Abstract

A multistage parallel algorithm with iterative processing is discussed for the processing of information in diffraction tomography. The algorithm is based on matrix partitioning, which results in mostly parallel stages of processing. Each successive stage is designed to minimize the remaining error. The process is iterated until convergence. The major advantages of the multistage algorithm are the reduced computational time from faster convergence as compared with a single-stage iterative algorithm, further reduction of computation time if the stages are implemented mostly in parallel, and better performance in terms of reduced reconstruction error.

© 1995 Optical Society of America

Comparison of the filtered backpropagation and the filtered backprojection algorithms for quantitative tomography

T. C. Wedberg, J. J. Stamnes, and W. Singer
Appl. Opt. 34(28) 6575-6581 (1995)

Full domain-decomposition scheme for diffuse optical tomography of large-sized tissues with a combined CPU and GPU parallelization

Xi Yi, Xin Wang, Weiting Chen, Wenbo Wan, Huijuan Zhao, and Feng Gao
Appl. Opt. 53(13) 2754-2765 (2014)

Modified direct twos-complement parallel array multiplication algorithm for complex matrix operation

Guoqiang Li, Liren Liu, Lan Shao, and Yaozu Yin
Appl. Opt. 34(8) 1321-1328 (1995)

Design considerations and algorithms for partitioning optoelectronic multichip modules

Jiao Fan, Brian Catanzaro, Volkan H. Ozguz, Chung Kuan Cheng, and Sing H. Lee
Appl. Opt. 34(17) 3116-3127 (1995)

Photonic content-addressable memory system that uses a parallel-readout optical disk

Ashok V. Krishnamoorthy, Philippe J. Marchand, Gökçe Yayla, and Sadik C. Esener
Appl. Opt. 34(32) 7621-7638 (1995)