An improved algorithm for fast motion estimation based on the block matching algorithm (BMA) is presented for use in a blockbased video coding system. To achieve enhanced motion estimation performance, we propose an adaptive search pattern length for each iteration for the current macro block (MB). In addition, search points that must be checked are determined by means of directional informatio...

Recently the camera resolution has been highly increased, and the registration between high-resolution images is computationally expensive even by using hierarchical block matching. This paper presents a novel optimized hierarchical block matching algorithm in which the computational cost is minimized for the scale factor and the number of levels in the hierarchy. The algorithm is based on a ge...

The popular Biometric used to authenticate a person is Fingerprint which is unique and permanent throughout a person’s life. A minutia matching is widely used for fingerprint recognition and can be classified as ridge ending and ridge bifurcation. In this paper we projected Fingerprint Recognition using Minutia Score Matching method (FRMSM). For Fingerprint thinning, the Block Filter is used, w...

In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...

Overlapped block-matching motion compensation (OBM) enhances the prediction results of classical non-overlapped block-matching in the context of video compression significantly and is especially well suited for wavelet-based video coding. However, this is achieved at a high additional computational cost. We investigate possibilities for parallelization of two classical OBM algorithms and invest...

Recently developed object-based video coding schemes require the estimation of motion in arbitrary-shaped objects. A quad-tree structured variable size block matching technique is described. The inherent motion is represented by significantly fewer blocks than if conventional fixed size block matching had been used to provide a similar quality prediction.

Block-Matching motion compensation is one of the key technologies in current video coding standards and requires about 70% of the overall execution time. Therefore, parallelization of video coding always involves parallelization of block-matching motion compensation. In this work we use this communication intensive application to show the limitations of cluster computing as compared to shared m...

Local image matching (block-matching) is a frequent operation in many image processing tasks, such as MPEG compression and the estimation of optical flow and stereo disparities. Normalized cross-correlation (NCC) is particularly useful since it is insensitive to both signal strength and level. However, NCC is computationally expensive. In this article we attempt to speed up NCC first by transfo...

Video data are rich sources of information and in order to make these data, the information content of the data has to be analyzed. A frame of video sequence at a boundary point of a shot differs in background and content from its successive frame that belongs to the next shot. Block Matching Algorithm is used to detect shot in video sequences. Vast number of Matching Algorithm have been propos...