Search

Mumford---Shah and Potts functionals are powerful variational models for regularization which are widely used in signal and image processing; typical applications are edge-preserving denoising and segmentation. Being both non-smooth and non-convex, they are computationally challenging even for scalar data. For manifold-valued data, the problem becomes even more involved since typical features of vector spaces are not available. In this paper, we propose algorithms for Mumford---Shah and for Potts regularization of manifold-valued signals and images. For the univariate problems, we derive solvers based on dynamic programming combined with (convex) optimization techniques for manifold-valued data. For the class of Cartan---Hadamard manifolds (which includes the data space in diffusion tensor imaging (DTI)), we show that our algorithms compute global minimizers for any starting point. For the multivariate Mumford---Shah and Potts problems (for image regularization), we propose a splitting into suitable subproblems which we can solve exactly using the techniques developed for the corresponding univariate problems. Our method does not require any priori restrictions on the edge set and we do not have to discretize the data space. We apply our method to DTI as well as Q-ball imaging. Using the DTI model, we obtain a segmentation of the corpus callosum on real data.

We propose to incorporate a weighted difference of anisotropic and isotropic total variation (TV) norms into a relaxed formulation of the two phase Mumford-Shah (MS) model for image segmentation. We show results exceeding those obtained by the MS model when using the standard TV norm to regularize partition boundaries. In particular, examples illustrating the qualitative differences between the proposed model and the standard MS one are shown. A fast numerical method is introduced to minimize the proposed model utilizing the difference-of-convex algorithm (DCA) and the primal dual hybrid gradient (PDHG) method.

Image inpainting is an artistic procedure to recover a damaged painting or picture. We propose a novel approach for image inpainting by using the Mumford-Shah (MS) model and the level set method to estimate image structure of the damaged regions. This approach has been successfully used in image segmentation problem. Compared to some other inpainting methods, the MS model approach detects and preserves edges in the inpainting areas. We propose a fast and efficient algorithm that achieves both inpainting and segmentation. In previous works on the MS model, only one or two level set functions are used to segment an image. While this approach works well on simple cases, detailed edges cannot be detected in complicated image structures. Although multi-level set functions can be used to segment an image into many regions, the traditional approach causes extensive computations and the solutions depend on the location of initial curves. Our proposed approach utilizes faster hierarchical level set method and guarantees convergence independent of initial conditions. Because we detect both the main structure and the detailed edges, our approach preserves edges in the inpainting area. Also, exemplar-based approach for filling textured regions is employed. Experimental results demonstrate the advantage of our method.

Variational models have been studied for image segmentation application since the Mumford-Shah functional was introduced in the late 1980s. In this paper, we focus on multiphase segmentation with a new regularization term that yields an unsupervised segmentation model. We propose a functional that automatically chooses a favorable number of phases as it segments the image. The primary driving force of the segmentation is the intensity fitting term while a phase scale measure complements the regularization term. We propose a fast, yet simple, brute-force numerical algorithm and present experimental results showing the robustness and stability of the proposed model.

Blind image deconvolution is required in many applications of microscopy imaging, remote sensing, and astronomical imaging. Unfortunately, in a single-channel framework, serious conceptual and numerical problems are often encountered. An eigenvector-based method (EVAM) has been proposed for a multichannel framework which determines perfectly convolution masks in a noise-free environment if channel disparity, called co-primeness, is satisfied (see Harikumar, G. and Bresler, Y., ibid., vol.8, no.2, p.202-19, 1999; Proc. ICIP 96, vol.3, p.97-100, 1996). We propose a novel iterative algorithm based on recent anisotropic denoising techniques of total variation and a Mumford-Shah functional with the EVAM restoration condition included. A linearization scheme of half-quadratic regularization together with a cell-centered finite difference discretization scheme is used in the algorithm and provides a unified approach to the solution of total variation or Mumford-Shah. The algorithm performs well even on very noisy images and does not require an exact estimation of mask orders. We demonstrate the capabilities of the algorithm on synthetic data. Finally, the algorithm is applied to defocused images taken with a digital camera and to data from astronomical ground-based observations of the Sun.

