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

Xiao Han 0007

dblp:01/2095-7 · DBLP profile ↗
← Back
6ranked-venue papers
5as first author
0since 2021 · last 2009
—ORCID · conflict

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

Artificial intelligence and machine learning · 5 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 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
5 papers
Geometric modeling and processing · 74% Image and video processing · 26%
Artificial intelligence
2 papers
Segmentation and scene understanding · 78% 3D vision · 22%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing
deformable models
0.242009
A Moving Grid Framework for Geometric Deformable Models · Int. J. Comput. Vis. 2009
Topology-preserving Geometric Deformable Model on Adaptive Quadtree Grid · CVPR 2007
A Topology Preserving Level Set Method for Geometric Deformable Models · IEEE Trans. Pattern Anal. Mach. Intell. 2003
Geometric modeling and processing › deformable models
geometric deformable model
0.232009
A Moving Grid Framework for Geometric Deformable Models · Int. J. Comput. Vis. 2009
Topology-preserving Geometric Deformable Model on Adaptive Quadtree Grid · CVPR 2007
A 2D Moving Grid Geometric Deformable Model · CVPR (1) 2003
Image and video processing
image segmentation
0.232009
A Moving Grid Framework for Geometric Deformable Models · Int. J. Comput. Vis. 2009
A 2D Moving Grid Geometric Deformable Model · CVPR (1) 2003
A Topology Preserving Deformable Model Using Level Sets · CVPR (2) 2001
Computer vision › Segmentation and scene understanding
medical image segmentation
0.112007
Topology-preserving Geometric Deformable Model on Adaptive Quadtree Grid · CVPR 2007
Computer vision › Segmentation and scene understanding › image segmentation › constrained image segmentation
topology-preserving segmentation
0.112007
Topology-preserving Geometric Deformable Model on Adaptive Quadtree Grid · CVPR 2007
Computer vision › 3D vision › 3d shape representation
deformable model
0.012003
A Topology Preserving Level Set Method for Geometric Deformable Models · IEEE Trans. Pattern Anal. Mach. Intell. 2003
Geometric modeling and processing › shape analysis
topology preservation
0.012003
A Topology Preserving Level Set Method for Geometric Deformable Models · IEEE Trans. Pattern Anal. Mach. Intell. 2003
Computational geometry › spatial data structures
quadtree
0.012007
Topology-preserving Geometric Deformable Model on Adaptive Quadtree Grid · CVPR 2007

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

digital topology · 0.3adaptive quadtree grid · 0.2level set method · 0.2simple point concept · 0.1level set · 0.1finite element method · 0.1topology-preserving constraint · 0.0moving grid method · 0.0
YearPublicationVenuePosition
2009 A Moving Grid Framework for Geometric Deformable Models
Xiao Han 0007, Chenyang Xu 0001, Jerry L. Prince
Int. J. Comput. Vis.1
2007 Topology-preserving Geometric Deformable Model on Adaptive Quadtree Grid
abstract
Topology-preserving geometric deformable models (TGDMs) are used to segment objects that have a known topology. Their accuracy is inherently limited, however, by the resolution of the underlying computational grid. Although this can be overcome by using fine-resolution grids, both the computational cost and the size of the resulting contour increase dramatically. In order to maintain computational efficiency and to keep the contour size manageable, we have developed a new framework, termed QTGDMs, for topology-preserving geometric deformable models on balanced quadtree grids (BQGs). In order to do this, definitions and concepts from digital topology on regular grids were extended to BQGs so that characterization of simple points could be made. Other issues critical to the implementation of geometric deformable models are also addressed and a strategy for adapting a BQG during contour evolution is presented. We demonstrate the performance of the QTGDM method using both mathematical phantoms and real medical images.
Ying Bai, Xiao Han 0007, Jerry L. Prince
CVPR2
2003 A 2D Moving Grid Geometric Deformable Model
abstract
Geometric deformable models based on the level set method have become very popular. To overcome an inherent limitation in accuracy while maintaining computational efficiency, adaptive grid techniques using local grid refinement have been developed for use with these models. However, this strategy requires a very complex data structure, yields large numbers of contour points, and is inconsistent with our previously presented topology-preserving geometric deformable model (TGDM). In this paper, we incorporate an alternative adaptive grid technique called the moving grid method into the geometric deformable model framework. We find that it is simpler to implement than grid refinement, requiring no large, complex, hierarchical data structures. It also limits the number of contour vertices in the final contour and supports the incorporation of the topology-preserving constraint of TGDM. After presenting the algorithm, we demonstrate its performance using both simulated and real images.
Xiao Han 0007, Chenyang Xu 0001, Jerry L. Prince
CVPR (1)1
2003 A Topology Preserving Level Set Method for Geometric Deformable Models
abstract
Active contour and surface models, also known as deformable models, are powerful image segmentation techniques. Geometric deformable models implemented using level set methods have advantages over parametric models due to their intrinsic behavior, parameterization independence, and ease of implementation. However, a long claimed advantage of geometric deformable models-the ability to automatically handle topology changes-turns out to be a liability in applications where the object to be segmented has a known topology that must be preserved. We present a new class of geometric deformable models designed using a novel topology-preserving level set method, which achieves topology preservation by applying the simple point concept from digital topology. These new models maintain the other advantages of standard geometric deformable models including subpixel accuracy and production of nonintersecting curves or surfaces. Moreover, since the topology-preserving constraint is enforced efficiently through local computations, the resulting algorithm incurs only nominal computational overhead over standard geometric deformable models. Several experiments on simulated and real data are provided to demonstrate the performance of this new deformable model algorithm.
Xiao Han 0007, Chenyang Xu 0001, Jerry L. Prince
IEEE Trans. Pattern Anal. Mach. Intell.1
2002 Topology Correction in Brain Cortex Segmentation Using a Multi-Scale, Graph-Based Algorithm
abstract
Reconstructing an accurate and topologically correct representation of the cortical surface of the brain is an important objective in various neuroscience applications. Most cortical surface reconstruction methods either ignore topology or correct it using manual editing or methods that lead to inaccurate reconstructions. Shattuck and Leahy recently reported a fully automatic method that yields a topologically correct representation with little distortion of the underlying segmentation. We provide an alternate approach that has several advantages over their approach, including the use of arbitrary digital connectivities, a flexible morphology-based multiscale approach, and the option of foreground-only or background-only correction. A detailed analysis of the method's performance on 15 magnetic resonance brain images is provided.
Xiao Han 0007, Chenyang Xu 0001, Ulisses Braga-Neto, Jerry L. Prince
IEEE Trans. Medical Imaging1
2001 A Topology Preserving Deformable Model Using Level Sets
abstract
Active contour and surface models, also known as deformable models, constitute a class of powerful segmentation techniques. Geometric deformable models implemented via level-set methods have advantages over parametric ones due to their intrinsic behavior, parameterization independence, and ease of implementation. However, a long claimed advantage of geometric deformable models, the ability to automatically handle topology changes, turns out to be a liability in applications where the objects to be segmented have a known topology that must be preserved. In this paper, we present a geometric deformable model that preserves topology using the simple point concept from digital topology. This algorithm maintains the other advantages of standard geometric deformable models including sub-pixel accuracy and production of nonintersecting curves (or surfaces). Several experiments on simulated and real data are provided to demonstrate the performance of the proposed algorithm.
Xiao Han 0007, Chenyang Xu 0001, Jerry L. Prince
CVPR (2)1