𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Evaluators of image reconstruction algorithms

✍ Scribed by Gabor T. Herman; K. T. Daniel Yeung


Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
933 KB
Volume
1
Category
Article
ISSN
0899-9457

No coin nor oath required. For personal study only.

✦ Synopsis


An image reconstruction algorithm is supposed to present an image that contains medically relevant information that exists in a cross section of the human body. There is an enormous variety of such algorithms. The question arises: Given a specific medical problem, what is the relative merit of two image reconstruction algorithms in presenting images that are helpful for solving the problem? An approach to answering this question with a high degree of confidence is that of ROC analysis of human observer performance. The problem with ROC studies using human observers is their complexity (and, hence, cost). To overcome this problem, it has been suggested to replace the human observer by a numerical observer. An even simpler approach is by the use of distance metrics, such as the root mean squared distance, between the reconstructed images and the known originals. For any of these approaches, the evaluation should be done using a sample set that is large enough to provide us with a statistically significant result.

We concentrate in this paper on the numerical observer approach, and we reintroduce in this framework the notion of the Hotelling Trace Criterion, which has recently been proposed as an appropriate evaluator of imaging systems. We propose a definite strategy (based on linear abnormality-index functions that are optimal for the chosen figure of merit) for evaluating image reconstruction algorithms. We give details of two experimental studies that embody the espoused principles. Since ROC analysis of human observer performance is the ultimate yardstick for system assessment, one justifies a numerical observer approach by showing that it yields "similar" results to a human observer study. Also, since simple distance metrics are computationally less cumbersome than are numerical observer studies, one would like to replace the latter by the former, whenever it is likely to give "similar" results. We discuss approaches to assigning a numerical value to the "similarity" of the results produced by two different evaluators. We introduce a new concept, called rank-ordering nearness, which seems to provide us with a promising approach to experimentally determining the similarity of two evaluators of image reconstruction algorithms.


πŸ“œ SIMILAR VOLUMES


Image reconstruction of buried multiple
✍ Chung-Hsin Huang; Hung-Cheng Lu; Chien-Ching Chiu; Tadeusz A. Wysocki; Beata J. πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 309 KB

## Abstract This paper presents an inverse scattering problem for recovering the shapes of multiple conducting cylinders with the immersed targets in a half‐space by genetic algorithm. Two separate perfectly conducting cylinders of unknown shapes are buried in one half‐space and illuminated by tran

High-resolution radar image reconstructi
✍ Chunyang Yu; Deyuan Gao πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 104 KB

The nonlinear model-fitting scheme is used for high-resolution radar imaging under the assumption that the objects consist of point scatters; genetic algorithms are then applied for the minimization of the fitting error. Numerical results of the method are compared with those of the Powell method to

Constrained Kaczmarz extended algorithm
✍ Constantin Popa πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 938 KB

In this paper, we present a constrained version of Kaczmarz extended algorithm for improving image reconstruction from projections in computerized tomography. We prove convergence of our algorithm in the general inconsistent case to a "constrained" least squares solution of the reconstruction proble

Image reconstruction by OPED algorithm w
✍ Yuan Xu; Oleg Tischenko; Christoph Hoeschen πŸ“‚ Article πŸ“… 2007 πŸ› Springer US 🌐 English βš– 439 KB

OPED is a new image reconstruction algorithm based on orthogonal polynomial expansion on the disk. We show that the integral of the approximation function in OPED can be given explicitly and evaluated efficiently. As a consequence, the reconstructed image over a pixel can be effectively represented