Globally optimal segmentation of interacting surfaces with geometric constraints

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn 1, Issue , 2004, Pages

  Li, Kang ^a   Wu, Xiaodong ^b   Chen, Danny Z ^c   Sonka, Milan ^a  

^a UNIVERSITY OF IOWA   (United States)

^b UNIVERSITY OF TEXAS PAN AMERICAN   (United States)

^c University of Notre Dame   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COST FUNCTIONS; GEOMETRIC CONSTRAINTS; SURFACE SMOOTHNESS; VOLUMETRIC IMAGES;

ALGORITHMS; APPROXIMATION THEORY; IMAGE SEGMENTATION; MATHEMATICAL TRANSFORMATIONS; MEDICAL IMAGING; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; SURFACE PROPERTIES; TOPOLOGY;

COMPUTER VISION;

EID: 5044232334     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. D. Thedens, D. Skorton, and S. Fleagle, "A three-dimensional graph searching technique for cardiac border detection in sequential images and its application to magnetic resonance image data," in Computers in Cardiology, Sept. 1990, pp. 57-60.
2. D. R. Thedens, D. J. Skorton, and S. R. Feagle, "Methods of graph searching for border detection in image sequences with applications to cardiac magnetic resonance imaging," IEEE Trans. Med. Imag., vol. 14, no. 1, pp. 42-55, 1995.
3. R. J. Frank, "Optimal surface detection using multi-dimensional graph search: Applications to Intravascular Ultrasound," Master's thesis, The University of Iowa, 1996.
4. X. Wu and D. Z. Chen, "Optimal net surface problems with applications," to Proc. of the 29th International Colloquium on Automata, Languages and Programming (ICALP), Malaga, Spain, July 2002, pp. 1029-1042.
5. K. Li, X. Wu, D. Z. Chen, and M. Sonka, "Efficient optimal surface detection: Theory, implementation and experimental validation," in Proc. SPIE International Symposium on Medical Imaging, Feb. 2004, in press.
6. M. Sonka, V. Hlavac, and R. Boyle, Image Processing, Analysis, and Machine Vision, 2nd ed. Brooks/Cole Publishing Company, 1999.
7. J. C. Picard, "Maximal closure of a graph and applications to combinatorial problems," Management Science, vol. 22, pp. 1268-1272, 1976.
8. D. S. Hochbaum, "A new-old algorithm for minimum-cut and maximum-flow in closure graphs," Networks, vol. 37, pp. 171-193, 2001.
9. M. Sonka, G. K. Reddy, M. D. Winniford, and S. M. Collins, "Adaptive approach to accurate analysis of small-diameter vessels in cineangiograms, " pp. 87-95, Feb. 1997.
10. J. A. Sethian, Level Set Methods and Fast Marching Methods Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science, 2nd ed. Cambridge, U.K.: Cambridge University Press, 1999, 400 pages.
11. S. J. Osher and R. P. Fedkiw, Level Set Methods and Dynamic Implicit Surfaces, 1st ed. Springer Verlag, 2002, 296 pages.
12. X. Han., C. Xu, and J. L. Prince, "A topology preserving level set method for geometric deformable models," IEEE Trans. Pattern Anal. Machine Intell., vol. 25, pp. 755-768, June 2003.
13. Y. Boykov and V. Kolmogorov, "An experimental comparison of min-cut/max-flow algorithms for energy minimization in computer vision," in Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition (EMMCVPR), Springer-Verlag, Sept. 2001.
14. A. V. Goldberg and S. Rao, "Beyond the flow decomposition barrier," Journal of the ACM (JACM), vol. 45, pp. 783-797, 1998.
15. J. Tschirren, "Segmentation, anatomical labeling, branch-point matching, and quantitative analysis of human airway in volumetric CT images," Ph.D. dissertation, University of Iowa, Iowa City, IA, August 2003.