Graphics enhanced version of this site

Scalable regularized tomography without repeated projections
J. August and T. Kanade
Proceedings of the 18th International Parallel and Distributed Processing Symposium, April, 2004, pp. 232 - 239.

Jump to: Download | Abstract | Notes | Text Reference | BibTeX Reference

Adobe portable document format (pdf) [1516 KB]

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Summary form only given. X-ray computerized tomography (CT) and related imaging modalities (e.g., PET) are notorious for their excessive computational demands, especially when noise-resistant probabilistic methods such as regularized tomography are used. The basic idea of regularized tomography is to compute a smooth image whose simulated projections (line integrals) approximate the observed, noisy X-ray projections. The computational expense in previous methods stems from explicitly applying a large sparse projection matrix to enforce these smoothness and data fidelity constraints during each of many iterations of the algorithm. Here we review our recent work in regularized tomography in which the smoothness constraint is analytically transformed from the image to the projection domain, before any computations begin. As a result, iterations take place entirely in the projection domain, avoiding the repeated sparse matrix-vector products. A more surprising benefit is the decoupling of a large system of regularization equations into many small systems of simpler independent equations, whose solution requires an "embarassingly parallel" computation. Here, we demonstrate that this method provides linear speedup of regularized tomography for up to 20 compute nodes (Pentium 4, 1.5 GHz) on a 100 Mb/s network using a Matlab MPI implementation.

Associated center: VASC

Number of pages: 8

J. August and T. Kanade, "Scalable regularized tomography without repeated projections," Proceedings of the 18th International Parallel and Distributed Processing Symposium, April, 2004, pp. 232 - 239.

@inproceedings{August_2004_5634,
   author = "Jonas August and Takeo Kanade",
   title = "Scalable regularized tomography without repeated projections",
   booktitle = "Proceedings of the 18th International Parallel and Distributed Processing Symposium",
   month = "April",
   year = "2004",
   pages = "232 - 239"
}