Motion estimation is a key problem in video processing and computer vision. Optical flow motion estimation can achieve high estimation accuracy when motion vector is small. Three-step search algorithm can handle large motion vector but not very accurate. A joint algorithm was proposed in this paper to achieve high estimation accuracy disregarding whether the motion vector is small or large, and...

background: the aim of the present study was to evaluate how left ventricular twist and torsion are associated with sex between sex groups of the same age. materials and methods : twenty one healthy subjects were scanned in left ventricle basal and apical short axis views to run the block matching algorithm; instantaneous changes in the base and apex rotation angels were estimated by this algor...

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...

The paper aims at developing a hierarchical algorithm for matching a given template of × on an image of × pixels partitioned into equal sized blocks of × pixels. The algorithm employs a fuzzy metric to measure the dispersion of individual feature of a block with respect to that of the template. A fuzzy threshold, preset by the user, is employed to restrict less likely blocks from participation ...

template matching is a widely used technique in many of image processing and machine vision applications. in this paper we propose a new as well as a fast and reliable template matching algorithm which is invariant to rotation, scale, translation and brightness (rstb) changes. for this purpose, we adopt the idea of ring projection transform (rpt) of image. in the proposed algorithm, two novel s...

Block matching motion estimation was one of the most important modules in the design of any video encoder. It consumed more than 85% of video encoding time due to searching of a candidate block in the search window of the reference frame. To minimize the search time on block matching, a simplified and efficient Block Matching Algorithm for Fast Motion Estimation was proposed. It had two steps s...

Block matching motion estimation algorithms have been developed for very different applications in image processing. In recent years, the variable block-size (VBS) motion estimation has been widely employed to improve the performance of the block matching algorithm. In this paper, we compare the performance of several variable block-size motion estimation algorithms based on merge and split pro...

Introduction: The most popular algorithm for the VLSI implementation of motion estimation is the block-based full-search algorithm [1–3]. However, the full-search algorithm notoriously needs high computation load and large memory size. The high computational cost has become a major problem in the implementation of motion estimation. Many papers have proposed different ways to reduce the computa...

In this paper, we propose an expert-system based parallel multi-1-dimensional block matching algorithm (ESPM-1D-BMA) for motion estimation (ME). Instead of the conventional 2D block matching, we employ the parallel multi-1D blocks matching to improve the computing speed. To improve the ME accuracy, we design a knowledge base and inference engine to determine the true motion vector (MV) from the...

The Motion estimation is an effective method for removing temporal redundancyfound in video sequence compression. Block Matching algorithm has been widely used in motion estimation and a number of fast algorithms have proposed to reduce the computational complexity of BMA. In this paper we propose a new search strategy for fast block matching based on Four-Neighborhood Search (FNS) and fast com...