Segmentation of texture images is always a challenging problem in image processing. The authors propose a novel model for segmentation of texture images based on L 0 gradient norm. The model will do smoothing of texture in image and segmentation jointly. It is well known that L 0 gradient norm smooths the image and preserve the edges. Keeping this in view, the proposed model is using L 0 gradient norm for smoothing of texture in image and Chan–Vese energy for segmentation. For fast and efficient solution of the model, the authors use alternating minimisation algorithm. Experimental results of their proposed model, which are compared with well‐known (state of the art) existing models, validate better performance of the proposed model.

Automated segmentation of fine objects details in a given image is becoming of crucial interest in different imaging fields. In this paper, we propose a new variational level-set model for both global and interactive\selective segmentation tasks, which can deal with intensity inhomogeneity and the presence of noise. The proposed method maintains the same performance on clean and noisy vector-valued images. The model utilizes a combination of locally computed denoising constrained surface and a denoising fidelity term to ensure a fine segmentation of local and global features of a given image. A two-phase level-set formulation has been extended to a multi-phase formulation to successfully segment medical images of the human brain. Comparative experiments with state-of-the-art models show the advantages of the proposed method.

In this paper, we present two related multigrid algorithms for multiphase image segmentation. Algorithm I solves the model by Vese-Chan. We first generalize our recently developed multigrid method to this multiphase segmentation model (MG1); we also give a local Fourier analysis for the local smoother which leads to a new and more effective smoother. Although MG1 is found many magnitudes faster than the fast method of additive operator splitting (AOS), both algorithms are not robust with regard to the initial guess. To overcome this dependence on the initial guess, we consider a hierarchical segmentation model which achieves multiphase segmentation by repeated use of the Chan-Vese two-phase model; our Algorithm II solves this model by a multigrid algorithm (MG2). Numerical experiments show that both algorithms are efficient and in particular MG2 is more robust than MG1 with respect to initial guesses. AMS subject classifications: 68U10, 65F10, 65K10.