Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Haili Chui

dblp:32/590 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
0since 2021 · last 2004
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 3 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 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
2 papers
Geometric modeling and processing · 100%
Artificial intelligence
1 paper
3D vision · 80% Trustworthy machine learning · 20%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

Topics — the 13 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining
clustering
0.012004
Unsupervised Learning of an Atlas from Unlabeled Point-Sets · IEEE Trans. Pattern Anal. Mach. Intell. 2004
Geometric modeling and processing › point set registration
nonrigid point-set matching
0.012004
Unsupervised Learning of an Atlas from Unlabeled Point-Sets · IEEE Trans. Pattern Anal. Mach. Intell. 2004
Geometric modeling and processing
shape matching
0.012004
Unsupervised Learning of an Atlas from Unlabeled Point-Sets · IEEE Trans. Pattern Anal. Mach. Intell. 2004
Geometric modeling and processing
shape modeling
0.012004
Unsupervised Learning of an Atlas from Unlabeled Point-Sets · IEEE Trans. Pattern Anal. Mach. Intell. 2004
Geometric modeling and processing
deformable models
0.012001
A Relationship between Spline-Based Deformable Models and Weighted Graphs in Non-Rigid Matching · CVPR (1) 2001
Computer vision › 3D vision
correspondence estimation
0.012000
A New Algorithm for Non-Rigid Point Matching · CVPR 2000
Computer vision › 3D vision › point cloud registration
non-rigid point cloud registration
0.012000
A New Algorithm for Non-Rigid Point Matching · CVPR 2000
Computer vision › 3D vision
point cloud registration
0.012000
A New Algorithm for Non-Rigid Point Matching · CVPR 2000
Computer vision › 3D vision › point cloud registration › point set registration
robust point matching
0.012000
A New Algorithm for Non-Rigid Point Matching · CVPR 2000
Machine learning › Trustworthy machine learning › robustness › learning with noisy labels
soft labels
0.012000
A New Algorithm for Non-Rigid Point Matching · CVPR 2000
Medical and health informatics › medical imaging
medical image analysis
0.012004
Unsupervised Learning of an Atlas from Unlabeled Point-Sets · IEEE Trans. Pattern Anal. Mach. Intell. 2004
Graph algorithms and graph theory
graph matching
0.012001
A Relationship between Spline-Based Deformable Models and Weighted Graphs in Non-Rigid Matching · CVPR (1) 2001
Graph algorithms and graph theory › graph matching
weighted graph matching
0.012001
A Relationship between Spline-Based Deformable Models and Weighted Graphs in Non-Rigid Matching · CVPR (1) 2001

Methods — techniques the papers use, named apart from their topics

iterative bootstrap · 0.1nonrigid alignment · 0.1kernel representation · 0.1non-rigid alignment · 0.0thin-plate spline · 0.0softassign · 0.0deterministic annealing · 0.0
YearPublicationVenuePosition
2004 Unsupervised Learning of an Atlas from Unlabeled Point-Sets
abstract
One of the key challenges in deformable shape modeling is the problem of estimating a meaningful average or mean shape from a set of unlabeled shapes. We present a new joint clustering and matching algorithm that is capable of computing such a mean shape from multiple shape samples which are represented by unlabeled point-sets. An iterative bootstrap process is used wherein multiple shape sample point-sets are nonrigidly deformed to the emerging mean shape, with subsequent estimation of the mean shape based on these nonrigid alignments. The process is entirely symmetric with no bias toward any of the original shape sample point-sets. We believe that this method can be especially useful for creating atlases of various shapes present in medical images. We have applied the method to create mean shapes from nine hand-segmented 2D corpus callosum data sets and 10 hippocampal 3D point-sets.
Haili Chui, Anand Rangarajan 0001, Jie Zhang 0025, Christiana Morison Leonard
IEEE Trans. Pattern Anal. Mach. Intell.1
2003 A new point matching algorithm for non-rigid registration
Haili Chui, Anand Rangarajan 0001
Comput. Vis. Image Underst.1
2003 A unified non-rigid feature registration method for brain mapping
Haili Chui, Lawrence Win, Robert T. Schultz, James S. Duncan, Anand Rangarajan 0001
Medical Image Anal.1
2001 A Relationship between Spline-Based Deformable Models and Weighted Graphs in Non-Rigid Matching
abstract
Deformable models are central to non-rigid motion analysis, shape matching and non-rigid medical image registration. Spline-based deformations are a very popular class of parameterizations of deformable models and have been heavily used in multiple domains. In a somewhat separate sub-field, weighted graphs are a frequently used object parameterization. Graph matching using weighted graph object parameterizations finds application in a spectrum ranging from rigid pose estimation to deformable object recognition. Here, we demonstrate a hitherto unsuspected relationship between spline-based deformable models and weighted graphs. It turns out that spline parameterizations in the kernel representation can be used to construct equivalent weighted graphs. With this connection established, we envision a cross-fertilization between these two seemingly disparate sub-fields of computer vision.
Anand Rangarajan 0001, Haili Chui, Eric Mjolsness
CVPR (1)2
2000 A New Algorithm for Non-Rigid Point Matching
abstract
We present a new robust point matching algorithm (RPM) that can jointly estimate the correspondence and non-rigid transformations between two point-sets that may be of different sizes. The algorithm utilizes the soft assign for the correspondence and the thin-plate spline for the non-rigid mapping. Embedded within a deterministic annealing framework, the algorithm can automatically reject a fraction of the points as outliers. Experiments on both 2D synthetic point-sets with varying degrees of deformation, noise and outliers, and on real 3D sulcal point-sets (extracted from brain MRI) demonstrate the robustness of the algorithm.
Haili Chui, Anand Rangarajan 0001
CVPR1
1999 Rigid point feature registration using mutual information
abstract
We have developed a new mutual information-based registration method for matching unlabeled point features. In contrast to earlier mutual information-based registration methods, which estimate the mutual information using image intensity information, our approach uses the point feature location information. A novel aspect of our approach is the emergence of correspondence (between the two sets of features) as a natural by-product of joint density estimation. We have applied this algorithm to the problem of geometric alignment of primate autoradiographs. We also present preliminary results on three-dimensional robust matching of sulci derived from anatomical magnetic resonance images. Finally, we present an experimental comparison between the mutual information approach and other recent approaches which explicitly parameterize feature correspondence.
Anand Rangarajan 0001, Haili Chui, James S. Duncan
Medical Image Anal.2
1997 A robust point-matching algorithm for autoradiograph alignment
abstract
We present a novel method for the geometric alignment of autoradiographs of the brain. The method is based on finding the spatial mapping and the one-to-one correspondences (or homologies) between point features extracted from the images and rejecting non-homologies as outliers. In this way, we attempt to account for the local, natural and artifactual differences between the autoradiograph slices. We have used the resulting automated algorithm on a set of left prefrontal cortex autoradiograph slices, specifically demonstrated its ability to perform point outlier rejection, validated its robustness property using synthetically generated spatial mappings and provided an anecdotal visual comparison with the well-known iterated closest-point (ICP) algorithm. Visualization of a stack of aligned left prefrontal cortex autoradiograph slices is also provided.
Anand Rangarajan 0001, Haili Chui, Eric Mjolsness, Suguna Pappu, Lila Davachi, Patricia S. Goldman-Rakic, James S. Duncan
Medical Image Anal.2