Bounded irregular pyramid: a new structure for color image segmentation

This paper presents a new segmentation technique for color images. It relies on building an irregular pyramid into a regular one, presenting only nodes associated to homogeneous color regions. Hence, the size of the irregular pyramid is bounded. Segmentation is performed by rearranging the set of links among pyramid nodes. Unlike other hierarchical methods based on relinking procedures, our algorithm does not operate in an iterative way and it preserves region connectivity.

[1]  Paola Campadelli,et al.  Quantitative evaluation of color image segmentation results , 1998, Pattern Recognit. Lett..

[2]  Azriel Rosenfeld,et al.  A critical view of pyramid segmentation algorithms , 1990, Pattern Recognit. Lett..

[3]  Jean-Michel Jolion,et al.  The adaptive pyramid: A framework for 2D image analysis , 1991, CVGIP Image Underst..

[4]  Walter G. Kropatsch,et al.  Dual graph contraction for irregular pyramids , 1994, Proceedings of the 12th IAPR International Conference on Pattern Recognition, Vol. 2 - Conference B: Computer Vision & Image Processing. (Cat. No.94CH3440-5).

[5]  Leslie J. Kitchen,et al.  Soft image segmentation by weighted linked pyramid , 2001, Pattern Recognit. Lett..