Sequential and indexed two-dimensional combinatorial template matching allowing rotations

DOI10.1016/j.tcs.2005.06.029zbMath1080.68108WikidataQ58054190 ScholiaQ58054190MaRDI QIDQ2576875

Esko Ukkonen, Kimmo Fredriksson, Gonzalo Navarro

Publication date: 29 December 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.06.029

zbMATH Keywords

image processing; string matching; template matching; combinatorial algorithms

Mathematics Subject Classification ID

68U10: Computing methodologies for image processing

68T10: Pattern recognition, speech recognition

Related Items

A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation, Average-optimal string matching, Rotation and lighting invariant template matching

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the construction of classes of suffix trees for square matrices: Algorithms and applications
• On the height of digital trees and related problems
• Fast two-dimensional pattern matching
• Pattern matching in a digitized image
• Fast practical multi-pattern matching
• Average complexity of exact and approximate multiple string matching
• Two-Dimensional Pattern Matching with Rotations
• The Complexity of Pattern Matching for a Random String
• Efficient string matching
• An Alphabet Independent Approach to Two-Dimensional Pattern Matching
• Alphabet-Independent and Scaled Dictionary Matching
• A Generalization of the Suffix Tree to Square Matrices, with Applications
• Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time
• Combinatorial Pattern Matching
• Average-optimal single and multiple approximate string matching
• Transposition invariant string matching
• Algorithms and Data Structures
• LATIN 2004: Theoretical Informatics