Hypergraph Matching With an Entropy Barrier Function
نویسندگان
چکیده
منابع مشابه
A natural barrier in random greedy hypergraph matching
Let r be a fixed constant and let H be an r-uniform, D-regular hypergraph on N vertices. Assume further that D → ∞ as N → ∞ and that co-degrees of pairs of vertices in H are at most L where L = o(D/ log N). We consider the random greedy algorithm for forming a matching in H. We choose a matching at random by iteratively choosing edges uniformly at random to be in the matching and deleting all e...
متن کاملOn a Hypergraph Matching Problem
Let H = (V,E) be an r-uniform hypergraph and let F ⊂ 2 . A matching M of H is (α,F)perfect if for each F ∈ F , at least α|F | vertices of F are covered by M . Our main result is a theorem giving sufficient conditions for an r-uniform hypergraph to have a (1− ,F)-perfect matching. As a special case of our theorem we obtain the following result. Let K(n, r) denote the complete r-uniform hypergrap...
متن کاملActivity 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 and fast graph matching algorithm for GPUs. Traditionally, graphs and hypergraphs are frequently used to recognize complex and often non-rigid patterns in computer vision, eith...
متن کاملIterative Packing for Demand and Hypergraph Matching
Iterative rounding has enjoyed tremendous success in elegantly resolving open questions regarding the approximability of problems dominated by covering constraints. Although iterative rounding methods have been applied to packing problems, no single method has emerged that matches the effectiveness and simplicity afforded by the covering case. We offer a simple iterative packing technique that ...
متن کاملLearning Hypergraph Labeling for Feature Matching
This study poses the feature correspondence problem as a hypergraph node labeling problem. Candidate feature matches and their subsets (usually of size larger than two) are considered to be the nodes and hyperedges of a hypergraph. A hypergraph labeling algorithm, which models the subset-wise interaction by an undirected graphical model, is applied to label the nodes (feature correspondences) a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2895809