Finding all occurrences of a non-rectangular pattern of height m and area a in an n × n text with no more than k mismatch, insertion, and deletion errors is an important problem in computer vision. It can be solved using a dynamic programming approach in time O(an2). We show a O(kn2√m log m √k log k + k2n2) algorithm which combines convolutions with dynamic programming. At the heart of the algorithm are the Smaller Matching Problem and the k-Aligned Ones with Location Problem. Efficient algorithms to solve both these problems are presented.
|Title of host publication||Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991|
|Publisher||Association for Computing Machinery|
|Number of pages||12|
|State||Published - 1 Mar 1991|
|Event||2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991 - San Francisco, United States|
Duration: 28 Jan 1991 → 30 Jan 1991
|Name||Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms|
|Conference||2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991|
|Period||28/01/91 → 30/01/91|
Bibliographical notePublisher Copyright:
© 1991 Association for Computing Machinery. All rights reserved.