2017
DOI: 10.3390/s17081815
|View full text |Cite
|
Sign up to set email alerts
|

Progressive Line Processing of Kernel RX Anomaly Detection Algorithm for Hyperspectral Imagery

Abstract: The Kernel-RX detector (KRXD) has attracted widespread interest in hyperspectral image processing with the utilization of nonlinear information. However, the kernelization of hyperspectral data leads to poor execution efficiency in KRXD. This paper presents an approach to the progressive line processing of KRXD (PLP-KRXD) that can perform KRXD line by line (the main data acquisition pattern). Parallel causal sliding windows are defined to ensure the causality of PLP-KRXD. Then, with the employment of the Woodb… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 18 publications
(11 citation statements)
references
References 24 publications
0
11
0
Order By: Relevance
“…Finally, we would like to highlight the existing trade-off between the causality in line-by-line approaches and how to model the background distribution, which is the most important part in any adopted solution for anomaly detection. Actually, very few publications are made in this field where the anomaly detection issue is addressed in a line-by-line fashion [43,47,59,60]. In the solution proposed in this manuscript, the background distribution is estimated from several of the first sensed hyperspectral image blocks, n f , under the assumption that they are free of anomalous signatures and hence, fully representative of the background distribution.…”
Section: Discussionmentioning
confidence: 99%
“…Finally, we would like to highlight the existing trade-off between the causality in line-by-line approaches and how to model the background distribution, which is the most important part in any adopted solution for anomaly detection. Actually, very few publications are made in this field where the anomaly detection issue is addressed in a line-by-line fashion [43,47,59,60]. In the solution proposed in this manuscript, the background distribution is estimated from several of the first sensed hyperspectral image blocks, n f , under the assumption that they are free of anomalous signatures and hence, fully representative of the background distribution.…”
Section: Discussionmentioning
confidence: 99%
“…It should be emphasized that many new anomaly detection algorithms have emerged in recent years [53,54]. A separate survey is needed for this area alone.…”
Section: Residual Analysismentioning
confidence: 99%
“…As a result, only a small number of target signatures need to be converted from reflectance to radiance, and hence, a great reduction of computations has been achieved. Similarly, there are fast anomaly detectors based on random down sampling of background pixels [116], cluster centers of background pixels [16], progressive line scanning [53], and recursive implementation [117].…”
Section: Need To Improve Computational Efficiencymentioning
confidence: 99%
“…For applications under strict real-time constraints in which the captured images must be processed in a short period of time, it is more efficient if the anomalies are uncovered as soon as the hyperspectral data are sensed. For this purpose, there have been recent solutions proposed to cope with this situation [28][29][30].…”
Section: Anomaly Detection Algorithmsmentioning
confidence: 99%