• Laser & Optoelectronics Progress
  • Vol. 58, Issue 2, 0210021 (2021)
Yuxiong Xu1, Xiaojun Yang1、*, Yongda Cai1, Xiaoyan Du2, and Xin Zhang1
Author Affiliations
  • 1College of Information Engineering, Guangdong University of Technology, Guangzhou, Guangdong 510006, China
  • 2Chinese People's Liberation Army 96630 Troops, Beijing 102206, China
  • show less
    DOI: 10.3788/LOP202158.0210021 Cite this Article Set citation alerts
    Yuxiong Xu, Xiaojun Yang, Yongda Cai, Xiaoyan Du, Xin Zhang. Hyperspectral Fast Clustering Algorithm Based on Binary Tree Anchor Points[J]. Laser & Optoelectronics Progress, 2021, 58(2): 0210021 Copy Citation Text show less
    References

    [1] Zeng C P, Ju L J, Zhang J C. Hyperspectral image classification based on clustering dimensionality reduction and visual attention mechanism[J]. Laser & Optoelectronics Progress, 56, 212802(2019).

    [2] Huang D M, Zhang X T, Zhang M H et al. Feature extraction of hyperspectral images based on semi-supervised locality preserving projection with spatial-correlation[J]. Laser & Optoelectronics Progress, 56, 021003(2019).

    [3] Ji L, Zhang X, Zhang L M et al. Hyperspectral image classification algorithm based on spatial spectrum weighted nearest neighbors[J]. Laser & Optoelectronics Progress, 57, 061013(2020).

    [4] Xue Z H, Du P J, Li J et al. Sparse graph regularization for hyperspectral remote sensing image classification[J]. IEEE Transactions on Geoscience and Remote Sensing, 55, 2351-2366(2017). http://ieeexplore.ieee.org/document/7815348/

    [5] Chang X J, Yang Y. Semisupervised feature analysis by mining correlations among multiple tasks[J]. IEEE Transactions on Neural Networks and Learning Systems, 28, 2294-2305(2017). http://ieeexplore.ieee.org/document/7506338

    [6] Hartigan J A, Wong M A. Algorithm AS 136: a K-means clustering algorithm[J]. Applied Statistics, 28, 100-108(1979). http://www.bioone.org/servlet/linkout?suffix=bibr12&dbid=16&doi=10.1600%2F036364413X666750&key=10.2307%2F2346830

    [7] Li Y, Zhen C, Shi X et al. Hyperspectral image classification based on entropy-weighted K-means global information clustering[J]. Chinese Journal of Image and Graphics, 24, 630-638(2019).

    [8] Bezdek J C. Modified objective function algorithms[M]. ∥Pattern recognition with fuzzy objective function algorithms. Boston: Springer, 155-201(1981).

    [9] Chen S, Zhang D. Robust image segmentation using FCM with spatial constraints based on new kernel-induced distance measure[J]. IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), 34, 1907-1916(2004).

    [10] Ng A Y, Jordan M I, Weiss Y. On spectral clustering:analysis and an algorithm. [C]∥ 14th International Conference on Neural Infomation Processing Systems: Natural and Synthetic, December 3-8, 2001, Vancouver, Canada. New York: Curran Associates, 849-856(2001).

    [11] Yang X J, Yu W Z, Wang R et al. Fast spectral clustering learning with hierarchical bipartite graph for large-scale data[J]. Pattern Recognition Letters, 130, 345-352(2020).

    [12] Jebara T, Wang J, Chang S F. Graph construction and b-matching for semi-supervised learning[C]∥, 441-448(2009).

    [13] Wang R, Nie F P, Yu W Z. Fast spectral clustering with anchor graph for large hyperspectral images[J]. IEEE Geoscience and Remote Sensing Letters, 14, 2003-2007(2017). http://ieeexplore.ieee.org/document/8039217/

    [14] Li Y, Nie F, Huang H et al. Large-scale multi-view spectral clustering via bipartite graph. [C]∥Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA. [S.l:s.n.], 2750-2756(2015).

    [15] Cai D, Chen X L. Large scale spectral clustering via landmark-based sparse representation[J]. IEEE Transactions on Cybernetics, 45, 1669-1680(2015).

    [16] Zhou X M, Pan D. Research on large scale image indexing technology based on PCA-binary tree[J]. Journal of Southwest China Normal University (Natural Science Edition), 44, 57-62(2019).

    [17] Liu Y X, Zhang Z H, Zhang Y M. Image denoising based on K-means clustering and binary tree decision[J]. Computer Engineering & Science, 35, 118-123(2013).

    [18] Zhu W, Nie F P, Li X L. Fast spectral clustering with efficient large graph construction. [C]∥2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), March 5-9,2017, New Orleans, LA, USA. New York: IEEE, 2492-2496(2017).

    [19] Zhou Y C, Peng J T. Chen C L P. Dimension reduction using spatial and spectral regularized local discriminant embedding for hyperspectral image classification[J]. IEEE Transactions on Geoscience and Remote Sensing, 53, 1082-1095(2015).

    [20] Nie F, Zhu W, Li X. Unsupervised large graph embedding. [C]∥ Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA.[S.l:s.n.], 2422-2428(2017).

    [21] Nie F P, Wang X Q, Jordan M I et al. The constrained Laplacian rank algorithm for graph-based clustering. [C]∥ Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, February 12-17, 2016, Phoenix, Arizona, USA. [S.l:s.n.], 1969-1976(2016).

    [22] Wei Y W, Niu C, Wang Y T et al. The fast spectral clustering based on spatial information for large scale hyperspectral image[J]. IEEE Access, 7, 141045-141054(2019). http://ieeexplore.ieee.org/document/8846013

    [23] Wang R, Nie F P, Hong R C et al. Fast and orthogonal locality preserving projections for dimensionality reduction[J]. IEEE Transactions on Image Processing, 26, 5019-5030(2017).

    Yuxiong Xu, Xiaojun Yang, Yongda Cai, Xiaoyan Du, Xin Zhang. Hyperspectral Fast Clustering Algorithm Based on Binary Tree Anchor Points[J]. Laser & Optoelectronics Progress, 2021, 58(2): 0210021
    Download Citation