Sciweavers

1337 search results - page 69 / 268
» Fast computation of distance estimators
Sort
View
ICPR
2010
IEEE
15 years 6 months ago
A Constant Average Time Algorithm to Allow Insertions in the LAESA Fast Nearest Neighbour Search Index
Abstract—Nearest Neighbour search is a widely used technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. However, most of...
Luisa Micó, José Oncina
CVPR
2000
IEEE
16 years 8 months ago
Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
Song Chun Zhu, Xiuwen Liu
ICCV
2009
IEEE
15 years 4 months ago
Non-iterative approach for fast and accurate vanishing point detection
We present an algorithm that quickly and accurately estimates vanishing points in images of man-made environments. Contrary to previously proposed solutions, ours is neither itera...
Jean-Philippe Tardif
ACIVS
2008
Springer
16 years 20 days ago
Blur and Contrast Invariant Fast Stereo Matching
We propose a novel approach for estimating a depth-map from a pair of rectified stereo images degraded by blur and contrast change. At each location in image space, information is...
Matteo Pedone, Janne Heikkilä
FOCS
2009
IEEE
16 years 1 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu