Skip to main content

Design trade-offs for real-time block-matching motion estimation algorithms

  • Structure from Motion
  • Conference paper
  • First Online:
Recent Developments in Computer Vision (ACCV 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1035))

Included in the following conference series:

  • 221 Accesses

Abstract

In this paper, VLSI design trade-offs for real-time block-matching motion estimation (BMME) algorithms are discussed. Traditionally, design trade offs are considered only for two design parameters, i.e, processing speed and silicon area. However, this is not sufficient for real-time BMME algorithms. In addition to the traditional ones, we introduce two new design parameters, i.e, I/O bandwidth and algorithmic performance for consideration. Various design trade offs among these four parameters are presented in this paper.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sun Xuening and Minas E. Spetsakis, “A comparison of weighted LS methods with LS methods in 3-D motion estimation from stereo image sequences”, Proceedings 1993 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp.200–205, 1993.

    Google Scholar 

  2. Janusz Konrad and Eric Dubois, “Bayesian estimation of motion vector fields”, IEEE transactions on Pattern analysis and Machine Intelligence, vol. 14, No. 9, Sept. 1992.

    Google Scholar 

  3. R. Li, B. Zeng, and M. L. Liou, “A new three-step search algorithm for fast block motion estimation “, IEEE Trans. on Circuits and Systems for Video Technology, Vol. 4, No. 4, pp. 438–442, Aug. 1994.

    Google Scholar 

  4. T. Koga, K. Iinuma, A, Hirano, Y. Iijima, and T. Ishiguro, “Motion compensated interframe coding for video conferencing”, Proc. Nat. Telecommun. Conf., New Orleans, LA, Nov. 29, Dec. 1981, pp. G5.3.1–5.3.5.

    Google Scholar 

  5. K. M. Yang, M. T. Sun and L. Wu, “A family of VLSI designs for the motion compensation block-matching algorithm”, IEEE Transactions on Circuits and Systems, vol. 36, No. 10, pp. 1317–1325, Oct. 1989.

    Google Scholar 

  6. P. Ruetz, P. Tong, D. Bailey, D. Luthi and P. Ang, “A high performance full-motion video compression chip set”, IEEE Trans. on Circuits and Systems for Video Technology, Vol. 2, pp. 111–122, June 1992.

    Google Scholar 

  7. T. Komarek and P. Pirsch, “Array architecture for block matching Algorithms”, IEEE Transaction on Circuits and Systems, Vol. 36, No. 10, pp. 1301–1308, 1989.

    Google Scholar 

  8. Z. He and M. L. Liou, “A new array architecture for motion estimation”, Proceedings of IEEE Workshop on Visual Signal Processing and Communications, pp.148–151, Sept. 1994.

    Google Scholar 

  9. L. D. Vos and M. Stegherr, “Parameterizable VLSI architecture for the full-search block-matching algorithm”, IEEE Trans. on Circuits and System, Vol. 36, No. 10, pp. 1309–1316. 1989.

    Google Scholar 

  10. Zhong L. He and Ming L. Liou, P. C. Chan, and R. Li, “An efficient architecture for a new three-step search algorithm”, to appear in Proceedings of 38th Midwest Symposium on Circuit and systems, 1995.

    Google Scholar 

  11. H. M. Jong, L. G. Chen, T. D. Chiueh, “Parallel architectures for 3-step hierarchical search block-matching algorithm”, IEEE Trans. on Circuits and System for Video Technology, vol. 4, No. 4, pp. 407–416, August 1994.

    Google Scholar 

  12. Y. S. Jehng, L. G. Chen and T. D. Chiueh, “An efficient and simple VLSI tree architecture for motion estimation algorithms”, IEEE Trans. on Signal Processing, Vol. 41, No. 2, pp. 889–900, Feb., 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Stan Z. Li Dinesh P. Mital Eam Khwang Teoh Han Wang

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

He, Z.L., Liou, M.L. (1996). Design trade-offs for real-time block-matching motion estimation algorithms. In: Li, S.Z., Mital, D.P., Teoh, E.K., Wang, H. (eds) Recent Developments in Computer Vision. ACCV 1995. Lecture Notes in Computer Science, vol 1035. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60793-5_68

Download citation

  • DOI: https://doi.org/10.1007/3-540-60793-5_68

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60793-9

  • Online ISBN: 978-3-540-49448-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics