Singular value decompositionfor approximate block matching in image coding
- 7 December 1995
- journal article
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 31 (25) , 2164-2165
- https://doi.org/10.1049/el:19951481
Abstract
The minimum Euclidean distance matching of a 2-D image block can be reorganised, via singular value decomposition, into a set of computations with the block's singular vectors. The first two or three pairs of singular vectors are usually sufficient to achieve a good approximation, calculated with fewer operations than Euclidean matching. Full search motion estimation can be speeded up by at least a factor of 2, with minimal loss of accuracy.Keywords
This publication has 3 references indexed in Scilit:
- Singular Value Decomposition (SVD) Image CodingIEEE Transactions on Communications, 1976
- Singular value decompositions and digital image processingIEEE Transactions on Acoustics, Speech, and Signal Processing, 1976
- Singular value decomposition and least squares solutionsNumerische Mathematik, 1970