Quadratic optimization for image reconstruction. I
โ Scribed by Gabor T. Herman; Arnold Lent
- Book ID
- 104290645
- Publisher
- Elsevier Science
- Year
- 1976
- Weight
- 833 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0146-664X
No coin nor oath required. For personal study only.
โฆ Synopsis
We attack the problem of recovering an image (a function of two variables) frora experimentally available integrals of its grayness over thin strips. This problem is of great importance in a large number of scientific areas. An important version of the problem in medicine is tha~ of obtaining the exact density distribution within ~he htunan body fl'om X-ray projections.
A large number of methods have been proposed to solve this problem. In this paper we show that some of these methods are special cases of the same iterative quach'atic optimization algorithm. We prove the convergence of ~his algorithm and characterize the image to which it converges. Thus, our restflts provide proofs of convergence of previously used reconstruction methods where no such proofs existed before. We discnss the efficacy of the quadratic optimisation approach for practical image reconstruction.
๐ SIMILAR VOLUMES
Portfolio optimization is a procedure for generating a portfolio composition which yields the highest return for a given level of risk or a minimum risk for given level of return. The problem can be formulated as a quadratic programming problem. We shall present a new and efticient optimization proc
In this paper we prove a sufficient condition that a strong local minimizer of a bounded quadratic program is the unique global minimizer. This sufficient condition can be verified computationally by solving a linear and a convex quadratic program and can be used as a quality test for local minimize