Papers Hypergraph Matching
“Hypergraph Matching” 태그가 달린 논문 13편 · 필터 해제
DAMPER: A Dual-Stage Medical Report Generation Framework with Coarse-Grained MeSH Alignment and Fine-Grained Hypergraph Matching
Medical report generation is crucial for clinical diagnosis and patient management, summarizing diagnoses and recommendations based on medical imaging. However, existing work often overlook the clinical pipeline involved…
Hypergraph MatchingMedical Report GenerationFair Computation Offloading for RSMA-Assisted Mobile Edge Computing Networks
Rate splitting multiple access (RSMA) provides a flexible transmission framework that can be applied in mobile edge computing (MEC) systems. However, the research work on RSMA-assisted MEC systems is still at the infancy…
Edge-computingFairnessHypergraph MatchingHypergraph-Aided Task-Resource Matching for Maximizing Value of Task Completion in Collaborative IoT Systems
With the growing scale and intrinsic heterogeneity of Internet of Things (IoT) systems, distributed device collaboration becomes essential for effective task completion by dynamically utilizing limited communication and …
Hypergraph MatchingCURSOR: Scalable Mixed-Order Hypergraph Matching with CUR Decomposition
To achieve greater accuracy, hypergraph matching algorithms require exponential increases in computational resources. Recent kd-tree-based approximate nearest neighbor (ANN) methods, despite the sparsity of their compati…
Graph MatchingHypergraph MatchingTensor DecompositionAn Exact Hypergraph Matching Algorithm for Nuclear Identification in Embryonic Caenorhabditis elegans
Finding an optimal correspondence between point sets is a common task in computer vision. Existing techniques assume relatively simple relationships among points and do not guarantee an optimal match. We introduce an alg…
Hypergraph Matchingset matchingHypergraph Neural Networks for Hypergraph Matching
Hypergraph matching is a useful tool to find feature correspondence by considering higher-order structural information. Recently, the employment of deep learning has made great progress in the matching of graphs, sug…
Graph MatchingHypergraph MatchingNode ClassificationSimplicial Complex based Point Correspondence between Images warped onto Manifolds
Recent increase in the availability of warped images projected onto a manifold (e.g., omnidirectional spherical images), coupled with the success of higher-order assignment methods, has sparked an interest in the search …
Hypergraph MatchingNeural Graph Matching Network: Learning Lawler's Quadratic Assignment Problem with Extension to Hypergraph and Multiple-graph Matching
Graph matching involves combinatorial optimization based on edge-to-edge affinity matrix, which can be generally formulated as Lawler's Quadratic Assignment Problem (QAP). This paper presents a QAP network directly learn…
Combinatorial OptimizationGeneral ClassificationGraph MatchingHypergraph MatchingRanking with Fairness Constraints
Ranking algorithms are deployed widely to order a set of items in applications such as search engines, news feeds, and recommendation systems. Recent studies, however, have shown that, left unchecked, the output of ranki…
AttributeDiversityFairnessHypergraph Matching+1Kinematic Structure Correspondences via Hypergraph Matching
In this paper, we present a novel framework for finding the kinematic structure correspondence between two objects in videos via hypergraph matching. In contrast to prior appearance and graph alignment based matching met…
Hypergraph MatchingAn Efficient Multilinear Optimization Framework for Hypergraph Matching
Hypergraph matching has recently become a popular approach for solving correspondence problems in computer vision as it allows to integrate higher-order geometric information. Hypergraph matching can be formulated as a t…
Hypergraph MatchingActivity recognition from videos with parallel hypergraph matching on GPUs
In this paper, we propose a method for activity recognition from videos based on sparse local features and hypergraph matching. We benefit from special properties of the temporal domain in the data to derive a sequential…
Activity RecognitionGPUGraph MatchingHypergraph Matching+1A Flexible Tensor Block Coordinate Ascent Scheme for Hypergraph Matching
The estimation of correspondences between two images resp. point sets is a core problem in computer vision. One way to formulate the problem is graph matching leading to the quadratic assignment problem which is NP-hard.…
Graph MatchingHypergraph MatchingSecond-order methods