Hyperspectral Anomaly Detection by Graph Pixel Selection
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Hyperspectral anomaly detection (AD) is an important problem in remote sensing field. It can make full use of the spectral differences to discover certain potential interesting regions without any target priors. Traditional Mahalanobis-distance-based anomaly detectors assume the background spectrum distribution conforms to a Gaussian distribution. However, this and other similar distributions may not be satisfied for the real hyperspectral images. Moreover, the background statistics are susceptible to contamination of anomaly targets which will lead to a high false-positive rate. To address these intrinsic problems, this paper proposes a novel AD method based on the graph theory. We first construct a vertex- and edge-weighted graph and then utilize a pixel selection process to locate the anomaly targets. Two contributions are claimed in this paper: 1) no background distributions are required which makes the method more adaptive and 2) both the vertex and edge weights are considered which enables a more accurate detection performance and better robustness to noise. Intensive experiments on the simulated and real hyperspectral images demonstrate that the proposed method outperforms other benchmark competitors. In addition, the robustness of the proposed method has been validated by using various window sizes. This experimental result also demonstrates the valuable characteristic of less computational complexity and less parameter tuning for real applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Adaptive multiple-band CFAR detection of an optical pattern with unknown spectral distribution
Reed, I. S., & Yu, X. (1990) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.60107 · Cited by 1,867 · cited 1×
“1) The well-known Reed Xiaoli (RX) algorithm proposed by Reed and Yu [30], is a typical type of the first kind, which assumes a simple background distribution.”
Method
Cited by
Hyperspectral Anomaly Detection: A survey
Su, H., Wu, Z., Zhang, H., & Du, Q. (2022) · IEEE Geoscience and Remote Sensing Magazine · doi:10.1109/mgrs.2021.3105440 · Cited by 310
Auto-AD: Autonomous Hyperspectral Anomaly Detection Network Based on Fully Convolutional Autoencoder
Wang, S., Wang, X., Zhang, L., & Zhong, Y. (2022) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2021.3057721 · Cited by 274
Hyperspectral Anomaly Detection by Fractional Fourier Entropy
Tao, R., Zhao, X., Li, W., Li, H.-C., & Du, Q. (2019) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2019.2940278 · Cited by 264
Hyperspectral anomaly detection with robust graph autoencoders
Fan, G., Ma, Y., Mei, X., Fan, F., Huang, J., & Ma, J. (2022) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2021.3097097 · Cited by 212
Interpretable Anomaly Detection with DIFFI: Depth-based feature importance of Isolation Forest
Carletti, M., Terzi, M., & Susto, G. A. (2023) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.105730 · Cited by 118
Metadata
- Authors
- Yuan, Y., Ma, D., & Wang, Q.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2016-12
- Volume
- 46
- Issue
- 12
- Pages
- 3123-3134
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2343117455
- Cited by
- 142
- References
- 1
- FWCI
- 14.99
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Hyperspectral Anomaly Detection by Graph Pixel Selection. https://app.cochat.ai/papers/10.1109/tcyb.2015.2497711
- The paper
- Yuan, Y., Ma, D., & Wang, Q. (2016). Hyperspectral Anomaly Detection by Graph Pixel Selection. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2015.2497711
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.