DocumentCode :
2172766
Title :
Constrained spectral clustering for image segmentation
Author :
Sourati, Jamshid ; Brooks, Dana H. ; Dy, Jennifer G. ; Erdogmus, Deniz
Author_Institution :
Electr. & Comput. Eng. Dept., Northeastern Univ., Boston, MA, USA
fYear :
2012
fDate :
23-26 Sept. 2012
Firstpage :
1
Lastpage :
6
Abstract :
Constrained spectral clustering with affinity propagation in its original form is not practical for large scale problems like image segmentation. In this paper we employ novelty selection sub-sampling strategy, besides using efficient numerical eigen-decomposition methods to make this algorithm work efficiently for images. In addition, entropy-based active learning is also employed to select the queries posed to the user more wisely in an interactive image segmentation framework. We evaluate the algorithm on general and medical images to show that the segmentation results will improve using constrained clustering even if one works with a subset of pixels. Furthermore, this happens more efficiently when pixels to be labeled are selected actively.
Keywords :
eigenvalues and eigenfunctions; entropy; image sampling; image segmentation; affinity propagation; constrained spectral clustering; entropy-based active learning; general image; interactive image segmentation; large scale problems; medical image; novelty selection sub-sampling; numerical eigen-decomposition; Clustering algorithms; Equations; Image segmentation; Machine learning; Matrices; Signal processing algorithms; Vectors; Constrained spectral clustering; active learning; image segmentation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Machine Learning for Signal Processing (MLSP), 2012 IEEE International Workshop on
Conference_Location :
Santander
ISSN :
1551-2541
Print_ISBN :
978-1-4673-1024-6
Electronic_ISBN :
1551-2541
Type :
conf
DOI :
10.1109/MLSP.2012.6349765
Filename :
6349765
Link To Document :
بازگشت