Abstract
Hyperspectral image target detection is an important application for both of its civil and military uses. Traditional hyperspectral image target detection algorithms are usually designed based on the second-order statistics of the data where it is assumed that the target follows a Gaussian distribution. However, due to the low spatial resolution of the hyperspectral sensor, sometimes the targets of interest only occupy a few pixels. In this case, targets are more suitable to be described by high-order statistics. In this paper, we propose a fast high-order matched filter (FHMF) algorithm which describes the essence of the data more properly and then formulate the detection problem as an optimization problem. To solve the optimization problem efficiently, a fixed-point algorithm is proposed inspired by the FastICA algorithm of the signal processing field. The experiments are conducted with a synthetic hyperspectral image and a real hyperspectral image. The experiment results show that FHMF has better detection performance than other classical detection algorithms. In addition, the fast convergence speed also demonstrates the effectiveness of the proposed fixed-point algorithm.
| Original language | English |
|---|---|
| Pages (from-to) | 151-155 |
| Number of pages | 5 |
| Journal | Infrared Physics and Technology |
| Volume | 94 |
| DOIs | |
| State | Published - Nov 2018 |
Keywords
- Fast high-order matched filter (FHMF)
- Fixed-point algorithm
- Hyperspectral image
- Target detection
Fingerprint
Dive into the research topics of 'Fast high-order matched filter for hyperspectral image target detection'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver