Singular value decomposition transform with an FFT-based algorithm on the connection machine CM5

Author

Cao-Huu, Tuan ; Évéquoz, Claude

Author_Institution

Harvard Univ., USA

Volume

2

fYear

1995

fDate

5-8 Sep 1995

Firstpage

1046

Abstract

We describe in this paper the parallel implementation of a modified, high radix fast Fourier transform (FFT) together with a Jacobi-based algorithm for matrix factorization to compute the singular value decomposition (SVD) of a 16384×16384 projection normal matrix arising from probability measure estimation in positron emission tomography (PET). We simplify the analysis significantly by working with block matrices and the Kronecker products because the symmetries built into the orthogonal decompositions allow the computation of the various factorizations of interest

Keywords

Jacobian matrices; fast Fourier transforms; medical image processing; parallel processing; positron emission tomography; probability; singular value decomposition; FFT-based algorithm; Jacobi-based algorithm; Kronecker products; PET; block matrices; connection machine CM5; factorizations; high radix fast Fourier transform; image processing; matrix factorization; orthogonal decompositions; parallel computing; positron emission tomography; probability measure estimation; singular value decomposition transform; Concurrent computing; Fast Fourier transforms; Image coding; Image processing; Jacobian matrices; Matrix decomposition; Parallel processing; Partitioning algorithms; Positron emission tomography; Singular value decomposition;

fLanguage

English

Publisher

ieee

Conference_Titel

Electrical and Computer Engineering, 1995. Canadian Conference on

Conference_Location

Montreal, Que.

ISSN

0840-7789

Print_ISBN

0-7803-2766-7

Type

conf

DOI

10.1109/CCECE.1995.526609

Filename

526609