CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2011 vol.33 Issue No.07 - July

Subscribe

Issue No.07 - July (2011 vol.33)

pp: 1384-1399

Leo Grady , Siemens Corporate Research, Princeton

Laurent Najman , Université Paris-Est, ESIEE, Noisy-le-Grand

Camille Couprie , Université Paris-Est, ESIEE, Noisy-le-Grand

ABSTRACT

In this work, we extend a common framework for graph-based image segmentation that includes the graph cuts, random walker, and shortest path optimization algorithms. Viewing an image as a weighted graph, these algorithms can be expressed by means of a common energy function with differing choices of a parameter q acting as an exponent on the differences between neighboring nodes. Introducing a new parameter p that fixes a power for the edge weights allows us to also include the optimal spanning forest algorithm for watershed in this same framework. We then propose a new family of segmentation algorithms that fixes p to produce an optimal spanning forest but varies the power q beyond the usual watershed algorithm, which we term the power watershed. In particular, when q=2, the power watershed leads to a multilabel, scale and contrast invariant, unique global optimum obtained in practice in quasi-linear time. Placing the watershed algorithm in this energy minimization framework also opens new possibilities for using unary terms in traditional watershed segmentation and using watershed to optimize more general models of use in applications beyond image segmentation.

INDEX TERMS

Combinatorial optimization, image segmentation, graph cuts, random walker, shortest paths, optimal spanning forests, Markov random fields.

CITATION

Leo Grady, Laurent Najman, Camille Couprie, "Power Watershed: A Unifying Graph-Based Optimization Framework",

*IEEE Transactions on Pattern Analysis & Machine Intelligence*, vol.33, no. 7, pp. 1384-1399, July 2011, doi:10.1109/TPAMI.2010.200REFERENCES