Patent ID: 10963733

Abstract:
A computer implemented method for generating a one-to-one mapping between a first spatial point set and a second spatial point set in nD, n=2 or 3, comprising receiving a first and a second spatial point sets in nD and a plurality of candidate correspondences; computing unit conflict lists for the candidate correspondences; generating one or more MatchPairs between the first and the second point sets; computing local distance measures for the MatchPairs; converting the local distance measures to weights; computing conflict lists for pairs of the MatchPairs by taking the bitwise ORs of their candidate correspondences' unit conflict lists; computing correspondence lists for the MatchPairs; computing compatibilities between pairs of the MatchPairs by examining for each pair the bitwise AND of one's correspondence list and the other's conflict list; constructing a vertex-weighted undirected graph with its nodes corresponding to the MatchPairs, its edges representing the compatibilities, and its graph vertices assigned the weights; computing a maximum-weight clique of the vertex-weighted undirected graph; and merging the maximum-weight clique to generate the one-to-one mapping.