2013 9th International Conference on Information, Communications &Amp; Signal Processing 2013
DOI: 10.1109/icics.2013.6782781
|View full text |Cite
|
Sign up to set email alerts
|

Skeleton based shape matching using reweighted random walks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 24 publications
0
1
0
Order By: Relevance
“…In a subsequent publication [3], the skeleton paths shape descriptor is used in conjunction with contour fragments to design a shape classifier. Using a similar endpoints representation for the shape skeleton, Giang et al [16] further compare tuples of terminal nodes. They define a hyper-graph that relates a node to its k-nearest neighbors.…”
Section: Related Workmentioning
confidence: 99%
“…In a subsequent publication [3], the skeleton paths shape descriptor is used in conjunction with contour fragments to design a shape classifier. Using a similar endpoints representation for the shape skeleton, Giang et al [16] further compare tuples of terminal nodes. They define a hyper-graph that relates a node to its k-nearest neighbors.…”
Section: Related Workmentioning
confidence: 99%