Efficient partial shape matching using Smith-Waterman algorithm

@article{Chen2008EfficientPS,
  title={Efficient partial shape matching using Smith-Waterman algorithm},
  author={Longbin Chen and Rog{\'e}rio Schmidt Feris and Matthew Turk},
  journal={2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops},
  year={2008},
  pages={1-6}
}
This paper presents an efficient partial shape matching method based on the Smith-Waterman algorithm. For two contours of m and n points respectively, the complexity of our method to find similar parts is only O(mn). In addition to this improvement in efficiency, we also obtain comparable accurate matching with fewer shape descriptors. Also, in contrast to arbitrary distance functions that are used by previous methods, we use a probabilistic similarity measurement, p-value, to evaluate the… CONTINUE READING
Highly Cited
This paper has 76 citations. REVIEW CITATIONS

8 Figures & Tables

Topics

Statistics

0510152009201020112012201320142015201620172018
Citations per Year

76 Citations

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

See our FAQ for additional information.