Towards a fast triple correlation algorithm

Details Towards a fast triple correlation algorithm Towards a fast triple correlation algorithm

Jan 1987

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1987spie..828...95g&link_type=abstract

IN: Digital image recovery and synthesis; Proceedings of the Meeting, San Diego, CA, Aug. 17, 18, 1987 (A88-51101 22-35). Bellin

Statistics

Computation

Computer Aided Tomography, Correlation, Crystallography, Imaging Techniques, Parallel Computers, Speckle Patterns, Bandwidth, Fourier Transformation, Pixels, Transfer Functions

Scientific paper

The triple correlation speckle imaging technique makes no assumptions about the imaged object, and is self-calibrating. An attempt is presently made to reduce the computational costs of the technique. The computer program with which that goal is presently addressed has demonstrated triple-correlation speckle imaging at a rate that is comparable to video bandwidth, using a CM-2 parallel processor. An evaluation is made of two distinct approaches to such a fast algorithm: one based on computerized tomography, and the other related to direct-phase crystallographic methods.

Affiliated with

Also associated with

No associations

Rating

Towards a fast triple correlation algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Towards a fast triple correlation algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Towards a fast triple correlation algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1624841