221 search results - page 29 / 45 » Detection and matching of rectilinear structures |
ACCV
2006
Springer
14 years 3 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...
SSPR
2004
Springer
14 years 3 months ago
2004
Springer
Kernel Methods are a class of algorithms for pattern analysis with a number of convenient features. They can deal in a uniform way with a multitude of data types and can be used to...
SCIA
2009
Springer
14 years 2 months ago
2009
Springer
Features from the Scale Invariant Feature Transformation (SIFT) are widely used for matching between spatially or temporally displaced images. Recently a topology on the SIFT featu...
DAC
1996
ACM
14 years 2 months ago
1996
ACM
The testability of basic DSP datapath structures using pseudorandom built-in self-test techniques is examined. The addition of variance mismatched signals is identified as a testi...
JVCA
2008
13 years 9 months ago
2008
Imagine an object such as a paper sheet being waved in front of some sensor. Reconstructing the time-varying 3D shape of the object finds direct applications in computer animation...