A Batch-Mode Regularized Multimetric Active Learning Framework for Classification of Hyperspectral Images
Zhou Zhang,Melba M. Crawford +1 more
26
TL;DR: A regularized multimetric active learning (AL) framework is proposed which consists of three main parts, in which a regularizer incorporates the unlabeled data based on the neighborhood relationship, which helps avoid overfitting at early stages of AL, when the quantity of training data is particularly small.
read more
Abstract: Techniques that combine multiple types of features, such as spectral and spatial features, for hyperspectral image classification can often significantly improve the classification accuracy and produce a more reliable thematic map. However, the high dimensionality of the input data and the typically limited quantity of labeled samples are two key challenges that affect classification performance of supervised methods. In order to simultaneously deal with these issues, a regularized multimetric active learning (AL) framework is proposed which consists of three main parts. First, a regularized multimetric learning approach is proposed to jointly learn distinct metrics for different types of features. The regularizer incorporates the unlabeled data based on the neighborhood relationship, which helps avoid overfitting at early stages of AL, when the quantity of training data is particularly small. Then, as AL proceeds, the regularizer is also updated through similarity propagation, thus taking advantage of informative labeled samples. Finally, multiple features are projected into a common feature space, in which a new batch-mode AL strategy combining uncertainty and diversity is utilized in conjunction with k-nearest neighbor classification to enrich the set of labeled samples. In order to evaluate the effectiveness of the proposed framework, the experiments were conducted on two benchmark hyperspectral data sets, and the results were compared to those achieved by several other state-of-the-art AL methods.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Deep Pyramidal Residual Networks for Spectral–Spatial Hyperspectral Image Classification
Mercedes E. Paoletti,Juan M. Haut,Ruben Fernandez-Beltran,Javier Plaza,Antonio Plaza,Filiberto Pla +5 more
TL;DR: A new deep CNN architecture specially designed for the HSI data is presented to improve the spectral–spatial features uncovered by the convolutional filters of the network and is able to provide competitive advantages over the state-of-the-art HSI classification methods.
Diversity in Machine Learning
TL;DR: This analysis provides a deeper understanding of the diversity technology in machine learning tasks and hence can help design and learn more effective models for real-world applications.
245
•Posted Content
Hyperspectral Image Classification - Traditional to Deep Models: A Survey for Future Prospects.
Sidrah Shabbir,Muhammad Ahmad +1 more
TL;DR: In this paper, a survey of state-of-the-art DL frameworks for hyperspectral imaging (HSI) classification is presented, including spectral-features, spatial-features and together spatial-spectral features.
223
Hyperspectral Image Classification—Traditional to Deep Models: A Survey for Future Prospects
TL;DR: In this article , a survey of state-of-the-art DL frameworks for hyperspectral imaging classification (HSIC) is presented. And the authors discuss some strategies to improve the generalization performance of DL strategies and provide some future guidelines.
Active Semi-Supervised Random Forest for Hyperspectral Image Classification
TL;DR: A unified framework that embeds active learning and semi-supervised learning into RF (ASSRF) to improve the performance of RF and avoids bias caused by AL-labeled samples.
References
Nonlinear dimensionality reduction by locally linear embedding.
Sam T. Roweis,Lawrence K. Saul +1 more
TL;DR: Locally linear embedding (LLE) is introduced, an unsupervised learning algorithm that computes low-dimensional, neighborhood-preserving embeddings of high-dimensional inputs that learns the global structure of nonlinear manifolds.
A global geometric framework for nonlinear dimensionality reduction.
TL;DR: An approach to solving dimensionality reduction problems that uses easily measured local metric information to learn the underlying global geometry of a data set and efficiently computes a globally optimal solution, and is guaranteed to converge asymptotically to the true structure.
Distance Metric Learning for Large Margin Nearest Neighbor Classification
TL;DR: This paper shows how to learn a Mahalanobis distance metric for kNN classification from labeled examples in a globally integrated manner and finds that metrics trained in this way lead to significant improvements in kNN Classification.
5.7K
•Proceedings Article
Learning with Local and Global Consistency
Dengyong Zhou,Olivier Bousquet,TN Lal,Jason Weston,Bernhard Schölkopf +4 more
- 09 Dec 2003
TL;DR: A principled approach to semi-supervised learning is to design a classifying function which is sufficiently smooth with respect to the intrinsic structure collectively revealed by known labeled and unlabeled points.
•Proceedings Article
Distance Metric Learning for Large Margin Nearest Neighbor Classification
Kilian Q. Weinberger,John Blitzer,Lawrence K. Saul +2 more
- 05 Dec 2005
TL;DR: In this article, a Mahanalobis distance metric for k-NN classification is trained with the goal that the k-nearest neighbors always belong to the same class while examples from different classes are separated by a large margin.