CWMA: Circular window matching algorithm

Daniel Miramontes-Jaramillo, Vitaly Kober, Víctor Hugo Díaz-Ramírez

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

6 Scopus citations

Abstract

Various vision applications exploit matching algorithms to locate a target object in a scene image. A new fast matching algorithm based on recursive calculation of oriented gradient histograms over several circular sliding windows is presented. In order to speed up the algorithm pyramidal image decomposition technique and parallel implementation with modern multicore processors are utilized. The proposed fast algorithm yields a good invariance performance for both in-plane and out-of-plane rotations of a scene image. Computer results obtained with the proposed algorithm are presented and compared with those of common algorithms in terms of matching accuracy and processing time.

Original languageEnglish
Title of host publicationProgress in Pattern Recognition, Image Analysis, Computer Vision, and Applications - 18th Iberoamerican Congress, CIARP 2013, Proceedings
Pages439-446
Number of pages8
EditionPART 1
DOIs
StatePublished - 2013
Event18th Iberoamerican Congress on Pattern Recognition, CIARP 2013 - Havana, Cuba
Duration: 20 Nov 201323 Nov 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume8258 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference18th Iberoamerican Congress on Pattern Recognition, CIARP 2013
Country/TerritoryCuba
CityHavana
Period20/11/1323/11/13

Fingerprint

Dive into the research topics of 'CWMA: Circular window matching algorithm'. Together they form a unique fingerprint.

Cite this