Deakin University
Browse

Deformable template matching using proposal-based best-buddies similarity

Version 2 2025-05-10, 10:47
Version 1 2017-01-01, 00:00
conference contribution
posted on 2025-05-10, 10:47 authored by H Xia, W Zhao, Z Zhou, F Jiang, H Li, X He
We propose a new method for template matching based on the Best-Buddies Similarity (BBS) measure. Our method is able to match objects with large difference in size and hence achieves a deformable template matching. In addition, compared with the original method for template matching based on the BBS, our method significantly cuts down on the computation time. The fast and deformable template matching is implemented by measuring the BBS of only potential areas instead of all positions in an image. The potential areas, which can have different size from the given template, are found by a proposal generation based on edge priors and a selective search among the obtained proposals. The results from the experiments conduct-ed on a challenging dataset demonstrate that our method out-performs the state-of-the-art methods in terms of accuracy.

History

Related Materials

Location

Sydney, N.S.W.

Language

eng

Publication classification

E1.1 Full written paper - refereed

Editor/Contributor(s)

[Unknown]

Pagination

517-521

Start date

2017-08-01

End date

2017-08-04

eISSN

2324-9013

ISBN-13

9781509049059

Title of proceedings

Proceedings - 16th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, 11th IEEE International Conference on Big Data Science and Engineering and 14th IEEE International Conference on Embedded Software and Systems, Trustcom/BigDataSE/ICESS 2017

Event

IEEE Trustcom/BigDataSE/ICESS. International Conferences (2017 : Sydney, N.S.W.)

Publisher

IEEE

Place of publication

Piscataway, N.J.

Usage metrics

    Research Publications

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC