Efficient 2-dimensional approximate matching of half-rectangular figures

DOI10.1006/inco.1995.1047zbMath0827.68099OpenAlexW2047006226MaRDI QIDQ1891128

Martin Farach, Amihood Amir

Publication date: 28 May 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1047

zbMATH Keywords

computer visionstring matchingefficient algorithms

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10)

Related Items

Efficient special cases of pattern matching with swaps ⋮ Resource scheduling with variable requirements over time ⋮ \(L_{1}\) pattern matching lower bound ⋮ Faster two dimensional scaled matching ⋮ The submatrices character count problem: An efficient solution using separable values ⋮ A Black Box for Online Approximate Pattern Matching ⋮ Overlap matching. ⋮ Modulated string searching ⋮ Order-preserving matching ⋮ Efficient one-dimensional real scaled matching ⋮ Generalized function matching ⋮ Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics ⋮ Embeddings of \(k\)-connected graphs of pathwidth \(k\) ⋮ A black box for online approximate pattern matching ⋮ Real two dimensional scaled matching ⋮ ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES ⋮ Unnamed Item ⋮ FLEXIBLE MUSIC RETRIEVAL IN SUBLINEAR TIME ⋮ Approximate swapped matching. ⋮ Order-preserving pattern matching indeterminate strings ⋮ Approximate congruence in nearly linear time