Interpretable Hyperspectral Unmixing Framework with Fixed Endmember Prior and Structured Residual Refinement
- URL: http://arxiv.org/abs/2609.08786v1
- Date: Tue, 08 Sep 2026 14:18:16 GMT
- Title: Interpretable Hyperspectral Unmixing Framework with Fixed Endmember Prior and Structured Residual Refinement
- Abstract summary: This study presents an interpretable stage-wise hyperspectral unmixing framework (I-HyperSU) under fixed endmember priors.<n>Experiments on Samson, Urban, and Jasper Ridge datasets demonstrate that, under fixed and imperfect endmember priors, soft abundance relaxation consistently outperforms hard simplex projection.
- Score: 10.38467383160934
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Hyperspectral unmixing decomposes mixed pixels into material endmembers and their abundances from contiguous spectral observations. In modular sensing pipelines, endmembers are often first identified and then treated as fixed during abundance estimation. When this fixed endmember prior is inaccurate, spatially structured mismatch arising from illumination changes, sensor artifacts, or material boundaries may be incorrectly captured by the abundance variables, leading to unstable decompositions. This study presents an interpretable stage-wise hyperspectral unmixing framework (I-HyperSU) under fixed endmember priors, which is explicitly decomposed into a fixed endmember matrix $\mathbf{A}$, an abundance block $\mathbf{X}$, and a structural residual refinement block $\mathbf{S}$. The X-block estimates abundances using FISTA with nonnegativity and sparsity enhancement, and a soft penalty that approximately enforces sum-to-one constraints. The S-block jointly applies low-rank SVD structural regularization and a lightweight deep image prior (DIP) to refine structured residuals. This staged design makes the interaction between abundance and residual components transparent and interpretable. Experiments on Samson, Urban, and Jasper Ridge datasets demonstrate that, under fixed and imperfect endmember priors, soft abundance relaxation consistently outperforms hard simplex projection. Under the default N-FINDR endmember prior, the proposed framework reduces the joint reconstruction error by 61.7\%--69.5\% compared with a fixed-$\mathbf{A}$ UCLS baseline, while keeping the abundance RMSE nearly unchanged, indicating that the residual refinement branch accounts for structured model mismatch without degrading the abundance estimates. For example, on Urban, the reconstruction SAM decreases from $5.99^\circ$ for the X-only model to $1.92^\circ$ for the full model.
Related papers
- Efficient and High-Quality Depth Estimation via Pixel-Space Diffusion with Linear Attention [10.565261122171906]
Lapis is a generative framework that achieves efficient and high-fidelity depth estimation with one-step diffusion.<n>It rectifies these limitations through a coarse-to-fine hierarchy.<n>It consistently achieves state-of-the-art (SOTA) accuracy and boundary sharpness across various resolutions.
arXiv Detail & Related papers (2026-08-31T01:27:50Z) - SANE: State Anomaly Neutralization for Stable Extreme-Context Delta-Rule Models [53.86918766240095]
Delta-Rule recurrent models maintain a fixed-size state, enabling $O(1)$ inference memory but potentially becoming unstable under extreme-context extrapolation.<n>We propose textbfState Anomaly Neutralization (SANE), which applies adaptive $tanh$ compression at chunk boundaries while preserving the intra-chunk parallel structure.
arXiv Detail & Related papers (2026-08-23T10:41:07Z) - Controllable Diversity in Normalization-Based Implicit Ensembles via Softmax-Temperature Modulation [0.9668407688201359]
$$N-Ens is a normalisation-based implicit ensemble that treats each member as a task in a multi-task architecture.<n>Because only normalisation layers are replicated, the mechanism can wrap convolutional and transformer backbones alike.
arXiv Detail & Related papers (2026-07-26T22:06:42Z) - Gradient-Based Latent Decomposition Reveals Mechanisms of Feature Degradation in Weakly Supervised Mammography [0.0]
Weakly supervised hierarchical models exhibit a persistent asymmetry.<n> coarse lesion-type features are preserved under reconstruction while fine-grained malignancy cues degrade.<n>In high-dimensional spaces, a single coarse supervisory signal isolates only a 1D latent direction, forcing critical fine-grained features into the vulnerable residual subspace.
arXiv Detail & Related papers (2026-07-24T01:04:07Z) - DP-Splat: Bayesian Nonparametric Complexity Control for Gaussian Splatting [0.0]
3D Splatting represents finite mixtures of anisotropic Gaussians whose number of components $K$ is set by density control or user caps.<n>We replace the symmetric symmetric Dirichlet over mixture weights with a truncated stick-breaking Dirichlet-process prior.<n>We give an exact monotonicity guarantee, a rigorous truncation-error bound correcting an anti-conservative large-error approximation in common use.
arXiv Detail & Related papers (2026-07-12T20:31:15Z) - Reinforcement Learning from Multi-Source Imperfect Preferences: Best-of-Both-Regimes Regret [71.69884486156359]
We study episodic RL from emphmulti-source imperfect preferences through a cumulative imperfection budget.<n>We propose a unified algorithm with regret $tildeO(sqrtK/M+)$, which exhibits a best-of-both-regimes behavior.
arXiv Detail & Related papers (2026-03-20T19:34:53Z) - Sharp Convergence Rates for Masked Diffusion Models [53.117058231393834]
We develop a total-variation based analysis for the Euler method that overcomes limitations.<n>Our results relax assumptions on score estimation, improve parameter dependencies, and establish convergence guarantees.<n>Overall, our analysis introduces a direct TV-based error decomposition along the CTMC trajectory and a decoupling-based path-wise analysis for FHS.
arXiv Detail & Related papers (2026-02-26T00:47:51Z) - Optimal Unconstrained Self-Distillation in Ridge Regression: Strict Improvements, Precise Asymptotics, and One-Shot Tuning [61.07540493350384]
Self-distillation (SD) is the process of retraining a student on a mixture of ground-truth and the teacher's own predictions.<n>We show that for any prediction risk, the optimally mixed student improves upon the ridge teacher for every regularization level.<n>We propose a consistent one-shot tuning method to estimate $star$ without grid search, sample splitting, or refitting.
arXiv Detail & Related papers (2026-02-19T17:21:15Z) - Singular Bayesian Neural Networks [1.2891210250935148]
Bayesian neural networks promise calibrated uncertainty but require $O(mn)$ parameters for standard mean-field Gaussian posteriors.<n>We induce a posterior that is singular with respect to the Lebesgue measure, concentrating on the rank-$r$ manifold.<n>We derive PAC-Bayes generalization bounds whose complexity term scales as $sqrtr(m+n)$ instead of $sqrtm n$, and prove loss bounds that decompose the error into optimization and rank-induced bias.
arXiv Detail & Related papers (2026-01-30T23:06:34Z) - Phase-space entropy at acquisition reflects downstream learnability [54.4100065023873]
We propose an acquisition-level scalar $S_mathcal B$ based on instrument-resolved phase space.<n>We show theoretically that (S_mathcal B) correctly identifies the phase-space coherence of periodic sampling.<n>$|S_mathcal B|$ consistently ranks sampling geometries and predicts downstream reconstruction/recognition difficulty emphwithout training.
arXiv Detail & Related papers (2025-12-22T10:03:51Z) - FedSVD: Adaptive Orthogonalization for Private Federated Learning with LoRA [68.44043212834204]
Low-Rank Adaptation (LoRA) is widely used for efficient fine-tuning of language models in learning (FL)<n>Low-Rank Adaptation (LoRA) is widely used for efficient fine-tuning of language models in learning (FL)
arXiv Detail & Related papers (2025-05-19T07:32:56Z)
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.