Sciweavers

233 search results - page 22 / 47
» An Investigation of Practical Approximate Nearest Neighbor A...
Sort
View
3DIM
2003
IEEE
15 years 4 months ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick
CVPR
2007
IEEE
16 years 2 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell
139
Voted
TIFS
2008
157views more  TIFS 2008»
15 years 9 days ago
Subspace Approximation of Face Recognition Algorithms: An Empirical Study
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi, ...
122
Voted
VTC
2008
IEEE
218views Communications» more  VTC 2008»
15 years 6 months ago
Performance Analysis of a System using Coordinate Interleaving and Constellation Rotation in Rayleigh Fading Channels
Abstract— Diversity can play an important role in the performance improvement of a communication system in fading channels. The achievable performance with signal space diversity...
Nauman F. Kiyani, Jos H. Weber, Alenka G. Zajic, G...
ISNN
2010
Springer
14 years 11 months ago
Pruning Training Samples Using a Supervised Clustering Algorithm
As practical pattern classification tasks are often very-large scale and serious imbalance such as patent classification, using traditional pattern classification techniques in ...
Minzhang Huang, Hai Zhao, Bao-Liang Lu