Light Field Segmentation Using a Ray-Based Graph Structure
Abstract
In this paper, we introduce a novel graph representation for interactive light field segmentation using Markov Random Field (MRF). The greatest barrier to the adoption of MRF for light field processing is the large volume of input data. The proposed graph structure exploits the redundancy in the ray space in order to reduce the graph size, decreasing the running time of MRF-based optimisation tasks. Concepts of free rays and ray bundles with corresponding neighbourhood relationships are defined to construct the simplified graph-based light field representation. We then propose a light field interactive segmentation algorithm using graph-cuts based on such ray space graph structure, that guarantees the segmentation consistency across all views. Our experiments with several datasets show results that are very close to the ground truth, competing with state of the art light field segmentation methods in terms of accuracy and with a significantly lower complexity. They also show that our method performs well on both densely and sparsely sampled light fields.
Cite
Text
Hog et al. "Light Field Segmentation Using a Ray-Based Graph Structure." European Conference on Computer Vision, 2016. doi:10.1007/978-3-319-46478-7_3Markdown
[Hog et al. "Light Field Segmentation Using a Ray-Based Graph Structure." European Conference on Computer Vision, 2016.](https://mlanthology.org/eccv/2016/hog2016eccv-light/) doi:10.1007/978-3-319-46478-7_3BibTeX
@inproceedings{hog2016eccv-light,
title = {{Light Field Segmentation Using a Ray-Based Graph Structure}},
author = {Hog, Matthieu and Sabater, Neus and Guillemot, Christine},
booktitle = {European Conference on Computer Vision},
year = {2016},
pages = {35-50},
doi = {10.1007/978-3-319-46478-7_3},
url = {https://mlanthology.org/eccv/2016/hog2016eccv-light/}
}