机械制造与自动化2024，Vol.53Issue(4)：169-172,4.DOI:10.19344/j.cnki.issn1671-5276.2024.04.032
基于距离哈希的稀疏点集快速匹配算法研究
Research on Sparse Point Set Fast Matching Algorithm Based on Distance Hash
吴林鹏 1周玲 1杨晗 1赵佳怡 1张丽艳1
作者信息
- 1. 南京航空航天大学,江苏 南京 210016
- 折叠
摘要
Abstract
Based on distance hash,proposes a fast and robust matching algorithm with homonymous points for partially overlapping sparse coordinate point tsets in different coordinate systems.A binary code identity tag is mapped according to the distance relationship between each point and its adjacent points.Through the similarity calculation of identity tags,the corresponding similar point pairs meeting the set threshold in two point sets are found to establish the initial matching,based on which,the rigid body transformation matrix is calculated to register the two point sets,and the precise matching between the two point sets is defined.The experiment results show that the proposed algorithm is fast,accurate,robust to noises and low overlapping,and hasno restriction on the initial relative position between two point sets.关键词
机器视觉/稀疏点集/点集匹配/距离哈希/二进制码Key words
machine vision/sparse point sets/point sets matching/distance hash/binary code分类
信息技术与安全科学引用本文复制引用
吴林鹏,周玲,杨晗,赵佳怡,张丽艳..基于距离哈希的稀疏点集快速匹配算法研究[J].机械制造与自动化,2024,53(4):169-172,4.
