We propose a new method for matching two 3D point sets of identical cardinality with global similarity but local non-rigid deformations and distribution errors. This problem arises...
Directional features have been successfully used for the recognition of both machine-printed and handwritten Kanji characters for the last decade. This paper attempts to explain w...
We consider a fully compressed pattern matching problem, where both text T and pattern P are given by its succinct representation, in terms of straight-line programs and its varia...
We present a shape matching algorithm based on the chamfer distance transform which can be easily integrated into the well-known SIFT framework. The shape matching was designed to...
We develop efficient dynamic programming algorithms for pattern matching with general gaps and character classes. We consider patterns of the form p0g(a0, b0)p1g(a1, b1) . . . pm-1...