Matching

We develop algorithms for efficient matching of features across images, videos, and data-sets.

Relevant papers

  • I. Talmi, R. Mechrez, L. Zelnik-Manor, Template Matching with Deformable Diversity Similarity, To appear in CVPR2017, arXiv preprint arXiv:1612.02190, 7 Dec 2016. (pdf,Project page)
  • A. Gilinsky and L. Zelnik-Manor, SIFTpack: A Compact Representation for Efficient SIFT Matching, Book chapter in Dense Image Correspondences for Computer Vision, Springer International Publishing, 2016. (pdf, Project page)
  • N. Ben-Zrihem and L. Zelnik-Manor, Approximate Nearest Neighbor Fields in Video, CVPR’2015 (pdf, Project page)
  • A. Gilinsky and L. Zelnik-Manor, SIFTpack: A Compact Representation for Efficient SIFT Matching, ICCV’2013. (pdf, Project page)
  • R. Basri, T. Hassner and L. Zelnik-Manor, Approximate Nearest Subspace Search, IEEE Trans. on Pattern Analysis and Machine Intelligence (PAMI), 33(2): 266–278, Feb. 2011. (pdf)
  • R. Basri, T. Hassner and L. Zelnik-Manor, A General Framework for Approximate Nearest Subspace Search, 2nd IEEE International Workshop on Subspace Methods at the IEEE International Conference on Computer Vision, Kyoto, Sept 2009 (pdf)
  • R. Basri, T. Hassner, L. Zelnik-Manor, A General Framework for Approximate Nearest Subspace Search, Technical Re port CCIT #699, Department of Electrical Engineering, Technion, June 2008. (pdf)
  • R. Basri, T. Hassner, and L. Zelnik-Manor, Approximate Nearest Subspace Search with Applications to Pattern Recognition, CVPR’2007. (pdf, Project page)
Premium Wordpress Themes by UFO Themes