New fast block-matching algorithm based on block sum pyramid

Nenghai Yu; H. Y. Chen; Zhengkai Liu; Xuelong Li; Feng Niu

doi:10.1117/12.477197

31 July 2002 New fast block-matching algorithm based on block sum pyramid

Nenghai Yu, H. Y. Chen, Zhengkai Liu, Xuelong Li, Feng Niu

Proceedings Volume 4875, Second International Conference on Image and Graphics; (2002) https://doi.org/10.1117/12.477197
Event: Second International Conference on Image and Graphics, 2002, Hefei, China

Abstract

In this correspondence, a new block sum pyramid algorithm (NBPSA) to motion estimation is presented. Compared with BSPA, NBSPA estimate the vector of the minimum mean absolute difference ( MADmin ) In the mean time, instead of update the value level by level, we update the estimation of MAD row by row, up to down. Experimental results showed that, with the search result ofthe algorithm identical to the search result ofthe exhaustive search and BSPA, NBSPA reduced the computation complexity greatly.

Citation Download Citation

Nenghai Yu, H. Y. Chen, Zhengkai Liu, Xuelong Li, and Feng Niu "New fast block-matching algorithm based on block sum pyramid", Proc. SPIE 4875, Second International Conference on Image and Graphics, (31 July 2002); https://doi.org/10.1117/12.477197

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available