Please help transcribe this video using our simple transcription tool. You need to be logged in to do so.


We present a method for finding correspondence between 3D models. From an initial set of feature correspondences, our method uses a fast voting scheme to separate the inliers from the outliers. The novelty of our method lies in the use of a combination of local and global constraints to determine if a vote should be cast. On a local scale, we use simple, low-level geometric invariants. On a global scale, we apply covariant constraints for finding compatible correspondences. We guide the sampling for collecting voters by downward dependencies on previous voting stages. All of this together results in an accurate matching procedure. We evaluate our algorithm by controlled and comparative testing on different datasets, giving superior performance compared to state of the art methods. In a final experiment, we apply our method for 3D object detection, showing potential use of our method within higher-level vision.

Questions and Answers

You need to be logged in to be able to post here.
    • Q:
      I'm the author of the work IN THE TITLE, but certainly not in the video. The content is wrong - we never submitted a video spotlight!
      Posted by: | July 7, 2014, 2:19 p.m. | 0 likes