741 search results - page 142 / 149 » Correspondence-free Structure from Motion |
135
Voted
COMPGEOM
2005
ACM
15 years 3 months ago
2005
ACM
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...
COMGEO
2010
ACM
15 years 1 months ago
2010
ACM
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
115
click to vote
ESA
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
108
click to vote
ECCV
2008
Springer
16 years 3 months ago
2008
Springer
Assumptions of brightness constancy and spatial smoothness underlie most optical flow estimation methods. In contrast to standard heuristic formulations, we learn a statistical mod...
154
click to vote
ECCV
2010
Springer
15 years 2 months ago
2010
Springer
We present a fast, simple location recognition and image localization method that leverages feature correspondence and geometry estimated from large Internet photo collections. Suc...