Skip to Main Content
Skip Nav Destination
ASME Press Select Proceedings
International Conference on Electronics, Information and Communication Engineering (EICE 2012)
By
Garry Lee
Garry Lee
Information Engineering Research Institute
Search for other works by this author on:
ISBN:
9780791859971
No. of Pages:
1008
Publisher:
ASME Press
Publication date:
2012

Unsupervised image segmentation (UIS) is a very challenging problem in computer vision and artificial intelligence. In general, the UIS can be viewed as a clustering problem, which aims to partition the image into K sets of regions that have coherent color and texture features. Clearly, the UIS results depend on the employed clustering methods. Inspired by the recent rapid progress of l1-norm minimization techniques and the great success of l1-norm minimization based sparse representation (SR), in this paper we propose a K-sparse clustering algorithm to segment the image into K partitions. The given image is first over-segmented into many small regions, from which the K clustering centers are learned under the SR framework using l1-norm minimization. Finally, each of the regions can be classified into one of the K classes based on its SR coefficients over the K cluster centers. The experimental results on the benchmark images demonstrate the effectiveness and superiority of the proposed K-sparse clustering method to the classical K-means clustering method and recently developed sparse subspace clustering method in applications of UIS.

Abstract
Keywords
Introduction
Sparse Representation (SR)
Image Segmentation by K-Sparse Clustering
Problem Formulation
Computing the K-Sparse Clustering Centers
Segmentation via K-Sparse Clustering
Experimental Results
Conclusion
Acknowledgments
References
This content is only available via PDF.
You do not currently have access to this chapter.
Close Modal

or Create an Account

Close Modal
Close Modal