OSA's Digital Library

Journal of the Optical Society of America

Journal of the Optical Society of America

  • Vol. 72, Iss. 8 — Aug. 1, 1982
  • pp: 987–992

Restoration of discrete Fourier spectra using linear programming

R. Mammone and G. Eichmann  »View Author Affiliations

JOSA, Vol. 72, Issue 8, pp. 987-992 (1982)

View Full Text Article

Acrobat PDF (706 KB)

Browse Journals / Lookup Meetings

Browse by Journal and Year


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools



A method of restoring the discrete-Fourier-transform (DFT) spectrum of a diffraction-limited (DL) image from a narrow-observation segment of the DL image is presented. The DL spectral-restoration process is the dual of the more common DL image-restoration process with the roles of the frequency and space reversed. Applications of a spectrum restoration include increasing the field of view of existing imaging systems and extracting precise frequency components of a large DL image by using only a small segment of the entire image. This method could also be employed for image data compression, which is of interest in digital video applications. Several differences between the implementations of the image- and the spectrum-restoration processes are described. The estimate is constrained to have an upper bound on the number of frequency components contained in the Fourier spectrum. The bound is the number of samples acquired at the Nyquist rate for the length of the image. The magnitude of the DFT spectrum is also bounded. These constraints define a large number of possible solutions. The desired solution is then selected such that the distance, defined in a function-theoretic sense, between the measured and the estimated images is an optimum. A number of such measures are investigated. Numerical experiments show that this approach yields results that are highly immune to measurement noise.

© 1982 Optical Society of America

R. Mammone and G. Eichmann, "Restoration of discrete Fourier spectra using linear programming," J. Opt. Soc. Am. 72, 987-992 (1982)

Sort:  Author  |  Year  |  Journal  |  Reset


  1. D. Slepian and H. O. Pollak, "Prolate spheroidal wave functions, Fourier analysis and uncertainty—I," Bell Syst. Tech. J. 40,43–63 (1961).
  2. B. R. Frieden, "Image enhancement and restoration," in Picture Processing and Digital Filtering, T. S. Huang, ed. (Springer-Verlag, New York, 1975).
  3. A. C. Schell, "Enhancing the angular resolution of incoherent sources," Radio Electron. Eng. 29, 21–26 (1965).
  4. Y. Biraud, "A new approach for increasing the resolving power by data processing," Astron. Astrophys. 1, 124–127 (1969).
  5. P. A. Jansson, R. H. Hunt, and E. K. Plyer, "Resolution enhancement of spectra," J. Opt. Soc. Am. 60, 596–599 (1970).
  6. J. P. Burg, "Maximum entropy spectral analysis," presented at the Thirty-Seventh Annual Meeting of Society of Exploration Geophysicists, Oklahoma City, Oklahoma, 1967.
  7. S. J. Howard, "Continuation of discrete Fourier spectra using a minimum-negativity constraint," J. Opt. Soc. Am. 71, 819–824 (1981).
  8. C. K. Rushforth, A. E. Crawford, and Y. Zhou, "Least-squares reconstruction of objects with missing high-frequency components," J. Opt. Soc. Am. 72, 204–211 (1982).
  9. R. Mammone and G. Eichmann, "Superresolving image restoration using linear programming," Appl. Opt. 21, 496–501 (1982).
  10. A. Papoulis, Signal Analysis (McGraw-Hill, New York, 1977).
  11. H. J. Landau and H. O. Pollak, "Prolate spheroidal wave functions, Fourier analysis and uncertainty—III: the dimension of the space of essentially time-and band-limited signals," Bell Syst. Tech. J. 41, 1295–1336 (1962).
  12. G. Toraldo de Francia, "Degrees of freedom of an image," J. Opt. Soc. Am. 59, 799–804 (1969).
  13. D. P. MacAdam, "Digital image restoration by constrained convolution," J. Opt. Soc. Am. 60, 1617–1627 (1970).
  14. N. D. A. Mascarenhas and W. K. Pratt, "Digital restoration under a regression model," IEEE Trans. Circuits Syst. CAS-22, 252–266 (1975).
  15. B. R. Hunt, "A matrix theory proof of the discrete convolution theorem," IEEE Trans. Audio Electroacoust. AU-IS, 285–288 (1971).
  16. A. Albert, Regression and the Moore-Penrose Pseudoinverse (Academic, New York, 1972).
  17. G. Hadley, Linear Programming (Addison-Wesley, Reading, Mass., 1962).
  18. H. P. Kunzi, H. G. Tzschach, and C. A. Zehnder, Numerical Methods of Mathematical Optimization (Academic, New York, 1971).
  19. C. L. Lawson and R. J. Hanson, Solving Least-Squares Problems (Prentice Hall, Englewood Cliffs, N.J., 1974).
  20. S. M. Pizer, Numerical Computing and Mathematical Analysis (Science Research Association, Chicago, Ill., 1975).

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.

Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited