Deheng Qian

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Point matching problem seeks the optimal correspondences between two sets of points. However, the matching result often includes some mismatches that decrease the matching precision. In this paper, we propose a fast algorithm to reject mismatches using pair-wise similarity. The intuition of our algorithm is that the matches should be similar with their(More)
  • 1