Skip to main content

EFBLA: A Two-Phase Matching Algorithm for Fast Motion Estimation

  • Conference paper
  • First Online:
  • 353 Accesses

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

Abstract

This paper presents a novel matching algorithm for fast motion estimation. The algorithm, called the Edge-matching First Block-matching Last Algorithm (EFBLA), first employs the edge-matching procedure to determine candidate motion vectors and then performs the conventional block matching with the SAD criteria on the candidates. The edge-matching procedure features low computation load and high degree of data reusability; therefore, it requires fewer operations and lower memory size compared with the full search algorithm. As the result of benchmarking and comparing to the full search algorithm, EFBLA may significantly save the computation load by 93.9% while the degradation of PSNR is very little.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Peter Kuhn, “Algorithms, Complexity Analysis and VLSI Architectures for MPEG-4 Motion Estimation,” Kluwer Academic Publishers, 1999.

    Google Scholar 

  2. Jun-Fu Shen, Tu-Chih Wand, and Liang-Gee Chen, “A Novel Low-Power Full-Search Block-Matching Motion-Estimation Design for H.263+,” IEEE Trans. on Circuits and Systems for Video Technology, Vol. 11, No. 7, pp. 890–897, July 2001.

    Article  Google Scholar 

  3. V. L. Do and K. Y. Yun, “A low-power VLSI architecture for full-search block-matching motion estimation,”, IEEE Trans. on Circuits and Systems for Video Technology, Vol. 8, No. 4, pp. 393–398, Aug. 1998.

    Article  Google Scholar 

  4. M. Brunig and W. Niehsen, “Fast full-search block matching,”, IEEE Trans. on Circuits and Systems for Video Technology, Vol. 11, No. 2, pp. 241–247, Feb. 2001.

    Article  Google Scholar 

  5. L. Sousa and N. Roma, “Low-power array architectures for motion estimation,”, 1999 IEEE 3rd Workshop on Multimedia Signal Processing, pp. 679–684, 1999.

    Google Scholar 

  6. Bo-Sung Kim and Jun-Dong Cho, “VLSI architecture for low power motion estimation using high data access reuse,” The First IEEE Asia Pacific Conference on ASIC, APASIC’ 99, pp162–165, 1999.

    Google Scholar 

  7. W. Li and E. Salari, “Sucessive Elimination Algorithm for Motion Estimation,” IEEE Transactions on Image Processing, Vol. 4, No. 1, pp. 105–107, Jan. 1995.

    Article  Google Scholar 

  8. S. Lee and S. I. Chae, “Motion estimation algorithm using low-resolution quantization,” IEE Electronic Letters, vol. 32, no 7, pp. 647–648, Mar. 1996.

    Article  Google Scholar 

  9. Takagi A., Nishikawa K. and Kiya H., “Low-bit motion estimation with edge enhanced images for lowpower MPEG encoder,” ISCAS 2001, Vol. 2, pp. 505–508, 2001.

    Google Scholar 

  10. Rafael C. Gonzalez, and Richard E. Woods, “Digital Image Processing,” Addison Wesley, Sep. 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cheng, HW., Dung, LR. (2002). EFBLA: A Two-Phase Matching Algorithm for Fast Motion Estimation. In: Chen, YC., Chang, LW., Hsu, CT. (eds) Advances in Multimedia Information Processing — PCM 2002. PCM 2002. Lecture Notes in Computer Science, vol 2532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36228-2_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-36228-2_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00262-8

  • Online ISBN: 978-3-540-36228-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics