%0 Conference Paper
%B Proceedings of the Seventh Indian Conference on Computer Vision, Graphics and Image Processing
%D 2010
%T Nearest-neighbor search algorithms on non-Euclidean manifolds for computer vision applications
%A Turaga,Pavan
%A Chellapa, Rama
%K Grassmann manifold
%K hashing
%K manifold
%K nearest-neighbor
%K region covariance
%K shapes
%X Nearest-neighbor searching is a crucial component in many computer vision applications such as face recognition, object recognition, texture classification, and activity recognition. When large databases are involved in these applications, it is also important to perform these searches in a fast manner. Depending on the problem at hand, nearest neighbor strategies need to be devised over feature and model spaces which in many cases are not Euclidean in nature. Thus, metrics that are tuned to the geometry of this space are required which are also known as geodesics. In this paper, we address the problem of fast nearest neighbor searching in non-Euclidean spaces, where in addition to dealing with the large size of the dataset, the significant computational load involves geodesic computations. We study the applicability of the various classes of nearest neighbor algorithms toward this end. Exact nearest neighbor methods that rely solely on the existence of a metric can be extended, albeit with a huge computational cost. We derive an approximate method of searching via approximate embeddings using the logarithmic map. We study the error incurred in such an embedding and show that it performs well in real experiments.
%B Proceedings of the Seventh Indian Conference on Computer Vision, Graphics and Image Processing
%S ICVGIP '10
%I ACM
%C New York, NY, USA
%P 282 - 289
%8 2010///
%@ 978-1-4503-0060-5
%G eng
%U http://doi.acm.org/10.1145/1924559.1924597
%R 10.1145/1924559.1924597