Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0705.2720

Inverse problems in imaging systems and the general Bayesian inversion frawework

Ali Mohammad-Djafari
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, first a great number of inverse problems which arise in instrumentation, in computer imaging systems and in computer vision are presented. Then a common general forward modeling for them is given and the corresponding inversion problem is presented. Then, after showing the inadequacy of the classical analytical and least square methods for these ill posed inverse problems, a Bayesian estimation framework is presented which can handle, in a coherent way, all these problems. One of the main steps, in Bayesian inversion framework is the prior modeling of the unknowns. For this reason, a great number of such models and in particular the compound hidden Markov models are presented. Then, the main computational tools of the Bayesian estimation are briefly presented. Finally, some particular cases are studied in detail and new results are presented.

Explore related subjects

physics.data-anphysics.comp-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ali Mohammad-Djafari. 2007-05-18. Inverse problems in imaging systems and the general Bayesian inversion frawework. https://arxiv.org/abs/0705.2720

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