A method for corresponding the boundaries of two shapes is presented. The algorithm employs a sparse polygonal approximation of one of the boundaries, generated using a critical point detection algorithm. A matching sparse polygon is sought on the second of the two boundaries which is both similar in shape to and has a similar representation error to the rst. Optimisation of a cost function using a greedy algorithm locates the sparse polygon on the second boundary. Results are presented for three classes of shape which exhibit various types of non-rigid deformation. The algorithm is also applied to an automatic landmark identi cation task.
In REF , a sparse polygonal representation of one shape's boundary is matched onto a second shape's boundary via a greedy optimisation of a cost function.
A Method of Non-rigid Correspondence for Automatic Landmark Identification
In 7 th British Machine Vison Conference
Computer Science