Block-matching algorithm based on an adaptive reduction of the search area for motion estimation

Cited 26 time in webofscience Cited 0 time in scopus
  • Hit : 426
  • Download : 3
The motion estimation and compensation technique is widely used for video coding applications but the real-time motion estimation is not easy due to its enormous computations. In this paper, a new adaptive reduction of search area for the block-matching algorithm is presented to reduce the computational complexity of the full search block-matching algorithm for low bit-rate video coding. The proposed method exploits the correlation of successive video frames and adjusts the size of search area depending on the displaced block difference and the block classification information in the previous frames of the block. Simulation-results show that the proposed algorithm has similar mean square error performance to the full search block-matching algorithm but only requires less a half computational complexity than the full search algorithm. (C) 2000 Academic Press.
Publisher
ACADEMIC PRESS LTD
Issue Date
2000-10
Language
English
Article Type
Article
Keywords

ARRAY ARCHITECTURES

Citation

REAL-TIME IMAGING, v.6, no.5, pp.407 - 414

ISSN
1077-2014
URI
http://hdl.handle.net/10203/17522
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 26 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0