Real Scaled Matching refers to 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~(1/2)m~(3/2) (log m)~(1/2)).
展开▼
机译：实际缩放匹配是指在出现根据任意实际规模的模式，按比例放大的文本中找到所有位置的问题。真实缩放匹配是最初受到计算机愿景的重要问题。在本文中，我们展示了一种新的，更精确和逼真的定义，用于一维实际缩放匹配和用于解决此问题的有效算法。对于长度n的文本和长度的模式，算法在时间o（n log m + n〜（1/2）m〜（3/2）（log m）〜（1/2））中运行。
展开▼
