Multiple Kernel Learning Based on Discriminative Kernel Clustering for Hyperspectral Band Selection

被引:43
作者
Feng, Jie [1 ]
Jiao, Licheng [1 ]
Sun, Tao [1 ]
Liu, Hongying [1 ]
Zhang, Xiangrong [1 ]
机构
[1] Xidian Univ, Minist Educ, Key Lab Intelligent Percept & Image Understanding, Xian 710071, Peoples R China
来源
IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING | 2016年 / 54卷 / 11期
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
Affinity propagation (AP); discriminative kernel alignment (KA) (DKA); hyperspectral band selection; kernel synergy; multiple kernel learning (MKL); Rademacher complexity; MUTUAL INFORMATION; CLASSIFICATION; REDUCTION; MATRIX; IMAGES;
D O I
10.1109/TGRS.2016.2585961
中图分类号
P3 [地球物理学]; P59 [地球化学];
学科分类号
0708 ; 070902 ;
摘要
In hyperspectral images, band selection plays a crucial role for land-cover classification. Multiple kernel learning (MKL) is a popular feature selection method by selecting the relevant features and classifying the images simultaneously. Unfortunately, a large number of spectral bands in hyperspectral images result in excessive kernels, which limit the application of MKL. To address this problem, a novel MKL method based on discriminative kernel clustering (DKC) is proposed. In the proposed method, a discriminative kernel alignment (KA) (DKA) is defined. Traditional KA measures kernel similarity independently of the current classification task. Compared with KA, DKA measures the similarity of discriminative information by introducing the comparison of intraclass and interclass similarities. It can evaluate both kernel redundancy and kernel synergy for classification. Then, DKA-based affinity-propagation clustering is devised to reduce the kernel scale and retain the kernels having high discrimination and low redundancy for classification. Additionally, an analysis of necessity for DKC in hyperspectral band selection is provided by empirical Rademacher complexity. Experimental results on several hyperspectral images demonstrate the effectiveness of the proposed band selection method in terms of classification performance and computation efficiency.
引用
收藏
页码:6516 / 6530
页数:15
相关论文
共 41 条
[1]  
[Anonymous], 2007, Hyperspectral data exploitation: theory and applications
[2]   Feature selection and classification of hyperspectral images, with support vector machines [J].
Archibald, Rick ;
Fann, George .
IEEE GEOSCIENCE AND REMOTE SENSING LETTERS, 2007, 4 (04) :674-677
[3]  
Bartlett P. L., 2003, Journal of Machine Learning Research, V3, P463, DOI 10.1162/153244303321897690
[4]   Toward an optimal SVM classification system for hyperspectral remote sensing images [J].
Bazi, Yakoub ;
Melgani, Farid .
IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, 2006, 44 (11) :3374-3385
[5]   Random forests [J].
Breiman, L .
MACHINE LEARNING, 2001, 45 (01) :5-32
[6]   Spectral curve fitting for automatic hyperspectral data analysis [J].
Brown, Adrian Jon .
IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, 2006, 44 (06) :1601-1608
[7]   Hyperspectral imaging spectroscopy of a Mars analogue environment at the North Pole Dome, Pilbara Craton, Western Australia [J].
Brown, AJ ;
Walter, MR ;
Cudahy, TJ .
AUSTRALIAN JOURNAL OF EARTH SCIENCES, 2005, 52 (03) :353-364
[8]  
Cortes C., 2009, P 25 C UNC ART INT U, DOI DOI 10.5555/1795114.1795128
[9]  
Cristianini N, 2002, ADV NEUR IN, V14, P367
[10]   A band selection technique for spectral classitication [J].
De Backer, S ;
Kempeneers, P ;
Debruyn, W ;
Scheunders, P .
IEEE GEOSCIENCE AND REMOTE SENSING LETTERS, 2005, 2 (03) :319-323