By Topic

Fast diamond search algorithm for real time 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
$33 $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

2 Author(s)
Yasser Ismail ; The Center of Research Excellence in Hajj and Omrah, Umm Al-Qura University - KSA ; Sherif El-etriby

A Fast Diamond Search (FDS) algorithm based on the conventional Diamond Search (DS) algorithm is proposed. Two computationally efficient algorithms are applied to the conventional DS in order to reduce the computations with an acceptable degradation in the coding efficiency. The first algorithm is the Internal Stop Search (ISS) that is used to reduce the internal redundant SAD (Sum of Absolute Difference) operations between both the current and the reference blocks. The second algorithm is the External Stop Search (ESS) that is used to skip the unnecessary operations by skipping all the irrelevant blocks in the search area. Both of these algorithms use adaptive models that accurately remove the unnecessary operations considering small degradation in the coding efficiency. In addition, early search termination and adaptive pattern selections techniques are applied to the proposed FDS as initialization steps to achieve even higher complexity reduction. Experiments show that the proposed FDS algorithm reduces the computations greatly up to 99% and 20% compared to the conventional FS algorithm and DS respectively.

Published in:

Computing, Networking and Communications (ICNC), 2012 International Conference on

Date of Conference:

Jan. 30 2012-Feb. 2 2012