Ten Architectures, One Error: Shared Failure Modes in Hyperspectral Classification under Spatially Disjoint Evaluation

• URL: http://arxiv.org/abs/2609.01786v1
• Date: Tue, 01 Sep 2026 18:58:59 GMT
• Title: Ten Architectures, One Error: Shared Failure Modes in Hyperspectral Classification under Spatially Disjoint Evaluation
• Abstract summary: Under a random split method, a large fraction of test pixels fall immediately adjacent to a training pixel, which inflates reported accuracy.<n>This work introduces a leakage-free evaluation protocol linking spatial separation to the model's receptive field.<n>Applying this protocol across ten different architectures, including classical, spectral, spectral-spatial, transformer, vision-backbone, and state-space families, shows that Macro-F1 drops by 0.147 on average and model rankings change by as many as five places.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Hyperspectral image classification still relies heavily on random pixel splits within a single scene. The Salinas dataset, randomly split, is among the most widely used datasets for comparing different architectures. However, under a random split method, a large fraction of test pixels fall immediately adjacent to a training pixel, which inflates reported accuracy. This work introduces a leakage-free evaluation protocol linking spatial separation to the model's receptive field. Applying this protocol across ten different architectures, including classical, spectral, spectral-spatial, transformer, vision-backbone, and state-space families, shows that Macro-F1 drops by 0.147 on average and model rankings change by as many as five places. Furthermore, leakage-free evaluation limits which architectures can be tested on a given benchmark. Since each partition supports patches only within a finite radius, reporting this radius alongside the receptive field is essential for fair comparison. In addition, this study reveals that all ten architectures misclassify largely the same pixels, pointing to a spectral ambiguity in the data that none of them resolves.

Related papers

• Beyond Landmark Extraction: A Framework for Robust Geometric Feature Construction in Structured Image Classification [0.0]
  discriminative information lies less in individual pixels and more in spatial relationships between semantic parts.<n>This paper studies the post-landmark feature map as the central object of analysis.<n>We evaluate coordinate, distance, angle, and hybrid representations through perturbation and ablation experiments.
  arXiv  Detail & Related papers  (2026-09-01T03:10:55Z)
• Robust Scene Coordinate Regression via Geometrically-Consistent Global Descriptors [52.57327385675752]
  We propose an aggregator module that learns global descriptors consistent with both geometrical structure and visual similarity.<n>This corrects erroneous associations caused by unreliable overlap scores.<n>Experiments on challenging benchmarks show substantial localization gains in large-scale environments.
  arXiv  Detail & Related papers  (2025-12-19T04:24:03Z)
• Approximate Size Targets Are Sufficient for Accurate Semantic Segmentation [52.239136918460616]
  Extending binary class tags to approximate relative object-size distributions allows off-the-shelf architectures to solve the segmentation problem.<n>A straightforward zero-avoiding KL-divergence loss for average predictions produces segmentation accuracy comparable to the standard pixel-precise supervision.<n>Our ideas are validated on PASCAL VOC using our new human annotations of approximate object sizes.
  arXiv  Detail & Related papers  (2025-03-10T06:02:13Z)
• Probabilistic Deep Metric Learning for Hyperspectral Image Classification [91.5747859691553]
  This paper proposes a probabilistic deep metric learning framework for hyperspectral image classification. It aims to predict the category of each pixel for an image captured by hyperspectral sensors. Our framework can be readily applied to existing hyperspectral image classification methods.
  arXiv  Detail & Related papers  (2022-11-15T17:57:12Z)
• Region-aware Attention for Image Inpainting [33.22497212024083]
  We propose a novel region-aware attention (RA) module for inpainting images. By avoiding the directly calculating corralation between each pixel pair in a single samples, the misleading of invalid information in holes can be avoided. A learnable region dictionary (LRD) is introduced to store important information in the entire dataset. Our methodscan generate semantically plausible results with realistic details.
  arXiv  Detail & Related papers  (2022-04-03T06:26:22Z)
• Augmenting Convolutional networks with attention-based aggregation [55.97184767391253]
  We show how to augment any convolutional network with an attention-based global map to achieve non-local reasoning. We plug this learned aggregation layer with a simplistic patch-based convolutional network parametrized by 2 parameters (width and depth) It yields surprisingly competitive trade-offs between accuracy and complexity, in particular in terms of memory consumption.
  arXiv  Detail & Related papers  (2021-12-27T14:05:41Z)
• Anomaly Clustering: Grouping Images into Coherent Clusters of Anomaly Types [60.45942774425782]
  We introduce anomaly clustering, whose goal is to group data into coherent clusters of anomaly types. This is different from anomaly detection, whose goal is to divide anomalies from normal data. We present a simple yet effective clustering framework using a patch-based pretrained deep embeddings and off-the-shelf clustering methods.
  arXiv  Detail & Related papers  (2021-12-21T23:11:33Z)
• Multi-temporal and multi-source remote sensing image classification by nonlinear relative normalization [17.124438150480326]
  We study a methodology that aligns data from different domains in a nonlinear way through em kernelization. We successfully test KEMA in multi-temporal and multi-source very high resolution classification tasks, as well as on the task of making a model invariant to shadowing for hyperspectral imaging.
  arXiv  Detail & Related papers  (2020-12-07T08:46:11Z)
• SegFix: Model-Agnostic Boundary Refinement for Segmentation [75.58050758615316]
  We present a model-agnostic post-processing scheme to improve the boundary quality for the segmentation result that is generated by any existing segmentation model. Motivated by the empirical observation that the label predictions of interior pixels are more reliable, we propose to replace the originally unreliable predictions of boundary pixels by the predictions of interior pixels.
  arXiv  Detail & Related papers  (2020-07-08T17:08:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.