Curve Matching Using the Fast Marching Method

Curve Matching Tool

Software Download Page

Department of Computer Science and Applied Mathematics

Description

This software implements the curve matching method of Frenkel and Basri. Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. This algorithm employs Sethian’s Fast Marching Method to find the solution with sub-resolution accuracy and in consistence with the underlying continuous problem. The method may be applied to compare closed curves, morph one curve into another, and compute curve averages. The method is based on a local curve dissimilarity function F(t, s) that compares the two input curves C1(t) and C2(s) at given points t and s. The comparison between the dissimilarity functions is based on local curvature information and on shape contexts. The algorithm was tested on a database of 110 sample curves by performing ”best matches” experiments.

For the paper click here PDF.

References

Max Frenkel, Ronen Basri: "Curve Matching Using the Fast Marching Method." EMMCVPR 2003: 35-51

J.A. Sethian, “A fast marching level set method for monotonically advancing fronts,” Proc. Nat. Acad. Sci., 93(4) (1996) 1591–1595.