Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

SODA
2000
ACM

favoriteEmaildiscussreport

85views Algorithms» more SODA 2000»

Real scaled matching

13 years 5 months ago

Real scaled matching

Download www.cs.bgu.ac.il

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 + nm3/2 log m).

Amihood Amir, Ayelet Butman, Moshe Lewenstein

Real-time Traffic

Algorithms | Arbitrary Real-sized Scale | Important Problem | Real Scaled Matching | SODA 2000 |

claim paper

Related Content

» Learning and Matching Multiscale Template Descriptors for RealTime Detection Localization ...

» Improving quality and performance of schema matching in large scale

» Scale and Rotation Invariant Matching Using Linearly Augmented Trees

» Robust RealTime Visual SLAM Using Scale Prediction and Exemplar Based Feature Description

» Matching of Datasets

» MOVE A Large Scale KeywordBased Content Filtering and Dissemination System

» Using Movie Subtitles for Creating a LargeScale Bilingual Corpora

» Building an Advanced Invariant RealTime Human Tracking System

» A Probabilistic Approach to Robust Shape Matching

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	2000
Where	SODA
Authors	Amihood Amir, Ayelet Butman, Moshe Lewenstein

Comments (0)