Causal graph-based video segmentation

Abstract : Among the different methods producing superpixel segmentations of an image, the graph-based approach of Felzen-szwalb and Huttenlocher is broadly employed. One of its interesting properties is that the regions are computed in a greedy manner in quasi-linear time by using a minimum spanning tree. The algorithm may be trivially extended to video segmentation by considering a video as a 3D volume, however, this can not be the case for causal segmentation, when subsequent frames are unknown. In a framework exploiting minimum spanning trees all along, we propose an efficient video segmentation approach that computes temporally consistent pixels in a causal manner, filling the need for causal and real time applications.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [21 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00830820
Contributor : Laurent Najman <>
Submitted on : Wednesday, June 5, 2013 - 5:00:28 PM
Last modification on : Thursday, February 7, 2019 - 3:01:10 PM
Document(s) archivé(s) le : Tuesday, April 4, 2017 - 5:18:22 PM

File

icip2013_video_segm.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00830820, version 1

Citation

Camille Couprie, Clément Farabet, Yann Lecun, Laurent Najman. Causal graph-based video segmentation. International Conference on Image Processing, Sep 2013, Melbourne, Australia. pp.1-4. ⟨hal-00830820⟩

Share

Metrics

Record views

419

Files downloads

218