OSA's Digital Library

Journal of the Optical Society of America A

Journal of the Optical Society of America A

| OPTICS, IMAGE SCIENCE, AND VISION

  • Vol. 21, Iss. 5 — May. 1, 2004
  • pp: 724–731

A limited-memory, quasi-Newton preconditioner for nonnegatively constrained image reconstruction

Johnathan M. Bardsley  »View Author Affiliations


JOSA A, Vol. 21, Issue 5, pp. 724-731 (2004)
http://dx.doi.org/10.1364/JOSAA.21.000724


View Full Text Article

Enhanced HTML    Acrobat PDF (310 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

Image reconstruction gives rise to some challenging large-scale constrained optimization problems. We consider a convex minimization problem with nonnegativity constraints that arises in astronomical imaging. To solve this problem, we use an efficient hybrid gradient projection–reduced Newton (active-set) method. By “reduced Newton,” we mean that we take Newton steps only in the inactive variables. Owing to the large size of our problem, we compute approximate reduced Newton steps by using the conjugate gradient (CG) iteration. We introduce a limited-memory, quasi-Newton preconditioner that speeds up CG convergence. A numerical comparison is presented that demonstrates the effectiveness of this preconditioner.

© 2004 Optical Society of America

OCIS Codes
(100.1830) Image processing : Deconvolution
(100.3010) Image processing : Image reconstruction techniques
(100.3190) Image processing : Inverse problems

History
Original Manuscript: September 9, 2003
Revised Manuscript: December 5, 2003
Manuscript Accepted: December 5, 2003
Published: May 1, 2004

Citation
Johnathan M. Bardsley, "A limited-memory, quasi-Newton preconditioner for nonnegatively constrained image reconstruction," J. Opt. Soc. Am. A 21, 724-731 (2004)
http://www.opticsinfobase.org/josaa/abstract.cfm?URI=josaa-21-5-724


Sort:  Author  |  Year  |  Journal  |  Reset  

References

  1. D. L. Snyder, A. M. Hammoud, R. L. White, “Image recovery from data acquired with a charge-coupled-device camera,” J. Opt. Soc. Am. A 10, 1014–1023 (1993). [CrossRef] [PubMed]
  2. L. B. Lucy, “An iterative technique for the rectification of observed distributions,” Astron. J. 79, 745–754 (1974). [CrossRef]
  3. W. H. Richardson, “Bayesian-based iterative method of image restoration,” J. Opt. Soc. Am. 62, 55–59 (1972). [CrossRef]
  4. J. Nagy, Z. Strakos, “Enforcing nonnegativity in image reconstruction algorithms,” in Mathematical Modeling, Estimation, and Imaging, D. C. Wilson, H. D. Tagare, F. L. Bookstein, F. J. Preteux, E. R. Dougherty, eds., Proc. SPIE4121, 182–190 (2000). [CrossRef]
  5. J. M. Bardsley, C. R. Vogel, “A nonnnegatively constrained convex programming method for image reconstruction,” SIAM J. Sci. Comput. (USA) 25(4), (2003).
  6. J. J. Moré, G. Toraldo, “On the solution of large quadratic programming problems with bound constraints,” SIAM J. Optim. 1, 93–113 (1991). [CrossRef]
  7. D. P. Bertsekas, “On the Goldstein–Levitin–Poljak gradient projection method,” IEEE Trans. Autom. Control 21, 174–184 (1976). [CrossRef]
  8. C. T. Kelley, Iterative Methods for Optimization (Society for Industrial and Applied Mathematics, Philadelphia, Pa., 1999).
  9. J. Nocedal, S. J. Wright, Numerical Optimization (Springer-Verlag, New York, 1999).
  10. J. L. Barlow, G. Toraldo, “The effect of diagonal scaling on projected gradient methods for bound constrained quadratic programming problems,” Optim. Methods Software 5, 235–245 (1995). [CrossRef]
  11. J. W. Goodman, Introduction to Fourier Optics, 2nd ed. (McGraw-Hill, New York, 1996).
  12. J. W. Goodman, Statistical Optics (Wiley, New York, 1985).
  13. C. R. Vogel, Computational Methods for Inverse Problems (Society for Industrial and Applied Mathematics, Philadelphia, Pa., 2002).
  14. W. Feller, An Introduction to Probability Theory and Its Applications (Wiley, New York, 1971).
  15. J. Nocedal, J. L. Morales, “Automatic preconditioning by limited memory quasi-Newton updating,” SIAM J. Optim. 10, 1079–1096 (2000). [CrossRef]
  16. D. P. Bertsekas, “Projected Newton methods for optimization problems with simple constraints,” SIAM J. Control Optim. 20, 221–246 (1982). [CrossRef]
  17. R. H. Byrd, P. Lu, J. Nocedal, “A limited memory algorithm for bound constrained optimization,” SIAM J. Sci. Comput. (USA) 16, 1190–1208 (1995). [CrossRef]
  18. C. Zhu, R. H. Byrd, J. Nocedal, “L-BFGS-B: FORTRAN subroutines for large scale bound constrained optimization,” ACM Trans. Math. Softw. 23, 550–560 (1997). [CrossRef]

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

Figures

Fig. 1 Fig. 2 Fig. 3
 
Fig. 4 Fig. 5
 

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited