Pattern matching in a digitized image

DOI10.1007/BF01185433zbMath0942.68774OpenAlexW2019627712WikidataQ56813212 ScholiaQ56813212MaRDI QIDQ1336966

Uzi Vishkin, Gad M. Landau

Publication date: 26 February 1996

Published in: Algorithmica (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computing methodologies for image processing (68U10)

Related Items (16)

Two-dimensional pattern matching with rotations ⋮ Faster two dimensional scaled matching ⋮ Algorithms for approximate graph matching ⋮ Faster two-dimensional pattern matching with rotations ⋮ Two-Dimensional Pattern Matching with Combined Scaling and Rotation ⋮ The generic combinatorial algorithm for image matching with classes of projective transformations ⋮ Efficient one-dimensional real scaled matching ⋮ THEORETICAL ISSUES OF SEARCHING AERIAL PHOTOGRAPHS: A BIRD'S EYE VIEW ⋮ New complexity bounds for image matching under rotation and scaling ⋮ Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations ⋮ The exact complexity of projective image matching ⋮ New Complexity Bounds for Image Matching under Rotation and Scaling ⋮ Optimal data compression algorithm ⋮ Real two dimensional scaled matching ⋮ A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation ⋮ Sequential and indexed two-dimensional combinatorial template matching allowing rotations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel construction of a suffix tree with applications
• Fast string matching with k differences
• Topologically sweeping an arrangement
• Fast parallel and serial multidimensional approximate array matching
• Ignoring ignorance and agreeing to disagree
• Maximum-likelihood edge detection in digital signals
• Fast Algorithms for Finding Nearest Common Ancestors
• Generalized String Matching
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Recursive Star-Tree Parallel Data Structure
• Efficient string matching
• A Space-Economical Suffix Tree Construction Algorithm
• On the Complexity of Timetable and Multicommodity Flow Problems
• Faster tree pattern matching

This page was built for publication: Pattern matching in a digitized image