Filters








43,704 Hits in 4.4 sec

Graph Matching Based on Node Signatures [chapter]

Salim Jouili, Salvatore Tabbone
2009 Lecture Notes in Computer Science  
We present an algorithm for graph matching in a pattern recognition context. This algorithm deals with weighted graphs, based on new structural and topological node signatures.  ...  Using these signatures, we compute an optimum solution for node-to-node assignment with the Hungarian method and propose a distance formula to compute the distance between weighted graphs.  ...  Conclusion In this work, we propose a new graph matching technique based on node signatures describing local information in the graphs.  ... 
doi:10.1007/978-3-642-02124-4_16 fatcat:hfdzxm5gnvenriyejcaw7xyv6q

Attributed Graph Matching Using Local Descriptions [chapter]

Salim Jouili, Ines Mili, Salvatore Tabbone
2009 Lecture Notes in Computer Science  
In this paper, a node signatures extraction is combined with an optimal assignment method for matching attributed graphs.  ...  Consequently, matching attributed graphs plays an important role in objects recognition.  ...  Node signatures In the literature, the major part of proposed AG matching algorithms deal with global-based representation of graphs.  ... 
doi:10.1007/978-3-642-04697-1_9 fatcat:7t7y4sq54fa47oazbyssmgyu44

Stable and Informative Spectral Signatures for Graph Matching [article]

Nan Hu and Raif M. Rustamov and Leonidas Guibas
2018 arXiv   pre-print
By optimizing this objective, we design new spectral node signatures tuned to a specific graph to be matched.  ...  Our approach relies on a rigorous analysis of stability of spectral signatures based on the graph Laplacian.  ...  signatures based solely on the graph that is being matched.  ... 
arXiv:1304.1572v5 fatcat:6y7cdbfzh5exneuumkk2swlxei

Stable and Informative Spectral Signatures for Graph Matching

Nan Hu, Raif Rustamov, Leonidas Guibas
2014 2014 IEEE Conference on Computer Vision and Pattern Recognition  
By optimizing this objective, we design new spectral node signatures tuned to a specific graph to be matched.  ...  Our approach relies on a rigorous analysis of stability of spectral signatures based on the graph Laplacian.  ...  signatures based solely on the graph that is being matched.  ... 
doi:10.1109/cvpr.2014.296 dblp:conf/cvpr/HuRG14 fatcat:73bymhseevbypmkqy2ohs54roy

Graph Matching with Anchor Nodes: A Learning Approach [article]

Nan Hu and Raif M. Rustamov and Leonidas Guibas
2018 arXiv   pre-print
Our construction exploits recently introduced node signatures based on graph Laplacians, namely the Laplacian family signature (LFS) on the nodes, and the pairwise heat kernel map on the edges.  ...  based graph matching methods.  ...  Their signature is based on the simulated heat diffusion process on manifold. Aubry et. al. [1] later proposed a signature of similar structure based on quantum processes on graph.  ... 
arXiv:1804.03715v1 fatcat:2koycdaytzehzd6hw53r2qmkru

Graph Matching with Anchor Nodes: A Learning Approach

Nan Hu, Raif M. Rustamov, Leonidas Guibas
2013 2013 IEEE Conference on Computer Vision and Pattern Recognition  
Our construction exploits recently introduced node signatures based on graph Laplacians, namely the Laplacian family signature (LFS) on the nodes, and the pairwise heat kernel map on the edges.  ...  based graph matching methods.  ...  Their signature is based on the simulated heat diffusion process on manifold. Aubry et. al. [1] later proposed a signature of similar structure based on quantum processes on graph.  ... 
doi:10.1109/cvpr.2013.374 dblp:conf/cvpr/HuRG13 fatcat:764td4g5lrb6xi6wfck54tefhe

The RW2 Algorithm for Exact Graph Matching [chapter]

Marco Gori, Marco Maggini, Lorenzo Sarti
2005 Lecture Notes in Computer Science  
This algorithm exploits Random Walk theory to compute a topological signature which can be used to match the nodes in two isomorphic graphs.  ...  However, the algorithm may suffer from the presence of colliding signatures in the same graph, which may prevent the procedure from finding the complete mapping between the matching nodes.  ...  Most of the exact matching algorithms are based on a tree search with backtracking (see e.g. [2, 3] ).  ... 
doi:10.1007/11551188_9 fatcat:nz36smeu2ve5xhfoa5lnjzavfy

One Size Does not Fit All: When to Use Signature-based Pruning to Improve Template Matching for RDF graphs [article]

Shi Qiao, Z. Meral Ozsoyoglu
2015 arXiv   pre-print
Signature-based pruning is broadly accepted as an effective way to improve query performance of graph template matching on general labeled graphs.  ...  Keywords: RDF, Graph Template Matching, Signature-based Pruning  ...  Neighborhood signature-based pruning has been used extensively to improve performance of graph template matching (based on subgraph isomorphism) problem.  ... 
arXiv:1501.07184v1 fatcat:refo4cf3kzao7moy773kpkonsy

