## 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, landau@pucs2.poly. 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
- Mathematics (all)