2021
DOI: 10.3390/rs13193954
|View full text |Cite
|
Sign up to set email alerts
|

A Fast Hyperspectral Anomaly Detection Algorithm Based on Greedy Bilateral Smoothing and Extended Multi-Attribute Profile

Abstract: To address the difficulty of separating background materials from similar materials associated with the use of “single-spectral information” for hyperspectral anomaly detection, a fast hyperspectral anomaly detection algorithm based on what we term the “greedy bilateral smoothing and extended multi-attribute profile” (GBSAED) method is proposed to improve detection precision and operation efficiency. This method utilizes “greedy bilateral smoothing” to decompose the low-rank part of a hyperspectral image (HSI)… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 42 publications
0
3
0
Order By: Relevance
“…The size of window: (3, 5), (3,5), (13,31), (5, 7) The outputting sensitivity of spatial distance weight: 0.8, 5, 10, 0.5 The outputting sensitivity of spectral distance weight: 0.3, 1, 1, 0.3…”
Section: Bfadmentioning
confidence: 99%
See 2 more Smart Citations
“…The size of window: (3, 5), (3,5), (13,31), (5, 7) The outputting sensitivity of spatial distance weight: 0.8, 5, 10, 0.5 The outputting sensitivity of spectral distance weight: 0.3, 1, 1, 0.3…”
Section: Bfadmentioning
confidence: 99%
“…The size of window: (3, 5), (5, 7), (13,21), (3,5) The fractional order: 0.8, 0.5, 0.8, 0.9 The Lagrange multiplier: 0.5, 1, 0.1, 0.1 The weighting coefficient: 0.5, 0.1, 0.1, 0.1…”
Section: Ssfscrdmentioning
confidence: 99%
See 1 more Smart Citation