Design of fast algorithms for projections through matrix decomposition

Hongzheng Li; Hongchi Shi

doi:10.1117/12.365896

Translator Disclaimer

7 October 1999 Design of fast algorithms for projections through matrix decomposition

Hongzheng Li, Hongchi Shi

Author Affiliations +

Proceedings Volume 3817, Parallel and Distributed Methods for Image Processing III; (1999) https://doi.org/10.1117/12.365896
Event: SPIE's International Symposium on Optical Science, Engineering, and Instrumentation, 1999, Denver, CO, United States

Abstract

Projection is a frequently used process in image processing and visualization. In volume graphics, projection is used to render the essential content of a 3D volume onto a 2D image plane. For Radon transform, projection is used to transform the image space into a parameter space. In this paper, we propose a matrix decomposition method called identity-plus- row decomposition for designing fast algorithms for projections. By applying this method, we solve the data redistributed problem due to the irregular data access patterns present in those applications on SIMD mesh- connected computers, developing fast algorithms for volume rendering and Radon transform on SIMD mesh-connected computers.

Citation Download Citation

Hongzheng Li and Hongchi Shi "Design of fast algorithms for projections through matrix decomposition", Proc. SPIE 3817, Parallel and Distributed Methods for Image Processing III, (7 October 1999); https://doi.org/10.1117/12.365896

ACCESS THE FULL ARTICLE