## Publications: |
||

Here are my publications indexed by Google Scholar, DBLP Bibliography, Research Gate, Microsoft Academic Search, ACM Portal, and IEEE Xplore. For full publication list, please check my Curriculum Vitae. Selected research topics and the related publications are listed below: |
||

## Geometric Modeling: |
||

## Intrusive Plant AcquisitionWe present an intrusive plant acquisition approach, which disassembles the plant into disjoint parts that can be accurately scanned and reconstructed offline. We use the reconstructed part meshes as 3D proxies for the reconstruction of the complete plant and devisea global-to-local non-rigid registration technique that preserves specific plant characteristics. Our method is tested with sucesss on plants of various styles, appearances, and characteristics. ## Papers: CGF 2015 |
||

## Quality-driven AutoscanningWe present a quality-driven autonomous scanning method that places the scanner at strategically selected Next-Best-Views to ensure progressively capturing the geometric details of the object, until both completeness and high fidelity are reached. The technique that we present is based on the analysis of a Poisson field and its geometric relation with an input scan. We applied the algorithm on two different robotic platforms, a PR2 mobile robot and a one arm industry robot. ## Papers: SigAsia 2014 |
||

## Reconstruction from Incomplete Point CloudWith significant data missing in a point scan, reconstructing a complete surface with geometric and topological fidelity fully automatically is highly challenging. Directly editing data in 3D is tedious, but working with 1D entities is a lot more manageable. Our interactive reconstruction iterates between user edits and morfit to converge to a desired final surface. We demonstrate various interactive reconstructions from point scans with sharp features and significant missing data. ## Papers: SigAsia 2014 |
||

## Flower Modeling from a Single PhotoWe present a method for reconstructing flower models from a single photograph. Flower head typically consists of petals embedded in 3D space that share similar shapes and form certain level of regular structure. Our technique employs these assumptions and allows users to quickly generate a variety of realistic 3D flowers from photographs and to animate an image using the underlying models reconstructed from our method. ## Papers: EG 2014 |
||

## Edge-Aware Point Set ResamplingWe propose a resampling approach to process a noisy and possibly outlier-ridden point set in an edge-aware manner. The key idea is to first resample away from the edges so that reliable normals can be computed, and then progressively resample the point set while approaching the edge singularities. Results show that the algorithm is capable of producing consolidated point sets with noise-free normals and clean preservation of sharp features. ## Papers: TOG 2013 |
||

## Field-Guided Registration for Shape CompositionWe present an automatic shape composition method to fuse two shape parts which may not overlap and possibly contain sharp features. At the core of our method is a novel field-guided approach to automatically align two input parts in a feature-conforming manner. The key to our field-guided shape registration is a natural continuation of one part into the ambient field as a means to introduce an overlap with the distant part, which then allows a surface-to-field registration. ## Papers: SigAsia 2012 |
||

## Modeling of Deformable ObjectsWe propose a novel approach to reconstruct complete 3D deformable models over time using a single depth camera. The core of this algorithm is based on the assumption that the deformation is continuous and predictable in a short temporal interval. Our experiment shows that this approach is able to reconstruct visually plausible 3D surface deformation results with a single camera. ## Papers: 3DPVT 2010, ICCV 2009 |
||

## Geometry Processing: |
||

## Deep Points ConsolidationThis work presents a consolidation method that is based on a new representation of 3D point sets. The key idea is to augment each surface point into a deep point by associating it with an inner point that resides on the meso-skeleton, which consists of a mixture of skeletal curves and sheets. We demonstrate the advantages of the deep points consolidation technique by employing it to consolidate and complete noisy point-sampled geometry with large missing parts. ## Papers: SigAsia 2015 |
||

## Generalized Cylinder DecompositionDecomposing a complex shape into geometrically simple primitives is a fundamental problem in geometry processing. We introduce a quantitative measure of cylindricity for a shape part and develop a cylindricitydriven optimization algorithm, with a global objective function, for generalized cylinder decomposition. We demonstrate results of our optimal decomposition algorithm on numerous examples and compare with other alternatives. ## Papers: SigAsia 2015 |
||

## Mobility-Trees for Indoor Scenes ManipulationThis work introduces the mobility-tree construct for high-level functional representation of complex 3D indoor scenes. We analyze the reoccurrence of objects in the scene and automatically detect their functional mobilities based on their spatial arrangements, repetitions and relations with other objects. Repetitive motions in the scenes are grouped in mobility-groups, for which we develop a set of controllers facilitating semantical high-level editing operations. ## Papers: CGF 2013 |
||

