1
|
Scalable generalized median graph estimation and its manifold use in bioinformatics, clustering, classification, and indexing. INFORM SYST 2021. [DOI: 10.1016/j.is.2021.101766] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/18/2022]
|
2
|
Graph matching approach and generalized median graph for automatic labeling of cortical sulci with parallel and distributed algorithms. COGN SYST RES 2019. [DOI: 10.1016/j.cogsys.2018.08.008] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/15/2022]
|
3
|
Moreno-García CF, Serratosa F. Obtaining the consensus of multiple correspondences between graphs through online learning. Pattern Recognit Lett 2017. [DOI: 10.1016/j.patrec.2016.09.003] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/21/2022]
|
4
|
Cortés X, Serratosa F. Learning Graph Matching Substitution Weights Based on the Ground Truth Node Correspondence. INT J PATTERN RECOGN 2016. [DOI: 10.1142/s0218001416500051] [Citation(s) in RCA: 21] [Impact Index Per Article: 2.6] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/18/2022]
Abstract
In pattern recognition, it is usual to compare structured objects through attributed graphs in which nodes represent local parts and edges relations between them. Thus, each characteristic in the local parts is represented by different attributes on the nodes or edges. In this framework, the comparison between structured objects is performed through a distance between attributed graphs. If we want to correctly tune the distance and node correspondence between graphs, we need to add some weights on the node and edge attributes to gauge the importance of each local characteristic while defining the distance measure between graphs. In this paper, we present a method to learn the weights of each node and edge attribute such that the distance between the ground truth correspondence between graphs and the automatically obtained correspondence is minimized.
Collapse
Affiliation(s)
- Xavier Cortés
- Universitat Rovira i Virgili, 43003 Tarragona, Spain
| | | |
Collapse
|
5
|
Correspondence consensus of two sets of correspondences through optimisation functions. Pattern Anal Appl 2015. [DOI: 10.1007/s10044-015-0486-y] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/23/2022]
|
6
|
Abstract
Bipartite (BP) has been seen to be a fast and accurate suboptimal algorithm to solve the Error-Tolerant Graph Matching problem. Recently, Fast Bipartite (FBP) has been presented that obtains the same distance value and node labelings but in a reduced time. Both algorithms approximate the quadratic problem in a linear problem and they do it through a specific cost matrix. FBP imposes the Edit costs to be defined such as the Edit distance is a distance function. Originally, the Hungarian method was used but it has been seen the Jonker–Volgenant linear solver obtains similar results than the Hungarian method but with an important run time reduction. Nevertheless, this second solver has some convergence problems on some specific cost matrices. The aim of this paper is to define a new cost matrix such that the Jonker–Volgenant solver converges and the matching algorithm obtains the same distance value than the BP algorithm.
Collapse
|
7
|
FOGGIA PASQUALE, PERCANNELLA GENNARO, VENTO MARIO. GRAPH MATCHING AND LEARNING IN PATTERN RECOGNITION IN THE LAST 10 YEARS. INT J PATTERN RECOGN 2014. [DOI: 10.1142/s0218001414500013] [Citation(s) in RCA: 222] [Impact Index Per Article: 22.2] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/18/2022]
Abstract
In this paper, we examine the main advances registered in the last ten years in Pattern Recognition methodologies based on graph matching and related techniques, analyzing more than 180 papers; the aim is to provide a systematic framework presenting the recent history and the current developments. This is made by introducing a categorization of graph-based techniques and reporting, for each class, the main contributions and the most outstanding research results.
Collapse
Affiliation(s)
- PASQUALE FOGGIA
- Department of Information Engineering, Electrical Engineering and Applied Mathematics, University of Salerno, Via Giovanni Paolo II, 132, 84084 Fisciano (SA), Italy
| | - GENNARO PERCANNELLA
- Department of Information Engineering, Electrical Engineering and Applied Mathematics, University of Salerno, Via Giovanni Paolo II, 132, 84084 Fisciano (SA), Italy
| | - MARIO VENTO
- Department of Information Engineering, Electrical Engineering and Applied Mathematics, University of Salerno, Via Giovanni Paolo II, 132, 84084 Fisciano (SA), Italy
| |
Collapse
|
8
|
Vento M. A One Hour Trip in the World of Graphs, Looking at the Papers of the Last Ten Years. GRAPH-BASED REPRESENTATIONS IN PATTERN RECOGNITION 2013:1-10. [DOI: 10.1007/978-3-642-38221-5_1] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 09/02/2023]
|