대한전자공학회논문지SP (Journal of the Institute of Electronics Engineers of Korea SP)

대한전자공학회 (The Institute of Electronics and Information Engineers)
권호 표지

이웃 탐색점에서의 평균 절대치 오차를 이용한 2단계 고속 블록 정합 알고리듬

A Two-Stage Fast Block Matching Algorithm Using Mean Absolute Error of Neighbor Search Point

  • 정원식 (경북대학교 전자전기공학부) ;
  • 이법기 (경북대학교 전자전기공학부) ;
  • 권성근 (경북대학교 전자전기공학부) ;
  • 한찬호 (경운대학교 멀티미디어정보학부) ;
  • 신용달 (영동대학교 전자공학부) ;
  • 송규익 (경북대학교 전자전기공학부) ;
  • 이건일 (경북대학교 전자전기공학부)
  • Cheong, Won-Sik (School of Electronic and Electrical Engineering, Kyungpook National University) ;
  • Lee, Bub-Ki (School of Electronic and Electrical Engineering, Kyungpook National University) ;
  • Kwon, Seong-Geun (School of Electronic and Electrical Engineering, Kyungpook National University) ;
  • Han, Chan-Ho (Dept. of Software, School of Multimedia and Information, Kyungwoon University) ;
  • Shin, Yong-Dal (School of Electronic Engineering, Youngdong University) ;
  • Sohng, Kyu-Ik (School of Electronic and Electrical Engineering, Kyungpook National University) ;
  • Lee, Kuhn-Il (School of Electronic and Electrical Engineering, Kyungpook National University)
  • 발행 : 2000.05.25
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 논문에서는 이웃 탐색점에서의 평균 절대치 오차(mean absolute error, MAE)를 이용하여 전역 탐색 알고리듬(full search algorithm, FSA)과 거의 같은 움직임 추정 성능을 얻으면서도 고속으로 움직임을 추정할 수 있는 2단계 고속 블록 정함 알고리듬을 제안하였다. 제안한 방법에서는 현재 탐색점에서 블록 정합을 통하여 얻을 수 있는 MAE의 최소 범위를 이웃 탐색점에서의 MAE를 이용하여 구한 뒤, 이를 이용하여 블록 정합이 필요한 탐색점에 대하여서만 블록 정합을 행하였다. 즉, 제안한 방법에서는 블록 정함이 필요한 탐색점 수를 줄임으로써 고속으로 움직임을 추정하였으며, 움직임 추정을 두 단계로 나누어 수행하였다 모의 설험을 통하여 제안한 방법이 FSA와 거의 같은 움직임 추정 성능을 유지하면서도 많은 계산량의 감소를 얻을 수 있음을 확인하였다

In this paper, we propose a two-stage fast block matching algorithm using the mean absolute error (MAE) of neighbor search point that can reduce the computational complexity to estimate motion vector while the motion estimation error performance is nearly the same as full search algorithm (FSA) In the proposed method, the lower bound of MAE 6at current search point IS calculated using the MAE of neighbor search point And we reduce the computational complexity by performing the block matching process only at the search point that has to be block matched using the lower bound of MAE The proposed algorithm is composed of two stages The experimental results show that the proposed method drastically reduces the computational complexity while the motion compensated error performance is nearly kept same as that of FSA.

키워드

참고문헌

  1. ITU-T Recommendation H.261, 'Video codec for audiovisual services at $p{\times}64$ kbits/s.'
  2. ITU-T Recommendation H 263, 'Video coding for low bit rate communication.'
  3. ISO/IEC 11172-2, 'Coding of Moving Pictures and Associated Audio for Digital Storage Media at up to about 1.5Mbits/s. Video.'
  4. ISO/IEC 13818-2, 'Information technology - Generic Coding of Moving Pictures and Associated Audio Information' Video.'
  5. K. M. Yang, M. T. Sun, and L. Wu, 'A family of VLSI design for the motion compensation block-matching algorithm,' IEEE Trans Circuit and Systems, vol 36, no 10, pp. 1309-1316, 1989 https://doi.org/10.1109/31.44348
  6. J R. Jain and A. K. Jain, 'Displacement measurement and its application in interframe Image coding,' IEEE Trans Commun, vol. 29, no 12, pp. 1799-1801, Dec., 1981 https://doi.org/10.1109/TCOM.1981.1094950
  7. T Koga, K. Iinuma, A Hirano, Y Iijima, and T Ishiguro, 'Motion compensated interframe coding for video conferencing,' Proc. Nat Telecommun. Conf, pp. G5 3 1 - aG5 3 5, Nov./Dec. 1981
  8. R. Strinivasan and K R. Rao, 'Predictive coding based on efficient motion estimation,' IEEE Trans. Commun, vol. COM-33, pp. 1011-1014, Sept 1985
  9. M. Ganbari, 'The cross search algorithm for motion estimation,' IEEE Trans. Commun., vol. COM-38, no 7, pp. 950-953, July 1990 https://doi.org/10.1109/26.57512
  10. R Li, B. Zeng, and M L. Liou, 'A new three-step search algorithm for block motion estimation,' IEEE Trans. Circuit and Systems for Video Technology, vol 4, no 4, pp 438-442, Aug. 1994 https://doi.org/10.1109/76.313138
  11. B Liu and A. Zaccarin, 'New fast algorithms for the estimation of block motion vectors,' IEEE Trans Circuit and Systems for Video Technology, vol 3, no 2, pp. 148-157, Apr. 1993 https://doi.org/10.1109/76.212720
  12. Y. L. Chan and W C. Siu, 'New adaptive pixel decimation for block motion vector estimation,' IEEE Trans. Circuit and Systems for Video Technology, vol. 6, no 1, pp. 113-118, Feb. 1996 https://doi.org/10.1109/76.486426
  13. J. Lu and M. L Liou, 'A simple and efficient search algorithm for block-matching motion estimation,' IEEE Trans Circuit and Systems for Video Technology, vol. 7, no. 2, pp 429-433, Apr 1997 https://doi.org/10.1109/76.564122
  14. W. Li and E. Salari, 'Successive elimination algorithm for motion estimation,' IEEE Trans. Image Processing, vol 4, no 1 pp. 105-107, Jan. 1995 https://doi.org/10.1109/83.350809
  15. H Fujiwara, M. L Liou, M.-T. Sun, K.-M Yang, M Maruyama, K. Shomura, and K. Ohyama, 'An all ASIC implementation of a low bit-rate video codec, ' IEEE Trans Circuit and Systems for Video Technology, vol. 2, no 2, pp 123-134, June 1992 https://doi.org/10.1109/76.143412
  16. P. A. Ruetz, P. Tong, D. A Luthi, and P. H. Ang, 'A high-performance full-motion video compression chip set,' IEEE Trans. Circuit and Systems for Video Technology, vol. 2, no. 2, pp 111-122, June, 1992 https://doi.org/10.1109/76.143411
  17. 정원식, 이법기, 이경환, 최정현, 김경규, 김덕규, 이건일, '블록 움직임 추정을 위한 2단계 고속 전역 탐색 알고리듬,' 한국통신학회논문지, vol 24, no 9A, pp 1392-1400, 1999년 9월
  18. H.-M. Jong, L -G. Chen, and T -D Chiueh, 'Accuracy Improvement and Cost Reduction of 3-Step Search Block Matching Algorithm for Video Coding,' IEEE Trans Circuit and Systems for Video Technology, vol 4, no. 1, pp 88-90, Feb. 1994 https://doi.org/10.1109/76.276175