Analytical dynamic programming tracker

Authors:
Seiichi Uchida;Ikko Fujimura;Hiroki Kawano;Yaokai Feng
Affiliations:
Kyushu University, Fukuoka, Japan;Kyushu University, Fukuoka, Japan;Kyushu University, Fukuoka, Japan;Kyushu University, Fukuoka, Japan
Venue:
ACCV'10 Proceedings of the 10th Asian conference on Computer vision - Volume Part I
Year:
2010

Citing 9
Cited 1

Using Dynamic Programming for Solving Variational Problems in Vision

IEEE Transactions on Pattern Analysis and Machine Intelligence
Dynamic Programming for Detecting, Tracking, and Matching Deformable Contours

IEEE Transactions on Pattern Analysis and Machine Intelligence
On the optimal detection of curves in noisy pictures

Communications of the ACM
A Coarse-to-Fine Deformable Contour Optimization Framework

IEEE Transactions on Pattern Analysis and Machine Intelligence
Bi-Directional Tracking Using Trajectory Segment Analysis

ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Tracking Using Dynamic Programming for Appearance-Based Sign Language Recognition

FGR '06 Proceedings of the 7th International Conference on Automatic Face and Gesture Recognition
Interactive Feature Tracking using K-D Trees and Dynamic Programming

CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1
Object tracking: A survey

ACM Computing Surveys (CSUR)
A Combinatorial Solution for Model-Based Image Segmentation and Real-Time Tracking

IEEE Transactions on Pattern Analysis and Machine Intelligence

Analytical dynamic programming matching

ECCV'12 Proceedings of the 12th international conference on Computer Vision - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Visual tracking is formulated as an optimization problem of the position of a target object on video frames. This paper proposes a new tracking method based on dynamic programming (DP). Conventional DP-based tracking methods have utilized DP as an efficient breadth-first search algorithm. Thus, their computational complexity becomes prohibitive if the search breadth becomes large according to the increase of the number of parameters to be optimized. In contrast, the proposed method can avoid this problem by utilizing DP as an analytical solver rather than the conventional breadth-first search algorithm. In addition to experimental evaluations, it will be revealed that the proposed method has a close relation to the well-known KLT tracker.