Efficient 2-dimensional approximate matching of non-rectangular figures

Amihood Amir; Martin Farach

Efficient 2-dimensional approximate matching of non-rectangular figures

Amihood Amir, Martin Farach

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

29 Scopus citations

Abstract

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(an²). We show a O(kn²√m log m √k log k + k²n²) 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.

Original language	English
Title of host publication	Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991
Publisher	Association for Computing Machinery
Pages	212-223
Number of pages	12
ISBN (Print)	0897913760
State	Published - 1 Mar 1991
Externally published	Yes
Event	2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991 - San Francisco, United States Duration: 28 Jan 1991 → 30 Jan 1991

Publication series

Name	Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Conference

Conference	2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991
Country/Territory	United States
City	San Francisco
Period	28/01/91 → 30/01/91

Bibliographical note

Publisher Copyright:
© 1991 Association for Computing Machinery. All rights reserved.

Funding

“ [email protected], Department of Computer Science and Institute for Advauced Computer Studies, University of Maryland, College Park, MD 20742. Partially supported by NSF grant CCR-88-03641 and a University of Maryland full year research award. t mpf@cs .umd.edu, Department of Comput er Science, University of Maryland, college Park, MD 20742. Supported by a University of Maryland Graduate Fellowship, au ACM Samuel M. Alexander Fellowship aud NSF grant CCR-88-03641.

Funders	Funder number
National Science Foundation	CCR-88-03641
University of Maryland

Cite this

@inproceedings{62b996a354474fed9b2e65b304517556,

title = "Efficient 2-dimensional approximate matching of non-rectangular figures",

abstract = "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.",

author = "Amihood Amir and Martin Farach",

note = "Publisher Copyright: {\textcopyright} 1991 Association for Computing Machinery. All rights reserved.; 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991 ; Conference date: 28-01-1991 Through 30-01-1991",

year = "1991",

month = mar,

day = "1",

language = "אנגלית",

isbn = "0897913760",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

publisher = "Association for Computing Machinery",

pages = "212--223",

booktitle = "Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991",

}

Amir, A & Farach, M 1991, Efficient 2-dimensional approximate matching of non-rectangular figures. in Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Association for Computing Machinery, pp. 212-223, 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991, San Francisco, United States, 28/01/91.

Efficient 2-dimensional approximate matching of non-rectangular figures. / Amir, Amihood; Farach, Martin.
Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991. Association for Computing Machinery, 1991. p. 212-223 (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Efficient 2-dimensional approximate matching of non-rectangular figures

AU - Amir, Amihood

AU - Farach, Martin

PY - 1991/3/1

Y1 - 1991/3/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84989853970&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84989853970

SN - 0897913760

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 212

EP - 223

BT - Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991

PB - Association for Computing Machinery

T2 - 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991

Y2 - 28 January 1991 through 30 January 1991

ER -

Efficient 2-dimensional approximate matching of non-rectangular figures

Abstract

Publication series

Conference

Bibliographical note

Funding

Other files and links

Fingerprint

Cite this