Fast, Quality, Segmentation of Large Volumes – Isoperimetric Distance Trees
- 1 January 2006
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 449-462
- https://doi.org/10.1007/11744078_35
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Isoperimetric graph partitioning for image segmentationIeee Transactions On Pattern Analysis and Machine Intelligence, 2006
- Fast sub-voxel re-initialization of the distance map for level set methodsPattern Recognition Letters, 2005
- Efficient Graph-Based Image SegmentationInternational Journal of Computer Vision, 2004
- Multi-label Image Segmentation for Medical Applications Based on Graph-Theoretic Electrical PotentialsLecture Notes in Computer Science, 2004
- Automatic centerline extraction for virtual colonoscopyIEEE Transactions on Medical Imaging, 2002
- Normalized cuts and image segmentationIeee Transactions On Pattern Analysis and Machine Intelligence, 2000
- Tree approximations to Markov random fieldsIeee Transactions On Pattern Analysis and Machine Intelligence, 1995
- Graph theoretical clustering based on limited neighbourhood setsPattern Recognition, 1982
- Graph-Theoretical Methods for Detecting and Describing Gestalt ClustersIEEE Transactions on Computers, 1971
- Scene analysis using regionsArtificial Intelligence, 1970