Pengkun Wang, Weijia Cao, Ning Wang +1 more
Hyperspectral images capture hundreds of narrow color bands per pixel, which is great for telling materials apart but hard to classify cleanly when pixels blend or sit on a boundary. Graph-based classifiers connect pixels and pass information between neighbors, but they usually build those links from spatial closeness or learned similarity, and mostly ignore the physics carried in the smooth run of adjacent spectral bands.
DAPGNet tries to put that physics back in. It encodes the continuous spectral response into a physical prior, then builds a sparse graph that blends spectral-spatial similarity, agreement with that prior, and spatial distance. During message passing, a physical gate mixes graph features with the prior features. On four standard datasets it reports the best overall and average accuracy, improving average accuracy over the strongest competitor by roughly 3.6 to 7.3 points.
Those numbers are from a cut-off abstract, so read the paper for the ablations and full comparison.
Hyperspectral image (HSI) classification requires reliable pixel-relation modeling under spectral variability, mixed pixels, and heterogeneous boundaries. Existing graph-based HSI classifiers usually construct graph topology from spatial proximity, superpixel connectivity, or learned feature affinity. However, the spectral physical prior carried by contiguous bands has limited influence on topology estimation and message propagation. This paper presents DAPGNet, a dynamic…
How Do VLMs Fail? Vision-Operation Misalignment in Compositional VQA
arXiv (cs.AI) · July 17, 2026DADiff: Diffusion-Driven Cross-Domain Policy Adaptation for Reinforcement Learning
arXiv (cs.LG) · July 17, 2026Neural spectroscopy of AlphaFold2 reveals encoded protein conformational landscapes
arXiv (cs.CL) · July 17, 2026Controlling Implicit Shortcut Reliance in L2 Spoken English Auto-markers