Affordable Access

Publisher Website

Efficient one-dimensional real scaled matching

Authors
Journal
Journal of Discrete Algorithms
1570-8667
Publisher
Elsevier
Publication Date
Volume
5
Issue
2
Identifiers
DOI: 10.1016/j.jda.2006.03.017
Keywords
  • Pattern Matching
  • Scaled Matching
  • Real Scales
  • Combinatorial Computer Vision
Disciplines
  • Computer Science

Abstract

Abstract Real Scaled Matching is the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary real-sized scale, appears. Real scaled matching is an important problem that was originally inspired by Computer Vision. In this paper, we present a new, more precise and realistic, definition for one-dimensional real scaled matching, and an efficient algorithm for solving this problem. For a text of length n and a pattern of length m, the algorithm runs in time O ( n log m + n m 3 / 2 log m ) .

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

A new efficient indexing algorithm for one-dimensi...

on Journal of Computer and System... Jan 01, 2012

Real scaled matching

on Information Processing Letters Jan 01, 1999

Efficient indexing algorithms for one-dimensional...

on Information Processing Letters Jan 01, 2010
More articles like this..