2019
DOI: 10.3390/rs11242974
|View full text |Cite
|
Sign up to set email alerts
|

Active Semi-Supervised Random Forest for Hyperspectral Image Classification

Abstract: Random forest (RF) has obtained great success in hyperspectral image (HSI) classification. However, RF cannot leverage its full potential in the case of limited labeled samples. To address this issue, we propose a unified framework that embeds active learning (AL) and semi-supervised learning (SSL) into RF (ASSRF). Our aim is to utilize AL and SSL simultaneously to improve the performance of RF. The objective of the proposed method is to use a small number of manually labeled samples to train classifiers with … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 47 publications
(25 citation statements)
references
References 70 publications
(129 reference statements)
0
18
0
Order By: Relevance
“…[299] proposed a feature-driven AL framework to define a wellconstructed feature space for HSIC. [300] proposed a Random Forest-based semi-supervised AL method that exploits spectral-spatial features to define a query function to select the most informative samples as target candidates for the training set.…”
Section: Fig 14: a General Overview Of Active Learningmentioning
confidence: 99%
“…[299] proposed a feature-driven AL framework to define a wellconstructed feature space for HSIC. [300] proposed a Random Forest-based semi-supervised AL method that exploits spectral-spatial features to define a query function to select the most informative samples as target candidates for the training set.…”
Section: Fig 14: a General Overview Of Active Learningmentioning
confidence: 99%
“…Generally, the similarity function in RBMAL adopts the Euclidean distance and does not consider the spectral characteristics of samples [38]. The purpose of spectral similarity measurement in the combined query strategy in this study is to determine the similarity between the unknown spectrum and a known spectrum according to a spectral similarity measurement function and then divide the attributes of unknown categories according to the similarity results [72][73][74]. This approach is consistent with the description of the similarity function in RBMAL.…”
Section: Similarity Function Based On the Sidmentioning
confidence: 86%
“…A new semi-supervised framework has been proposed to cope with high-dimensional and large-scale data, which combined the randomness with anchor graphs [32]. The advantages of random forest [33] include not over-fitting due to randomness and featuring good generalization performance. Moreover, the advantage of the anchor graph algorithm [34] is that it can linearly scale the size of the dataset, which is very suitable for HSI characteristics.…”
Section: Random Multi-graphs Algorithmmentioning
confidence: 99%
“…where F Θ is a nonlinear function of the CNN using parameters Θ, L u is the unary term that predicts the samples by using CNN, and L p can make adjacent samples to have the similar label. Here, the detailed explanation of label Y and the parameter Θ refers to the ADL classification method from [33]. The data input to the convolutional neural network is provided in the form of a three-dimensional cubic block with a three-dimensional convolutional kernel for convolution and pooling.…”
Section: Active Deep Learning (Adl) Modulementioning
confidence: 99%