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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Weiss, Y.: Segmentation using eigenvectors, Aunified view. In: International Conference on Computer Vision (1999)
Malik, J., Belongie, S., Leung, T., et al.: Contour and texture analysis for image segmentation. In: Perceptual Organization for Artificial Vision Systems. Kluwer (2000)
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22(8), 888–905 (2000)
Fowlkes, C., Belongie, S., Malik, J.: Efficient Spatiotemporal Grouping Using the Nyström Method. In: Proc. of IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1:231–1:238 (2001)
Zhang, K., Kwok, J.T.: Density-weighted Nyström Method for Computing Large Kernel Eigensystems. Neural Computation 21(1), 121–146 (2009)
Fowlkes, C., Belongie, S., Malik, J.: Efficient Spatiotemporal Grouping Using the Nyström Method. In: Proc. of IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1:231–1:238 (2001)
Williams, C.K.I., Seeger, M.: Using the Nyström Method to Speed Up Kernel Machines. In: NIPS, pp. 682–688 (2000)
Wright, J., Sapiroz, G., Yan, S.: Sparse Representation For Computer Vision and Pattern Recognition. Proceedings of IEEE (March 2009)
Mairal, J., Bach, F., Ponce, J.: Discriminative Learned Dictionaries For Local Image Analysis, IMA Preprint Series # 2212 (June 2008)
Sprechmann, P., Sapiro, G.: Dictionary Learning And Sparse Coding For Unsupervised Clustering, IMA Preprint Series # 2281 (September 2009)
Quattoni, A., Collins, M., Darrell, T.: Transfer Learning for Image Classification with Sparse Prototype Representations. In: CVPR 2008 (2008)
Aharon, M., Elad, M., Bruckstein, A.: K-SVD: Design Of Dictionaries For Sparse Representation. In: Proceedings of SPARS (2005)
Malik, J., Belongie, S., Leung, T., et al.: Contour and texture analysis for image segmentation. In: Perceptual Organization for Artificial Vision Systems. Kluwer (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gou, S., Yang, J., Yu, T. (2012). Spectral Clustering Based on Dictionary Learning Sampling for Image Segmentation. In: Zhang, Y., Zhou, ZH., Zhang, C., Li, Y. (eds) Intelligent Science and Intelligent Data Engineering. IScIDE 2011. Lecture Notes in Computer Science, vol 7202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31919-8_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-31919-8_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31918-1
Online ISBN: 978-3-642-31919-8
eBook Packages: Computer ScienceComputer Science (R0)