The piecewise smooth Mumford-Shah functional on an arbitrary graph

• Authors: Leo Grady;Christopher V. Alvino
• Venue: IEEE Transactions on Image Processing
• Year: 2009

The Mumford-Shah functional has had a major impact on a variety of image analysis problems, including image segmentation and filtering, and, despite being introduced over two decades ago, it is still in widespread use. Present day optimization of the Mumford-Shah functional is predominated by active contour methods. Until recently, these formulations necessitated optimization of the contour by evolving via gradient descent, which is known for its overdependence on initialization and the tendency to produce undesirable local minima. In order to reduce these problems, we reformulate the corresponding Mumford-Shah functional on an arbitrary graph and apply the techniques of combinatorial optimization to produce a fast, low-energy solution. In contrast to traditional optimization methods, use of these combinatorial techniques necessitates consideration of the reconstructed image outside of its usual boundary, requiring additionally the inclusion of regularization for generating these values. The energy of the solution provided by this graph formulation is compared with the energy of the solution computed via traditional gradient descent-based narrow-band level set methods. This comparison demonstrates that our graph formulation and optimization produces lower energy solutions than the traditional gradient descent based contour evolution methods in significantly less time. Finally, we demonstrate the usefulness of the graph formulation to apply the Mumford-Shah functional to new applications such as point clustering and filtering of nonuniformly sampled images.