Share Email Print

Proceedings Paper

Iterative projection algorithms for reconstructing compact binary images
Author(s): V. L. Lo; R. P. Millane
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

An algorithm is described for reconstructing compact binary images from limited Fourier amplitude data. This problem arises in macromolecular crystallography where one wishes to reconstruct the molecular envelope from crystal x-ray diffraction amplitudes using a solvent contrast series. Such data are the amplitude of the Fourier transform of an object that has a constant electron density within the boundary of the molecule and zero outside. The image is thus binary and compact, but the data are available only within a limited resolution range in Fourier space and are undersampled. The problem is solved using an iterative projection algorithm; a class of algorithm used to solve inverse problems for which the solution is subject to a number of constraints that represent a priori information and the data. Unfortunately, these algorithms experience convergence difficulties if one or more of the constraints are non-convex, which is the case for all the constraints in this problem. We solve the problem by constructing appropriate projection operators and implementing the difference map projection algorithm. Simulations are used to study convergence behaviour of the algorithm.

Paper Details

Date Published: 5 September 2008
PDF: 9 pages
Proc. SPIE 7076, Image Reconstruction from Incomplete Data V, 70760B (5 September 2008); doi: 10.1117/12.792947
Show Author Affiliations
V. L. Lo, Univ. of Canterbury (New Zealand)
R. P. Millane, Univ. of Canterbury (New Zealand)

Published in SPIE Proceedings Vol. 7076:
Image Reconstruction from Incomplete Data V
Philip J. Bones; Michael A. Fiddy; Rick P. Millane, Editor(s)

© SPIE. Terms of Use
Back to Top