We propose a method for tracking objects in H.264/AVC compressed videos using a Markov Random Field model. Given an initial segmentation of the target object in the first frame, our algorithm applies a graph-cuts-based optimization to output a binary segmentation map for the next frame. Our model uses only the motion vectors and block coding modes from the compressed bitstream. Thus, complexity and storage requirements are significantly reduced compared to pixel-domain algorithms. We evaluate our method over two datasets and compare its performance to a state-of-the-art compressed-domain algorithm. Results show that we achieve better results in more challenging sequences.
CITATION STYLE
Bombardelli, F., Gül, S., & Hellge, C. (2019). Compressed-Domain Video Object Tracking Using Markov Random Fields with Graph Cuts Optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11269 LNCS, pp. 127–139). Springer Verlag. https://doi.org/10.1007/978-3-030-12939-2_10
Mendeley helps you to discover research relevant for your work.