We cast the problem of shape reconstruction of a scene as the global region segmentation of a collection of calibrated images. We assume that the scene is composed of a number of smooth surfaces and a background, both of which support smooth Lambertian radiance functions. We formulate the problem in a variational framework, where the solution (both the shape and radiance of the scene) is a minimizer of a global cost functional which combines a geometric prior on shape, a smoothness prior on radiance and a data fitness score. We estimate the shape and radiance via an alternating minimization: The radiance is computed as the solutions of partial differential equations defined on the surface and the background. The shape is estimated using a gradient descent flow, which is implemented using the level set method. Our algorithm works for scenes with smooth radiances as well as fine homogeneous textures, which are known challenges to traditional stereo algorithms based on local correspondence.

In this work, we first address the problem of simultaneous image segmentation and smoothing by approaching the Mumford-Shah paradigm from a curve evolution perspective. In particular, we let a set of deformable contours define the boundaries between regions in an image where we model the data via piecewise smooth functions and employ a gradient flow to evolve these contours. Each gradient step involves solving an optimal estimation problem for the data within each region, connecting curve evolution and the Mumford-Shah functional with the theory of boundary-value stochastic processes. The resulting active contour model offers a tractable implementation of the original Mumford-Shah model (i.e., without resorting to elliptic approximations which have traditionally been favored for greater ease in implementation) to simultaneously segment and smoothly reconstruct the data within a given image in a coupled manner. Various implementations of this algorithm are introduced to increase its speed of convergence. We also outline a hierarchical implementation of this algorithm to handle important image features such as triple points and other multiple junctions. Next, by generalizing the data fidelity term of the original Mumford-Shah functional to incorporate a spatially varying penalty, we extend our method to problems in which data quality varies across the image and to images in which sets of pixel measurements are missing. This more general model leads us to a novel PDE-based approach for simultaneous image magnification, segmentation, and smoothing, thereby extending the traditional applications of the Mumford-Shah functional which only considers simultaneous segmentation and smoothing.

We present and detail a method for the numerical solving of the Mumford-Shah problem, based on a finite element method and on adaptive meshes. We start with the formulation introduced in [13], detail its numerical implementation and then propose a variant which is proved to converge to the Mumford-Shah problem. A few experiments are illustrated.

We present a series of results on the regularity of edges in the Mumford-Shah minimization process. We prove that an isolated connected component of the edge set is a finite union of C 1,1 arcs. A fundamental step of the proof is the characterization of the four possible global-minimizers having a connected edge.

In this paper we discuss the links between Mumford and Shah’s variational problem for (signal and) image segmentation, based on an energy functional of a continuous grey-level function, and the numerical algorithms proposed to solve it. These numerical approaches are based on a discrete functional. We recall that, in one dimension, this discrete functional is asymptotically equivalent to the continuous functional. This can be summarized in a $\Gamma $-convergence result. We show that the same result holds in dimension two, provided that the continuous energy is adapted to the anisotropy of the discrete approaches. We display a few experimental results in dimensions one and two.

We propose a new model for active contours based on a geometric partial differential equation. Our model is intrinsec, stable (satisfies the maximum principle) and permits a rigorous mathematical analysis. It enables us to extract smooth shapes (we cannot retrieve angles) and it can be adapted to find several contours simultaneously. Moreover, as a consequence of the stability, we can design robust algorithms which can be engineed with no parameters in applications. Numerical experiments are presented.

Topological sensitivity analysis is performed for the piecewise constant Mumford-Shah functional. Topological and shape derivatives are combined in order to derive an algorithm for image segmentation with fully automatized initialization. Segmentation of 2D and 3D data is presented. Further, a generalized Mumford-Shah functional is proposed and numerically investigated for the segmentation of images modulated due to, e.g., coil sensitivities.

The capability of sonoelastography to detect lesions based on elasticity contrast can be applied to monitor the creation of thermally ablated lesion. Currently, segmentation of lesions depicted in sonoelastographic images is performed manually which can be a time consuming process and prone to significant intra- and inter-observer variability. This work presents a semi-automated segmentation algorithm for sonoelastographic data. The user starts by planting a seed in the perceived center of the lesion. Fast marching methods use this information to create an initial estimate of the lesion. Subsequently, level set methods refine its final shape by attaching the segmented contour to edges in the image while maintaining smoothness. The algorithm is applied to in vivo sonoelastographic images from twenty five thermal ablated lesions created in porcine livers. The estimated area is compared to results from manual segmentation and gross pathology images. Results show that the algorithm outperforms manual segmentation in accuracy, inter- and intra-observer variability. The processing time per image is significantly reduced.

We propose a new model for active contours to detect objects in a given image, based on techniques of curve evolution, Mumford-Shah (1989) functional for segmentation and level sets. Our model can detect objects whose boundaries are not necessarily defined by the gradient. We minimize an energy which can be seen as a particular case of the minimal partition problem. In the level set formulation, the problem becomes a "mean-curvature flow"-like evolving the active contour, which will stop on the desired boundary. However, the stopping term does not depend on the gradient of the image, as in the classical active contour models, but is instead related to a particular segmentation of the image. We give a numerical algorithm using finite differences. Finally, we present various experimental results and in particular some examples for which the classical snakes methods based on the gradient are not applicable. Also, the initial curve can be anywhere in the image, and interior contours are automatically detected.

Image segmentation using the piecewise smooth variational model proposed by Mumford and Shah is both robust and computationally expensive. Fortunately, both the intermediate segmentations computed in the process of the evolution, and the final segmentation itself have a common structure. They typically resemble a linear combination of blurred versions of the original image. In this paper, we present methods for fast approximations to Mumford-Shah segmentation using reduced image bases. We show that the majority of the robustness of Mumford-Shah segmentation can be obtained without allowing each pixel to vary independently in the implementation. We illustrate segmentations of real images that show how the proposed segmentation method is both computationally inexpensive, and has comparable performance to Mumford-Shah segmentations where each pixel is allowed to vary freely.

In this note we adapt the calibration method to functionals of Mumford-Shah type, and provide a criterion (Theorem 1) to verify if a given function is energy min- imizing. Among other applications, we use this criterion to show that certain triple-junction configurations are minimizing (Example 3). Une methode de calibration pour la fonctionnelle de Mumford-Shah

An algorithm, based on the Mumford-Shah (M-S) functional, for image contour segmentation and object smoothing in the presence of noise is proposed. However, in the proposed algorithm, contour length minimisation is not required and it is demonstrated that the M-S functional without contour length minimisation becomes an edge detector. Optimisation of this nonlinear functional is based on the method of calculus of variations, which is implemented by using the level set method. Fourier and Legendre's series are also employed to improve the segmentation performance of the proposed algorithm. The segmentation results clearly demonstrate the effectiveness of the proposed approach for images with low signal-to-noise ratios.

An improved Mumford-Shah functional for coupled edge-preserving regularization and image segmentation is presented. A nonlinear smooth constraint function is introduced that can induce edge-preserving regularization thus also facilitate the coupled image segmentation. The formulation of the functional is considered from the level set perspective, so that explicit boundary contours and edge-preserving regularization are both addressed naturally. To reduce computational cost, a modified additive operator splitting (AOS) algorithm is developed to address diffusion equations defined on irregular domains and multi-initial scheme is used to speed up the convergence rate. Experimental results by our approach are provided and compared with that of Mumford-Shah functional and other edge-preserving approach, and the results show the effectiveness of the proposed method.

We show how the piecewise-smooth Mumford-Shah segmentation problem can be solved using the level set method of Osher and Sethian (1988). The obtained algorithm can be simultaneously used to denoise, segment, detect-extract edges, and perform active contours. The proposed model is also a generalisation of a previous active contour model without edges, proposed by the authors in Chan et al., (2001), and of its extension to the case with more than two segments for piecewise-constant segmentation Chan et al., (2000). Based on the four color theorem, we can assume that in general, at most two level set functions are sufficient to detect and represent distinct objects of distinct intensities, with triple junctions, or T-junctions.

In this paper, we introduce a novel approach for simultaneous restoration and segmentation of blurred noisy images by approaching a variant of the Mumford-Shah functional from a curve evolution perspective. In particular, by viewing the active contour as the set of discontinuities in the image, we derive a gradient flow to minimize an extended Mumford-Shah functional where the known blurring function is incorporated as part of the data fidelity term. Each gradient step involves solving a discrete approximation of the corresponding partial differential equation to obtain a smooth and deblurred estimate of the observed image without blurring across the curve. The experimental results based on both synthetic and real images demonstrate that the proposed method segments and restores the blurred images effectively. We conclude that our work is an edge-preserving image restoration technique that couples segmentation, denoising, and deblurring within a single framework. In addition, this framework provides an intellectual connection between regularization theory (used to solve the deblurring inverse problem) and the theory of curve evolution.