Irregular pattern matching using projections

M. Ben-Yehuda, L. Cadany, H. Hel-Or, Y. Hel-Or

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

Abstract

Recently, a novel approach to pattern matching was introduced, which reduces time complexity by two orders of magnitude over traditional approaches. It uses an efficient projection scheme which bounds the distance between a pattern and an image window using very few operations on average. The projection framework combined with a rejection scheme allows rapid rejection of image windows that are distant from the pattern. One of the limitations of this approach is the restriction to square dyadic patterns. In this paper we introduce a scheme, based on this approach which allows fast search for patterns of any size and shape. The suggested method takes advantage of the inherent recursive tree-structure introduced in the original scheme.

Original languageEnglish
Title of host publicationIEEE International Conference on Image Processing 2005, ICIP 2005
PublisherIEEE Computer Society
Pages2-834
Number of pages833
ISBN (Print)0780391349, 9780780391345
DOIs
StatePublished - 2005
EventIEEE International Conference on Image Processing 2005, ICIP 2005 - Genova, Italy
Duration: 11 Sep 200514 Sep 2005

Publication series

NameProceedings - International Conference on Image Processing, ICIP
Volume2
ISSN (Print)1522-4880

Conference

ConferenceIEEE International Conference on Image Processing 2005, ICIP 2005
Country/TerritoryItaly
CityGenova
Period11/09/0514/09/05

ASJC Scopus subject areas

  • Engineering (all)

Fingerprint

Dive into the research topics of 'Irregular pattern matching using projections'. Together they form a unique fingerprint.

Cite this