Visual tracking is very important for many applications in computer vision, such as traac control, intelligent surveillance, industry automation, human computer interaction, etc. In this paper, we propose a hierarchical framework for estimating displacement vectors at feature points with the coarse-tone block matching method. Feature points are chosen to be the image locations having large curv...

Almost all existing approaches towards video coding exploit the temporal redundancy by block-matching-based motion estimation and compensation. Regardless of its popularity, block matching still reflects an ad hoc understanding of the relationship between motion and intensity uncertainty models. In this paper, we present a novel backward adaptive approach, named “leastsquare prediction” (LSP), ...

Because general algorithms seldom detect copy-move forgery with angle rotation and block matching algorithms are very time-consuming, this paper proposes a detection algorithm which is able to detect copymove forgery with rotation of certain angles by using the direction invariance of the circular projection vector. At the same time, considering the influence of random noise and brightness chan...

The Rate Constrained Block Matching Algorithm, (RC-BMA), introduced in this paper, jointly minimizes Displaced Frame Di erence (DFD) variance and entropy or conditional entropy of motion vectors for determining the motion vectors. It is intended for use in low rate video coding applications where the contribution of the motion vector rate to the overall coding rate might be signi cant. The DFD ...

This paper presents methods for recovering accurate binocular disparity estimates in the vicinity of 3D surface discontinuities. Of particular concern are methods that impact coarse-to-fine, block matching as it forms the basis of the fastest and resource efficient disparity estimation procedures. Two advances are put forth. First, a novel approach to coarse-to-fine processing is presented that...

A method is presented for fast interpolation between medical images. The method is intended for both slice and projective interpolation. It allows offline interpolation between neighboring slices in tomographic data. Spatial correspondence between adjacent images is established using a block matching algorithm. Interpolation of image intensities is then carried out by morphing between the image...

Motion estimation is a key technique in most algorithms for video compression and particularly in the MPEG and H.261 standards. The most frequently used technique is based on a Full Search Block Matching Algorithm which is highly computing intensive and requires the use of special purpose architectures to obtain real-time performance. In this paper we propose an approach to the parallel impleme...

Apart from robustness and accuracy of copy–paste image forgery detection, time complexity also plays an important role to evaluate the performance of the system. In this paper, the focus point is to improve time complexity of the block-matching algorithm. Hence, a coarse-to-fine approach is applied to propose an enhanced duplicated region detection model by using sequential block clustering. Cl...

This paper introduces a block based motion estimation algorithm based on projection with adaptive window size selection. The blocks cannot match well if their corresponding 1D projection does not match well, with this as foundation 2D block matching problem is translated to a simpler 1D matching, which eliminates majority of potential pixel participation. This projection method is combined with...