From Ramp Discontinuities to Segmentation Tree
This paper presents a new algorithm for low-level multiscale segmentation of images. The algorithm is designed to detect image regions regardless of their shapes, sizes, and levels of interior homogeneity, by doing a multiscale analysis without assuming any prior models of region geometry. As in previous work, a region is modeled as a homogeneous set of connected pixels surrounded by ramp discontinuities. A new transform, called the ramp transform, is described, which is used to detect ramp discontinuities and seeds for all regions in an image. Region seeds are grown towards the ramp discontinuity areas by utilizing a relaxation labeling procedure. Segmentation is achieved by analyzing the output of this procedure at multiple photometric scales. Finally, all detected regions are organized into a tree data structure based on their recursive containment relations. Experiments on real and synthetic images verify the desired properties of the proposed algorithm.
KeywordsSegmentation Algorithm Synthetic Image Boundary Pixel Tree Data Structure Connected Pixel
Unable to display preview. Download preview PDF.
- 2.Arora, H., Ahuja, N.: Analysis of ramp discontinuity model for multiscale image segmentation. In: ICPR 2006: Int’l Conf. on Pattern Recog., pp. 99–103 (2006)Google Scholar
- 4.Comaniciu, D., Ramesh, V., Meer, P.: The variable bandwidth mean shift and data-driven scale selection. In: ICCV, pp. 438–445 (2001)Google Scholar
- 9.Martin, D., Fowlkes, C., Tal, D., Malik, J.: A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: Proc. 8th Int’l Conf. Computer Vision, July 2001, vol. 2, pp. 416–423 (2001)Google Scholar
- 11.Meyer, F., Beucher, S.: Morphological segmentation. J. Vis. Comm. Image Represent, 21–46 (1990)Google Scholar
- 15.Zabih, R., Kolmogorov, V.: Spatially coherent clustering using graph cuts. In: CVPR 2004: Int’l Conf. on Computer Vision and Pattern Recog., pp. 437–444 (2004)Google Scholar