This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops
Efficient partial shape matching using Smith-Waterman algorithm
Anchorage, AK, USA
June 23-June 28
ISBN: 978-1-4244-2339-2
Longbin Chen, Computer Sciences, UC, Santa Barbara, USA
Rogerio Feris, Exploratory Computer Vision, IBM T.J. Watson Research, USA
Matthew Turk, Computer Sciences, UC, Santa Barbara, USA
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 similarity of two shapes. Our experiments on several public shape databases indicate that our method outperforms state-of-the-art global and partial shape matching algorithms in various scenarios.
Citation:
Longbin Chen, Rogerio Feris, Matthew Turk, "Efficient partial shape matching using Smith-Waterman algorithm," cvprw, pp.1-6, 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, 2008
Usage of this product signifies your acceptance of the Terms of Use.