Earticle

초록

영어

In Video coding, Motion Estimation(ME) is the major step to remove the temporal redundancy between adjacent frames. Several algorithms have been developed for acceleration of ME by reducing the number of computations. In this paper, we propose, two- step motion estimation technique to minimize the computational overhead of general full search block matching motion estimation algorithm. In our proposed methodology, we first find the matching block using the trace and upon match, the Sum of Absolute Difference (SAD) is calculated for the entire block in order to ensure the best match motion prediction. In trace matching, the number of computations observed are O(n) rather than O(n2)in case of full search. Hence, the two- step methodology reduces the computational overhead and also ensures compression quality comparable with the existing fast motion search techniques.

목차

Abstract
 1. Introduction
 2. Literature Survey
 3. Full Search Block Motion Estimation Algorithm
 4. Proposed Methodology
  4.1. Trace Match for Block Motion Estimation
  4.2. Algorithm of Two-Step Trace match and SAD Computations
 5. Inter Block Search Reduction.
 6. Results and Discussions
  6.1. Speed Up
  6.2. Peak Signal to Noise Ratio (PSNR)
 7. Conclusion
 References

키워드

저자

• Linganagoud Kulkarni [ B.V.B College of Engineering and Technology, Hubli-30, Karanataka, India ]
• Manu T. M. [ K.L.E Institute of Technology, Hubli-30, Karnataka, India ]
• Basavaraj. S. Anami [ K.L.E Institute of Technology, Hubli-30, Karnataka, India ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of u- and e- Service, Science and Technology

• 간기

  격월간

• pISSN

  2005-4246

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605