z-logo
Premium
Pixon‐based multiresolution image reconstruction and the quantification of picture information content
Author(s) -
Puetter R. C.
Publication year - 1995
Publication title -
international journal of imaging systems and technology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.359
H-Index - 47
eISSN - 1098-1098
pISSN - 0899-9457
DOI - 10.1002/ima.1850060405
Subject(s) - akaike information criterion , wavelet , bayesian information criterion , computer science , iterative reconstruction , entropy (arrow of time) , algorithm , artificial intelligence , basis (linear algebra) , principle of maximum entropy , mathematics , data compression , pattern recognition (psychology) , machine learning , physics , geometry , quantum mechanics
This article reviews pixon‐based image reconstruction, which in its current formulation uses a multiresolution language to quantify an image's algorithmic information content (AIC) using Bayesian techniques. Each pixon (or its generalization, the information ) represents a fundamental quanta of an image's AIC, and an image's pixon basis represents the minimum degrees of freedom necessary to describe the image within the accuracy of the noise. We demonstrate with a number of examples that pixon‐based image reconstruction yields results consistently superior to popular competing methods, including maximum likelihood and maximum entropy methods. Typical improvements include higher spatial resolution, greater sensitivity to faint sources, and immunity to the production of spurious sources and signal correlated residuals. Finally, we show how the pixon provides a generalization of the Akaike information criterion, and how it relates to concepts of “coarse graining” and the role of the Heisenberg uncertainly principle in statistical mechanics, provides a mechanism for optimal data compression, and represents a more optimal basis for image compression or reconstruction than wavelets.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here