New Penalty Scheme for Optimal Subsequence Bijection
Optimal Subsequence Bijection (OSB) is a method that allows comparing two sequences of endnodes of two skeleton graphs which represent articulated shapes of 2D images. The OSB dissimilarity function uses a constant penalty cost for all endnodes not matching between two skeleton graphs; this can be a problem, especially in those cases where there is a big amount of not matching endnodes. In this paper, a new penalty scheme for OSB, assigning variable penalties on endnodes not matching between two skeleton graphs, is proposed. The experimental results show that the new penalty scheme improves the results on supervised classification, compared with the original OSB.
Keywordsskeleton graph classification matching
- 7.Zhu, S.C., Yuille, A.L.: FORMS: A Flexible Object Recognition and Modeling Sys-tem. Proceedings of International Journal of Computer Vision 20(3), 187–212 (1996)Google Scholar
- 8.Liu, T., Geiger, D.: Approximate Tree Matching and Shape Similarity. In: Proceedings of IEEE 7th International Conference on Computer Vision, pp. 456–462 (1999)Google Scholar
- 11.Sebastian, T.B., Klein, P., Kimia, B.B.: Recognition of Shapes by Editing Shocks Graphs. In: Proceedings of International Conference in Computer Vision, pp. 755–762 (2001)Google Scholar
- 13.Bai, X., Liu, W., Tu, Z.: Integrating contour and skeleton for shape classification. In: IEEE 12th International Conference on Computer Vision Workshops (2009)Google Scholar