## Projective Analysis for 3D Shape SegmentationWe introduce projective analysis for semantic segmentation and labeling of 3D shapes. An input 3D shape is treated as a collection of 2D projections, which are labeled through supervised learning using selected training images. Projective analysis simplifies the processing task by working in a lower-dimensional space. We demonstrate semantic labeling of imperfect 3D models which are otherwise difficult to analyze without utilizing 2D training data. ## Papers: SigAsia 2013 |
||

## L1-Medial Skeleton of Point CloudThe L1-median is well-known as a robust global center of an arbitrary set of points. We develop a L1-medial skeleton construction algorithm, which can be directly applied to an unoriented raw point scan with significant noise, outliers, and large areas of missing data. We demonstrate L1-medial skeletons extracted from raw scans of a variety of shapes, including those modeling highgenus 3D objects, plants, and curve networks. ## Papers: Siggraph 2013 |
||

## Image and Video Synthesis: |
||

## Structure-Driven Image CompletionWe propose a method that starts with a set of sloppily pasted image pieces with gaps between them, extracts salient curves that approach the gaps, and uses corresponding curve pairs to guide a novel tele-registration method that simultaneously aligns all the pieces together. A structure-driven image completion technique is then proposed to fill the gaps, allowing the subsequent employment of standard in-painting tools to finish the job. ## Papers: SigAsia 2013 |
||

## Video StereolizationWe present a semiautomatic system that converts conventional videos into stereoscopic videos by combining motion analysis with user interaction. Besides structure from motion techniques, we develop two new methods that analyze the optical flow to provide additional qualitative depth constraints. We further developed a quadratic programming approach to incorporate both quantitative depth and qualitative depth to recover dense depth maps for all frames. ## Papers: TVCG 2012 |
||

## Stereoscopic InpaintingWe present a novel algorithm for simultaneous color and depth inpainting. The algorithm takes stereo images and estimated disparity maps as input and fills in missing color and depth information introduced by occlusions or object removal. We demonstrate the effectiveness of the proposed algorithm on several challenging data sets. ## Papers: CVPR 2008 |
||

## Layer-based MorphingThe warp functions used in most image morphing algorithms are one-to-one. Hence, when some features are visible in only one of the reference images, "ghosting" problems will appear. In addition, since the control features have global effects, there is no way to control different objects in the scene separately. To address these problems, a layer-based morphing approach is porposed. Multiple layers are created and are used to solve the visibility problem. ## Papers: GM 2001 |
||

## Image Processing: |
||

## Distilled Collections from Textual Image QueriesWe present a distillation algorithm which operates on a large, unstructured, and noisy collection of internet images returned from an online object query. We introduce the notion of a distilled set, which is a clean, coherent, and structured subset of inlier images. In addition, the object of interest is properly segmented out throughout the distilled set. Our approach is unsupervised, built on a novel clustering scheme, and solves the distillation and object segmentation problems simultaneously. ## Papers: EG 2015 |
||

## Fuzzy C-Entropy Image SegmentationAn iterative scheme is presented for reducing redundancy in fuzzy c-entropy evaluation. Furthermore, instead of performing thresholding for each pixel independently, the presented algorithm oversegments the input image into small regions and uses the probabilities of fuzzy events to define the costs of different label assignments for each region. The final segmentation results is computed using graph cut, which produces smooth segmentation results. ## Papers: PR 2014 |
||

## Refractive Imaging: |
||

## 3D Reconstruction of Transparent ObjectsEstimating the shape of transparent and refractive objects is one of the few open problems in 3D reconstruction. Under the assumption that the rays refract only twice when traveling through the object, we present the first approach to simultaneously reconstructing the 3D positions and normals of the object’s surface at both refraction locations. Experimental results using both synthetic and real data demonstrate the robustness and accuracy of the proposed approach. ## Papers: CVPR 2016 |
||

## Frequency-based Environment MattingWe propose a novel approach to capturing and extracting the matte of a real scene effectively and efficiently. By exploiting the recently developed compressive sensing theory, we simplify the data acquisition process of frequency-based environment matting. Compared with the state-of-the-art method, our approach achieves superior performance on both synthetic and real data, while consuming only a fraction of the processing time. ## Papers: ICCV 2015 |
||

## Underwater Stereo and ImagingIn underwater imagery, refractions occur when light passes from water into the camera housing. We extend the existing work on physical refraction models by considering the dispersion of light, and derive new constraints on the model parameters for use in calibration. This leads to a novel calibration method that achieves improved accuracy compared to existing work. ## Papers: CVPR 2013, CRV 2011 |
||

## Foreground Segmentation and Matting: |
||

## Real-time Video MattingThis project presents the 1st real-time matting algorithm that can handle live videos with natural backgrounds. The algorithm is based on a set of novel Poisson equations that are derived for handling multichannel color vectors, as well as the depth information captured. Quantitative evaluation shows that the presented algorithm is comparable to state-of-the-art offline image matting techniques in terms of accuracy. ## Papers: IJCV 2012, GI 2010, CRV 2009 |
||

## Foreground Segmentation for Live VideosAn easy to implement and simple to use algorithm is proposed for processing live video in real-time. The algorithm can handle a variety of challenges such as dynamic background, fuzzy object boundaries, camera motion, topology changes, and low color contrast. It has applications in video matting, video conferencing, and automatic background subtraction. ## Papers: TIP 2015, CVPR 2011 |
||

## Background Subtraction from Dynamic ScenesThis project addresses the problem of foreground separation from the background modeling perspective. In particular, we deal with the difficult scenarios where the background texture might change spatially and temporally. Empirical experiments on a variety of datasets show the competitiveness of the proposed approach, which works in real-time on programmable graphics cards. ## Papers: TIP 2011, ICCV 2009, ICPR 2008## Source code: ZIP |
||

## Stereo Vision: |
||

## Real-time Stereo Matching on GPUsReal-time stereo estimation has many important applications in robotics, image-based modeling and rendering, etc. This project investigates how to perform stereo matching on the Graphics Processing Units (GPU) of modern programmable graphics cards. Two algorithms are proposed, both are capable of estimating disparity maps for dynamic real scenes in real time. ## Papers: JRTIP 2013, 3DPVT 2006, 3DIM 2005 |
||

## Subpixel Stereo with Slanted Surface ModelingThis project proposes a new stereo matching algorithm which takes into consideration surface orientation at the per-pixel level. Two disparity calculation passes are used. The first uses fronto-parallel surface assumption to generate an initial disparity map, from which the disparity plane orientations of all pixels are estimated. The second pass aggregates the matching costs for different pixels along the estimated disparity plane orientations using adaptive support weights. ## Papers: PR 2011, ICPR 2008 |
||

## Evaluation of Cost Aggregation ApproachesThis project studies how well different cost aggregation approaches perform under the real-time constraint. Six recent cost aggregation approaches are implemented and optimized for graphics hardware so that real-time speed can be achieved. The performances of these aggregation approaches in terms of both processing speed and result quality are reported. ## Papers: IJCV 2007, 3DPVT 2006## Source code: ZIP |
||

## Light Fall-off StereoWe present light fall-off stereo (LFS) a new method for computing depth from scenes beyond Lambertian reflectance and texture. LFS takes a number of images from a stationary camera as the illumination source moves away from the scene. Based on the inverse square law for light intensity, the ratio images are directly related to scene depth from the perspective of the light source. ## Papers: ICIP 2008, CVPR 2007 |
||

## Unambiguous Matching w/ Reliability-based DPA new reliability measure is designed for evaluating stereo matches, which is defined as the cost difference between the globally best disparity assignment that includes the match, and the globally best assignment that does not include the match. A reliability-based algorithm is derived, which selectively assigns disparities to pixels when the corresponding reliabilities exceed a given threshold. ## Papers: TIP 2007, CVPR 2005, TPAMI 2005, ICCV 2003 |
||

## Motion Estimation: |
||

## Joint Disparity and Disparity Flow EstimationA disparity flow map for a given view depicts the 3D motion observed from this view. An algorithm is developed to compute both disparity and disparity flow in an integrated process. The estimated disparity flow is used to predict the disparity for the next frame. The temporal consistency between the two frames is therefore enforced. All computations are performed in the 2D image space, leading to an efficient implementation. ## Papers: CVIU 2008, ECCV 2006, ICPR 2006 |
||

