ML Anthology

A Scalable Graph-Cut Algorithm for N-D Grids

Andrew Delong, Yuri Boykov
CVPR 2008
doi:10.1109/CVPR.2008.4587464 /cvpr/2008/delong2008cvpr-scalable/
CVPR Semantic Scholar

Cite

Text

Delong and Boykov. "A Scalable Graph-Cut Algorithm for N-D Grids." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2008. doi:10.1109/CVPR.2008.4587464

Markdown

[Delong and Boykov. "A Scalable Graph-Cut Algorithm for N-D Grids." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2008.](https://mlanthology.org/cvpr/2008/delong2008cvpr-scalable/) doi:10.1109/CVPR.2008.4587464

BibTeX

@inproceedings{delong2008cvpr-scalable,
  title     = {{A Scalable Graph-Cut Algorithm for N-D Grids}},
  author    = {Delong, Andrew and Boykov, Yuri},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2008},
  doi       = {10.1109/CVPR.2008.4587464},
  url       = {https://mlanthology.org/cvpr/2008/delong2008cvpr-scalable/}
}