By Topic

A variable search count block-matching algorithm for video 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 $13
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

3 Author(s)
Habili, N. ; Dept. of Electr. & Electron. Eng., Adelaide Univ., SA, Australia ; Moini, A.R. ; Burgess, N.

In this paper, we propose a variable search count algorithm (VSCA) which is faster than other center-biased motion estimation algorithms, with comparable accuracy. This paper compares the accuracy and processing speed of VSCA to the full search algorithm and several other suboptimal search algorithms. VSCA has a best case scenario of only 9 searches, and a worst case scenario of 19 searches. For a fast moving sequence such as “Foreman≫CLOSE/, VSCA has an average search-count per block of 12.11, and offers a speedup of 16.87, normalized to the full search algorithm

Published in:

TENCON 99. Proceedings of the IEEE Region 10 Conference  (Volume:1 )

Date of Conference:

1999