We present a new deformable template based technique for recovering depth information from two or more images. The basic idea of our method is to use 3-D planar patches as the primitives describing the surfaces in a scene. In order to recover the depth information of a planar patch, two constraints on the view-line and the imaging geometry, and a deformable template matching based hypothesis-an...

We consider the general problem of matching a subspace to a signal in R that has been observed indirectly (compressed) through a random projection. We are interested in the case where the collection of K-dimensional subspaces is continuously parameterized, i.e. naturally indexed by an interval from the real line, or more generally a region of R. Our main results show that if the dimension of th...

Shape template matching is an important approach in object detection and recognition. In this paper, we propose a fast and novel object detection method, which represents edge map contours with salient points and retrieves the target object by using a backtracking method with two stages from coarse matching to fine matching. Our method has two main contributions. One is we propose the way to re...

The authors regret that Table 2 contains an error in the original article, the correct table appears below. The authors would like to apologise for any inconvenience caused.

Several methods aimed at effectively speeding up the block matching and template matching tasks have been recently proposed. A class of these methods, referred to as exhaustive due to the fact that they optimally solve the minimization problem of the matching cost, often deploys a succession of bounding functions based on a partitioning of the template and subwindow to perform rapid and reliabl...

In this paper we present a novel dense matching algorithm that relies on sparse stereo data in order to build a dense disparity map. The algorithm uses a recursive updating scheme to estimate the dense stereo data using various interpolation techniques. The major problem of classical template matching techniques is their reliance on a fixed template shape and poor performance around untextured ...

In a two-dimensional pattern matching problem, a known template image has be located in another image, irrespective of the template's position, orientation and size in the image. One way to accomplish invariance to the changes in the template is by forming a set of feature vectors that encompass all the variations in the template. Matching is then performed by finding the best similarity betwee...

In the coming ubiquitous-computing society, an eyegaze interface will be one of the key technologies as an input device. Most of the conventional eyegaze tracking algorithms require specific light sources, equipments, devices, etc. In a previous work, the authors developed a simple eye-gaze detection system using a monocular video camera. This paper proposes a fast eye-gaze detection algorithm ...

In this paper, a coherence function technique is introduced for Tangible Acoustic Interfaces (TAI) using the Location Template Matching (LTM) approach. A simple workflow is proposed for the purpose of evaluating the performance of different TAI techniques and investigating the effect of various parameters based on experimental data. Performance analysis shows that the method of magnitude square...

This paper addresses a problem of robust, accurate and fast object detection in complex environments, such as cluttered backgrounds and low-quality images. A new method called Statistical Template Matching is proposed to detect objects, represented by a set of template regions. A similarity measure between the image and a template is derived from the Fisher criterion. We show how to apply our m...