Motion estimation is regarded as vital importance for video coding. When designing search methods for motion estimation, both the estimation accuracy and computational complexity are the main considerations. The existing fast search methods such as TSS, NTSS, DS and ARPS can provide satisfactory result at a very low computational cost but within their own best application range. Besides, none o...

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 newsearch origin basedonblock similarity anddisplacedblockdifference(DBD), as a displacement of the block which has smaller D...

The extraction of the moving foreground from a stationary background from a general video sequence has various applications such as compression of videos and also in the cinematographic effects. For this foreground extraction the main algorithm used is the Block Matching Algorithm (BMA) which is the motion estimation algorithm employed in the MPEG compression standards. The noise is estimated f...

In this work, we have developed a new bio-inspired neural network algorithms for blockbased motion estimation. The main goal is to bridge the gap between algorithmic and biological vision by suggesting a bio-inspired motion estimation model based on neural network. We simplify the matching criterion for the block matching algorithm to reduce the hardware complexity and a number of input ports w...

The paper describes an approach to vehicle detection and tracking fully based on the Block Matching Algorithm (BMA), which is the motion estimation algorithm employed in the MPEG compression standard. BMA partitions the current frame in small, fixed size blocks and matches them in the previous frame in order to estimate blocks displacement (referred to as motion vectors) between two successive ...

This paper describes a computationally adaptive motion estimation algorithm by exploiting the spatial-temporal motion correlation characteristics of the video sequence. In our approach, a set of initial candidate MV’s include center block and four neighboring blocks at the same location from the previous frame are used to track the motion of the current block. Among the set of initial MV candid...

In this paper, a lightweight genetic search algorithm (LGSA) is proposed. Different evolution schemes are investigated, such that the control overheads are largely reduced. It is also shown that the proposed LGSA can be viewed as a novel expansion of the three-step search algorithm (TSS). It can be seen from the simulation results that the performance of LGSA is very similar to that of FSA, and...

Motion estimation is a computation-intensive procedure used in many coding schemes such as MPEG and H.261 to remove temporal redundancy in image sequences. In this paper, we describe an algorithm which can reduce computation significantly and achieve close-to-optimal performance in mean absolute difference(MAD) sense. In contrast with the conventional exhaustive search in pixel domain, we searc...

Motion estimation (ME) using bit-plane matching (BPM) algorithm has been proposed. The bit-plane matching algorithm transforms original images into bit-planes and performs a fast block matching process using the bit-planes. Two-bit transform (2BT) transforms an image frame into two bit planes with local window mean and variance values as threshold values. Constrained two-bit transform (C2BT) wa...

This paper applies ideas from fractal compression and optimization theory to attack the problem of e cient content-based image indexing and retrieval. Similarity of images is measured by block matching after optimal (geometric, photometric, etc.) transformation. Such block matching which, by de nition, consists of localized optimization, is further governed by a global dynamic programming techn...