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.
CITATION STYLE
Miramontes-Jaramillo, D., Kober, V., & Díaz-Ramírez, V. H. (2013). CWMA: Circular window matching algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8258 LNCS, pp. 439–446). https://doi.org/10.1007/978-3-642-41822-8_55
Mendeley helps you to discover research relevant for your work.