Sciweavers

305 search results - page 13 / 61
» A Robust Interest Points Matching Algorithm
Sort
View
ECCV
2006
Springer
14 years 9 months ago
SURF: Speeded Up Robust Features
In this paper, we present a novel scale- and rotation-invariant interest point detector and descriptor, coined SURF (Speeded Up Robust Features). It approximates or even outperform...
Herbert Bay, Tinne Tuytelaars, Luc J. Van Gool
ICCV
2009
IEEE
13 years 5 months ago
Video scene categorization by 3D hierarchical histogram matching
In this paper we present a new method for categorizing video sequences capturing different scene classes. This can be seen as a generalization of previous work on scene classifica...
Paritosh Gupta, Sai Sankalp Arrabolu, Mathew Brown...
ECCV
2004
Springer
14 years 9 months ago
Hand Motion from 3D Point Trajectories and a Smooth Surface Model
A method is proposed to track the full hand motion from 3D points reconstructed using a stereoscopic set of cameras. This approach combines the advantages of methods that use 2D mo...
Guillaume Dewaele, Frederic Devernay, Radu Horaud
INFORMATICALT
2008
139views more  INFORMATICALT 2008»
13 years 7 months ago
Fingerprint Minutiae Matching without Global Alignment Using Local Structures
This paper presents a method of minutiae based fingerprint matching that is robust to deformations and does not do fingerprint alignment. It concentrates on comparing rotation and ...
Andrej Kisel, Alexej Kochetkov, Justas Kranauskas
ISAAC
2007
Springer
183views Algorithms» more  ISAAC 2007»
14 years 2 months ago
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...