Greedy graph matching provides us with a fast way to coarsen a graph during graph partitioning. Direct algorithms on the CPU which perform such greedy matchings are simple and fast, but offer few handholds for parallelisation. To remedy this, we introduce a fine-grained shared-memory parallel algorithm for maximal greedy matching, together with an implementation on the GPU, which is faster (spe...

This paper introduces the concept of geo-consistency to overcome the occlusion problems associated with wide-baseline multiple-camera stereo. By expressing more formally the geometric relationship between occlusion and visibility, it provides a new tool to understand and compare the behavior of stereo algorithms. In this context, we present a new visibility mask handling that can render most re...

A fast block-matching algorithm for motion estimation is described for interframe image coding. Utilizing the fact that the motion is searched by a macroblock basis while the compression is performed by a block basis in many video compression standards, the proposed algorithm produces high PSNR and fast computation while keeping the bit-rate as low as those of conventional fast algorithms. The ...

We propose Fast Eigen Matching, a method for accelerating the matching and learning processes of the eigenspace method for rotation invariant template matching (RITM). Correlation-based template matching is one of the basic techniques used in computer vision. Among them, rotation invariant template matching (RITM), which locates a known template in a query irrespective of the template’s transla...

The application of state-of-the-art history matching methods to large heterogeneous reservoirs is hampered by two main problems: (1) reservoir models should be constrained jointly to dynamic data and a large variety of geological continuity information, (2) CPU demand should not be prohibitive for large models. This paper proposes a method contributing to alleviating these two main concerns. By...

Reservoir modeling is a critical step in the planning and development of oil fields. Before a reservoir model can be accepted for forecasting future production, the model has to be updated with historical production data. This process is called history matching. History matching requires computer flow simulation, which is very time-consuming. As a result, only a small number of simulation runs ...

We consider the template matching problem, in which one wants to find all good enough occurrences of a pattern template P from a larger image I . The current standard of template matching is based on cross correlation computed in Fourier domain, using the Fast Fourier Transform (FFT). This can be extended to rotations of the template by a suitable rotational sampling of the template. An alterna...

Authentication time is the main and important part of the authentication system. Normally the response time should be fast but as the number of persons in the database increases, there is probability of more response time taken for authentication. The need of fast authentication system arises so that authentication time (matching time) is very less. This paper proposes a sliding window approach...