Research on Sparse Point Set Fast Matching Algorithm Based on Distance Hash
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.
machine visionsparse point setspoint sets matchingdistance hashbinary code
国家科技期刊平台
NSTL
万方数据
