paper-with-me

홈 › Papers

Geometric Hypergraph Learning for Visual Tracking

2016-03-18 · Dawei Du, Honggang Qi, Longyin Wen, Qi Tian, Qingming Huang, Siwei Lyu

Graph based representation is widely used in visual tracking field by finding correct correspondences between target parts in consecutive frames. However, most graph based trackers consider pairwise geometric relations between local parts. They do not make full use of the target's intrinsic structure, thereby making the representation easily disturbed by errors in pairwise affinities when large deformation and occlusion occur. In this paper, we propose a geometric hypergraph learning based tracking method, which fully exploits high-order geometric relations among multiple correspondences of parts in consecutive frames. Then visual tracking is formulated as the mode-seeking problem on the hypergraph in which vertices represent correspondence hypotheses and hyperedges describe high-order geometric relations. Besides, a confidence-aware sampling method is developed to select representative vertices and hyperedges to construct the geometric hypergraph for more robustness and scalability. The experiments are carried out on two challenging datasets (VOT2014 and Deform-SOT) to demonstrate that the proposed method performs favorable against other existing trackers.

📄 PDF Abstract BibTeX arXiv:1603.05930

Code (0)

등록된 구현이 없습니다.

Tasks

Visual Tracking

Similar Papers 제목 키워드 기반

Multiple Hypothesis Hypergraph Tracking for Posture Identification in Embryonic Caenorhabditis elegans

2021-11-11 · Andrew Lauziere, Evan Ardiel, Stephen Xu, Hari Shroff

Current methods in multiple object tracking (MOT) rely on independent object trajectories undergoing predictable motion to effectively track large numbers of objects. Adversarial conditions such as volatile object motion…

Cell TrackingMultiple Object TrackingObjectObject Tracking

Instruction Set and Language for Hypergraphs

2026-07-11 · Mario Pascual-Gonzalez, Ezequiel Lopez-Rubio arxiv

We present IsalHG, a method for representing the structure of any finite, connected hypergraph of bounded hyperedge arity as a string over a compact instruction alphabet $Σ_{\mathrm{HG}}$. The encoding is executed by a s…

Sparse random hypergraphs: Non-backtracking spectra and community detection

2022-03-14 · Ludovic Stephan, Yizhe Zhu

We consider the community detection problem in a sparse $q$-uniform hypergraph $G$, assuming that $G$ is generated according to the Hypergraph Stochastic Block Model (HSBM). We prove that a spectral method based on the n…

Community DetectionDimensionality ReductionStochastic Block Model

Hypergraph Modelling for Geometric Model Fitting

2016-07-11 · Guobao Xiao, Hanzi Wang, Taotao Lai, David Suter

In this paper, we propose a novel hypergraph based method (called HF) to fit and segment multi-structural data. The proposed HF formulates the geometric model fitting problem as a hypergraph partition problem based on a …

model

Nonbacktracking spectral clustering of nonuniform hypergraphs

2022-04-27 · Philip Chodrow, Nicole Eikmeier, Jamie Haddock

Spectral methods offer a tractable, global framework for clustering in graphs via eigenvector computations on graph matrices. Hypergraph data, in which entities interact on edges of arbitrary size, poses challenges for m…

Clustering