By Topic

Singular value decomposition for approximate block matching in image coding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Robinson, J.A. ; Dept. of Syst. Design Eng., Waterloo Univ., Ont., Canada

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

Published in:

Electronics Letters  (Volume:31 ,  Issue: 25 )