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

This work presents a fast exhaustive robust matching technique for aligning translated images. The key idea is to express a robust matching surface function in terms of correlation operations. Speed is obtained from computing correlations in the frequency domain. Different sized images and arbitrary shapes may be matched. The method outputs a matching surface representing the quality of match a...

A computationally efficient method is presented - 'fast rotational matching' or FRM - that significantly accelerates the search of the three rotational degrees of freedom (DOF) in biomolecular matching problems. This method uses a suitable parametrization of the three-dimensional rotation group along with spherical harmonics, which allows efficient computation of the Fourier Transform of the ro...

Given a set of titles and a query, we want to find the title with the largest similarity to the query. The queries may contain spelling mistakes and words which are not part of the correct entry. Furthermore, no word separators in the query are expected and words of the correct title may be missing. Titles are usually short and consist of multiple words and numbers. We analyse several existing ...

Although it is well known that cross correlation can be efficiently implemented in the transform domain, the normalized form of cross correlation preferred for template matching applications does not have a simple frequency domain expression. Normalized cross correlation is usually computed in the spatial domain for this reason. This short paper shows that unnormalized cross correlation can be ...

In this paper we develop a correlation method for the template matching problem in pattern recognition which includes translations, rotations, and dilations in a natural way. The correlation method is implemented using Fourier analysis on the “discrete motion group” and fast Fourier transform methods. A brief introduction to Fourier methods on the discrete motion group is given and the efficien...

This article addresses the problem of twoand higher dimensional pattern matching, i.e. the identification of instances of a template within a larger signal space, which is a form of registration. Unlike traditional correlation, we aim at obtaining more selective matchings by considering more strict comparisons of gray-level intensity. In order to achieve fast matching, a nonlinear thresholded v...

History matching is an inverse problem of partial differential equation on mathematics. We adopt the constrained non-linear optimization to handle this problem, defining the objective function as the weighted square sum of differences between the wells simulation values and the corresponding observation values. We develop an optimization computing program that include Zoutendijk feasible direct...