Block-matching algorithm based on dynamic adjustment of search window for low bit-rate video coding

A dynamic search window adjustment for block-matching algorithm (BMA) based on the block similarity is presented to reduce the computational complexity of full search BMA. The adjustment of the size of the search window is performed in three steps: (1) set a new search origin based on the block similarity and the displaced block difference (DBD), (2) adjust the size of search window in inverse proportion to block similarity, and (3) update the thresholds for accommodation to a given image sequence. The technique can be easily applied to full search BMA and several fast search algorithms to get more efficiency and to reduce a possibility of falling into a local minimum. Experimental results show that the proposed technique has a good MSE performance and reduces the number of search points substantially. (C) 1998 SPIE and IS&T. [S1017-9909(98)02303-4].
Publisher
I S T - SOC IMAGING SCIENCE TECHNOLOGY
Issue Date
1998-07
Language
ENG
Keywords

MOTION ESTIMATION

Citation

JOURNAL OF ELECTRONIC IMAGING, v.7, no.3, pp.571 - 577

ISSN
1017-9909
URI
http://hdl.handle.net/10203/73289
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
  • Hit : 154
  • Download : 0
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 1 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0