Laser & Optoelectronics Progress, Volume. 58, Issue 2, 0210021(2021)
Hyperspectral Fast Clustering Algorithm Based on Binary Tree Anchor Points
Fig. 1. Schematic of selecting anchor points for binary tree
Fig. 2. Flow chart of FHC-BTA algorithm
Fig. 3. Clustering map of each algorithm on Indian Pines dataset. (a) Ground map; (b) K-means; (c) FCM; (d) FCM_S1; (e) SC; (f) FHC-BTA_K; (g) FHC-BTA_R; (h) FHC-BTA
Fig. 4. Clustering map of each algorithm on Salinas dataset. (a) Ground map; (b) K-means; (c) FCM; (d) FCM_S1; (e) FHC-BTA_K; (f) FHC-BTA_R; (g) FHC-BTA
Fig. 5. Test results under Indian Pines dataset. (a) Different numbers of anchor points; (b) different numbers of nearest neighbors
Fig. 6. Test results under Salinas dataset. (a) Different numbers of anchor points; (b) different numbers of nearest neighbors
|
|
Get Citation
Copy Citation Text
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
Category: Image Processing
Received: Jun. 19, 2020
Accepted: Jul. 20, 2020
Published Online: Jan. 11, 2021
The Author Email: Yang Xiaojun (yxj029@163.com)