Sciweavers

1814 search results - page 44 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
ICCV
2009
IEEE
13 years 6 months ago
SCRAMSAC: Improving RANSAC's efficiency with a spatial consistency filter
Geometric verification with RANSAC has become a crucial step for many local feature based matching applications. Therefore, the details of its implementation are directly relevant...
Torsten Sattler, Bastian Leibe, Leif Kobbelt
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 9 months ago
Succinct Geometric Indexes Supporting Point Location Queries
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...
Prosenjit Bose, Eric Y. Chen, Meng He, Anil Mahesh...
DSP
2007
13 years 9 months ago
Short-time phase spectrum in speech processing: A review and some experimental results
Incorporating information from the short-time phase spectrum into a feature set for automatic speech recognition (ASR) may possibly serve to improve recognition accuracy. Currentl...
Leigh D. Alsteris, Kuldip K. Paliwal
ICPR
2010
IEEE
13 years 9 months ago
A Discrete Labelling Approach to Attributed Graph Matching Using SIFT Features
Local invariant feature extraction methods are widely used for image-features matching. There exist a number of approaches aimed at the refinement of the matches between image-fe...
Gerard Sanromà, René Alquézar...
IPL
2006
69views more  IPL 2006»
13 years 9 months ago
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
André Große, Jörg Rothe, Gerd We...