Inverse problems in imaging systems and the general Bayesian inversion frawework

Ali Mohammad-Djafari

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-an physics.comp-ph

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

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

Track finding and particle identification performance with particle physics foundation models

Modern high energy nuclear and particle physics experiments produce large amounts of sparse data that must be reduced significantly in size before performing physics analysis. Recently, there has been an effort to evaluate Foundation Models as a potential tool for performing data analysis. These models have been shown to learn features in high dimensional datasets based on the multi-modal data they are trained on. To show their effectiveness at performing complex pattern recognition tasks, such as reconstructing charged particles in a magnetic field, we evaluated the performance of a Foundation Model based reconstruction on several downstream tasks with a dataset composed of spacepoints in a Time Projection Chamber. We show that the performance of the Foundation Model based data analysis significantly improves upon that of traditional methods, and furthermore can be adapted to learn additional tasks that are not necessarily related to the initial training objective.

physics.data-an↗

arXiv2026

An Algebra Bundle for Non-Composable Coincidence Probabilities in Gamma-ray Spectroscopy

Understanding nuclear level schemes from the detection of emitted gamma-rays is, at its core, a combinatorial problem. The transition matrix formalism that treats nuclear decay as a Markov process is a well established treatment for the prediction of emitted and detected gamma-rays. However, with the path algebra being the underlying algebra of such matrix methods, the formalism is restricted to calculating probabilities only for composable paths through the decay. This paper presents a new algebra that allows for the calculations of non-composable coincidence probabilities offering a more complete formalism for the prediction of gamma-ray spectra. The aim of this \textit{coincidence algebra} is to provide a general treatment for predicting all full energy summing peaks for composable and non-composable transitions. Non-composable summing peaks often corrupt peaks of interest by creating doublets in the energy spectra. The coincidence algebra serves as a tool for investigating any possible doublets produced from full energy coincidence summing. This formalism is tested for the prediction of gamma-ray peaks in the electron capture of $^{133}$Ba and compared to the results a Geant4 simulation of the decay within the GRIFFIN spectrometer. It is also shown how the path algebra formalism may be useful for understanding uncertainty propagation in nuclear level schemes.

physics.data-an↗

arXiv2026

When Should Team KPIs Be Absolute or Relative for Match-Outcome Prediction?

In rugby union and association football, team key performance indicators (KPIs) can be represented in absolute terms or relative to the opponent. Relativisation sometimes improves match-outcome prediction and sometimes harms it. There has been no general account of when each occurs. The answer depends on how much the two teams differ in variability and how strongly their KPI values rise and fall together. We combine these properties into the Paired Efficiency Factor (PEF), which generalises Fisher's paired-efficiency result to the unequal-variance conditions typical of competitive sport. The PEF also connects a KPI's statistical efficiency to how much information its relative form carries about the outcome. Combined KPIs can interact in complex ways, so we analyse each indicator on its own. Across 86 team KPIs from professional rugby union and association football, the PEF places every metric in one of four regimes. Anti-correlation is common among these KPIs, especially for high-volume competitive counts, and absolute measures are then usually preferable. Relativisation can still improve prediction when a noisier difference carries more outcome information. An idealised simulation and one representative KPI from each regime confirm both signs under team-blocked cross-validation. The same pairing geometry appears in healthcare, genomics, finance, and manufacturing. The PEF is a diagnostic for when to relativise a performance metric and when not to.

physics.data-an↗