Fast eigenspace decomposition of correlated images

We present a computationally efficient algorithm for the eigenspace decomposition of correlated images. Our approach is motivated by the fact that for a planar rotation of a two-dimensional (2-D) image, analytical expressions can be given for the eigendecomposition, based on the theory of circulant...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 9(2000), 11 vom: 15., Seite 1937-49
1. Verfasser: Chang, C Y (VerfasserIn)
Weitere Verfasser: Maciejewski, A A, Balakrishnan, V
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2000
Zugriff auf das übergeordnete Werk:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM177503963
003 DE-627
005 20231223150345.0
007 cr uuu---uuuuu
008 231223s2000 xx |||||o 00| ||eng c
024 7 |a 10.1109/83.877214  |2 doi 
028 5 2 |a pubmed24n0592.xml 
035 |a (DE-627)NLM177503963 
035 |a (NLM)18262928 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Chang, C Y  |e verfasserin  |4 aut 
245 1 0 |a Fast eigenspace decomposition of correlated images 
264 1 |c 2000 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 11.12.2009 
500 |a Date Revised 11.02.2008 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a We present a computationally efficient algorithm for the eigenspace decomposition of correlated images. Our approach is motivated by the fact that for a planar rotation of a two-dimensional (2-D) image, analytical expressions can be given for the eigendecomposition, based on the theory of circulant matrices. These analytical expressions turn out to be good first approximations of the eigendecomposition, even for three-dimensional (3-D) objects rotated about a single axis. In addition, the theory of circulant matrices yields good approximations to the eigendecomposition for images that result when objects are translated and scaled. We use these observations to automatically determine the dimension of the subspace required to represent an image with a guaranteed user-specified accuracy, as well as to quickly compute a basis for the subspace. Examples show that the algorithm performs very well on a number of test cases ranging from images of 3-D objects rotated about a single axis to arbitrary video sequences 
650 4 |a Journal Article 
700 1 |a Maciejewski, A A  |e verfasserin  |4 aut 
700 1 |a Balakrishnan, V  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society  |d 1992  |g 9(2000), 11 vom: 15., Seite 1937-49  |w (DE-627)NLM09821456X  |x 1941-0042  |7 nnns 
773 1 8 |g volume:9  |g year:2000  |g number:11  |g day:15  |g pages:1937-49 
856 4 0 |u http://dx.doi.org/10.1109/83.877214  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 9  |j 2000  |e 11  |b 15  |h 1937-49