Globally Optimal Regions and Boundaries

Abstract

We propose a new form of energy functional for the segmentation of regions in images, and an efficient method for finding its global optima. The energy can have contributions from both the region and its boundary, thus combining the best features of region- and boundary-based approaches to segmentation. By transforming the region energy into a boundary energy, we can treat both contributions on an equal footing, and solve the global optimization problem as a minimum mean weight cycle problem on a directed graph. The simple, polynomial-time algorithm requires no initialization and is highly parallelizable

Cite

Text

Jermyn and Ishikawa. "Globally Optimal Regions and Boundaries." IEEE/CVF International Conference on Computer Vision, 1999. doi:10.1109/ICCV.1999.790318

Markdown

[Jermyn and Ishikawa. "Globally Optimal Regions and Boundaries." IEEE/CVF International Conference on Computer Vision, 1999.](https://mlanthology.org/iccv/1999/jermyn1999iccv-globally/) doi:10.1109/ICCV.1999.790318

BibTeX

@inproceedings{jermyn1999iccv-globally,
  title     = {{Globally Optimal Regions and Boundaries}},
  author    = {Jermyn, Ian and Ishikawa, Hiroshi},
  booktitle = {IEEE/CVF International Conference on Computer Vision},
  year      = {1999},
  pages     = {904-910},
  doi       = {10.1109/ICCV.1999.790318},
  url       = {https://mlanthology.org/iccv/1999/jermyn1999iccv-globally/}
}