You have requested a machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Neither SPIE nor the owners and publishers of the content make, and they explicitly disclaim, any express or implied representations or warranties of any kind, including, without limitation, representations and warranties as to the functionality of the translation feature or the accuracy or completeness of the translations.
Translations are not retained in our system. Your use of this feature and the translations is subject to all use restrictions contained in the Terms and Conditions of Use of the SPIE website.
7 October 1999Design of fast algorithms for projections through matrix decomposition
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.
Hongzheng Li andHongchi 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
The alert did not successfully save. Please try again later.
Hongzheng Li, 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