Accelerating pattern matching or how much can you slide?

Ofir Pele*, Michael Werman

*Corresponding author for this work

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

8 Scopus citations


This paper describes a method that accelerates pattern matching. The distance between a pattern and a window is usually close to the distance of the pattern to the adjacement windows due to image smoothness. We show how to exploit this fact to reduce the running time of pattern matching by adaptively sliding the window often by more than one pixel. The decision how much we can slide is based on a novel rank we define for each feature in the pattern. Implemented on a Pentium 4 3GHz processor, detection of a pattern with 7569 pixels in a 640 × 480 pixel image requires only 3.4ms.

Original languageAmerican English
Title of host publicationComputer Vision - ACCV 2007 - 8th Asian Conference on Computer Vision, Proceedings
PublisherSpringer Verlag
Number of pages12
EditionPART 2
ISBN (Print)9783540763895
StatePublished - 2007
Event8th Asian Conference on Computer Vision, ACCV 2007 - Tokyo, Japan
Duration: 18 Nov 200722 Nov 2007

Publication series

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


Conference8th Asian Conference on Computer Vision, ACCV 2007


Dive into the research topics of 'Accelerating pattern matching or how much can you slide?'. Together they form a unique fingerprint.

Cite this