686 search results - page 3 / 138 » View Matching for Outer-Join Views |
100
click to vote
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
We propose a graph-based semi-supervised symmetric matching framework that performs dense matching between two uncalibrated wide-baseline images by exploiting the results of sparse...
69
Voted
IVC
2000
14 years 9 months ago
2000
Feature matching is a prerequisite to a wide variety of vision tasks. This paper presents a method that addresses the problem of matching disparate views of coplanar points and li...
ICCV
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper describes a PDE-based method for dense depth extraction from multiple wide-baseline images. Emphasis lies on the usage of only a small amount of images. The integration...
ICPR
2010
IEEE
15 years 23 days ago
2010
IEEE
This paper proposes a method for computing a quasi-dense set of matching points between three views of a scene. The method takes a sparse set of seed matches between pairs of view...
ICFP
2010
ACM
14 years 10 months ago
2010
ACM
Bidirectional programming languages are a practical approach to the view update problem. Programs in these languages, called lenses, define both a view and an update policy--i.e.,...