Searcharxiv⌕ Search

arXiv · 0705.2459

Hierarchical Markovian models for hyperspectral image segmentation

Abstract

Hyperspectral images can be represented either as a set of images or as a set of spectra. Spectral classification and segmentation and data reduction are the main problems in hyperspectral image analysis. In this paper we propose a Bayesian estimation approach with an appropriate hiearchical model with hidden markovian variables which gives the possibility to jointly do data reduction, spectral classification and image segmentation. In the proposed model, the desired independent components are piecewise homogeneous images which share the same common hidden segmentation variable. Thus, the joint Bayesian estimation of this hidden variable as well as the sources and the mixing matrix of the source separation problem gives a solution for all the three problems of dimensionality reduction, spectra classification and segmentation of hyperspectral images. A few simulation results illustrate the performances of the proposed method compared to other classical methods usually used in hyperspectral image processing.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ali Mohammad-Djafari, Adel Mohammadpoor, Nadia Bali. 2007-05-17. Hierarchical Markovian models for hyperspectral image segmentation. https://arxiv.org/abs/0705.2459

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

KEEP EXPLORING

Related papers

The BRUIT-FM "open data" noise reduction challenge

The BRUIT-FM Challenge asks participants to reduce ''noise'' --- defined as any signal that masks the signal of interest --- on an open dataset of real and synthetic broadband seafloor seismology data. The dataset includes signals from earthquakes, ocean infragravity waves and seafloor currents. It also includes training datasets of synthetic data with reference solutions. Participants are asked to remove or separate these signals to obtain the best earthquake and seafloor compliance signals. The authors will make a first assessment of the submissions, based on noise reduction, signal deformation and ease of use. Participants are invited to a community workshop, in which they will validate the preliminary assessment and collaborate on a community paper describing the results, identifying promising pathways and proposing new directions. The best results will be added to a new version of the dataset, which will persist as a benchmark for future developments.

physics.data-an↗

Data geometry preserves prediction but reshapes explanation

Across scientific domains, empirical data often give rise to positive semidefinite matrices that encode similarities, couplings or interactions and induce natural geometries. We investigate whether changing the geometry used to compare the same empirical representations preserves subject-level performance and the local structures from which explanations are derived, a question we term the prediction explanation invariance problem. We address this problem across morphometric MRI, fMRI and EEG data by comparing Frobenius and trace geometries applied to the same empirical matrices. Predictive performance was broadly preserved across geometries, but comparable performance did not imply agreement in subject-level decision scores or predicted labels. Predictive similarity also masked geometry-dependent differences in local neighbourhoods, perturbation sensitivities and explanatory rankings. Dimensionality reduction made the two subject-space geometries progressively more concordant, while classification performance and decision-level agreement declined. These results identify data geometry as a hidden degree of freedom in explainability: similar performance does not guarantee invariant decisions or explanations.

physics.data-an↗

Modular Aggregation as a Debiasing Method for Non-Stationary Discrete Sources: Convergence and Numerical Validatio

We analyze \emph{modular aggregation}---summing $N$ independent outcomes modulo $m$---as a post-processing method for extracting nearly uniform randomness from biased discrete sources. Using discrete Fourier analysis over the cyclic group $\mathbb{Z}_m$, we prove exponential convergence of the output distribution to uniformity, with a rate determined by the largest non-trivial Fourier modulus. The result applies to independent non-stationary (non-IID) sources under a uniform spectral-gap condition on the non-trivial Fourier modes. Numerical simulations under several bias regimes, including cyclic drift and extreme cyclic bias, are used as finite-sample diagnostics and illustrate the theoretical predictions in comparison with Peres extraction and SHA-256 post-processing. The robustness of modular aggregation comes at a retention cost of order $1/N$, yielding an explicit trade-off between statistical quality and throughput.

physics.data-an↗