Temporal Coherent and Graph Optimized Manifold Ranking for Visual Tracking

04/17/2018
by   Bo Jiang, et al.
0

Recently, weighted patch representation has been widely studied for alleviating the impact of background information included in bounding box to improve visual tracking results. However, existing weighted patch representation models generally exploit spatial structure information among patches in each frame separately which ignore (1) unary featureof each patch and (2) temporal correlation among patches in different frames. To address this problem, we propose a novel unified temporal coherence and graph optimized ranking model for weighted patch representation in visual tracking problem. There are three main contributions of this paper. First, we propose to employ a flexible graph ranking for patch weight computation which exploits both structure information among patches and unary feature of each patch simultaneously. Second, we propose a new more discriminative ranking model by further considering the temporal correlation among patches in different frames. Third, a neighborhood preserved, low-rank graph is learned and incorporated to build a unified optimized ranking model. Experiments on two benchmark datasets show the benefits of our model.

READ FULL TEXT
research
10/04/2017

Visual Tracking via Learning Dynamic Patch-based Graph Representation

Existing visual tracking methods usually localize a target object with a...
research
05/06/2021

Unsupervised Visual Representation Learning by Tracking Patches in Video

Inspired by the fact that human eyes continue to develop tracking abilit...
research
03/16/2018

Patchwise object tracking via structural local sparse appearance model

In this paper, we propose a robust visual tracking method which exploits...
research
03/22/2023

Region-wise matching for image inpainting based on adaptive weighted low-rank decomposition

Digital image inpainting is an interpolation problem, inferring the cont...
research
05/17/2019

Neither Global Nor Local: A Hierarchical Robust Subspace Clustering For Image Data

In this paper, we consider the problem of subspace clustering in presenc...
research
03/13/2020

Patch Graph Rewriting

The basic principle of graph rewriting is the stepwise replacement of su...
research
05/22/2018

Part-Based Tracking by Sampling

We propose a novel part-based method for tracking an arbitrary object in...

Please sign up or login with your details

Forgot password? Click here to reset