Fast partial difference elimination algorithm based on block matching error prediction
نویسندگان
چکیده
منابع مشابه
Fast block matching algorithm based on the winner-update strategy
Block matching is a widely used method for stereo vision, visual tracking, and video compression. Many fast algorithms for block matching have been proposed in the past, but most of them do not guarantee that the match found is the globally optimal match in a search range. This paper presents a new fast algorithm based on the winner-update strategy which utilizes an ascending lower bound list o...
متن کاملBlock - Matching Algorithm Based on Dynamic Search
Dynamic search window adjustment for block-matching algorithm(BMA) based on the block similarity to overcome the computational complexity of full search BMA is presented. The proposed method for adjustment of the size of search window is performed with three steps:(1)Set new search origin based on block similarity and displaced block diierence(DBD), as a displacement of the block which has smal...
متن کاملExtended Successive Elimination Algorithm for Fast Optimal Block Matching Motion Estimation
In this paper, we propose an extended successive elimination algorithm (SEA) for fast optimal block matching motion estimation (ME). By reinterpreting the typical sum of absolute differences measure, we can obtain additional decision criteria whether to discard the impossible candidate motion vectors. Experimental results show that the proposed algorithm reduces the computational complexity up ...
متن کاملAn Efficient Successive Elimination Algorithm for Block-Matching Motion Estimation
Low power VLSI video compression processors are in high demand for the emerging wireless video applications [1]. Video compression processors include VLSI implementation of a motion estimation algorithm. Many motion estimation algorithms are found in the literature. Some of them are fast but can not guarantee an optimal solution; they can be stuck in a local optima. Such algorithms are fast, co...
متن کاملA New Fast Block Matching Algorithm for Video Files with Much Inter-frame Difference
For video coding, we have to consider two performance factors, i.e., the search speed and coded video’s quality. Since there is often a trade-off between those performance factors, it is not easy to develop an efficient algorithm in all these aspects. As two feasible video coding algorithms based on the block matching motion estimation, the CDS and HEXBS have been proposed. Although the algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optical Engineering
سال: 2007
ISSN: 0091-3286
DOI: 10.1117/1.2721453