A fast multi-resolution block matching algorithm for motion estimation

Cited 10 time in webofscience Cited 0 time in scopus
  • Hit : 343
  • Download : 0
In this paper, we present a fast multi-resolution block matching algorithm (BMA) for an MPEG-2 video encoder. Motion vectors (MVs) of spatially adjacent blocks are often exploited as credible MV candidates in searching continuous motions. However, they are no longer helpful when searching complex or random motions. We propose a novel multi-resolution BMA to solve this problem. At the coarsest level, a full search BMA (FSBMA) is performed for searching complex or random motions. Concurrently, spatial correlation of MV field is used for searching continuous motions. Here we present an efficient method for searching full resolution MVs without MV decimation even at the coarsest level. After the coarsest level search, two or three initial MV candidates are chosen for the next level. At the following levels, the MV candidates are refined within smaller search areas. Experimental results show that in comparison with FSBMA, the proposed BMA achieves a speed-up factor over 710 with minor PSNR degradation of 0.2 dB at most, under a normal MPEG2 encoding environment. Furthermore, our scheme is also suitable for hardware implementation due to regular data-flow. (C) 2000 Elsevier Science B.V. All rights reserved.
Publisher
ELSEVIER SCIENCE BV
Issue Date
2000-07
Language
English
Article Type
Article
Keywords

VECTOR ESTIMATION; CANDIDATES; PREDICTION

Citation

SIGNAL PROCESSING-IMAGE COMMUNICATION, v.15, no.9, pp.799 - 810

ISSN
0923-5965
URI
http://hdl.handle.net/10203/75553
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 10 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0