Template matching in the wild with weighted assembled similarity

Lingfeng Wang, Yan Ding*, Peilin Li

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, we propose a template matching algorithm that is robust to deformations and background clutters. A weighted assembled similarity measure is constructed to discover the similarity between two different distributions, and a two-step nearest neighbor searching algorithm is designed to provide the feature points with different weights, which makes it more distinctive when calculating the similarity between the candidate image and the template. A local feature descriptor named Progressive Gradient Descriptor is also put forward to encode the input image to a high-dimensional feature map. Experiments on real-scene data prove that the proposed algorithm is competitive in terms of matching accuracy.

Original languageEnglish
Title of host publicationSixth Conference on Frontiers in Optical Imaging and Technology
Subtitle of host publicationImaging Detection and Target Recognition
EditorsChao Zuo, Jiangtao Xu
PublisherSPIE
ISBN (Electronic)9781510679726
DOIs
Publication statusPublished - 2024
Event6th Conference on Frontiers in Optical Imaging and Technology: Imaging Detection and Target Recognition - Nanjing, China
Duration: 22 Oct 202324 Oct 2023

Publication series

NameProceedings of SPIE - The International Society for Optical Engineering
Volume13156
ISSN (Print)0277-786X
ISSN (Electronic)1996-756X

Conference

Conference6th Conference on Frontiers in Optical Imaging and Technology: Imaging Detection and Target Recognition
Country/TerritoryChina
CityNanjing
Period22/10/2324/10/23

Keywords

  • feature descriptor
  • nearest neighbor
  • template matching

Fingerprint

Dive into the research topics of 'Template matching in the wild with weighted assembled similarity'. Together they form a unique fingerprint.

Cite this