Sciweavers

2127 search results - page 6 / 426
» Computing large matchings fast
Sort
View
IJCV
2008
173views more  IJCV 2008»
14 years 11 months ago
Fast Non-Rigid Surface Detection, Registration and Realistic Augmentation
We present a real-time method for detecting deformable surfaces, with no need whatsoever for a priori pose knowledge. Our method starts from a set of wide baseline point matches be...
Julien Pilet, Vincent Lepetit, Pascal Fua
ICCV
1998
IEEE
16 years 1 months ago
Depth Discontinuities by Pixel-to-Pixel Stereo
Proceedings of the 1998IEEE International Conference on Computer Vision, Bombay, India An algorithm to detect depth discontinuities from a stereo pair of images is presented. The ...
Stan Birchfield, Carlo Tomasi
PVLDB
2010
136views more  PVLDB 2010»
14 years 10 months ago
SigMatch: Fast and Scalable Multi-Pattern Matching
Multi-pattern matching involves matching a data item against a large database of “signature” patterns. Existing algorithms for multipattern matching do not scale well as the s...
Ramakrishnan Kandhan, Nikhil Teletia, Jignesh M. P...
81
Voted
ACCV
2006
Springer
15 years 5 months ago
Image Matching by Multiscale Oriented Corner Correlation
In this paper we present a simple but effective method for matching two uncalibrated images. Feature points are firstly extracted in each image using a fast multiscale corner det...
Feng Zhao, Qingming Huang, Wen Gao
78
Voted
ISAAC
2009
Springer
133views Algorithms» more  ISAAC 2009»
15 years 6 months ago
Computing Large Matchings in Planar Graphs with Fixed Minimum Degree
Robert Franke, Ignaz Rutter, Dorothea Wagner