A dual-kernel spectral-spatial classification approach for hyperspectral images based on Mahalanobis distance metric learning

被引:23
作者
Li, Li [1 ,2 ]
Sun, Chao [1 ]
Lin, Lianlei [1 ]
Li, Junbao [1 ]
Jiang, Shouda [1 ]
Yin, Jingwei [2 ]
机构
[1] Harbin Inst Technol, Dept Automat Test & Control, Harbin, Heilongjiang, Peoples R China
[2] Harbin Engineer Univ, Sci & Technol Underwater Acoust Lab, Harbin, Heilongjiang, Peoples R China
关键词
Mahalanobis kernel; Supervised learning; Hyperspectral classification; Kernel-based segmentation; GRAPH CUTS; ENERGY MINIMIZATION; FEATURE-EXTRACTION; SEGMENTATION; ALGORITHMS; SYSTEMS;
D O I
10.1016/j.ins.2017.11.005
中图分类号
TP [自动化技术、计算机技术];
学科分类号
080201 [机械制造及其自动化];
摘要
Hyperspectral images provide a precise representation of the earth's surface, with abundant spectral and spatial features, but normal classification algorithms use only the information provided by the spectral features of each data point. In this paper, we propose a new approach to hyperspectral image classification based on Mahalanobis distance metric learning and kernel learning that considers both the features of the spectral bands and a spatial prior. This approach consists of two components. First, we obtain a primary labeled classification result and a posterior probability distribution for each pixel point using a Mahalanobis-kernel-based classifier. Second, instead of the original or extracted spectral features, we reconstruct the spatial relationship of the hyperspectral images using the posterior probability of every data point, smooth the boundaries, and revise suspicious points based on this piecewise information using a kernel-based multi-region segmentation method. In an experimental study, we adopt a support vector machine (SVM) classifier as the kernel classifier to obtain the posterior probabilities using dimensionally reduced data. The proposed method is compared with several other methods from various perspectives. Simulation experiments run on several real hyperspectral data sets are reported. The results show that the proposed method performs better than other comparable classification algorithms, especially in a condition-constrained environment. (C) 2017 Elsevier Inc. All rights reserved.
引用
收藏
页码:260 / 283
页数:24
相关论文
共 49 条
[1]
[Anonymous], IEEE CVPR
[2]
[Anonymous], 2007, THESIS I NATL POLYT
[3]
Learning low-rank kernel matrices for constrained clustering [J].
Baghshah, Mahdieh Soleymani ;
Shouraki, Saeed Bagheri .
NEUROCOMPUTING, 2011, 74 (12-13) :2201-2211
[4]
Bagon S., 2006, MATLAB WRAPPER GRAPH
[5]
Multiregion level-set partitioning of synthetic aperture radar images [J].
Ben Ayed, I ;
Mitiche, A ;
Belhadj, Z .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2005, 27 (05) :793-800
[6]
Unsupervised variational image segmentation/classification using a Weibull observation model [J].
Ben Ayed, Ismail ;
Hennane, Nacera ;
Mitiche, Amar .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2006, 15 (11) :3431-3439
[7]
Polarimetric image segmentation via maximum-likelihood approximation and efficient multiphase level-sets [J].
Ben Ayed, Ismail ;
Mitiche, Amar ;
Belhadj, Ziad .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2006, 28 (09) :1493-1500
[8]
Multiregion Image Segmentation by Parametric Kernel Graph Cuts [J].
Ben Salah, Mohamed ;
Mitiche, Amar ;
Ben Ayed, Ismail .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2011, 20 (02) :545-557
[9]
Ben Salah M, 2008, LECT NOTES COMPUT SC, V5358, P268, DOI 10.1007/978-3-540-89639-5_26
[10]
BESAG J, 1974, J ROY STAT SOC B MET, V36, P192