论文标题

快速关键点检测和树结构图像的匹配

Fast Key Points Detection and Matching for Tree-Structured Images

论文作者

Wang, Hao, Chen, Xiwen, Razi, Abolfazl, Amin, Rahul

论文摘要

本文根据具有树状图案的纳米分辨率视觉标识符的图像匹配提供了一种新的身份验证算法。该算法包括通过分形图案骨架贪婪提取的图像到树的转换以及匹配算法的定制图形,该算法可与成像伪像(例如缩放,旋转,刮擦和照明更改)相鲁and。所提出的算法适用于各种树结构的图像匹配,但我们的重点是叉石,最近开发的视觉标识符。树突的熵富含且无统一的与现有的2D和3D打印机,因为它们的自然随机性,纳米分辨率粒度和3D方面,使其成为安全应用程序(例如供应链跟踪和跟踪)的适当选择。与标准图像描述符匹配时,所提出的算法会改善。例如,由于相机传感器噪声而引起的图像不一致可能会导致意外的特征提取,从而导致树木转换和身份验证故障。同样,以前的树木提取算法会严格降低其对大型系统的可扩展性。在本文中,我们通过实现一种新的骨架提取方法,搜索算法的新关键点以及优化的匹配算法匹配的算法来加速[1]的当前问题,并通过实现新的骨架提取方法加速了高达10倍的关键点。使用最小封闭的圆圈和中心点,使算法可靠地选择图案形状。与[1]相比,我们的算法处理具有循环连接的通用图,因此适用于更广泛的应用范围,例如运输图分析,指纹和视网膜容器成像。

This paper offers a new authentication algorithm based on image matching of nano-resolution visual identifiers with tree-shaped patterns. The algorithm includes image-to-tree conversion by greedy extraction of the fractal pattern skeleton along with a custom-built graph matching algorithm that is robust against imaging artifacts such as scaling, rotation, scratch, and illumination change. The proposed algorithm is applicable to a variety of tree-structured image matching, but our focus is on dendrites, recently-developed visual identifiers. Dendrites are entropy rich and unclonable with existing 2D and 3D printers due to their natural randomness, nano-resolution granularity, and 3D facets, making them an appropriate choice for security applications such as supply chain trace and tracking. The proposed algorithm improves upon graph matching with standard image descriptors. For instance, image inconsistency due to the camera sensor noise may cause unexpected feature extraction leading to inaccurate tree conversion and authentication failure. Also, previous tree extraction algorithms are prohibitively slow hindering their scalability to large systems. In this paper, we fix the current issues of [1] and accelerate the key points extraction up to 10-times faster by implementing a new skeleton extraction method, a new key points searching algorithm, as well as an optimized key point matching algorithm. Using minimum enclosing circle and center points, make the algorithm robust to the choice of pattern shape. In contrast to [1] our algorithm handles general graphs with loop connections, therefore is applicable to a wider range of applications such as transportation map analysis, fingerprints, and retina vessel imaging.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源