【24h】

Spatial Keypoint Representation for Visual Object Retrieval

机译:用于可视对象检索的空间关键点表示

获取原文

摘要

This paper presents a concept of an object pre-classification method based on image keypoints generated by the SURF algorithm. For this purpose, the method uses keypoints histograms for image serialization and next histograms tree representation to speed-up the comparison process. Presented method generates histograms for each image based on localization of generated keypoints. Each histogram contains 72 values computed from keypoints that correspond to sectors that slice the entire image. Sectors divide image in radial direction form center points of objects that are the subject of classification. Generated histograms allow to store information of the object shape and also allow to compare shapes efficiently by determining the deviation between histograms. Moreover, a tree structure generated from a set of image histograms allows to further speed up process of image comparison. In this approach each histogram is added to a tree as a branch. The sub tree is created in a reverse order. The last element of the lowest level stores the entire histogram. Each next upper element is a simplified version of its child. This approach allows to group histograms by their parent node and reduce the number of node comparisons. In case of not matched element, its entire subtree is omitted. The final result is a set of similar images that could be processed by more complex methods.
机译:本文介绍了基于冲浪算法生成的图像关键点的对象预分类方法的概念。为此目的,该方法使用KeyPoints为图像序列化的直方图和下一个直方图树表示,以加快比较过程。呈现的方法基于生成的关键点的本地化生成每个图像的直方图。每个直方图包含从对应于切割整个图像的扇区的关键点计算的72个值。扇区在径向方向形式中划分图像的对象的中心点,这是分类的主题。生成的直方图允许存储对象形状的信息,并且还可以通过确定直方图之间的偏差有效地比较形状。此外,从一组图像直方图产生的树结构允许进一步加速图像比较的过程。在这种方法中,每个直方图都作为分支添加到树中。子树以相反的顺序创建。最低级别的最后一个元素存储整个直方图。每个下一个上部元素都是其孩子的简化版本。该方法允许由其父节点组的直方图并减少节点比较的数量。如果元素不匹配,则省略其整个子树。最终结果是可以通过更复杂的方法处理的一组类似图像。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号