2009
DOI: 10.1109/tgrs.2009.2020910
|View full text |Cite
|
Sign up to set email alerts
|

Target Detection With Semisupervised Kernel Orthogonal Subspace Projection

Abstract: The Orthogonal Subspace Projection (OSP) algorithm is substantially a kind of matched filter that requires the evaluation of a prototype for each class to be detected. The kernel OSP (KOSP) has recently demonstrated improved results for target detection in hyperspectral images. The use of kernel methods (KMs) makes the method nonlinear, helps to combat the high-dimensionality problem, and improves robustness to noise. This paper presents a semisupervised graph-based approach to improve KOSP. The proposed algor… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
22
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 57 publications
(22 citation statements)
references
References 22 publications
0
22
0
Order By: Relevance
“…However, good performance of the above approaches could be achieved only when the manually labeled samples are provided. To alleviate the tedious and unreliable manual annotation, some researchers adopted semi-supervised learning (SSL) methods to perform object detection [18,19], in which only a few labeled training samples were used to train detectors and then new samples in training set were added from unlabeled data. However, these methods still require a comparative number of manual labeled positive examples.…”
Section: Introductionmentioning
confidence: 99%
“…However, good performance of the above approaches could be achieved only when the manually labeled samples are provided. To alleviate the tedious and unreliable manual annotation, some researchers adopted semi-supervised learning (SSL) methods to perform object detection [18,19], in which only a few labeled training samples were used to train detectors and then new samples in training set were added from unlabeled data. However, these methods still require a comparative number of manual labeled positive examples.…”
Section: Introductionmentioning
confidence: 99%
“…Essentially, we propose to deform the kernel using the graph Laplacian. This idea was originally presented in [11] for the inductive SVM and has been recently presented for kernel orthogonal subspace projection target detection [15]. Here, it is applied to the OC-SVM.…”
Section: Proposed Smentioning
confidence: 99%
“…For our experiments, class "Graminoid marsh" was selected as the target class, whereas the others are considered as outlier class. The interest in this class is motivated by its intrinsic complexity; it is underrepresented, and it can be confused with similar subclasses in the scene, as documented in [15]. …”
Section: ) Hyperspectral Crop Detectionmentioning
confidence: 99%
“…Thus, target detection is one of the important applications of HIS [5]. It can be viewed as a binary classification problem where pixels are labeled as target (target present) or background (target absent) based on their spectral characteristics [6]. The most common model assumes that the spectra are represented by unique spatially non-overlapping materials.…”
Section: Introductionmentioning
confidence: 99%