Sciweavers

133 search results - page 24 / 27
» Approximate Nearest Subspace Search
Sort
View
COMPGEOM
2004
ACM
14 years 1 months ago
Deformable spanners and applications
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
Jie Gao, Leonidas J. Guibas, An Nguyen
3DIM
2007
IEEE
14 years 2 months ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 7 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
ICASSP
2010
IEEE
13 years 7 months ago
A novel estimation of feature-space MLLR for full-covariance models
In this paper we present a novel approach for estimating featurespace maximum likelihood linear regression (fMLLR) transforms for full-covariance Gaussian models by directly maxim...
Arnab Ghoshal, Daniel Povey, Mohit Agarwal, Pinar ...
ICCV
2005
IEEE
14 years 9 months ago
Object Recognition in High Clutter Images Using Line Features
We present an object recognition algorithm that uses model and image line features to locate complex objects in high clutter environments. Finding correspondences between model an...
Philip David, Daniel DeMenthon