## Large Motion Estimation Using Reliability-DPDetecting and estimating motions of fast moving objects has many important applications. Here we use reliability-based dynamic programming (DP) technique to solving large motion estimation problem. The resulting algorithm can handle sequences that contain large motions and can produce optical flows with 100% density over the entire image domain. ## Papers: IJCV 2006, ICIP 2004 |
||

## Information Visualization: |
||

## Organize Data into Structured LayoutGiven a set of data items and a similarity measure between each pair of them, this project studies how to position these data into a structured layout so that their proximity reflects their similarity. Different techniques are proposed to solve this problem. Results show that these techniques can facilitate users to understand the relations among the data items and to locate the desired ones during the browsing. ## Papers: TMM 2014, ISVC 2013, GI 2011 |
||

## Concept-based Web Image SearchWhen users search images online, their queries are often short and potentially ambiguous. The solution we propose is to perform automatic query expansion using Wikipedia as the source knowledge base, resulting in a diversification of the search results. The outcome is a broad range of images that represent the various possible interpretations of the query, which are then organized using both conceptual and visual information to assist users in finding the desired images. ## Papers: IP&M 2013, JAIHC 2013, JETWI 2012, AWIC 2011 |
||

## Similarity-based Image BrowsingWe study how to facilatate users to locate the desired photos. Using extracted feature vectors, our approach maps photos onto a 2D virtual canvas so that similar ones are close to each other. When a user browses the collection, a subset of photos is automatically selected to compose a photo collage. Once having identified photos of interest, the user can find more photos with similar features through panning and zooming, which dynamically update the photo collage. ## Papers: IVC 2011, CIVR 2009, ISVC 2008 |
||

## Rendering: |
||

## Rayset: A Taxonomy for Image-Based RenderingA rayset is a parametric function, which consists of two mapping relations. The first one maps from a parameter space to the ray space, while the second one maps from the parameter space to the attribute space. A taxonomy is proposed based on the rayset concept, using which scene representations and scene reconstruction techniques used in image-based rendering are individually classified. ## Papers: IJIG 2006, GI 2001 |
||

## Camera Field Rendering for Dynamic ScenesThis project studies how to render dynamic scenes using only a few sample views and estimated noisy disparity maps. To color a pixel in the novel view, a backward searching process is conducted to find the corresponding pixels from the closest four reference images. Since the computations for different pixels are independent, they can be performed in parallel on the Graphics Processing Units of modern graphics hardware. ## Papers: GI 2007, GM 2005 |
||

## Fast Ray-NURBS Intersection CalculationA new algorithm with extrapolation process for computing the ray-NURBS intersection is presented. In the preprocessing step, the NURBS surfaces are subdivided adaptively into rational Bezier patches. The parallelepipeds are used to enclose the respective patches as tightly as possible. The improved Newton iteration with extrapolation process saves CPU time by reducing the iteration steps. The intersection scheme is faster than previous methods. ## Papers: C&G 1997, JCST 1996 |
||

## Evolutionary Computation: |
||

## Artificial Multi-Bee-Colony AlgorithmA novel artificial multi-bee-colony (AMBC) algorithm is proposed for solving the k-nearest-neighbor fields (k-NNF) problem. A dedicated bee colony is used to search for the k-nearest matches for each pixel. Bee colonies at neighboring pixels communicate with each other, allowing good matches propagate across the image quickly. Results show that AMBC can find better solutions than the generalized Patch-Match algorithm does. ## Papers: GECCO 2016 |
||

## Multiresolution GA and Its ApplicationsA new algorithm is proposed that incorporates a multi-resolution scheme into the conventional genetic algorithms (GA). The solutions of image-related problems are encoded through encoding the corresponding quadtrees, and hence, the 2D locality within the solutions can be preserved. Several computer vision problems, such as color image segmentation, stereo matching, and motion estimation, can be solved efficiently under the same framework. ## Papers: PR 2004, IJCV 2002, ICPR 2002 |
||

## A GA for Minimum Weight TriangulationIn this project, a new method for the minimum weight triangulation of points on a plane is presented based on the rationale of genetic algorithms (GA). Polygon crossover and its algorithm for triangulations are proposed. New adaptive crossover and mutation operators are introduced. It is shown that the new method for the minimum weight triangulation can obtain more optimal results of triangulations than the greedy algorithm. ## Papers: ICEC 1997, JCADCG 1996 |

Home | Teaching | Research | Service | Personal | Vitae |