Computationally efficient eigenspace decomposition of correlated images characterized by three parameters
From MaRDI portal
Publication:710625
DOI10.1007/s10044-008-0135-9zbMath1422.68262OpenAlexW1973291102MaRDI QIDQ710625
K. Saitwal, R. G. Roberts, Anthony A. Maciejewski
Publication date: 19 October 2010
Published in: PAA. Pattern Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10044-008-0135-9
computational complexitycomputer visionsingular value decompositioneigenspaceimage sequencesthree-dimensional correlations
Factorization of matrices (15A23) Computing methodologies for image processing (68U10) Machine vision and scene understanding (68T45)
Cites Work
- Unnamed Item
- Unnamed Item
- Fast eigenspace decomposition of correlated images
- A survey of conjugate gradient algorithms for solution of extreme eigen-problems of a symmetric matrix
- Gradient-Type Algorithms for Partial Singular Value Decomposition
- A Method for Computing the Partial Singular Value Decomposition
- Iterative SVD-Based Methods for Ill-Posed Problems
This page was built for publication: Computationally efficient eigenspace decomposition of correlated images characterized by three parameters