Improved k-means and spectral matching for hyperspectral mineral mapping

被引:27
|
作者
Ren, Zhongliang [1 ]
Sun, Lin [1 ]
Zhai, Qiuping [2 ]
机构
[1] Shandong Univ Sci & Technol, Coll Geodesy & Geomat, Qingdao 266590, Peoples R China
[2] Linyi Univ, Coll Resources & Environm, Shandong Prov Key Lab Water & Soil Conservat & En, Linyi 276000, Shandong, Peoples R China
基金
中国国家自然科学基金;
关键词
Hyperspectral m; ineral; mapping; I; mproved k; -means; Similarity measurement method; Spectral absorption; feature; Spectral matching; THERMAL INFRARED DATA; HYDROTHERMAL ALTERATION; ASTER DATA; AIRBORNE; CUPRITE; NEVADA; SYSTEM; IDENTIFICATION; SPECTROSCOPY; EARTH;
D O I
10.1016/j.jag.2020.102154
中图分类号
TP7 [遥感技术];
学科分类号
081102 ; 0816 ; 081602 ; 083002 ; 1404 ;
摘要
Mineral mapping is an important step for the development and utilization of mineral resources. The emergence of remote sensing technology, especially hyperspectral imagery, has paved a new approach to geological mapping. The k-means clustering algorithm is a classical approach to classifying hyperspectral imagery, but the influence of mixed pixels and noise mean that it usually has poor mineral mapping accuracy. In this study, the mapping accuracy of the k-means algorithm was improved in three ways: similarity measurement methods that are insensitive to dimensions are used instead of the Euclidean distance for clustering; the spectral absorption features of minerals are enhanced; and the mineral mapping results are combined as the number of cluster centers (K) is incremented from 1. The improved algorithm is used with combined spectral matching to match the clustering results with a spectral library. A case study on Cuprite, Nevada, demonstrated that the improved k-means algorithm can identify most minerals with the kappa value of over 0.8, which is 46% and 15% higher than the traditional k-means and spectral matching technology. New mineral types are more likely to be found with increasing K. When K is much greater than the number of mineral types, the accuracy is improved, and the mineral mapping results are independent of the similarity measurement method. The improved k-means algorithm can also effectively remove speckle noise from the mineral mapping results and be used to identify other objects.
引用
收藏
页数:12
相关论文
共 50 条
  • [41] Cloud implementation of the K-means algorithm for hyperspectral image analysis
    Juan Mario Haut
    Mercedes Paoletti
    Javier Plaza
    Antonio Plaza
    The Journal of Supercomputing, 2017, 73 : 514 - 529
  • [42] Hyperspectral Image Classification: A k-means Clustering Based Approach
    Ranjan, Sameer
    Nayak, Deepak Ranjan
    Kumar, Kallepalli Satish
    Dash, Ratnakar
    Majhi, Banshidhar
    2017 4TH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTING AND COMMUNICATION SYSTEMS (ICACCS), 2017,
  • [43] AN EFFICIENT INITIALIZATION METHOD FOR K-MEANS CLUSTERING OF HYPERSPECTRAL DATA
    Naeini, A. Alizade
    Jamshidzadeh, A.
    Saadatseresht, M.
    Homayouni, S.
    1ST ISPRS INTERNATIONAL CONFERENCE ON GEOSPATIAL INFORMATION RESEARCH, 2014, 40 (2/W3): : 35 - 39
  • [44] DIMENSIONALITY REDUCTION WITH WEIGHTED K-MEANS FOR HYPERSPECTRAL IMAGE CLASSIFICATION
    Wong, Michael
    Hung, Chih-Cheng
    IGARSS 2020 - 2020 IEEE INTERNATIONAL GEOSCIENCE AND REMOTE SENSING SYMPOSIUM, 2020, : 44 - 47
  • [45] Cloud implementation of the K-means algorithm for hyperspectral image analysis
    Mario Haut, Juan
    Paoletti, Mercedes
    Plaza, Javier
    Plaza, Antonio
    JOURNAL OF SUPERCOMPUTING, 2017, 73 (01): : 514 - 529
  • [46] Nonnegative Lagrangian relaxation of K-means and spectral clustering
    Ding, C
    He, XF
    Simon, HD
    MACHINE LEARNING: ECML 2005, PROCEEDINGS, 2005, 3720 : 530 - 538
  • [47] K-means - a fast and efficient K-means algorithms
    Nguyen C.D.
    Duong T.H.
    Nguyen, Cuong Duc (nguyenduccuong@tdt.edu.vn), 2018, Inderscience Publishers, 29, route de Pre-Bois, Case Postale 856, CH-1215 Geneva 15, CH-1215, Switzerland (11) : 27 - 45
  • [48] Spectral Embedding of k-Cliques, Graph Partitioning and k-Means
    Awasthi, Pranjal
    Charikar, Moses
    Krishnaswamy, Ravishankar
    Sinop, Ali Kemal
    ITCS'16: PROCEEDINGS OF THE 2016 ACM CONFERENCE ON INNOVATIONS IN THEORETICAL COMPUTER SCIENCE, 2016, : 301 - 310
  • [49] The Analysis of Matching Learners in Pair Programming Using K-Means
    Aottiwerch, Naladtaporn
    Kokaew, Urachart
    2018 5TH INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND APPLICATIONS (ICIEA), 2018, : 362 - 366
  • [50] Image Matching Algorithm based on ORB and K-means Clustering
    Zhang, Liye
    Cai, Fudong
    Wang, Jinjun
    Lv, Changfeng
    Liu, Wei
    Guo, Guoxin
    Liu, Huanyun
    Xing, Yixin
    2020 5TH INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE, COMPUTER TECHNOLOGY AND TRANSPORTATION (ISCTT 2020), 2020, : 460 - 464