Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007) A Hierarchical Segmentation Algorithm Based on Mumford and Shah Model Haier International Training Center, Qingdao, China July 30-August 01 ISBN: 0-7695-2909-7
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SNPD.2007.120
This paper proposes a new hierarchical segmentation algorithm. Comparing with the previous work, the segmentation procedure is divided into two steps: a pre-segmenting stage and a tuning stage. By this way, some difficulties like the initialization of the level set and converging to local minima can be completely eliminated. To find an initial segmentation that will be applied as initial contours for tuning, a novel edge detection algorithm is introduced at the pre-segmenting stage, which is implemented based on the Mumford and Shah model in level set frame. Due to the contours obtained with the properties of level set functions, many active contour approaches may be used for tuning at second stage. However, aim at segmenting noisy images, only the piecewise smooth Mumford and Shah approach is taken into consideration in this paper. The resulting algorithm has been demonstrated by several cases.
Citation:
Zhang Yingjie, Ge Liling, "A Hierarchical Segmentation Algorithm Based on Mumford and Shah Model," snpd, vol. 1, pp.735-740, Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007), 2007 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||