원문정보
초록
영어
In this paper, present a graph cuts based geodesic active contours (GAC) approach to object segmentation problems. Our method is a combination of geodesic active contours and the optimization tool of graph cuts and differs fundamentally from traditional active contours in that it uses graph cuts to iteratively deform the contour. Consequently, it has the following advantages. 1. It has the ability to jump over local minima and provide a more global result. 2. Graph cuts guarantee continuity and lead to smooth contours free of self-crossing and uneven spacing problems. Therefore, the internal force which is commonly used in traditional energy functions to control the smoothness is no longer needed, and hence the number of parameters is greatly reduced. 3 Our approach easily extends to the segmentation of three and higher dimensional objects. In addition, the algorithm is suitable for interactive correction and is shown to always converge. Experimental results and analyses are provided.
목차
1. Introduction
2. Approach
2.1. Related Graph Theory
2.2 Graph Cuts based Geodesic Active Contours
2.3 Dilation
3. GAC Model based on Prior Shape of the Sample Registration and Model Analysis
3.1 Based on Graph Theory and Shape Constraint Algorithm for Segmentation ofLeft Ventricle MR
3.2 Algorithm Steps of Segmentation
3.3 Interactive Modification of Segmentation Results
4. Experimental Methods
5. Performance Analysis
6. Conclusion
References