Efficient 2-dimensional approximate matching of half-rectangular figures

DOI10.1006/inco.1995.1047zbMath0827.68099MaRDI 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 vision; string matching; efficient algorithms

Mathematics Subject Classification ID

68U10: Computing methodologies for image processing

68T10: Pattern recognition, speech recognition

Related Items

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