Graph Matching
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 0
- 평가표
- 7
- 보존된 평가 기록
- 83
Graph Matching is the problem of finding correspondences between two sets of vertices while preserving complex relational information among them. Since the graph structure has a strong capacity to represent objects and robustness to severe deformation and outliers, it is frequently adopted to formulate various correspondence problems in the field of computer vision. Theoretically, the Graph Matching problem can be solved by exhaustively searching the entire solution space. However, this approach is infeasible in practice because the solution space expands exponentially as the size of input data increases. For that reason, previous studies have attempted to solve the problem by using various approximation techniques.
Source: Consistent Multiple Graph Matching with Multi-layer Random Walks Synchronization
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Disentangled Structural and Featural Representation for Task-Agnostic Graph Valuation
Cross-domain Named Entity Recognition via Graph Matching
Neural Graph Matching for Video Retrieval in Large-Scale Video-driven E-commerce
DNTextSpotter: Arbitrary-Shaped Scene Text Spotting via Improved Denoising Training
The Research of Group Re-identification from Multiple Cameras
LinSATNet: The Positive Linear Satisfiability Neural Networks
FuncEvalGMN: Evaluating Functional Correctness of SQL via Graph Matching Network
Contrastive General Graph Matching with Adaptive Augmentation Sampling
Geodesic Distance Between Graphs: A Spectral Metric for Assessing the Stability of Graph Neural Networks
A Unified Framework for Integer Programming Formulation of Graph Matching Problems
Network two-sample test for block models
Semantic Similarity Score for Measuring Visual Similarity at Semantic Level
ContrastAlign: Toward Robust BEV Feature Alignment via Contrastive Learning for Multi-Modal 3D Object Detection
Network Interdiction Goes Neural
Differentiable Proximal Graph Matching
Multi Player Tracking in Ice Hockey with Homographic Projections
OAEI Machine Learning Dataset for Online Model Generation
Rematch: Robust and Efficient Matching of Local Knowledge Graphs to Improve Structural and Semantic Similarity
SG-PGM: Partial Graph Matching Network with Semantic Geometric Fusion for 3D Scene Graph Alignment and Its Downstream Tasks
Semi-Supervised Image Captioning Considering Wasserstein Graph Matching
Cross-modal Retrieval with Noisy Correspondence via Consistency Refining and Mining
DSGG: Dense Relation Transformer for an End-to-end Scene Graph Generation
GraphBEV: Towards Robust BEV Feature Alignment for Multi-Modal 3D Object Detection
Ensemble Quadratic Assignment Network for Graph Matching
Extreme Point Pursuit -- Part II: Further Error Bound Analysis and Applications
Bigraph Matching Weighted with Learnt Incentive Function for Multi-Robot Task Allocation
CURSOR: Scalable Mixed-Order Hypergraph Matching with CUR Decomposition
Multi-graph Graph Matching for Coronary Artery Semantic Labeling
Perfect Recovery for Random Geometric Graph Matching with Shallow Graph Neural Networks
Do Vision and Language Encoders Represent the World Similarly?
SAT-Based Algorithms for Regular Graph Pattern Matching
ZeroReg: Zero-Shot Point Cloud Registration with Foundation Models
xNeuSM: Explainable Neural Subgraph Matching with Graph Learnable Multi-hop Attention Networks
SpotServe: Serving Generative Large Language Models on Preemptible Instances
GMTR: Graph Matching Transformers
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.