In order to track moving objects in long range against occlusion, interruption, and background clutter, this paper proposes a unified approach for global trajectory analysis. Instead of the traditional frame-by-frame tracking, our method recovers target trajectories based on a short sequence of video frames, e.g., 15 frames. We initially calculate a foreground map at each frame obtained from a state-of-the-art background model. An attribute graph is then extracted from the foreground map, where the graph vertices are image primitives represented by the composite features. With this graph representation, we pose trajectory analysis as a joint task of spatial graph partitioning and temporal graph matching. The task can be formulated by maximizing a posteriori under the Bayesian framework, in which we integrate the spatio-temporal contexts and the appearance models. The probabilistic inference is achieved by a data-driven Markov chain Monte Carlo algorithm. Given a period of observed frames, the algorithm simulates an ergodic and aperiodic Markov chain, and it visits a sequence of solution states in the joint space of spatial graph partitioning and temporal graph matching. In the experiments, our method is tested on several challenging videos from the public datasets of visual surveillance, and it outperforms the state-of-the-art methods.
(I) Sequential inference based methods use the information of the currently observed frame to predict the states of moving targets and assign their target identities. The classical examples are particle filtering @cite_41 @cite_0 @cite_28 and optical flow @cite_25 . Recently, Avidan @cite_12 proposed a learning-based tracker using the online Adaboost algorithm, which maintains a discriminative detector to track targets in the current frame. @cite_36 significantly improved the tracking performance using Multiple Instance Learning (MIL). Despite great success, these approaches may yield identity lossing (or switching) and trajectory fragmentation in terms of mutual-interaction, occlusion and spurious motion, because they make online decisions while discarding global information.
@cite_41 @cite_28 @cite_36 @cite_0 @cite_25 @cite_12
1499578337 2126701066 2167089254 2099263216 1990472920
We describe a Markov chain Monte Carlo based particle filter that effectively deals with interacting targets, i.e., targets that are influenced by the proximity and or behavior of other targets. Such interactions cause problems for traditional approaches to the data association problem. In response, we developed a joint tracker that includes a more sophisticated motion model to maintain the identity of targets throughout an interaction, drastically reducing tracker failures. The paper presents two main contributions: (1) we show how a Markov random field (MRF) motion prior, built on the fly at each time step, can substantially improve tracking when targets interact, and (2) we show how this can be done efficiently using Markov chain Monte Carlo (MCMC) sampling. We prove that incorporating an MRF to model interactions is equivalent to adding an additional interaction factor to the importance weights in a joint particle filter. Since a joint particle filter suffers from exponential complexity in the number of tracked targets, we replace the traditional importance sampling step in the particle filter with an MCMC sampling step. The resulting filter deals efficiently and effectively with complicated interactions when targets approach each other. We present both qualitative and quantitative results to substantiate the claims made in the paper, including a large scale experiment on a video-sequence of over 10,000 frames in length. The use of head movements in control applications leaves the hands free for other tasks and utilizes the mobility of the head to acquire and track targets over a wide field of view. We present the results of applying a Kalman filter to generate prediction estimates for tracking head positions. A simple kinematics approach based on the assumption of a piecewise constant acceleration process is suggested and is shown to track head positions with an rms error under 2 spl deg for head movements with accelerations smaller than 3000 spl deg s. To account for the wide range of head dynamic characteristics, an adaptive approach with input estimation is developed. The performance of the Kalman filter is compared to that based on a simple polynomial predictor. In this paper, we address the problem of learning an adaptive appearance model for object tracking. In particular, a class of tracking techniques called “tracking by detection” have been shown to give promising results at real-time speeds. These methods train a discriminative classifier in an online manner to separate the object from the background. This classifier bootstraps itself by using the current tracker state to extract positive and negative examples from the current frame. Slight inaccuracies in the tracker can therefore lead to incorrectly labeled training examples, which degrades the classifier and can cause further drift. In this paper we show that using Multiple Instance Learning (MIL) instead of traditional supervised learning avoids these problems, and can therefore lead to a more robust tracker with fewer parameter tweaks. We present a novel online MIL algorithm for object tracking that achieves superior results with real-time performance. In this paper, we develop a novel solution for particle filtering on general graphs. We provide an exact solution for particle filtering on directed cycle-free graphs. The proposed approach relies on a partial-order relation in an antichain decomposition that forms a high-order Markov chain over the partitioned graph. We subsequently derive a closed-form sequential updating scheme for conditional density propagation using particle filtering on directed cycle-free graphs. We also provide an approximate solution for particle filtering on general graphs by splitting graphs with cycles into multiple directed cycle-free subgraphs. We then use the sequential updating scheme by alternating among the directed cycle-free subgraphs to obtain an estimate of the density propagation. We rely on the proposed method for particle filtering on general graphs for two video tracking applications: 1) object tracking using high-order Markov chains; and 2) distributed multiple object tracking based on multi-object graphical interaction models. Experimental results demonstrate the improved performance of the proposed approach to particle filtering on graphs compared with existing methods for video tracking. Optical flow can be used to segment a moving object from its background provided the velocity of the object is distinguishable from that of the background, and has expected characteristics. Existing optical flow techniques often detect flow (and thus the object) in the background. To overcome this, we propose a new optical flow technique, which only determines optical flow in regions of motion. We also propose a method by which output from a tracking system can be fed back into the motion segmenter optical flow system to reinforce the detected motion, or aid in predicting the optical flow. This technique has been developed for use in person tracking systems, and our testing shows that for this application it is more effective than other commonly used optical flow techniques. When tested within a tracking system, it works with an average position error of less than six and a half pixels, outperforming the current CAVIAR benchmark system.