Demo Data from EDBT 2026 / reviewers in the wild / expert
Chia-Wei Liao
dblp:17/2771
· DBLP profile ↗
10ranked-venue papers
10as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 6 · 6 first-authorGraphics, computer vision, multimedia, augmented reality and games · 5 · 5 first-authorComputer networks · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer graphics and multimedia
1 paper |
Geometric modeling and processing · 100% | |
| Artificial intelligence
1 paper |
Segmentation and scene understanding · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Geometric modeling and processing › deformable models
deformable model fitting |
0.0 | 1 | 1994 | Simultaneous segmentation and approximation of complex patterns · CVPR 1994 |
Geometric modeling and processing › shape representation
shape approximation |
0.0 | 1 | 1994 | Simultaneous segmentation and approximation of complex patterns · CVPR 1994 |
Methods — techniques the papers use, named apart from their topics
external energy · 0.0deformable models · 0.0boolean operations · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Evaluating NFV-enabled Network Slicing for 5G CoreabstractNetwork slicing enables a single physical network be sliced into multiple virtual networks. Each is customized and optimized according to specific 5G services and business goals. It can accommodate QoS heterogeneity of different 5G vertical services with isolation. In this research, we realize 5G mobile core network slicing based on the NFV (Network Functions Virtualisation) MANO (MANagement and Orchestration) architecture. Our prototype leverages open sources from both OpenStack Tacker and NCTU free5GC to creates 5G core network slicing based on its Network Service Descriptor (NSD). We evaluate and compare the performance between the multiple network slicing system and the one-slice-fits-all single slicing system using three eMBB (enhanced Mobile BroadBand) services of different QoS levels. Our test results show that the former can achieve better throughput and response time than the latter with the tradeoff of increasing its CPU consumption. Chia-Wei Liao, Fuchun Joseph Lin |
APNOMS | 1 |
| 2008 | Video-based person authetication with random passwordsabstractThe proposed system aims at providing a novel framework of speaker authentication using lip-motion data. The system is divided into three steps: feature extraction and modeling, model synthesis, and probabilistic model matching. First, the visual features are obtained by locating a region-of-interest and extracting geometric and textural features from the region. The extracted feature vectors are then classified by K-means clustering to obtain a reduced number of observation vectors. These observation vectors are fed into a set of Hidden Markov Models (HMMs) classifiers to capture the temporal characteristics of the features. The main contribution of this paper lies in the introduction of using random passwords in performing speaker verification. Our results have demonstrated that random passwords provide useful information for speaker verification. Also, by using the proposed method, we observe a significant improvement in verification rate. Chia-Wei Liao, Wei-Yang Lin, Chia-Wen Lin |
ICME | 1 |
| 1999 | Simultaneous Surface Approximation and Segmentation of Complex Objects
Chia-Wei Liao, Gérard G. Medioni |
Comput. Vis. Image Underst. | 1 |
| 1995 | Surface Approximation of a Cloud of 3D Points
Chia-Wei Liao, Gérard G. Medioni |
CVGIP Graph. Model. Image Process. | 1 |
| 1994 | Simultaneous segmentation and approximation of complex patternsabstractDeformable model have been widely used to approximate objects from collected data points, but most algorithms based on the deformable model can only handle geometrically and topologically simple objects. They are inadequate for objects with deep cavities or multi-part objects. Furthermore, they always assume there is only one underlying object for the collected data, which means the segmentation has been done ahead of time. Unlike most deformable algorithms which approximate one object at a time, our proposed approach can apply simultaneously more than one curve to approximate multiple objects. Using (1) the residual data points, (2) the bad parts of the fitting curve, and (3) appropriate Boolean operations, our approach is able to detect patterns with holes or cavities, and can perform segmentation by itself for more than one underlying object. We currently present experiments mainly on 2D data. These 2D algorithms can be extended to 3D without theoretical difficulties. An experiment on 3D data, composed of two genus I toruses, is also presented. Also, a new method for defining the external energy is presented, which helps capture the shape more accurately with low time and reasonable space complexities, and a method to prevent self-intersection of the curve during evolution is also introduced.> Chia-Wei Liao, Gérard G. Medioni |
CVPR | 1 |
| 1992 | Representation of range data with B-spline surface patchesabstractPresents an implementation of deformable models for approximation of 3-D surfaces. It is an extension of work on B-snakes (Menet, Saint-Marc, and Gerard (1990), which approximate curves using B-splines. The user provides an initial simple surface, such as a cylinder or a plane, which is subject to internal forces and external forces which attracts it toward features. The problem is cast in terms of energy minimization, and is solved iteratively. The authors choice of basis functions leads to reasonable complexity and good numerical stability. The authors give results on real range images to illustrate the applicability of their approach. The advantages of this approach are that it provides a compact representation of the approximated data, it gives a C/sub 1/ continuous analytical description of the data, which allows computation of differential properties, and lends itself to applications such as non-rigid motion tacking and object recognition.> Chia-Wei Liao, Gérard G. Medioni |
ICPR (3) | 1 |
| 1991 | Font generation by beta-spline curve
Chia-Wei Liao, Jun Siung Huang |
Comput. Graph. | 1 |
| 1990 | Stroke segmentation by bernstein-bezier curve fitting
Chia-Wei Liao, Jun S. Huang |
Pattern Recognit. | 1 |
| 1990 | A transformation invariant matching algorithm for handwritten chinese character recognition
Chia-Wei Liao, Jun S. Huang |
Pattern Recognit. | 1 |
| 1989 | An edge preserved image compression technique
Chia-Wei Liao, Jun Siung Huang |
Image Vis. Comput. | 1 |