Results 1  10
of
3,410,877
The Correspondence Problem
, 1998
"... The identification of any form of social learning, imitation, copying or mimicry presupposes a notion of correspondence between two autonomous agents. Judging whether a behavior has been transmitted socially requires the observer to identify a mapping between the demonstrator and the imitator. If th ..."
Abstract

Cited by 56 (10 self)
 Add to MetaCart
presuppose different correspondences. If a child watches a teacher solving subtraction problems in arithmetic, and then solves for the first time similar but not identical problems on its own, social learning has occurred. But what type of correspondence is at work here? In China and Japan, the ideographic
Correspondence Problem
"... § Use differences between images in our left and right eye § How much is this difference for a car at 100 m? • Move our head sideways § Or, the scene is moving § Or we are moving in a car • We know the size and shape of objects § Traffic lights, car headlights and taillights 1 2 Headlights in the Da ..."
Abstract
 Add to MetaCart
§ Use differences between images in our left and right eye § How much is this difference for a car at 100 m? • Move our head sideways § Or, the scene is moving § Or we are moving in a car • We know the size and shape of objects § Traffic lights, car headlights and taillights 1 2 Headlights in the Dark • A robot could evaluate its distance from incoming cars at night partly from a model of cars § Distance between headlights known 2 m Object Pose with 1D Image Plane • What happens if we don’t know object’s angle? D
correspondence problem
, 2000
"... Abstract. We examine how differently oriented components contribute to the discrimination of motion direction along a horizontal axis. Stimuli were twoframe randomdot kinematograms that were narrowband filtered in spatial frequency. On each trial, subjects had to state whether motion was to the le ..."
Abstract
 Add to MetaCart
Abstract. We examine how differently oriented components contribute to the discrimination of motion direction along a horizontal axis. Stimuli were twoframe randomdot kinematograms that were narrowband filtered in spatial frequency. On each trial, subjects had to state whether motion was to the left or the right. For each stimulus condition, Dmax (the largest displacement supporting 80 % correct direction discrimination performance) was measured. In experiment 1, Dmax was measured for orientationally narrowband stimuli as a function of their mean orientation. Dmax was found to increase as the orientation of the stimuli became closer to the axis of motion. Experiment 2 used isotropic stimuli in which some orientation bands contained a coherent motion signal, and some contained only noise. When the noise band started at vertical orientations and increased until only horizontal orientations contained a coherent motion signal, Dmax increased slightly. This suggests that nearvertical orientations interfere with motion perception at large displacements when they contain a coherent motion signal. When the noise band started at horizontal and increased until only vertical orientations contained the motion signal, Dmax decreased steadily. This implies that Dmax depends at least partly on the most horizontal motion signal in the stimulus. These results were contrasted with two models. In the first, the visual system utilises the most informative orientations (nearest horizontal). In the second, all available orientations are used equally. Results supported an intermediate interpretation, in which all orientations are used but more informative ones are weighted more heavily. 1
A MaximumFlow Formulation of the Ncamera Stereo Correspondence Problem
, 1998
"... This paper describes a new algorithm for solving the Ncamera stereo correspondence problem by transforming it into a maximumflow problem. Once solved, the minimumcut associated to the maximumflow yields a disparity surface for the whole image at once. This global approach to stereo analysis provi ..."
Abstract

Cited by 263 (4 self)
 Add to MetaCart
This paper describes a new algorithm for solving the Ncamera stereo correspondence problem by transforming it into a maximumflow problem. Once solved, the minimumcut associated to the maximumflow yields a disparity surface for the whole image at once. This global approach to stereo analysis
A spectral technique for correspondence problems using pairwise constraints
 In ICCV
, 2005
"... We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the potential correspondences and the weights on the links represent pairwise agreements between potential correspondences. Co ..."
Abstract

Cited by 254 (10 self)
 Add to MetaCart
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the potential correspondences and the weights on the links represent pairwise agreements between potential correspondences
The Correspondence Problem in Perspective Images
, 2003
"... This thesis proposal addresses the correspondence problem, especially matching of two views of a scene taken with unknown cameras from unknown and arbitrary viewpoints. This task is known under the name of Wide Baseline Stereo Matching. Our recent research related to this field is described and ..."
Abstract
 Add to MetaCart
This thesis proposal addresses the correspondence problem, especially matching of two views of a scene taken with unknown cameras from unknown and arbitrary viewpoints. This task is known under the name of Wide Baseline Stereo Matching. Our recent research related to this field is described
Post Correspondence Problem for . . .
, 2005
"... In the Post Correspondence Problem (PCP) an instance (h, g) consists of two morphisms h and g, and the problem is to determine whether or not there exists a word w such that h(w) =g(w). Here we prove that the PCP is decidable for instances with unique blocks and that the infinite PCP is decidable fo ..."
Abstract
 Add to MetaCart
In the Post Correspondence Problem (PCP) an instance (h, g) consists of two morphisms h and g, and the problem is to determine whether or not there exists a word w such that h(w) =g(w). Here we prove that the PCP is decidable for instances with unique blocks and that the infinite PCP is decidable
Corresponding problems in geometric vision
, 2009
"... This thesis concerns optimal methods for geometric vision problems. Two important contributions are the first optimal methods for camera pose estimation and two view geometry estimation with outliers. These methods, and others, are obtained by extending previous work on using graph methods and branc ..."
Abstract
 Add to MetaCart
and branch and bound to handle the correspondence problems arising in geometric vision. The thesis consists of the following papers:
Shape and the stereo correspondence problem
 International Journal of Computer Vision
, 2005
"... We examine the implications of shape on the process of finding dense correspondence and halfocclusions for a stereo pair of images. The desired property of the disparity map is that it should be a piecewise continuous function which is consistent with the images and which has the minimum number of ..."
Abstract

Cited by 34 (1 self)
 Add to MetaCart
We examine the implications of shape on the process of finding dense correspondence and halfocclusions for a stereo pair of images. The desired property of the disparity map is that it should be a piecewise continuous function which is consistent with the images and which has the minimum number
The Extended Linear Complementarity Problem
, 1993
"... We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity of the biline ..."
Abstract

Cited by 776 (28 self)
 Add to MetaCart
We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity
Results 1  10
of
3,410,877