Papers Graph Matching
“Graph Matching” 태그가 달린 논문 515편 · 필터 해제
Incremental Multi-graph Matching via Diversity and Randomness based Graph Clustering
Multi-graph matching refers to finding correspondences across graphs, which are traditionally solved by matching all the graphs in a single batch. However in real-world applications, graphs are often collected incrementa…
AllClusteringDiversityGraph Clustering+1Neural Graph Matching Networks for Fewshot 3D Action Recognition
We propose Neural Graph Matching (NGM) Networks, a novel framework that can learn to recognize a previous unseen 3D action class with only a few examples. We achieve this by leveraging the inherent structure of 3D data t…
3D Action RecognitionAction RecognitionFew-Shot LearningGraph Matching+2Ranking with Features: Algorithm and A Graph Theoretic Analysis
We consider the problem of ranking a set of items from pairwise comparisons in the presence of features associated with the items. Recent works have established that $O(n\log(n))$ samples are needed to rank well when the…
Graph MatchingMatrix CompletionCategory-level 6D Object Pose Recovery in Depth Images
Intra-class variations, distribution shifts among source and target domains are the major challenges of category-level tasks. In this study, we address category-level full 6D object pose estimation in the context of dept…
6D Pose Estimation using RGBGraph MatchingObjectPose EstimationConsistent polynomial-time unseeded graph matching for Lipschitz graphons
We propose a consistent polynomial-time method for the unseeded node matching problem for networks with smooth underlying structures. Despite widely conjectured by the research community that the structured graph matchin…
Graph MatchingGraphon EstimationSeeded Graph Matching via Large Neighborhood Statistics
We study a well known noisy model of the graph isomorphism problem. In this model, the goal is to perfectly recover the vertex correspondence between two edge-correlated Erd\H{o}s-R\'{e}nyi random graphs, with an initial…
Graph MatchingAdaptively Transforming Graph Matching
Recently, many graph matching methods that incorporate pairwise constraint and that can be formulated as a quadratic assignment problem (QAP) have been proposed. Although these methods demonstrate promising results for t…
Domain AdaptationGraph MatchingDecentralized Task Allocation in Multi-Robot Systems via Bipartite Graph Matching Augmented with Fuzzy Clustering
Robotic systems, working together as a team, are becoming valuable players in different real-world applications, from disaster response to warehouse fulfillment services. Centralized solutions for coordinating multi-robo…
ClusteringDisaster ResponseGraph MatchingProblem Decomposition+2Unseeded low-rank graph matching by transform-based unsupervised point registration
The problem of learning a correspondence relationship between nodes of two networks has drawn much attention of the computer science community and recently that of statisticians. The unseeded version of this problem, in …
Graph MatchingPoster Abstract: Hierarchical Subchannel Allocation for Mode-3 Vehicle-to-Vehicle Sidelink Communications
In V2V Mode-3, eNodeBs assign subchannels to vehicles in order for them to periodically broadcast CAM messages \cite{b2}. A crucial aspect is to ensure that vehicles in the same cluster will broadcast in orthogonal time …
Graph MatchingTrQuery: An Embedding-based Framework for Recommanding SPARQL Queries
In this paper, we present an embedding-based framework (TrQuery) for recommending solutions of a SPARQL query, including approximate solutions when exact querying solutions are not available due to incompleteness or inco…
Graph MatchingMAP inference via Block-Coordinate Frank-Wolfe Algorithm
We present a new proximal bundle method for Maximum-A-Posteriori (MAP) inference in structured energy minimization problems. The method optimizes a Lagrangean relaxation of the original energy minimization problem using …
Graph MatchingDeep Learning of Graph Matching
The problem of graph matching under node and pair-wise constraints is fundamental in areas as diverse as combinatorial optimization, machine learning or computer vision, where representing both the relations between node…
Combinatorial OptimizationDeep LearningGraph MatchingMolGAN: An implicit generative model for small molecular graphs
Deep generative models for graph-structured data offer a new angle on the problem of chemical synthesis: by optimizing differentiable models that directly generate molecular graphs, it is possible to side-step expensive …
Graph MatchingReinforcement LearningvalidUnsupervised Domain Adaptation using Regularized Hyper-graph Matching
Domain adaptation (DA) addresses the real-world image classification problem of discrepancy between training (source) and testing (target) data distributions. We propose an unsupervised DA method that considers the prese…
Domain AdaptationGraph Matchingimage-classificationImage Classification+2Parallel and Successive Resource Allocation for V2V Communications in Overlapping Clusters
The 3rd Generation Partnership Project (3GPP) has introduced in Rel. 14 a novel technology referred to as vehicle--to--vehicle (V2V) \textit{mode-3}. Under this scheme, the eNodeB assists in the resource allocation proce…
Graph MatchingGraph-Based Resource Allocation with Conflict Avoidance for V2V Broadcast Communications
In this paper we present a graph-based resource allocation scheme for sidelink broadcast vehicle-to-vehicle (V2V) communications. Harnessing available information on the geographical position of vehicles and spectrum res…
Graph MatchingRobust and Efficient Graph Correspondence Transfer for Person Re-identification
Spatial misalignment caused by variations in poses and viewpoints is one of the most critical issues that hinders the performance improvement in existing person re-identification (Re-ID) algorithms. To address this probl…
Graph MatchingPerson Re-Identification(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs
We give a quasipolynomial time algorithm for the graph matching problem (also known as noisy or robust graph isomorphism) on correlated random graphs. Specifically, for every $\gamma>0$, we give a $n^{O(\log n)}$ time al…
Graph MatchingLatent Fingerprint Recognition: Role of Texture Template
We propose a texture template approach, consisting of a set of virtual minutiae, to improve the overall latent fingerprint recognition accuracy. To compensate for the lack of sufficient number of minutiae in poor quality…
Graph MatchingTemplate Matching