Efficient matching of nonrectangular shapes.

DOI10.1007/BF01531057MaRDI QIDQ1354075zbMATH OpenOpenAlexFDO

Authors Amihood Amir, Martin Farach

Publication date 13 May 1997

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01531057

zbMATH Keywords

matching algorithms

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• Efficient 2-dimensional approximate matching of half-rectangular figures
• Multiple matching of rectangular patterns
• Fast two-dimensional pattern matching
• Efficient pattern matching with scaling

Cites work

• A fast string searching algorithm
• Efficient string matching
• Fast Pattern Matching in Strings
• Finding approximate patterns in strings
• Generalized String Matching
• scientific article; zbMATH DE number 3845091 (Why is no real title available?)
• scientific article; zbMATH DE number 3471577 (Why is no real title available?)

Cited in

(10)

• On Fine and Wilf's theorem for bidimensional words.
• On a conjecture on bidimensional words.
• Efficient 2-dimensional approximate matching of half-rectangular figures
• Multiple matching of rectangular patterns
• Recent advances in text-to-pattern distance algorithms
• scientific article; zbMATH DE number 4094854 (Why is no real title available?)
• scientific article; zbMATH DE number 1950289 (Why is no real title available?)
• scientific article; zbMATH DE number 2044132 (Why is no real title available?)
• Hamming Distance Completeness
• A new algorithm for two-dimensional object inspection using string matching

This page was built for publication: Efficient matching of nonrectangular shapes.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1354075)