A New Method for Boundary-Based Shape Matching and Retrieval
暂无分享,去创建一个
[1] Gunilla Borgefors,et al. Hierarchical Chamfer Matching: A Parametric Edge Matching Algorithm , 1988, IEEE Trans. Pattern Anal. Mach. Intell..
[2] L. Bergroth,et al. A survey of longest common subsequence algorithms , 2000, Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000.
[3] Euripides G. M. Petrakis,et al. Matching and Retrieval of Distorted and Occluded Shapes Using Dynamic Programming , 2002, IEEE Trans. Pattern Anal. Mach. Intell..
[4] Francesco G. B. De Natale,et al. Efficient Shape Matching Using Weighted Edge Potential Functions , 2005, ICIAP.
[5] Li Han,et al. Freehand 3D Curve Recognition and Oversketching , 2005, TPCG.
[6] Alberto Del Bimbo,et al. Weighted walkthroughs between extended entities for retrieval by spatial arrangement , 2003, IEEE Trans. Multim..
[7] Dah-Jye Lee,et al. Partial shape matching of spine X-ray shapes using dynamic programming , 2004 .
[8] Remco C. Veltkamp,et al. Shape matching: similarity measures and algorithms , 2001, Proceedings International Conference on Shape Modeling and Applications.
[9] Shengrui Wang,et al. A new algorithm for inexact graph matching , 2002, Object recognition supported by user interaction for service robots.
[10] Haim J. Wolfson. On curve matching , 1990, IEEE Trans. Pattern Anal. Mach. Intell..