Filters








175,366 Hits in 5.1 sec

Typicality Matching for Pairs of Correlated Graphs [article]

F. Shirani, S. Garg, E. Erkip
2018 arXiv   pre-print
In this paper, the problem of matching pairs of correlated random graphs with multi-valued edge attributes is considered.  ...  The algorithm operates by investigating the joint typicality of the adjacency matrices of the two correlated graphs.  ...  It should be noted that a stronger definition for successful matching is used in [10] . V. Conclusion We have introduced the typicality matching algorithm for matching pairs of correlated graphs.  ... 
arXiv:1802.00918v1 fatcat:2p2xcgupe5g67jo63cbyhokq4e

Matching Graphs with Community Structure: A Concentration of Measure Approach [article]

F. Shirani, S. Garg, E. Erkip
2018 arXiv   pre-print
A matching scheme is proposed which operates based on typicality of the adjacency matrices of the graphs.  ...  In this paper, matching pairs of random graphs under the community structure model is considered.  ...  Matching Pairs of Correlated Graphs In this section, we describe the typicality matching scheme and provide achievable regions for the the matching scenarios formulated in Definition 7. A.  ... 
arXiv:1810.13347v1 fatcat:k4u2qtbxprajrpw5ps3s7xuize

Seeded Graph Matching: Efficient Algorithms and Theoretical Guarantees [article]

F. Shirani, S. Garg, E. Erkip
2017 arXiv   pre-print
Assuming an Erdos-Renyi model on the correlated graph pair, it is shown that successful matching is guaranteed when the number of seeds grows logarithmically with the number of vertices in the graphs.  ...  The algorithm uses 'typicality matching' and techniques from point-to-point communications for reliable matching.  ...  The problem of matching of correlated graphs was considered for pairs of Erdös-Rényi graphs [14] , [15] , [16] , [17] , as well as graphs with community structure [18] , [10] , [9] , [11] .  ... 
arXiv:1711.10360v1 fatcat:635uey43zrhnfbwjd5h7lmc7c4

A Concentration of Measure Approach to Correlated Graph Matching [article]

Farhad Shirani, Siddharth Garg, Elza Erkip
2021 arXiv   pre-print
In this paper, graph matching is considered under a stochastic model, where a pair of randomly generated graphs with pairwise correlated edges are to be matched such that given the labeling of the vertices  ...  New results on the typicality of permutations of sequences lead to necessary and sufficient conditions for successful matching based on the parameters of the CER model.  ...  Similar to the TM strategy for pairs of correlated graphs described in Section V, we propose a matching strategy based on typicality for collections of correlated graphs.  ... 
arXiv:2009.00467v2 fatcat:txv6d3f4rbax5f7fla5fk2n5e4

A Concentration of Measure Approach to Database De-anonymization [article]

Farhad Shirani, Siddharth Garg, Elza Erkip
2019 arXiv   pre-print
Concentration of measure theorems such as typicality and laws of large numbers are used to develop a database matching scheme and derive necessary conditions for successful matching.  ...  In this paper, matching of correlated high-dimensional databases is investigated.  ...  The problem of database matching under the I.I.D. database model is closely related to that of matching of Erdös-Rényi graphs [15] , where given a pair of stochastically correlated graphs, the objective  ... 
arXiv:1901.07655v3 fatcat:vdfgadzcczgdvibxpwqeph3ena

Knowledge and Cross-Pair Pattern Guided Semantic Matching for Question Answering

Zihan Xu, Hai-Tao Zheng, Shaopeng Zhai, Dong Wang
2020 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
Semantic matching is a basic problem in natural language processing, but it is far from solved because of the differences between the pairs for matching.  ...  We apply explicit cross-pair matching based on Graph Convolutional Network (GCN) to help KCG recognize general domain-independent Q-to-A patterns better.  ...  Therefore, we find it a good fit for capturing global correlations and learning cross-pair patterns.  ... 
doi:10.1609/aaai.v34i05.6478 fatcat:akek7h3txzdv7f3ybx36tdcwxi

A Robust Method for Image Stitching [article]

Matti Pellikka, Valtteri Lahtinen
2020 arXiv   pre-print
graph.  ...  We propose a novel method for large-scale image stitching that is robust against repetitive patterns and featureless regions in the imaginary.  ...  Global alignment of a pruned simple graph Alternatively, one can use the results of the previous minimization problem to prune the multigraph into a simple weighted graph for which the following typical  ... 
arXiv:2004.03860v2 fatcat:fviglw6qwvcdrozshmm5woo6li

Photo stream alignment for collaborative photo collection and sharing in social media

Jianchao Yang, Jiebo Luo, Jie Yu, Thomas S. Huang
2011 Proceedings of the 3rd ACM SIGMM international workshop on Social media - WSM '11  
Given the preferred similarity measure (e.g. visual, temporal, and spatial similarities), our algorithm performs photo stream alignment via matching on a sparse representation graph that forces the data  ...  With the popularity of digital cameras and camera phones, it is common for different people, who may or may not know each other, to attend the same event and take pictures and videos from different spatial  ...  Suppose we have s streams in total, for each pair of matched photo streams, we have the matched photo pair set M * pq , 1 ≤ p, q ≤ s found by Eqn. 10.  ... 
doi:10.1145/2072609.2072623 fatcat:swmoaj22tjaxfnydgqounqvhpi

