SCIENCE@home

A Dirichlet Energy Criterion for Graph-Based Image Segmentation

Dominique Zosso,B. Osting,S. Osher

Published 2015 in 2015 IEEE International Conference on Data Mining Workshop (ICDMW)

ABSTRACT

We consider a graph-based approach for image segmentation. We introduce several novel graph construction models which are based on graph-based segmentation criteria extending beyond -- and bridging the gap between -- segmentation approaches based on edges and homogeneous regions alone. The resulting graph is partitioned using a criterion based on the sum of the minimal Dirichlet energies of partition components. We propose an efficient primal-dual method for computing the Dirichlet energy ground state of partition components and a rearrangement algorithm is used to improve graph partitions. The method is applied to a number of example segmentation problems. We demonstrate the graph partitioning method on the five-moons toy problem, and illustrate the various image-based graph constructions, before successfully running a variety of region-, edge-, hybrid, and texture-based image segmentation experiments. Our method seamlessly generalizes region-and edge-based image segmentation to the multi-phase case and can intrinsically deal with image bias as well as more interesting image features such as texture descriptors.

PUBLICATION RECORD

  • Publication year

    2015

  • Venue

    2015 IEEE International Conference on Data Mining Workshop (ICDMW)

  • Publication date

    2015-11-01

  • Fields of study

    Mathematics, Computer Science

  • Identifiers
    DOI 10.1109/ICDMW.2015.112
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-61 of 61 references · Page 1 of 1

CITED BY

Showing 1-8 of 8 citing papers · Page 1 of 1