Skip to main content
Log in

Combining intrinsic dimension and local tangent space for manifold spectral clustering image segmentation

  • Application of soft computing
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

To solve the problem of high computational complexity and the lack of local similarity information in constructing similarity matrix, an algorithm combining intrinsic dimension and local tangent space (IDLTS) for manifold spectral clustering image segmentation is proposed. Firstly, considering the manifold structure of image feature space, local linear reconstruction in manifold learning is introduced, and the local tangent spatial similarity of image data is obtained. Secondly, performing the local PCA (Pincipal Components Analysis) in the K-nearest neighbor region of data points, the relationship between intrinsic dimensions of image data is calculated. Combining it with the local tangent spatial similarity, the similarity function and its related similarity matrix of the spectral clustering can be constructed. Thirdly, by sampling points and sampling points, as well as sampling points and non-sampling points, two similarity matrices are constructed with Nyström approximation strategy and used to approximate the eigenvectors for image segmentation. Finally the IDLTS manifold spectral clustering image segmentation is accomplished based on the constructed k principal eigenvectors. Berkeley Segmentation Dataset and eight evaluation metrics are selected to compare the proposed algorithm with some existing image segmentation algorithms. Experimental results show that the IDLTS has good performance in terms of segmentation accuracy and time consumption.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  • Achanta R, Shaji A, Smith K et al (2012) SLIC superpixels compared to state-of-the-art superpixel methods. IEEE Trans Pattern Anal Mach Intell 34(11):2274–2282

    Article  Google Scholar 

  • Arbelaez P, Maire M, Fowlkes C et al (2011) Contour detection and hierarchical image segmentation. IEEE Trans Pattern Anal Mach Intell 33:898–916

    Article  Google Scholar 

  • Arias-Castro E, Lerman G, Zhang T (2017) Spectral clustering based on local PCA. J Mach Learn Res 18(1):253–309

    MathSciNet  MATH  Google Scholar 

  • Boemer F, Ratner E, Lendasse A (2018) Parameter free image segmentation with SLIC. Neurocomputing 277:228–236

    Article  Google Scholar 

  • Bouneffouf D, Birol I (2016) Ensemble minimum sum of squared similarities sampling for Nyström-based spectral clustering. In: 2016 International joint conference on neural networks (IJCNN), IEEE, 2016, pp 3851–3855

  • Chen G, Lerman G (2009) Spectral curvature clustering (SCC). Int J Comput Vision 81(3):317–330

    Article  Google Scholar 

  • Chen J, Li Z, Huang B (2017) Linear spectral clustering superpixel. IEEE Trans Image Process 26(7):3317–3330

    Article  MathSciNet  Google Scholar 

  • Collins RT (2003) Mean-shift blob tracking through scale space. In: 2003 IEEE computer society conference on computer vision and pattern recognition, IEEE, 2003, pp II-234

  • Cour T, Benezit F, Shi J (2005) Spectral segmentation with multiscale graph decomposition. In: 2005 IEEE computer society conference on computer vision and pattern recognition, IEEE, 2005, pp 1124–1131

  • Fowlkes C, Belongie S, Malik J (2001) Efficient spatiotemporal grouping using the Nyström method. In: Proceedings of the 2001 IEEE computer society conference on computer vision and pattern recognition (CVPR), IEEE, pp I–I

  • Fukunaga K, Olsen DR (1971) An algorithm for finding intrinsic dimensionality of data. IEEE Trans Comput 100(2):176–183

    Article  Google Scholar 

  • Gilbert AC, Sonthalia R (2018) Unrolling Swiss Cheese: metric repair on manifolds with holes. arXiv preprint

  • Gittens A, Mahoney MW (2016) Revisiting the Nyström method for improved large-scale machine learning. J Mach Learn Res 17(1):3977–4041

    MATH  Google Scholar 

  • Halimi A, Honeine P, Kharouf M, Richard C, Tourneret JY (2016) Estimating the intrinsic dimension of hyperspectral images using a noise-whitened eigengap approach. IEEE Trans Geosci Remote Sens 54(7):3811–3821

    Article  Google Scholar 

  • Hou C, Nie F, Yi D, Tao D (2015) Discriminative embedded clustering: a framework for grouping high-dimensional data. IEEE Trans Neural Netw Learn Syst 26(6):1287–1299

    Article  MathSciNet  Google Scholar 

  • Huang S, Zhang L, Li F (2018) Spectral Embedded Clustering on Multi-Manifold. In: Proceedings of the IEEE international conference on pattern recognition. Beijing, China, IEEE, 391–396

  • Lei T, Jia X, Zhang Y et al (2018) Significantly fast and robust fuzzy C-means clustering algorithm based on morphological reconstruction and membership filtering. IEEE Trans Fuzzy Syst 26(5):3027–3041

    Article  Google Scholar 

  • Li JY, Zhou JG, Guan JH et al (2011) Progress of spectral clustering algorithm. J Intell Syst 6(05):405–414

    Google Scholar 

  • Li Q, Liu W, Li L, Wang R (2017) Towards large scale spectral problems via diffusion process. In: 2017 International conference on digital image computing: techniques and applications (DICTA), IEEE, 2017, pp 1–7

  • Li Z, Chen J (2015) Superpixel segmentation using linear spectral clustering. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 356–1363

  • Long J, Shelhamer E, Darrell T (2014) Fully convolutional networks for semantic segmentation. IEEE Trans Pattern Anal Mach Intell 39(4):640–651

    Google Scholar 

  • Luxburg UV (2007) A tutorial on spectral clustering. Stat Comput 17(4):395–416

    Article  MathSciNet  Google Scholar 

  • Ma X, Li B, Wang Y, Erfani SM, Wijewickrema S, Schoenebeck G, Bailey J (2018) Characterizing adversarial subspaces using local intrinsic dimensionsionality. arXiv preprint

  • Michael VDB, Boix X, Roig G et al (2015) SEEDS: superpixels extracted via energy-driven sampling. Int J Comput Vision 111(3):298–314

    Article  MathSciNet  Google Scholar 

  • Mohan M, Monteleoni C (2017) Exploiting sparsity to improve the accuracy of Nyström-based large-scale spectral clustering. In: 2017 international joint conference on neural networks (IJCNN), IEEE, pp 9–16

  • Ng AY, Jordan MI, Weiss Y (2002) On spectral clustering: analysis and an algorithm. In: Advances in neural information processing systems, pp 849–856

  • Ren X, Malik J (2003) Learning a classification model for segmentation. ICCV 1:10–17

    Google Scholar 

  • Roweis ST (2000) Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500):2323–2326

    Article  Google Scholar 

  • Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888–905

    Article  Google Scholar 

  • Tan LY, Wang SJ (2013) A fast image segmentation based on path-based similarity and dual super-pixel sets. Acta Autom Sin 39(10):1653–1664

    Article  Google Scholar 

  • Tipping ME, Bishop CM (1999) Mixtures of probabilistic principal component analyzers. Neural Comput 11(2):443–482

    Article  Google Scholar 

  • Tremblay N, Loukas A (2020) Approximating spectral clustering via sampling: a review. In: Sampling techniques for supervised or unsupervised tasks. Springer, Cham, pp 129–183

    Chapter  Google Scholar 

  • Unnikrishnan R, Pantofaru C, Hebert M (2007) Toward objective evaluation of image segmentation algorithms. IEEE Trans Pattern Anal Mach Intell 29(6):929–944

    Article  Google Scholar 

  • Wang HB, He L (2013) Research of a manifold learning algorithm based on spectral clustering. J Univ Sci Technol China 1(1):79–86

    MATH  Google Scholar 

  • Wang RX, Peng GH (2017) Image retrieval algorithm based on Riemannian manifold sparse coding. J Autom 43(5):778–788

    MATH  Google Scholar 

  • Wu DY, Ma L (2018) Multi-manifold LE algorithm for dimension reduction and classification of multitemporal hyperspectral image. Remote Sens Land Resour 30(2):80–86

    Google Scholar 

  • Yong W, Yuan J, Yi W et al (2011) Spectral clustering on multiple manifolds. IEEE Trans Neural Netw 22(7):1149–1161

    Article  Google Scholar 

  • Zhang RG, Liu XJ, Dong L et al (2015) Superpixel graph cuts rapid algorithm for extracting object contour shapes. Pattern Recognit Artif 28(4):344–353

    Google Scholar 

  • Zhang RG, Liu XJ, Hu J et al (2017) A fast method for moving object detection in video surveillance image. SIViP 11(5):841–848

    Article  Google Scholar 

Download references

Acknowledgements

This research was supported by the National Natural Science Foundation of China under Grant 51875152, the Natural Science Foundation of Shanxi Province (CN) under Grant 201801D121134, and the Graduate Education Innovation Foundation of Shanxi Province (CN) under Grant 2021Y698.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rongguo Zhang.

Ethics declarations

Conflict of interest

The authors declare that they have no conflicts of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yao, X., Zhang, R., Hu, J. et al. Combining intrinsic dimension and local tangent space for manifold spectral clustering image segmentation. Soft Comput 26, 9557–9572 (2022). https://doi.org/10.1007/s00500-022-06751-3

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-022-06751-3

Keywords

Navigation