Pattern matching in a digitized image

Gad M. Landau; Uzi Vishkin

Pattern matching in a digitized image

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

Abstract

The continuous pattern matching problem is defined. Given are two pictures, each consisting of unicolor regions; one picture is called the scene and the other the pattern. The problem is to find all occurrences of the pattern in the scene. As a step towards efficient algorithmic handling of the continuous pattern matching problem by computers, where discretized representations are involved, we give several algorithms. Our strongest algorithmic result is for a one-dimensional version of the problem, where running time which is linear in the length of a digitized representation is achieved. The definitions of our problems are derived from a "digitized-based" approach to object recognition problems in computer vision, which is different from a common computer vision approach. The digitized based approach may lead towards further research within the discrete algorithms community on computer vision problems.

Original language	English
Title of host publication	Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992
Publisher	Association for Computing Machinery
Pages	453-462
Number of pages	10
ISBN (Electronic)	089791466X
State	Published - 1 Sep 1992
Externally published	Yes
Event	3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992 - Orlando, United States Duration: 27 Jan 1992 → 29 Jan 1992

Publication series

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

Conference

Conference	3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992
Country/Territory	United States
City	Orlando
Period	27/01/92 → 29/01/92

Bibliographical note

Funding Information:
“Dept. of Computer Science, Polytechnic University, 333 Jay Street, Brooklyn, NY 11201, (718) 260-3154, [email protected]. edu; partially supported by NSF grant CCR-8908286.+ ‘Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742 (301) 405-6763, vishkin@uzisun. umiacs.umd.edu; and Tel Aviv University, Tel Aviv, Israel; partially supported by NSF grant CCR-8906949.+

ASJC Scopus subject areas

Software
General Mathematics

Cite this

@inproceedings{f495fb7d65d54fc9aedcaee42a1e0dbd,

title = "Pattern matching in a digitized image",

abstract = "The continuous pattern matching problem is defined. Given are two pictures, each consisting of unicolor regions; one picture is called the scene and the other the pattern. The problem is to find all occurrences of the pattern in the scene. As a step towards efficient algorithmic handling of the continuous pattern matching problem by computers, where discretized representations are involved, we give several algorithms. Our strongest algorithmic result is for a one-dimensional version of the problem, where running time which is linear in the length of a digitized representation is achieved. The definitions of our problems are derived from a {"}digitized-based{"} approach to object recognition problems in computer vision, which is different from a common computer vision approach. The digitized based approach may lead towards further research within the discrete algorithms community on computer vision problems.",

author = "Landau, {Gad M.} and Uzi Vishkin",

note = "Funding Information: “Dept. of Computer Science, Polytechnic University, 333 Jay Street, Brooklyn, NY 11201, (718) 260-3154, [email protected]. edu; partially supported by NSF grant CCR-8908286.+ {\textquoteleft}Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742 (301) 405-6763, vishkin@uzisun. umiacs.umd.edu; and Tel Aviv University, Tel Aviv, Israel; partially supported by NSF grant CCR-8906949.+; 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992 ; Conference date: 27-01-1992 Through 29-01-1992",

year = "1992",

month = sep,

day = "1",

language = "English",

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

publisher = "Association for Computing Machinery",

pages = "453--462",

booktitle = "Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992",

address = "United States",

}

Landau, GM & Vishkin, U 1992, Pattern matching in a digitized image. in Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. Part F129721, Association for Computing Machinery, pp. 453-462, 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992, Orlando, United States, 27/01/92.

Pattern matching in a digitized image. / Landau, Gad M.; Vishkin, Uzi.
Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992. Association for Computing Machinery, 1992. p. 453-462 (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; Vol. Part F129721).

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

TY - GEN

T1 - Pattern matching in a digitized image

AU - Landau, Gad M.

AU - Vishkin, Uzi

N1 - Funding Information: “Dept. of Computer Science, Polytechnic University, 333 Jay Street, Brooklyn, NY 11201, (718) 260-3154, [email protected]. edu; partially supported by NSF grant CCR-8908286.+ ‘Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742 (301) 405-6763, vishkin@uzisun. umiacs.umd.edu; and Tel Aviv University, Tel Aviv, Israel; partially supported by NSF grant CCR-8906949.+

PY - 1992/9/1

Y1 - 1992/9/1

N2 - The continuous pattern matching problem is defined. Given are two pictures, each consisting of unicolor regions; one picture is called the scene and the other the pattern. The problem is to find all occurrences of the pattern in the scene. As a step towards efficient algorithmic handling of the continuous pattern matching problem by computers, where discretized representations are involved, we give several algorithms. Our strongest algorithmic result is for a one-dimensional version of the problem, where running time which is linear in the length of a digitized representation is achieved. The definitions of our problems are derived from a "digitized-based" approach to object recognition problems in computer vision, which is different from a common computer vision approach. The digitized based approach may lead towards further research within the discrete algorithms community on computer vision problems.

AB - The continuous pattern matching problem is defined. Given are two pictures, each consisting of unicolor regions; one picture is called the scene and the other the pattern. The problem is to find all occurrences of the pattern in the scene. As a step towards efficient algorithmic handling of the continuous pattern matching problem by computers, where discretized representations are involved, we give several algorithms. Our strongest algorithmic result is for a one-dimensional version of the problem, where running time which is linear in the length of a digitized representation is achieved. The definitions of our problems are derived from a "digitized-based" approach to object recognition problems in computer vision, which is different from a common computer vision approach. The digitized based approach may lead towards further research within the discrete algorithms community on computer vision problems.

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

M3 - Conference contribution

AN - SCOPUS:85029475835

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

SP - 453

EP - 462

BT - Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992

PB - Association for Computing Machinery

T2 - 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992

Y2 - 27 January 1992 through 29 January 1992

ER -

Pattern matching in a digitized image

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this