Categories for Fast Block Matching Algorithm
Prashant A.Bhalge1, Salim.Y.Amdani2
1Prashant Ashok Bhalge, Department of Computer Science & Engineering, Babasaheb Naik College of Engineering, Pusad (Maharashtra). India.
2Dr. S.Y. Amdani, Department of Computer Science & Engineering, Babasaheb Naik College of Engineering, Pusad (Maharashtra). India.
Manuscript received on 20 May 2016 | Revised Manuscript received on 30 May 2016 | Manuscript published on 30 May 2016 | PP: 37-39 | Volume-5 Issue-2, May 2016 | Retrieval Number: B1590055216©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Motion Estimation plays a vital role in a motion compensated hybrid DCT video compression scheme. To reduce the computational complexity in finding the near to exact match of the block, many fast search algorithms have been proposed. This paper is survey paper in which fast block matching algorithm are categorized. Unsymmetrical multi hexagon search, Adaptive rood pattern search, Fast full search are described.
Keyword: Block matching, Hexagonal search, Adaptive rood pattern, Validity Metrics
Scope of the Article: Parallel and Distributed Algorithms