Robust contour matching via the order-preserving assignment problem

@article{Scott2006RobustCM,
  title={Robust contour matching via the order-preserving assignment problem},
  author={Clayton D. Scott and Robert D. Nowak},
  journal={IEEE Transactions on Image Processing},
  year={2006},
  volume={15},
  pages={1831-1838}
}
A common approach to determining corresponding points on two shapes is to compute the cost of each possible pairing of points and solve the assignment problem (weighted bipartite matching) for the resulting cost matrix. We consider the problem of solving for point correspondences when the shapes of interest are each defined by a single, closed contour. A modification of the standard assignment problem is proposed whereby the correspondences are required to preserve the ordering of the points… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 93 citations. REVIEW CITATIONS

8 Figures & Tables

Topics

Statistics

01020'05'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

94 Citations

Semantic Scholar estimates that this publication has 94 citations based on the available data.

See our FAQ for additional information.