Sciweavers

93 search results - page 4 / 19
» A Bayesian Approach to the Stereo Correspondence Problem
Sort
View
CVPR
2001
IEEE
14 years 9 months ago
Geometric Blur for Template Matching
We address the problem of finding point correspondences in images by way of an approach to template matching that is robust under affine distortions. This is achieved by applying ...
Alexander C. Berg, Jitendra Malik
ICPR
2000
IEEE
14 years 8 months ago
Using Geometric Constraints for Matching Disparate Stereo Views of 3D Scenes Containing Planes
Several vision tasks rely upon the availability of sets of corresponding features among images. This paper presents a method which, given some corresponding features in two stereo...
Manolis I. A. Lourakis, Stavros V. Tzurbakis, Anto...
ICIAP
1999
ACM
13 years 11 months ago
Bayesian Graph Edit Distance
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matchi...
Richard Myers, Richard C. Wilson, Edwin R. Hancock
ECCV
2002
Springer
14 years 9 months ago
Diffuse-Specular Separation and Depth Recovery from Image Sequences
Specular reflections present difficulties for many areas of computer vision such as stereo and segmentation. To separate specular and diffuse reflection components, previous approa...
Stephen Lin, Yuanzhen Li, Sing Bing Kang, Xin Tong...
CVPR
2004
IEEE
14 years 9 months ago
Segment-Based Stereo Matching Using Graph Cuts
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
Li Hong, George Chen