Querying Object-Oriented Databases Based on Signature Graph and n-ary Tree

Tran Minh Bao, Truong Cong Tuan, Huynh Trong Duc
2016 EAI Endorsed Transactions on Context-aware Systems and Applications  
It's based on a signature graph and n-ary tree helping to query related information when there is no correct match.  ...  More than that, we develop query algorithm on signature graph based on Chen and partners method [3] suggested, thereby helping to improve query time on signature graph better.  ...  Signature tree [2, 3] and signature graph [3, 4] are improved indexing techniques based on signature files.  ... 
doi:10.4108/eai.12-2-2016.151087 fatcat:pt6pe2owfzakjlrg2ewmlgk5em

Fast processing of graph queries on a large database of small and medium-sized data graphs

Dipali Pal, Praveen Rao, Vasil Slavov, Anas Katib
2016 Journal of computer and system sciences (Print)  
We construct a disk-based index on all the signatures via bulk loading.  ...  We aim to build disk based indexes for fast filtering of exact subgraph and approximate graph matching queries.  ...  Similar to APPFULL, GiS aims to support approximate (full) graph matching queries based on graph edit distance. GiS aims to rely on the same disk-based index for both types of matching.  ... 
doi:10.1016/j.jcss.2016.04.002 fatcat:zuc4zefjjzhqfjfijy3f4c2h4a

Context-Aware Nearest Neighbor Query on Social Networks [chapter]

Yazhe Wang, Baihua Zheng
2011 Lecture Notes in Computer Science  
CANN considers both the structure of the social network, and the profile information of the nodes. We design a hyper-graph based index structure to support approximated CANN search efficiently.  ...  In this paper, we define a new type of queries, namely context-aware nearest neighbor (CANN) search over social network to retrieve the nearest node to the query node that matches the context specified  ...  To decide whether a data item i matches/contains the query keyword Q, a query signature S Q is generated first, based on the same hash function.  ... 
doi:10.1007/978-3-642-24704-0_15 fatcat:ehj2ockgfndpdg4bk6qhug44ma

A tool for fast indexing and querying of graphs

Dipali Pal, Praveen R. Rao
2011 Proceedings of the 20th international conference companion on World wide web - WWW '11  
During the demo, the user can index real graph datasets using a recommendation facility in GiS, pose exact subgraph matching and approximate graph matching queries, and view matching graphs using the Jmol  ...  It adopts a suite of new techniques and algorithms for (a) fast construction of disk-based indexes with small index sizes, and (b) efficient query processing with high precision of matching.  ...  , to enable holistic pattern matching; • a new method based on the concept of line graphs to systematically expose more structural information about a graph, which can be captured by its signature, and  ... 
doi:10.1145/1963192.1963299 dblp:conf/www/PalR11 fatcat:oszwkwxnbff37fi3rdfmhirwyi

Malware Detection Based on Hybrid Signature Behaviour Application Programming Interface Call Graph

Murat
2012 American Journal of Applied Sciences  
Conclusion: The proposed framework combines Signature-Based with Behaviour-Based using API graph system.  ...  Static analysis techniques, dynamic analysis techniques and their combination including Signature-Based and Behaviour-Based techniques are discussed.  ...  They apply behavior Control Flow Graph (CFG) and then critical API Graph based on CFG is generated to do sub-graph matching.  ... 
doi:10.3844/ajassp.2012.283.288 fatcat:dq3zaa2lvbeb7ldutuevlk2wou

The Average Mixing Matrix Signature [chapter]

Luca Rossi, Simone Severini, Andrea Torsello
2016 Lecture Notes in Computer Science  
a node descriptor in a graph matching task.  ...  Laplacian-based descriptors, such as the Heat Kernel Signature and the Wave Kernel Signature, allow one to embed the vertices of a graph onto a vectorial space, and have been successfully used to find  ...  While the Heat Kernel Signature is based on a heat di↵usion process, the Wave Kernel Signature is based on the propagation of a wavefunction.  ... 
doi:10.1007/978-3-319-49055-7_42 fatcat:66fyfegksvcuxbos2ovkilzgku

Spectral Methods for View-Based 3-D Object Recognition Using Silhouettes [chapter]

Diego Macrini, Ali Shokoufandeh, Sven Dickinson, Kaleem Siddiqi, Steven Zucker
2002 Lecture Notes in Computer Science  
The large set of recognition trials (over 25,000) from a large database (over 1400 views) represents one of the most ambitious shock graph-based recognition experiments conducted to date.  ...  We extend our previous work in both shock graph matching and hierarchical structure indexing to propose the first unified framework for view-based 3-D object recognition using shock graphs.  ...  The maximum weight maximum cardinality matching is based on an objective function that measures the quality of the correspondence between matched regions while penalizing for unmatched nodes in the image  ... 
doi:10.1007/3-540-70659-3_1 fatcat:szgls6qdmjayvcourukr2srim4
« Previous Showing results 1 — 15 out of 43,704 results