141 search results - page 1 / 29 » Two Dimensional Parameterized Matching |
CPM
2005
Springer
13 years 10 months ago
2005
Springer
Two equal length strings, or two equal sized two-dimensional texts, parameterize match (p-match) if there is a one-one mapping (relative to the alphabet) of their characters. Two-...
ICPR
2000
IEEE
13 years 8 months ago
2000
IEEE
A new efficient dynamic programming (DP) algorithm for 2D elastic matching is proposed. The present DP algorithm requires by far less complexity than previous DPbased elastic mat...
ICCV
2005
IEEE
13 years 10 months ago
2005
IEEE
Recently, nonrigid shape matching has received more and more attention. For nonrigid shapes, most neighboring points cannot move independently under deformation due to physical co...
SSIAI
2002
IEEE
13 years 9 months ago
2002
IEEE
Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is pres...
LATIN
1998
Springer
13 years 8 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...