.png){kind=icon}
.png){kind=icon}
Return
Fast search algorithms for video coding using orthogonal logarithmic search algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TCE.2005.1468001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The paper presents a novel fast search algorithm for block base motion compensation called the Orthogonal Logarithmic Search. The performance of the algorithm is evaluated by using standard 176 x 44 pixels quarter common intermediate format (QCIF) benchmark video sequences and the results are compared to the traditional well-known full search algorithm and the suboptimal three step search which is used in international video coding standards such as ISO MPEG-1/2 and ITU-T H.263. The important metrics of time and Peak Signal to Noise Ratio are used to evaluate the novel algorithm. The results show that the strength of the algorithm lies in its speed of operation as it is much faster than both the full search algorithm and the three step search. It has speed advantages of almost 87% and over 23% over the full search and three step search algorithms respectively. Furthermore, the accuracy of the prediction of Orthogonal Logarithmic Search algorithm is comparable to that of the three step search.
Keywords:
orthogonal logarithmic search
motion estimation
block matching algorithms
low bit rate video coding
Journal
IF:
10.9
Papers:
5.1K
Citations:
6.8K
Organization
No organization information available