Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2204.04638

Spectral Unmixing of Hyperspectral Images Based on Block Sparse Structure

Seyed Hossein Mosavi Azarang·Roozbeh Rajabi·Hadi Zayyani·Amin Zehtabian
View original source ↗Read source document ↗Export metadata ↓

Abstract

Spectral unmixing (SU) of hyperspectral images (HSIs) is one of the important areas in remote sensing (RS) that needs to be carefully addressed in different RS applications. Despite the high spectral resolution of the hyperspectral data, the relatively low spatial resolution of the sensors may lead to mixture of different pure materials within the image pixels. In this case, the spectrum of a given pixel recorded by the sensor can be a combination of multiple spectra each belonging to a unique material in that pixel. Spectral unmixing is then used as a technique to extract the spectral characteristics of the different materials within the mixed pixels and to recover the spectrum of each pure spectral signature, called endmember. Block-sparsity exists in hyperspectral images as a result of spectral similarity between neighboring pixels. In block-sparse signals, the nonzero samples occur in clusters and the pattern of the clusters is often supposed to be unavailable as prior information. This paper presents an innovative spectral unmixing approach for HSIs based on block-sparse structure. Hyperspectral unmixing problem is solved using pattern coupled sparse Bayesian learning strategy (PCSBL). To evaluate the performance of the proposed SU algorithm, it is tested on both synthetic and real hyperspectral data and the quantitative results are compared to those of other state-of-the-art methods in terms of abundance angle distance and mean squared error. The achieved results show the superiority of the proposed algorithm over the other competing methods by a significant margin.

Explore related subjects

eess.IVcs.CV

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Seyed Hossein Mosavi Azarang, Roozbeh Rajabi, Hadi Zayyani, Amin Zehtabian. 2023-02-17. Spectral Unmixing of Hyperspectral Images Based on Block Sparse Structure. https://arxiv.org/abs/2204.04638

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Bridging the Inter-Domain Gap through Low-Level Features for Cross-Modal Medical Image Segmentation

This paper addresses cross-modal medical image segmentation, focusing on MRI-CT transfer in a source-only domain generalization setting. During training, only source-modality samples are available, while unlabeled target-modality images are used for testing. We propose LowBridge, which builds on the observation that cross-modal images share similar low-level features (e.g. edges) as they depict the same types of anatomical structures. Specifically, we first train a generative model to recover the source images from their edge features, followed by training a segmentation model on the generated source images, separately. At test time, edge features from the target images are input to the pretrained generative model to generate source-style target domain images, which are then segmented using the pretrained segmentation network. Experiments on various public datasets demonstrate that LowBridge achieves state-of-the-art performance, outperforming ten existing approaches. Ablation studies further show that LowBridge is compatible with different types of generative and segmentation models, suggesting its generalizability and potential to benefit from future advances in these models. The code will be available at https://github.com/JoshuaLPF/LowBridge.

eess.IV↗
arXiv2026

Revolutionizing Diffusion MRI Microstructure Mapping via Global Inversion

Diffusion MRI microstructure mapping (MM) is conventionally solved voxel by voxel, ignoring the fact that tissue microstructure forms a spatially organized field. This isolation leaves each estimation problem ill-posed and nonconvex. We instead cast MM as a single global inverse problem, reconstructing the entire parameter field jointly from all measurements of a subject. An untrained neural representation supplies implicit spatial priors and eases the nonconvex optimization, requiring no training data, while coregistered T1-weighted anatomy contributes structural guidance that is freely available in standard protocols. On both synthetic and in-vivo data, our method compares favorably with established voxel-wise and learning-based baselines, suggesting global inversion is a promising alternative.

eess.IV↗
arXiv2026

LC3EM: Long-Range Context Extrapolation Enhanced Entropy Model for Coordinate-based Overfitting Image Codecs

Coordinate-based overfitting image codecs have attracted increasing attention for their low decoding complexity and independence from cross-image generalization. However, representative approaches such as COOL-CHIC face an inherent entropy-modeling trade-off: lightweight models have limited capacity, while more expressive ones incur additional bitrate overhead from transmitting image-specific parameters. Inspired by the prediction mechanism in traditional codecs, we propose a new entropy-modeling strategy that introduces complementary prediction modes with region-adaptive soft mode selection, rather than relying on a single learned predictor to model diverse types of redundancy. Based on this concept, we develop a Long-Range Context Extrapolation Enhanced Entropy Model (LC3EM), which can be integrated into coordinate-based overfitting codecs. Specifically, a parameter-free Neighborhood-based Linear Extrapolation Mode (NLEM) complements the tiny MLP-based local predictor to exploit long-range contextual redundancy and strongly directional structures. A Minimum-Entropy-Inspired Continuous Mode Selection strategy is designed to adaptively fuse these two complementary modes, while requiring the transmission of only the parameters of a single additional linear layer. Moreover, to alleviate the mismatch between training-time relaxed and actual discrete quantization, we introduce a lightweight iterative latent rounding refinement stage to improve compression performance. Experiments demonstrate consistent improvements across diverse benchmarks, particularly on highly regular computer-generated images. When integrated with COOL-CHIC 4.0, the proposed method achieves BD-rate gains of -3.43\% and -7.69\% on the SIQAD and API datasets, respectively. With COOL-CHIC 5.0 as the backbone, the corresponding gains are -2.88\% and -3.15\%, respectively. The code will be made publicly available soon.

eess.IV↗