Notice
This item was automatically migrated from a legacy system. It's data has not been checked and might not meet the quality criteria of the present system.
Record link: 
http://hdl.handle.net/20.500.12708/54761
-
Title: 
On the Evaluation of Graph Centrality for Shape Matching
-
Citation: 
de Sousa, S., Artner, N., & Kropatsch, W. (2013). On the Evaluation of Graph Centrality for Shape Matching. In Graph-based Representations in Pattern Recognition, 9th IAPR - TC-15 Workshop (pp. 204–213). Lecture Notes in Computer Science, Volume 7877, Springer-Verlag. http://hdl.handle.net/20.500.12708/54761
-
Publication Type: 
Inproceedings - Full-Paper Contribution
en
Authors: 
de Sousa, Samuel 
Artner, Nicole 
Kropatsch, Walter 
-
Organisational Unit: 
E193-03 - Forschungsbereich Pattern Recognition and Image Processing 
-
Published in: 
Graph-based Representations in Pattern Recognition, 9th IAPR - TC-15 Workshop 
-
Date (published): 
2013
-
Event name: 
GbR 2013, 9th IAPR - TC-15 Workshop 
-
Event date: 
15-May-2013 - 17-May-2013
-
Event place: 
Wien, Austria
-
Number of Pages: 
10
-
Publisher: 
Lecture Notes in Computer Science, Volume 7877, Springer-Verlag, 7877
-
Peer reviewed: 
Yes
-
Abstract: 
Graph centrality has been extensively applied in Social Net- work Analysis to model the interaction of actors and the information ow inside a graph. In this paper, we investigate the usage of graph centrali- ties in the Shape Matching task. We create a graph-based representation of a shape and describe this graph by using di erent centrality measures. We build a Naive Bayes classi er whose input feature vector consists of the measurements obtained by the centralities and evaluate the di erent performances for each centrality
en
Research Areas: 
Visual Computing and Human-Centered Technology: 100%
-
Science Branch: 
Mathematik, Informatik
-
Appears in Collections:
Conference Paper

Show full item record

Page view(s)

182
checked on Nov 23, 2023

Google ScholarTM

Check