Abstract

The importance of nonorthogonal basis sets for representing images is discussed. To find such a representation necessitates diagonalizing overlap matrices that contain billions of elements, even for modest image sizes (256 × 256 pixels). By standard techniques this is completely intractable. An alternative method based on the fast Fourier transform is presented. Not only is it much faster, but it fits well within existing image-processing software.

© 1994 Optical Society of America

Full Article  |  PDF Article
OSA Recommended Articles
Fast algorithm for the computation of the zero-order Hankel transform

Patricia K. Murphy and Neal C. Gallagher
J. Opt. Soc. Am. 73(9) 1130-1137 (1983)

References

You do not have subscription access to this journal. Citation lists with outbound citation links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription

Equations (11)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription

Metrics

You do not have subscription access to this journal. Article level metrics are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription