By Topic

A Search Direction Extensible Fast Search Algorithm

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

4 Author(s)
Meibin Qi ; Inf. Sci. & Technol. Sch., Hefei Univ. of Technol. ; Debao Wang ; Jianguo Jiang ; Baolei An

This paper proposes a novel fast search algorithm with search direction extensible, through investigating diamond search algorithm's directivity and robustness. The proposed algorithm starts with a five-point diamond search's block matching, and decides the direction from the center check point to the least block distortion point to be the search direction. Next we continuously extend one check point and detect its block distortion until the next one check point's block distortion is larger than the current check point's. Then the current check point is declared to be the center check point, and repeat the operations. Finally we end the search when the center check point has least block distortion. The proposed algorithm's search speed can increase 1 to 2 times than diamond search's with the same video quality

Published in:

Pervasive Computing and Applications, 2006 1st International Symposium on

Date of Conference:

3-5 Aug. 2006