DOI QR코드

DOI QR Code

A Study on the New Motion Estimation Algorithm of Binary Operation for Real Time Video Communication

실시간 비디오 통신에 적합한 새로운 이진 연산 움직임 추정 알고리즘에 관한 연구

  • Published : 2004.07.01

Abstract

The motion estimation algorithm based block matching is a widely used in the international standards related to video compression, such as the MPEG series and H.26x series. Full search algorithm(FA) ones of this block matching algorithms is usually impractical because of the large number of computations required for large search region. Fast search algorithms and conventional binary block matching algorithms reduce computational complexity and data processing time but this algorithms have disadvantages that is less performance than full search algorithm. This paper presents new Boolean matching algorithm, called BCBM(Bit Converted Boolean Matching). Proposed algorithm has performance closed to the FA by Boolean only block matching that may be very efficiently implemented in hardware for real time video communication. Simulation results show that the PSNR of the proposed algorithm is about 0.08㏈ loss than FA but is about 0.96∼2.02㏈ gain than fast search algorithm and conventional Boolean matching algorithm.

블록 정합 움직임 추정 알고리즘은 국제 표준인 MPEG, H.26x등 대부분의 표준 비디오 압축 기법에 채택되어 시간적 중복성을 제거하여 압축률을 높이는 핵심적인 기술로 사용되고 있다. 이러한 블록 정합 알고리즘 중 전역 탐색은 탐색영역이 증가하는 경우 막대한 양의 연산이 필요하다는 단점을 갖고 있다. 반면에 고속 탐색 및 이진 연산 알고리즘은 전역 탐색보다 연산량과 속도는 개선할 수 있지만, 성능이 크게 떨어지는 단점을 가지고 있다. 따라서 본 논문에서는 하드웨어 구현이 용이하고 움직임 추정을 고속으로 수행 할 수 있는 새로운 BCBM(Bit Converted Boolean Matching)알고리즘을 제안한다. BCBM 알고리즘은 움직임 추정 시 필요한 연산을 이진 연산으로만 수행하면서 전역 탐색에 근접한 성능을 나타낸다. 움직임 추정 성능은 CIF 포맷의 영상 100프레임을 이용하여 분석하였다. BCBM 알고리즘의 PSNR 성능은 전역 탐색 알고리즘보다 약 0.08㏈ 떨어지지만, 고속 탐색 알고리즘 및 기존의 이진 연산 알고리즘 보다 0.96∼2.02㏈ 정도 우수함을 실험을 통해 확인하였다.

Keywords

References

  1. Iain E. G. Richardson, “Video Codec Design", John Wiley & Sons Ltd, 2002.
  2. K. Sayood, "Introduction to Data Compression", 2nd edition, Morgan Kaufmann, 2000.
  3. K. M. Yang, M. T. Sun, and L. Wu, "A family of VLSI architectures for the full-search block-matching algorithm", IEEE Trans. Circuits Syst., vol. 36, no. 10, pp. 1317-1325, Oct. 1989. https://doi.org/10.1109/31.44348
  4. M. Ghanbari, "The cross search algorithm for motion estimation", IEEE Trans. Commun., vol. COM-38, pp. 950-953, July 1990.
  5. Jong-Nam Kim and Tae-Sun Choi, "A fast three steps search algorithm with minimum checking points using Unimodal error surface assumption", IEEE Transactions on Consumer Electronics, vol. 44, no. 3, August 1998.
  6. Humaira Nisar, and Tae-Sun Choi, "An new four step search algorithm with minimum checking points for block motion estimation", Proceedings of MICC and ISCE'99, Melaka, Malaysia, pp.211-215, 1999.
  7. Shan Zhu, and Kai-kuang, Ma, "A new Diamond Search algorithm for fast block matching motion estimation", IEEE Transaction on Image Processing, vol. 9, no. 2, pp387-525, Feb 2000.
  8. B. Natarajan, V. Bhaskaran, and K. Konstantinides, "Low complexcity block based motion estimation via one bit transform", IEEE Trans. Circuits. Syst., Video Technol., vol. 7, no. 4, pp. 702-706, Aug. 1997. https://doi.org/10.1109/76.611181
  9. J. Chalidabhongse and J. Kuo, "Fast motion vector estimation using multiresolution-spatio-temporal correlations," IEEE Trans. Circuits and Systems for Video Tech., vol. 7, no. 3, pp.477-488, June 1997. https://doi.org/10.1109/76.585927
  10. Young-Ki Ko and Sung-Jea Ko et al., "VLSI Architecture for Fast Motion Estimation Based on Bit-Plane Matching," Journal of the Korean Physical Society, vol. 37, no. 6, pp. 934-944, Dec. 2000. https://doi.org/10.3938/jkps.37.938
  11. S.-J. Ko, S.-H. Lee, S.-W. Jeon, and E.-S. Kong, "Fast digital image stabilizer based on Gray-coded bit-plane matching", IEEE Trans. Consumer Electronics., vol. 45, pp. 598-603, Aug. 1999. https://doi.org/10.1109/30.793546
  12. Erturk, S. "Motion estimation by pre-coded image plane matching", Int. Conf. Image Proc., vol 2, pp. 347-350, Sept. 2003.