Prof. Mario Vento, Ph.D.
Prof. Mario Vento, Ph.D.
University of Salerno, Dept. of Information and Electrical Engineering and Applied Math (DIEM)
Bestätigte E-Mail-Adresse bei unisa.it
Titel
Zitiert von
Zitiert von
Jahr
Thirty years of graph matching in pattern recognition
D Conte, P Foggia, C Sansone, M Vento
International journal of pattern recognition and artificial intelligence 18 …, 2004
16302004
A (sub) graph isomorphism algorithm for matching large graphs
LP Cordella, P Foggia, C Sansone, M Vento
IEEE transactions on pattern analysis and machine intelligence 26 (10), 1367 …, 2004
12992004
An improved algorithm for matching large graphs
LP Cordella, P Foggia, C Sansone, M Vento
3rd IAPR-TC15 workshop on graph-based representations in pattern recognition …, 2001
5202001
Trainable COSFIRE filters for vessel delineation with application to retinal images
G Azzopardi, N Strisciuglio, M Vento, N Petkov
Medical image analysis 19 (1), 46-57, 2015
4642015
Graph matching and learning in pattern recognition in the last 10 years
P Foggia, G Percannella, M Vento
International Journal of Pattern Recognition and Artificial Intelligence 28 …, 2014
3112014
Performance evaluation of the VF graph matching algorithm
LP Cordella, P Foggia, C Sansone, M Vento
Proceedings 10th International Conference on Image Analysis and Processing …, 1999
2781999
A performance comparison of five algorithms for graph isomorphism
P Foggia, C Sansone, M Vento
Proceedings of the 3rd IAPR TC-15 Workshop on Graph-based Representations in …, 2001
2442001
Benchmarking HEp-2 cells classification methods
P Foggia, G Percannella, P Soda, M Vento
IEEE transactions on medical imaging 32 (10), 1878-1889, 2013
2392013
To reject or not to reject: that is the question-an answer in case of neural classifiers
C De Stefano, C Sansone, M Vento
IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and …, 2000
2232000
A database of graphs for isomorphism and sub-graph isomorphism benchmarking
P Foggia, C Sansone, M Vento
Proc. of the 3rd IAPR TC-15 International Workshop on Graph-based …, 2001
1492001
A comparison of algorithms for maximum common subgraph on randomly connected graphs
H Bunke, P Foggia, C Guidobaldi, C Sansone, M Vento
Joint IAPR International Workshops on Statistical Techniques in Pattern …, 2002
1482002
Audio surveillance of roads: A system for detecting anomalous sounds
P Foggia, N Petkov, A Saggese, N Strisciuglio, M Vento
IEEE transactions on intelligent transportation systems 17 (1), 279-288, 2015
1362015
Real-time fire detection for video-surveillance applications using a combination of experts based on color, shape, and motion
P Foggia, A Saggese, M Vento
IEEE TRANSACTIONS on circuits and systems for video technology 25 (9), 1545-1556, 2015
1312015
Symbol recognition in documents: a collection of techniques?
LP Cordella, M Vento
International Journal on Document Analysis and Recognition 3 (2), 73-88, 2000
1312000
Reliable detection of audio events in highly noisy environments
P Foggia, N Petkov, A Saggese, N Strisciuglio, M Vento
Pattern Recognition Letters 65, 22-28, 2015
1202015
Reactive tabu search for measuring graph similarity
S Sorlin, C Solnon
International Workshop on Graph-Based Representations in Pattern Recognition …, 2005
1182005
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs.
D Conte, P Foggia, M Vento
J. Graph Algorithms Appl. 11 (1), 99-143, 2007
1152007
Reliability parameters to improve combination strategies in multi-expert systems
LP Cordella, P Foggia, C Sansone, F Tortorella, M Vento
Pattern Analysis & Applications 2 (3), 205-214, 1999
1111999
A long trip in the charming world of graphs for pattern recognition
M Vento
Pattern Recognition 48 (2), 291-301, 2015
1102015
A large database of graphs and its use for benchmarking graph isomorphism algorithms
M De Santo, P Foggia, C Sansone, M Vento
Pattern Recognition Letters 24 (8), 1067-1079, 2003
1082003
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20