The paper aims at developing a hierarchical algorithm for matching a given template of m × non an image of M × N pixels partitioned into equal sized blocks of m × n 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 par...

This paper presents a patch-based image filtering algorithm for additive noise reduction. Our algorithm is a modification to the block matching 3D algorithm, where an adaptive thresholding was used for the collaborative hardthresholding step. The collaborative Wiener filtering step was also modified by assigning more weights for similar patches. Experimental results show that our algorithm outp...

Block matching motion estimation is the essence of video coding systems. Therefore, development of an efficient method for fast motion estimation is the basic requirement of the video encoder design. Block based motion estimation algorithms are used to reduce the memory requirements of any video file and also decrease computational complexity. We have been presented here some block matching alg...

The main purpose of this paper was to introduce an efficient algorithm for fault identification in fruits images. First, input image was de-noised using the combination of Block Matching and 3D filtering (BM3D) and Principle Component Analysis (PCA) model. Afterward, in order to reduce the size of images and increase the execution speed, refined Discrete Cosine Transform (DCT) algorithm was uti...

A multilevel motion model-based approach to ultrasonic speckle tracking has been developed that addresses the inherent trade-offs associated with traditional single-level block matching (SLBM) methods. The multilevel block matching (MLBM) algorithm uses variable matching block and search window sizes in a coarse-to-fine scheme, preserving the relative immunity to noise associated with the use o...

This paper proposes a fast block-matching algorithm that uses three fast matching error measures, besides the conventional mean-absolute error (MAE) or mean-square error (MSE). An incoming reference block in the current frame is compared to candidate blocks within the search window using multiple matching criteria. These three fast matching error measures are established on the integral project...

Many fast block-matching algorithms reduce computations by limiting the number of checking points. They can achieve high computation reduction, but often result in relatively higher matching error compared with the full-search algorithm. In this letter, a novel fast block-matching algorithm named normalized partial distortion search is proposed. The proposed algorithm reduces computations by us...

An important problem when using the Block Matching Algorithm to track objects is how to update the reference block to take account of the changing target appearance. This paper investigates and reports on the accuracy and stability of a variety of update strategies and on the robustness of these strategies to image noise. These strategies are applicable where an object is being tracked using th...

This Master thesis deals with an approach for 2D-3D pose estimation, which relies on texture information on the surface mesh of an object model. The textured surface mesh is projected in a virtual image, and a block matching algorithm is employed to determine correspondences between midpoints of surface patches to the image data. To facilitate this purpose, the block matching algorithm needs to...