This article presents a signal matching algorithm that can select an appropriate window size
adaptively so as to obtain both precise and stable estimation of correspondences. Matching …

A central problem in stereo matching by computing correlation or sum of squared differences
(SSD) lies in selecting an appropriate window size. The window size must be large enough …

Image-matching applications, such as tracking and stereo, commonly use the sum-of-
squared-difference (SSD) measure to determine the best match. However, this measure is …

The purpose of this work is to develop a stereo matching algorithm that produces a dense
disparity map for a real time vision system. Generally, correlation-based correspondence …

A stereo matching method that uses multiple stereo pairs with various baselines generated
by a lateral displacement of a camera to obtain precise distance estimates without suffering …

Stereo matching is an ill-posed problem for at least two principal reasons:(1) because of the
random nature of match similarity measure and (2) because of structural ambiguity due to …

The general approach to matching two scenes by a digital computer is usually costly in
computations. A match is determined by selecting the position of maximum cross correlation …

One of the central problems in stereo matching (and other image registration tasks) is the
selection of optimal window sizes for comparing image regions. This paper addresses this …

Image registration finds a variety of applications in computer vision. Unfortunately, traditional
image registration techniques tend to be costly. We present a new image registration …

This correspondence describes research in the development of symbolic registration
techniques directed toward the comparison of pairs of images of the same scene to …