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

Kernel RX-algorithm: a nonlinear anomaly detector for hyperspectral imagery

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
112
0

Year Published

2009
2009
2022
2022

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 649 publications
(112 citation statements)
references
References 23 publications
0
112
0
Order By: Relevance
“…Heesung and Nasrabadi in [21] proposed (KRX) a nonlinear version of the RXD based on its kernelization in the feature space in terms of kernels that implicitly compute dot products in the feature space. To estimate the kernel matrix, which is a Gram matrix; proprieties of the kernel principal component analysis are used.…”
Section: B Kernel Based Anomaly Detectorsmentioning
confidence: 99%
See 1 more Smart Citation
“…Heesung and Nasrabadi in [21] proposed (KRX) a nonlinear version of the RXD based on its kernelization in the feature space in terms of kernels that implicitly compute dot products in the feature space. To estimate the kernel matrix, which is a Gram matrix; proprieties of the kernel principal component analysis are used.…”
Section: B Kernel Based Anomaly Detectorsmentioning
confidence: 99%
“…This supposition accentuates the False Alarm Rate (FAR) especially for high resolution images where the supposition of homogeneity seems to be inappropriate since the big diversity of existing materials. To decrease this fact, non linear models of the background 978-1-4799-7069-8/14/$31.00 2014 IEEE have been proposed with the kernel based anomaly detectors [21][22][23][24][25][26][27][28]. Other researches try to solve the anomaly detection problem with different techniques as the projection [31][32][33][34][35][36] and the segmentation [37][38][39][40][41][42][43][44][45][46].…”
Section: Introductionmentioning
confidence: 99%
“…To reduce the background pixels in the input data, we used the assumption in [3,19] that the input data consists of two Gaussian distributions, background distribution and target distribution. In other words, the target pixels are drawn from multivariate Gaussian distribution.…”
Section: A Data Reductionmentioning
confidence: 99%
“…Reducing the background pixels facilitate the detection of targets based on the entire input information of the targets and simultaneously reduce the computational burden on SEM algorithm. The reduction step is accomplished in the feature space where the input data is mapped using the Gaussian RBF kernel [19,20]. This fusion scheme of the SEM algorithm with kernel approach reduced the computational burden on the SEM algorithm, used the entire information of target for detection, and reduced the possibility of false alarms that may arise from noisy input data.…”
Section: Introductionmentioning
confidence: 99%
“…In most literatures of hyperspectral anomaly detection, for the sake of extruding the anomalies, background estimation is the most important issue (4)- (6) . A variety of anomaly detection algorithms, such as Reed-Xiaoli (RX) detector (7) , kernel-RX (KRX) (8) , and the cluster-based anomaly detector (CBAD) (9) , aim at suppressing the background land-covers via a statistical background estimation. However, these statistical based anomaly detection methods are limited in that they incorporate the anomaly targets in the background estimation when undertaking a global or clustered background statistics estimation.…”
Section: Introductionmentioning
confidence: 99%