Sciweavers

2342 search results - page 218 / 469
» Sublinear geometric algorithms
Sort
View
CVPR
2005
IEEE
16 years 5 months ago
Shape Matching and Object Recognition Using Low Distortion Correspondences
We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up corres...
Alexander C. Berg, Tamara L. Berg, Jitendra Malik
140
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
120
Voted
ICCV
2009
IEEE
16 years 8 months ago
Optimal Correspondences from Pairwise Constraints
Correspondence problems are of great importance in computer vision. They appear as subtasks in many applications such as object recognition, merging partial 3D reconstructions a...
Olof Enqvist, Klas Josephson, Fredrik Kahl
CVPR
1999
IEEE
16 years 5 months ago
Image Interpolation by Joint View Triangulation
Creating novel views by interpolating prestored images or view morphing has many applications in visual simulation. We present in this paper a new method of automatically interpol...
Maxime Lhuillier, Long Quan
CVPR
2003
IEEE
16 years 5 months ago
Automated Feature-Based Range Registration of Urban Scenes of Large Scale
We are building a system that can automatically acquire 3D range scans and 2D images to build geometrically and photometrically correct 3D models of urban environments. A major bo...
Ioannis Stamos, Marius Leordeanu