Tuesday, November 21, 2006
DP for correspondences
Modified dynamic program from Scott & Nowak's "Robust Contour Matching Via the Order-Preserving Assignment Problem" paper to include spacing penalty, lambda. Here's how it performs on the tool, for lambda=0, 0.5, and 1:



Appears to do better than greedy search, and is just as fast. Next step is to try including local shape match in the distance function...



Appears to do better than greedy search, and is just as fast. Next step is to try including local shape match in the distance function...