Abstract

This work lies within the scope of color image segmentation by spatial-color pixel classification. Classes of pixels are difficult to be identified when the color distributions of the different objects highly overlap in the color space and when the color points give rise to non-convex clusters. We propose to apply spectral classification to regroup the pixels which represent the same regions, into classes. Spectral clustering achieves a spectral decomposition of a similarity matrix in order to construct an eigenspace in which the clusters are expected to be well separated. The originality of this paper lies in the similarity matrix which is derived from a spatial-color compactness function. This function takes into account both the distribution of colors in the color space and the spatial location of colors in the image plane. Experimental tests on synthetic and real images show that the spectral clustering technique associated with this spatial-color compactness function leads to promising results for segmentation purposes.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.