arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1509.06557cs.CV
收藏

基于环的局部多群二进制描述符池化配置及优化

Local Multi-Grouped Binary Descriptor with Ring-based Pooling Configuration and Optimization

Shenzhen Institute of Advanced Technology, Chinese Academy of Sciences(中国科学院深圳先进技术研究院);The Chinese University of Hong Kong(香港中文大学)

Yongqiang Gao, Weilin Huang, Yu Qiao

摘要:

局部二进制描述符由于其在计算速度上的巨大优势而受到越来越多的关注,它能够在许多图像/视觉应用中实现实时性能。已经提出了各种方法来学习数据相关的二进制描述符。然而,大多数现有的二进制描述符的目标过于在计算简单的代价是显着的信息丢失,导致歧义的相似性度量使用汉明距离。在本文中,考虑到多个功能可能会共享互补信息,我们提出了一种新的本地二进制描述符,称为基于环的多组描述符(RMGD),成功地弥合了当前的二进制和浮点描述符之间的性能差距。我们的贡献是双重的。首先,我们引入了一个新的池配置的基础上的空间环区域采样,允许涉及二进制测试的完整集的成对区域具有不同的形状,尺度和距离。这导致比现有方法更有意义的描述,现有方法通常应用有限的池化配置集。然后,提出了一种扩展的Adaboost,通过强调高方差和低相关性来进行有效的比特选择,实现了高度紧凑的表示。其次,RMGD计算从多个图像属性中提取的二进制字符串。我们将多组特征融合问题转化为rankSVM或稀疏SVM学习问题,使得不同特征之间能够相互补偿,这是提高分类器区分度和鲁棒性的关键。RMGD的性能进行了评估,在一些公开的基准,RMGD优于国家的最先进的二进制描述符显着。

英文摘要:

Local binary descriptors are attracting increasingly attention due to their great advantages in computational speed, which are able to achieve real-time performance in numerous image/vision applications. Various methods have been proposed to learn data-dependent binary descriptors. However, most existing binary descriptors aim overly at computational simplicity at the expense of significant information loss which causes ambiguity in similarity measure using Hamming distance. In this paper, by considering multiple features might share complementary information, we present a novel local binary descriptor, referred as Ring-based Multi-Grouped Descriptor (RMGD), to successfully bridge the performance gap between current binary and floated-point descriptors. Our contributions are two-fold. Firstly, we introduce a new pooling configuration based on spatial ring-region sampling, allowing for involving binary tests on the full set of pairwise regions with different shapes, scales and distances. This leads to a more meaningful description than existing methods which normally apply a limited set of pooling configurations. Then, an extended Adaboost is proposed for efficient bit selection by emphasizing high variance and low correlation, achieving a highly compact representation. Secondly, the RMGD is computed from multiple image properties where binary strings are extracted. We cast multi-grouped features integration as rankSVM or sparse SVM learning problem, so that different features can compensate strongly for each other, which is the key to discriminativeness and robustness. The performance of RMGD was evaluated on a number of publicly available benchmarks, where the RMGD outperforms the state-of-the-art binary descriptors significantly.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