An approximate matching algorithm for finding (sub-)optimal sequences in S-attributed grammars.
Jérôme WaldispühlBehshad BehzadiJean-Marc SteyaertPublished in: ECCB (2002)
Keyphrases
- matching algorithm
- image matching
- template matching
- matching process
- feature matching
- hausdorff distance
- graph matching
- object matching
- point matching
- voting scheme
- shape matching
- matching strategy
- dynamic programming
- hidden markov models
- regular expressions
- optimal solution
- fingerprint matching
- partial matching
- shape representation
- object recognition
- computer vision
- chamfer matching
- tree grammars
- euclidean distance
- multiscale