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 contribution

6 Citations (Scopus)

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. © Springer-Verlag 2013.
Original languageAmerican English
Title of host publicationCWMA: Circular window matching algorithm
Pages439-446
Number of pages394
ISBN (Electronic)9783642418211
DOIs
StatePublished - 1 Dec 2013
EventLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) -
Duration: 1 Jan 2014 → …

Publication series

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

Conference

ConferenceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Period1/01/14 → …

Fingerprint

Matching Algorithm
Fast Algorithm
Image Decomposition
Sliding Window
Multi-core Processor
Decomposition Techniques
Parallel Implementation
Histogram
Invariance
Speedup
Gradient
Target
Decomposition
Processing

Cite this

Miramontes-Jaramillo, D., Kober, V., & Díaz-Ramírez, V. H. (2013). CWMA: Circular window matching algorithm. In CWMA: Circular window matching algorithm (pp. 439-446). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8258 LNCS). https://doi.org/10.1007/978-3-642-41822-8_55
Miramontes-Jaramillo, Daniel ; Kober, Vitaly ; Díaz-Ramírez, Víctor Hugo. / CWMA: Circular window matching algorithm. CWMA: Circular window matching algorithm. 2013. pp. 439-446 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{606ba83f12624c8aae0dd7a489dfe0cf,
title = "CWMA: Circular window matching algorithm",
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. {\circledC} Springer-Verlag 2013.",
author = "Daniel Miramontes-Jaramillo and Vitaly Kober and D{\'i}az-Ram{\'i}rez, {V{\'i}ctor Hugo}",
year = "2013",
month = "12",
day = "1",
doi = "10.1007/978-3-642-41822-8_55",
language = "American English",
isbn = "9783642418211",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "439--446",
booktitle = "CWMA: Circular window matching algorithm",

}

Miramontes-Jaramillo, D, Kober, V & Díaz-Ramírez, VH 2013, CWMA: Circular window matching algorithm. in CWMA: Circular window matching algorithm. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8258 LNCS, pp. 439-446, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1/01/14. https://doi.org/10.1007/978-3-642-41822-8_55

CWMA: Circular window matching algorithm. / Miramontes-Jaramillo, Daniel; Kober, Vitaly; Díaz-Ramírez, Víctor Hugo.

CWMA: Circular window matching algorithm. 2013. p. 439-446 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8258 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - CWMA: Circular window matching algorithm

AU - Miramontes-Jaramillo, Daniel

AU - Kober, Vitaly

AU - Díaz-Ramírez, Víctor Hugo

PY - 2013/12/1

Y1 - 2013/12/1

N2 - 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. © Springer-Verlag 2013.

AB - 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. © Springer-Verlag 2013.

UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84893202871&origin=inward

UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=84893202871&origin=inward

U2 - 10.1007/978-3-642-41822-8_55

DO - 10.1007/978-3-642-41822-8_55

M3 - Conference contribution

SN - 9783642418211

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 439

EP - 446

BT - CWMA: Circular window matching algorithm

ER -

Miramontes-Jaramillo D, Kober V, Díaz-Ramírez VH. CWMA: Circular window matching algorithm. In CWMA: Circular window matching algorithm. 2013. p. 439-446. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-41822-8_55