Hyperspectral Fast Clustering Algorithm Based on Binary Tree Anchor Points

Yuxiong Xu; Xiaojun Yang; Yongda Cai; Xiaoyan Du; Xin Zhang

doi:10.3788/LOP202158.0210021

Journals >Laser & Optoelectronics Progress >Volume 58 >Issue 2 >Page 0210021 > Article

Laser & Optoelectronics Progress
Vol. 58, Issue 2, 0210021 (2021)

Hyperspectral Fast Clustering Algorithm Based on Binary Tree Anchor Points

Yuxiong Xu¹, Xiaojun Yang^1、*, Yongda Cai¹, Xiaoyan Du², and Xin Zhang¹

Author Affiliations

¹College of Information Engineering, Guangdong University of Technology, Guangzhou, Guangdong 510006, China

²Chinese 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

Cited By

Article index updated: May. 24, 2024

Citation counts are provided from Researching.

The article is cited by 1 article(s) from Researching.

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

Set citation alerts for the article

Tools

Set citation alerts for the article

Save the article for my favorites

Paper Information