2010 20th International Conference on Pattern Recognition 2010
DOI: 10.1109/icpr.2010.15
|View full text |Cite
|
Sign up to set email alerts
|

2D Shape Recognition Using Information Theoretic Kernels

Abstract: In this paper, a novel approach for contour-based 2D shape recognition is proposed, using a recently introduced class of information theoretic kernels.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2012
2012
2016
2016

Publication Types

Select...
2
2
1

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 13 publications
0
7
0
Order By: Relevance
“…cyclic dist [21] 0.78 K-NN + cyclic string edit dist [22] 0.74 1-NN + mBm-based features [23] 0.77 1-NN + HMM-based distance [23] 0.74 1-NN + IT kernels on n-grams [24] 0.81 1-NN + BLOSUM (local alignment) [8] 0.83…”
Section: B Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…cyclic dist [21] 0.78 K-NN + cyclic string edit dist [22] 0.74 1-NN + mBm-based features [23] 0.77 1-NN + HMM-based distance [23] 0.74 1-NN + IT kernels on n-grams [24] 0.81 1-NN + BLOSUM (local alignment) [8] 0.83…”
Section: B Resultsmentioning
confidence: 99%
“…One shape per class is shown. (6,2), which is the lowest pair allowed by many tools publicly available 2 .…”
Section: A Parameters Setting and Experimental Detailsmentioning
confidence: 99%
See 1 more Smart Citation
“…As a final comment, in Table 2 we reported some other recent results from the state of the art on the same datasets. Many different approaches have been tested on the Chicken dataset, using simple as well complicated classifiers (see for example comparisons reported in [20,21]): in Table 2(a) we reported only those based on nearest neighbour rules -taken from [20]. Even if in some cases different experimental protocols have been employed, it seems evident that the proposed approach represents a promising alternative to classic as well as to advanced schemes.…”
Section: Resultsmentioning
confidence: 99%
“…Chen, R. Feris, and M. Turk [2] proposed an efficient technique to find only the similar portions of two shapes and calculate the likeness of the shapes using only similar portions. Here the main contribution is to suggest a local shape identifying technique based on the Smith-Waterman algorithm [14] to efficiently find common portions of two shapes without needing exhaustive search for all likely parts.…”
Section: Literature Surveymentioning
confidence: 99%