Correlated probabilistic trajectories for pedestrian motion detection

Frank Perbet, Atsuto Maki, Bjorn Stenger
2009 2009 IEEE 12th International Conference on Computer Vision  
These are extracted from directed acyclic graphs whose edges represent temporal point correspondences and are weighted with their matching probability in terms of appearance and location.  ...  This representation tolerates the inherent trajectory ambiguity, for example due to occlusions. We then learn the correlation between the movement of two feet using a random forest classifier.  ...  Acknowledgments The authors would like to thank Roberto Cipolla for valuable discussions and the reviewers for constructive comments.  ... 
doi:10.1109/iccv.2009.5459372 dblp:conf/iccv/PerbetMS09 fatcat:ao6w57ynsregxcsscjjnd2h7ju

SPECTRE: Seedless Network Alignment via Spectral Centralities [article]

Mikhail Hayhoe, Francisco Barreras, Hamed Hassani, Victor M. Preciado
2019 arXiv   pre-print
Network alignment consists of finding a structure-preserving correspondence between the nodes of two correlated, but not necessarily identical, networks.  ...  Through extensive numerical simulations, we show that SPECTRE allows for fast run times and high accuracy on large synthetic and real-world networks, even those which do not exhibit a high correlation.  ...  Typically we choose f = 3/4, but this parameter may be increased if a larger matching is desired.  ... 
arXiv:1811.01056v2 fatcat:gvry7uvmzbhslpifaermeatq7u

A collaborative filtering approach to ad recommendation using the query-ad click graph

Tasos Anastasakos, Dustin Hillard, Sanjay Kshetramade, Hema Raghavan
2009 Proceeding of the 18th ACM conference on Information and knowledge management - CIKM '09  
We propose a new technique to determine the relevance of an ad document for a search query using click-through data.  ...  The proposed method is compared to three different baselines that are state-of-the-art for a commercial search engine.  ...  We provide an evaluation of the QuAd-Click-Graph ad suggestions for a sample set of 1,000 randomly selected queries that are representative of typical search engine traffic.  ... 
doi:10.1145/1645953.1646267 dblp:conf/cikm/AnastasakosHKR09 fatcat:3dmfwdft6jhjrgmgkiwc7lob24

Robust region-based stereo vision to build environment maps for robotics applications [chapter]

M. Angeles López, Filiberto Pla
1998 Lecture Notes in Computer Science  
The selection of an appropiate similarity criterion to create the initial nodes in the graph-based matching process is very important for reducing the time of computation considerably.  ...  Stereoscopic vision is an appropiate tool for building maps of the environment of a robot. When matching regions of the images, segmentation errors should be avoided.  ...  The use of regions make some of the matching constraints implicit or easier to introduce, and there are typically a lower number of regions than edges.  ... 
doi:10.1007/3-540-64574-8_422 fatcat:kehtmeftbzeijfym2ag3a4vkem

A Graph-Based Framework for Transmission of Correlated Sources Over Multiple-Access Channels

S. Sandeep Pradhan, Suhan Choi, Kannan Ramchandran
2007 IEEE Transactions on Information Theory  
A similar characterization of message-graphs that can reliably represent a pair of correlated sources is also provided.  ...  In this paper we consider a graph-based framework for transmission of correlated sources over multiple access channels.  ...  Further, it is shown that the coding scheme of Cover, El Gamal, and Salehi [10] can be interpreted as a match between the typicality-graph of the pair of sources and a subgraph of the typicality-graph  ... 
doi:10.1109/tit.2007.909093 fatcat:wn427w66mjam7mbrghbawzbbiy

Graph Matching via Optimal Transport [article]

Ali Saad-Eldin, Benjamin D. Pedigo, Carey E. Priebe, Joshua T. Vogelstein
2021 arXiv   pre-print
The graph matching problem seeks to find an alignment between the nodes of two graphs that minimizes the number of adjacency disagreements.  ...  However, current state-of-the-art algorithms are inefficient in matching very large graphs, though they produce good accuracy.  ...  We thank the NeuroData lab for helpful feedback, and Jonathan Larson for help with the network timeseries data.  ... 
arXiv:2111.05366v1 fatcat:pxpxluv2ofewni7jf5umikexpi

Spectral Graph Matching and Regularized Quadratic Relaxations: Algorithm and Theory

Zhou Fan, Cheng Mao, Yihong Wu, Jiaming Xu
2020 International Conference on Machine Learning  
For a universality class of correlated Wigner models, GRAMPA achieves exact recovery of the latent matching between two graphs with edge correlation 1 − 1/polylog(n) and average degree at least polylog  ...  This matches the state-of-theart guarantees for polynomial-time algorithms established for correlated Erdős-Rényi graphs, and significantly improves over existing spectral methods.  ...  Xu are grateful to Zorah Lähner for helpful suggestions on the experiment in Section 3.3. Y.  ... 
dblp:conf/icml/FanM0X20 fatcat:ittwdyfhbvf4nhjr7qg2exsffe
« Previous Showing results 1 — 15 out of 175,366 results