Skip to main content

A Fast Full Search Algorithm for Multiple Reference Images

  • Conference paper
Advances in Multimedia Information Processing - PCM 2004 (PCM 2004)

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

Included in the following conference series:

  • 1177 Accesses

Abstract

This paper presents a fast full search algorithm for motion estimation. The proposed method is an extended version of the rate constrained successive elimination algorithm (RSEA) for multiple reference frame applications. We will show that motion estimation for the reference images temporally preceding the first reference image can be less intensive in computation compared with that for the first reference image. For computational reduction, we will drive a new condition to lead the smaller number of candidate blocks for the best matched block. Simulation results explain that our method reduces computation complexity although it has the same quality as RSEA.

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. Dufaux, F., Moscheni, F.: Motion estimation techniques for digital TV: A review and a new contribution. Proc. IEEE 83, 858–879 (1995)

    Google Scholar 

  2. Po, L.M., Ma, W.C.: A novel four-step search algorithm for fast block motion estimation. IEEE Trans. Circuits Syst. Video Technol. 6, 313–317 (1996)

    Article  Google Scholar 

  3. Liu, L.K., Feig, E.: A block-based gradient descent search algorithm for block motion estimation in video coding. IEEE Trans. Circuits Syst. Video Technol. 6, 419–423 (1996)

    Article  Google Scholar 

  4. Zhu, S., Ma, K.-K.: A new diamond search algorithm for fast block matching motion estimation. In: Proc. Int. Conf. Inform. Comm., Signal Processing, Singapore, September 9-12, pp. 292–296 (1997)

    Google Scholar 

  5. Li, W., Salari, E.: Successive elimination algorithm for motion estimation. IEEE Trans. on Image Processing 4(1), 105–107 (1995)

    Article  Google Scholar 

  6. Coban, M.Z., Mersereau, R.M.: A fast exhaustive search algorithm for rateconstraned motion estimation. IEEE Trans. on Image Processing 7(5) (May 1998)

    Google Scholar 

  7. Gao, X.Q., Duanmu, C.J., Zou, C.R.: A multilevel successive elimination algorithm for block matching motion estimation. IEEE Trans. on Image Processing 9(3), 501–504 (2000)

    Article  Google Scholar 

  8. Lu, J.Y., Wu, K.S., Lin, J.C.: Fast full search in motion estimation by hierarchical use of Minkowski’s inequality. Pattern Recognition 31(7), 945–952 (1998)

    Article  Google Scholar 

  9. ITU-T recommendation H.264 — ISO/IEC 14496-10 AVC, Draft text of final draft standard for advanced video coding (March 2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kang, HS., Lee, SW., Yoo, KY., Choi, JG. (2004). A Fast Full Search Algorithm for Multiple Reference Images. In: Aizawa, K., Nakamura, Y., Satoh, S. (eds) Advances in Multimedia Information Processing - PCM 2004. PCM 2004. Lecture Notes in Computer Science, vol 3333. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30543-9_77

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30543-9_77

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23985-7

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics