Hierarchical Video Representation with Trajectory Binary Partition Tree

Guillem Palou, Philippe Salembier; The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2013, pp. 2099-2106

Abstract


As early stage of video processing, we introduce an iterative trajectory merging algorithm that produces a regionbased and hierarchical representation of the video sequence, called the Trajectory Binary Partition Tree (BPT). From this representation, many analysis and graph cut techniques can be used to extract partitions or objects that are useful in the context of specific applications. In order to define trajectories and to create a precise merging algorithm, color and motion cues have to be used. Both types of informations are very useful to characterize objects but present strong differences of behavior in the spatial and the temporal dimensions. On the one hand, scenes and objects are rich in their spatial color distributions, but these distributions are rather stable over time. Object motion, on the other hand, presents simple structures and low spatial variability but may change from frame to frame. The proposed algorithm takes into account this key difference and relies on different models and associated metrics to deal with color and motion information. We show that the proposed algorithm outperforms existing hierarchical video segmentation algorithms and provides more stable and precise regions.

Related Material


[pdf]
[bibtex]
@InProceedings{Palou_2013_CVPR,
author = {Palou, Guillem and Salembier, Philippe},
title = {Hierarchical Video Representation with Trajectory Binary Partition Tree},
booktitle = {The IEEE Conference on Computer Vision and Pattern Recognition (CVPR)},
month = {June},
year = {2013}
}