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 of the algorithm identical to the search result of the exhaustive search and BSPA, NBSPA reduced the computation complexity greatly.
Original language | English |
---|---|
Pages (from-to) | 559-566 |
Number of pages | 8 |
Journal | Proceedings of SPIE - The International Society for Optical Engineering |
Volume | 4875 |
Issue number | 1 |
DOIs | |
State | Published - 2002 |
Event | Second International Conference on Image and Graphics - Hefei, China Duration: 16 Aug 2002 → 18 Aug 2002 |
Keywords
- Block matching
- Block sum pyramid
- Minkowski's inequality
- Motion estimation