Best-Buddies Similarity for robust template matching
Name
Best-buddies similarity.pdf
Size
10.32 MB
Format
Adobe PDF
Checksum (MD5)
ef900db1b9055315954e1b9a49a2f83c
Author(s)
Dekel, Tali
Oron, Shaul
Rubinstein, Michael
Avidan, Shai
Freeman, William T.
Date Issued
October 2015
Journal
2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Dekel, Tali, et al. "Best-Buddies Similarity for Robust Template Matching." 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 7-12 June, 2015, Boston, Massachusetts, IEEE, 2015, pp. 2021–29.
Version
Author's final manuscript
Abstract
We propose a novel method for template matching in unconstrained environments. Its essence is the Best-Buddies Similarity (BBS), a useful, robust, and parameter-free similarity measure between two sets of points. BBS is based on counting the number of Best-Buddies Pairs (BBPs)-pairs of points in source and target sets, where each point is the nearest neighbor of the other. BBS has several key features that make it robust against complex geometric deformations and high levels of outliers, such as those arising from background clutter and occlusions. We study these properties, provide a statistical analysis that justifies them, and demonstrate the consistent success of BBS on a challenging real-world dataset.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/CVPR.2015.7298813
