Topological segmentation of discrete surfaces
International Journal of Computer Vision
Shape Modeling with Front Propagation: A Level Set Approach
IEEE Transactions on Pattern Analysis and Machine Intelligence
International Journal of Computer Vision
Distance-ordered homotopic thinning: a skeletonization algorithm for 3D digital images
Computer Vision and Image Understanding
International Journal of Computer Vision
Penalized-Distance Volumetric Skeleton Algorithm
IEEE Transactions on Visualization and Computer Graphics
Flux Maximizing Geometric Flows
IEEE Transactions on Pattern Analysis and Machine Intelligence
4D Active Surfaces for Cardiac Analysis
MICCAI '02 Proceedings of the 5th International Conference on Medical Image Computing and Computer-Assisted Intervention-Part I
Defining and computing curve-skeletons with medial geodesic function
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
An extension to 3D topological thinning method based on LUT for colon centerline extraction
Computer Methods and Programs in Biomedicine
Virtual fly-over: a new visualization technique for virtual colonoscopy
MICCAI'06 Proceedings of the 9th international conference on Medical Image Computing and Computer-Assisted Intervention - Volume Part I
Differential fly-throughs (DFT): a general framework for computing flight paths
MICCAI'05 Proceedings of the 8th international conference on Medical Image Computing and Computer-Assisted Intervention - Volume Part I
PDE-Based three dimensional path planning for virtual endoscopy
IPMI'05 Proceedings of the 19th international conference on Information Processing in Medical Imaging
Robust curve skeleton extraction for vascular structures
Graphical Models
Hi-index | 0.00 |
We present a fast, robust and automatic method for computing central paths through tubular structures for application to virtual endoscopy. The key idea is to utilize a medial surface algorithm which exploits properties of the average outward flux of the gradient vector field of a Euclidean distance function the boundary of the structure of interest. The algorithm is modified to yield a collection of 3D curves, each of which is locally centered. The approach requires no user interaction, is virtually parameter free and has low computational complexity. We illustrate the approach on segmented colon and vessel data.