Hyperspectral Anomaly Detection via Hybrid Convolutional and Transformer-Based U-Net With Error Attention Mechanism
Bibliographic record
Abstract
Hyperspectral anomaly detection is a crucial technique for recognizing abnormal pixels in hyperspectral images (HSIs), that is, those with distinct spectral characteristics from those of the surrounding background. Traditional methods always fall short in effectively leveraging the information regarding the spectral and spatial aspects of the dataset simultaneously, limiting their detection performances. This article proposes a novel framework using U-Net, termed hybrid convolution and transformer-based U-Net (HCT-Unet), which integrates convolution with a multihead attention mechanism in Transformer for enhanced hyperspectral anomaly detection. To ensure a more comprehensive understanding of spatial and spectral interactions, the HCT-Unet architecture capitalizes on the strengths of local feature extraction of convolutional layers and the capabilities of the long-range dependency modeling of Transformers. A key innovation of this framework is an error attention mechanism, which facilitates adaptive multiscale feature fusion and enhances the feature representation capacity. Furthermore, a new anomaly score calculation method is proposed, which combines reconstruction error with the pixelwise structural similarity index (SSIM) to determine pixel anomaly from both local structural preservation and global spectral consistency perspectives. Experiments carried out on seven different hyperspectral datasets reveal that the proposed method consistently outperforms the widely accepted state-of-the-art methods in hyperspectral anomaly detection.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".