计算机科学
k-最近邻算法
高斯分布
实施
图像(数学)
集合(抽象数据类型)
人工智能
任务(项目管理)
点(几何)
算法
模式识别(心理学)
数学
物理
经济
量子力学
管理
程序设计语言
几何学
作者
Neeraj Kumar,Li Zhang,Shree K. Nayar
标识
DOI:10.1007/978-3-540-88688-4_27
摘要
Many computer vision algorithms require searching a set of images for similar patches, which is a very expensive operation. In this work, we compare and evaluate a number of nearest neighbors algorithms for speeding up this task. Since image patches follow very different distributions from the uniform and Gaussian distributions that are typically used to evaluate nearest neighbors methods, we determine the method with the best performance via extensive experimentation on real images. Furthermore, we take advantage of the inherent structure and properties of images to achieve highly efficient implementations of these algorithms. Our results indicate that vantage point trees, which are not well known in the vision community, generally offer the best performance.
科研通智能强力驱动
Strongly Powered by AbleSci AI