2127 search results - page 66 / 426 » Computing large matchings fast |
117
Voted
ACCV
2006
Springer
15 years 9 months ago
2006
Springer
We propose a considerably faster approximation of the well known SIFT method. The main idea is to use efficient data structures for both, the detector and the descriptor. The detec...
127
Voted
ICASSP
2010
IEEE
15 years 3 months ago
2010
IEEE
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
161
Voted
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
Most existing structure from motion (SFM) approaches for unordered images cannot handle multiple instances of the same structure in the scene. When image pairs containing differen...
235
click to vote
ICDE
2002
IEEE
16 years 4 months ago
2002
IEEE
Network, web, and disk I/O traffic are usually bursty, self-similar [9, 3, 5, 6] and therefore can not be modeled adequately with Poisson arrivals[9]. However, we do want to model...
110
Voted
JMIV
2006
15 years 3 months ago
2006
Studying large deformations with a Riemannian approach has been an efficient point of view to generate metrics between deformable objects, and to provide accurate, non ambiguous an...