首页> 外文会议>International Conference on Pattern Recognition >Efficient Recognition of Planar Objects Based on Hashing of Keypoints - An Approach Towards Making the Physical World Clickable
【24h】

Efficient Recognition of Planar Objects Based on Hashing of Keypoints - An Approach Towards Making the Physical World Clickable

机译:基于关键点散列的平面对象的高效识别 - 一种使物理世界点击的方法

获取原文

摘要

This paper presents a method of planar object recognition for aiming at accessing information about objects by taking pictures of them. For this purpose efficiency of processing is the central issue because current state-of-the-art technologies with tree structures do not necessarily work well with a large amount of data represented as high dimensional vectors. To solve this problem, we employ hashing of keypoints extracted from images of objects. With the help of hash keys obtained as integers converted from the real valued vectors, keypoints are stored with object IDs and retrieved with no search process. Voting for object IDs is employed to determine a recognized object as the one with the largest vote. Experimental results show that the proposed method is at least 400 times faster than a brute-force method while 90% of objects were correctly recognized.
机译:本文介绍了一种平面对象识别,用于通过拍摄它们的照片来访问关于对象的信息。为此目的,处理效率是核心问题,因为具有树结构的当前最先进的技术不一定与表示为高维向量的大量数据工作。要解决此问题,我们使用从对象的图像中提取的关键点散列。借助从真数从真实值向量转换为整数的哈希键,KeyPoints存储在对象ID中并检索,没有搜索过程。用于对象ID的投票用于确定识别的对象作为投票最大的对象。实验结果表明,该方法比蛮力方法快至少400倍,而90%的物体被正确识别。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号