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. © Springer-Verlag 2013.
CITATION STYLE
Pinilla-Buitrago, L. A., Martínez-Trinidad, J. F., & Carrasco-Ochoa, J. A. (2013). New penalty scheme for optimal subsequence bijection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8258 LNCS, pp. 206–213). https://doi.org/10.1007/978-3-642-41822-8_26
Mendeley helps you to discover research relevant for your work.