Results 1 to 10 of about 91,504 (262)
Bisected graph matching improves automated pairing of bilaterally homologous neurons from connectomes [PDF]
Network Neuroscience, 2023 Graph matching algorithms attempt to find the best correspondence between the nodes of two networks. These techniques have been used to match individual neurons in nanoscale connectomes—in particular, to find pairings of neurons across hemispheres ...
Benjamin D. Pedigo +3 more
doaj +2 more sources
Population-wise labeling of sulcal graphs using multi-graph matching. [PDF]
PLoS ONE, 2023 Population-wise matching of the cortical folds is necessary to compute statistics, a required step for e.g. identifying biomarkers of neurological or psychiatric disorders.
Rohit Yadav +3 more
doaj +2 more sources
NCC Based Correspondence Problem for First- and Second-Order Graph Matching [PDF]
Sensors, 2020 Automatically finding correspondences between object features in images is of main interest for several applications, as object detection and tracking, identification, registration, and many derived tasks. In this paper, we address feature correspondence
Beibei Cui, Jean-Charles Créput
doaj +2 more sources
Fast approximate quadratic programming for graph matching. [PDF]
PLoS ONE, 2015 Quadratic assignment problems arise in a wide variety of domains, spanning operations research, graph theory, computer vision, and neuroscience, to name a few.
Joshua T Vogelstein +8 more
doaj +2 more sources
Multiplex graph matching matched filters
Applied Network Science, 2022 We consider the problem of detecting a noisy induced multiplex template network in a larger multiplex background network. Our approach, which extends the graph matching matched filter framework of Sussman et al. (IEEE Trans Pattern Anal Mach Intell 42(11)
Konstantinos Pantazis +5 more
doaj +3 more sources
Fair Fuzzy Matching in Middle Fuzzy Graph [PDF]
Ratio Mathematica, 2022 A fuzzy matching is a set of edges in which an edge does not incident on a vertex with same membership value. If every vertex of fuzzy graph is M-Plunged then the fuzzy matching is called as fair fuzzy matching.
S. Yahya Mohamed, S Suganthi
doaj +2 more sources
IEEE Access, 2022 In recent years, although the application of knowledge graph in natural language processing has made some progress, there are still some key problems to be solved, especially the matching query problem in natural language knowledge graph. Since the basic
Qifeng Zou, Chaoze Lu
doaj +1 more source
Multi-GPU Programming Model for Subgraph Matching in Large Graphs [PDF]
Jisuanji kexue yu tansuo, 2023 Subgraph matching is an important method of data mining in complex networks. In recent years, the subgraph matching algorithm based on GPU (graphics processing units) has shown obvious speed advantages.However, due to the large scale of graph data and a ...
LI Cenhao, CUI Pengjie, YUAN Ye, WANG Guoren
doaj +1 more source
A NOVEL APPROACH FOR PART BASED OBJECT MATCHING USING DISTANCE METRIC LEARNING WITH GRAPH CONVOLUTIONAL NETWORKS [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2021 Part-based object representation and part matching problem often appear in various areas of data analysis. A special case of particular interest is when parts are not fully separated, but in relations with each other.
V. Kozlov, A. Maysuradze
doaj +1 more source
Factorized Graph Matching [PDF]
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2012 Graph matching plays a central role in solving correspondence problems in computer vision. Graph matching problems that incorporate pair-wise constraints can be cast as a quadratic assignment problem (QAP). Unfortunately, QAP is NP-hard and many algorithms have been proposed to solve different relaxations. This paper presents factorized graph matching (
Feng, Zhou, Fernando, de la Torre
openaire +2 more sources