Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Minimum-negativity constraint applied to large data sets

Not Accessible

Your library or personal account may give you access

Abstract

The efficacy of a new algorithm implementing the minimum-negativity constraint1 in computing data sets of up to 64K (K = 1024) data points is demonstrated. A specific example is shown for an interferogram of 17K points taken from a rocketborne field-widened interferometer. Restoring data points to the interferogram to yield a total of 64K points, on Fourier transforming with the fast Fourier transform, produces improved resolution for the resulting 64K data points of the IR spectral lines. An example of restoration with the same interferogram involving a minor modification of the algorithm so that it is appropriate for parallel processing is also illustrated. The new algorithms may be easily generalized to two dimensions.

© 1987 Optical Society of America

PDF Article
More Like This
New developments in the minimum-negativity iterative algorithm for restoration

Samuel J. Howard
TUP6 OSA Annual Meeting (FIO) 1988

Optical Tomography with Large Data Sets

John C. Schotland
FWV2 Frontiers in Optics (FiO) 2006

Optical Tomography with Large Data Sets

John C. Schotland
CTuB1 Computational Optical Sensing and Imaging (COSI) 2007

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.