Skip to main content

Fast Block Matching Algorithm in Walsh Hadamard Domain

  • Conference paper
Book cover Computer Vision – ACCV 2006 (ACCV 2006)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 3852))

Included in the following conference series:

Abstract

A fast block matching algorithm, namely Fast Walsh Search, is proposed for motion estimation in block-based video coding. In our approach, target blocks in current frame and their candidates in reference frame are projected onto Walsh Hadamard domain, allowing early rejection of mismatch candidates to reduce computation requirement. Moreover, we introduce a new method called block pyramid matching that re-uses many previous calculations to further lessen the computation load of our approach. Experimental results show that the proposed algorithm can achieve more accurate motion estimation than the popular three-step-search and diamond search with slight increase in computation requirement only.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hel-Or, Y., Hel-Or, H.: Real time pattern matching using projection kernels. In: Proc. of Ninth IEEE International Conference on Computer Vision, October 2003, vol. 1, pp. 1486–1493 (2003)

    Google Scholar 

  2. Hel-Or, Y., Hel-Or, H.: Real time pattern matching using projection kernels. IEEE Trans. Pattern Analysis and Machine Intelligence 27(9) (September 2005)

    Google Scholar 

  3. Cham, W.K., Clarke, R.J.: Application of the principle of dyadic symmetry to the generation of orthogonal transforms. IEE Proc. F, Commun., Radar & Signal Process 133(3), 264–270 (1986)

    Article  Google Scholar 

  4. Koga, T., Iinuma, K., Hirano, A., Iijima, Y., Ishiguro, T.: Motion compensated interframe coding for video conferencing. In: Proc. Nat. Telecommun. Conf., New Orleans, LA, November 29-December 3, pp. G5.3.1–5.3.5 (1981)

    Google Scholar 

  5. Po, L.-M., Ma, W.-C.: A novel four-step search algorithm for fast block motion estimation. IEEE Transactions on Circuits and Systems for Video Technology 6(3), 313–317 (1996)

    Article  Google Scholar 

  6. Li, R., Zeng, B., Liou, M.L.: A new three-step search algorithm for block motion estimation. IEEE Transactions on Circuits and Systems for Video Technology 4(4), 438–442 (1994)

    Article  Google Scholar 

  7. Zhu, S., Ma, K.-K.: A new diamond search algorithm for fast block-matching motion estimation. IEEE Transactions on Image Processing 9(2), 287–290 (2000)

    Article  MathSciNet  Google Scholar 

  8. Wiegand, T., Sullivan, G.J., Bjontegaard, G., Luthra, A.: Overview of the H.264/AVC video coding standard. IEEE Trans. Circuits Syst. Video Technol 13, 560–576 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, N., Mak, CM., Cham, WK. (2006). Fast Block Matching Algorithm in Walsh Hadamard Domain. In: Narayanan, P.J., Nayar, S.K., Shum, HY. (eds) Computer Vision – ACCV 2006. ACCV 2006. Lecture Notes in Computer Science, vol 3852. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11612704_71

Download citation

  • DOI: https://doi.org/10.1007/11612704_71

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31244-4

  • Online ISBN: 978-3-540-32432-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics