Spectral clustering based on dictionary learning sampling for image segmentation

Authors:
Shuiping Gou;Jingyu Yang;Tiantian Yu
Affiliations:
Key Laboratory of Intelligent Perception and Image, Understanding of Ministry of Education of China, Xidian University, Xi'an, China;Key Laboratory of Intelligent Perception and Image, Understanding of Ministry of Education of China, Xidian University, Xi'an, China;Key Laboratory of Intelligent Perception and Image, Understanding of Ministry of Education of China, Xidian University, Xi'an, China
Venue:
IScIDE'11 Proceedings of the Second Sino-foreign-interchange conference on Intelligent Science and Intelligent Data Engineering
Year:
2011

Citing 3
Cited 0

Normalized Cuts and Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Segmentation Using Eigenvectors: A Unifying View

ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Density-weighted nyström method for computing large kernel eigensystems

Neural Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The classical spectral clustering spends much time on calculating similarity matrix and vectors. Nyström can be used to obtain approximate similarity matrix, which clustering results are unstable since randomly selected the sampling points. And dictionary learning is used to search the example points to construct similarity matrix, which Dictionary learning sampling Nyström spectral clustering algorithm (DNSC) is proposed in this paper. The DNSC constructs the dictionary by learning the entire data set, and select those points nearest atoms of the dictionary as sampling points. Further, removing redundancy points from candidate sampling points set that makes the size of sampling points be adaptive and sufficient. Compared with the Nyström Spectral Clustering Algorithm and K-means Nyström Spectral Clustering Algorithm, the presented algorithm has more stable and more accurate segmentation results.