Name
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. |
Year | Venue | Keywords |
|---|---|---|
2013 | 2013 20TH IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP 2013) | Optimization, superpixels, graph-matching |
DocType | Volume | ISSN |
Journal | abs/1301.1671 | 1522-4880 |
Citations | PageRank | References |
7 | 0.63 | 17 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Camille Couprie | 1 | 1337 | 74.61 |
| Clément Farabet | 2 | 1220 | 78.63 |
| Yann LeCun | 3 | 26090 | 3771.21 |
| Laurent Najman | 4 | 2365 | 172.20 |