Fast Algorithms for Two-Phase Image Variation Segmentation Based on Convex Relaxation Models

2014 ◽  
Vol 36 (5) ◽  
pp. 1086-1096
Author(s):  
Cheng-Shun JIANG ◽  
Xian-Chao WANG
Author(s):  
Vinicius R. P. Borges ◽  
Celia A. Zorzo Barcelos ◽  
Denise Guliato ◽  
Marcos Aurelio Batista

Author(s):  
Sunil Prasad Jaiswal ◽  
Oscar C. Au ◽  
Juhi Bhadviya ◽  
Vinit Jakhetiya ◽  
Yuan Yuan ◽  
...  

2014 ◽  
Vol 536-537 ◽  
pp. 172-175
Author(s):  
Bing Chen ◽  
Dong Dong Yang ◽  
Gang Lu ◽  
Hong Xiao Feng

In this study, a novel two-phase image segmentation algorithm (TPIS) by using nonlocal mean filter and kernel evolutionary clustering in local learning is proposed. Currently, the difficulties for image segmentation lie in its vast pixels with overlapping characteristic and the noise in the different process of imaging. Here, we want to use nonlocal mean filter to remove different types of noise in the image, and then, two kernel clustering indices are designed in evolutionary optimization. Besides, the local learning strategy is designed using local coefficient of variation of each local pixels or image patch is employed to update the quality of the local segments. The new algorithm is used to solve different image segmentation tasks. The experimental results show that TPIS is competent for segmenting majority of the test images with high quality.


2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Lumin Fan ◽  
Lingli Shen ◽  
Xinghua Zuo

In this paper, we propose an improved algorithm based on the active contour model Mumford-Shah model for CT images, which is the subject of this study. After analyzing the classical Mumford-Shah model and related improvement algorithms, we found that most of the improvement algorithms start from the initialization strategy of the model and the minimum value solution of the energy generalization function, so we will also improve the classical Mumford-Shah model from these two perspectives. For the initialization strategy of the Mumford-Shah model, we propose to first reduce the dimensionality of the image data by the PCA principal component analysis method, and for the reduced image feature vector, we use K -means, a general clustering method, as the initial position algorithm of the segmentation curve. For the image data that have completed the above two preprocessing processes, we then use the Mumford-Shah model for image segmentation. The Mumford-Shah curve evolution model solves the image segmentation by finding the minimum of the energy generalization of its model to obtain the optimal result of image segmentation, so for solving the minimum of the Mumford-Shah model, we first optimize the discrete problem of the energy generalization of the model by the convex relaxation technique and then use the Chambolle-Pock pairwise algorithm We then use the Chambolle-Pock dual algorithm to solve the optimization problem of the model after convex relaxation and finally obtain the image segmentation results. Finally, a comparison with the existing model through many numerical experiments shows that the model proposed in this paper calculates the texture image segmentation with high accuracy and good edge retention. Although the work in this paper is aimed at two-phase image segmentation, it can be easily extended to multiphase segmentation problems.


2021 ◽  
Author(s):  
Huan Li ◽  
Jinglei Tang ◽  
Xujing Zhou

2016 ◽  
Vol 10 (4) ◽  
pp. 302-313 ◽  
Author(s):  
Jack Spencer ◽  
Ke Chen

Automatic segmentation in the variational framework is a challenging task within the field of imaging sciences. Achieving robustness is a major problem, particularly for images with high levels of intensity inhomogeneity. The two-phase piecewise-constant case of the Mumford-Shah formulation is most suitable for images with simple and homogeneous features where the intensity variation is limited. However, it has been applied to many different types of synthetic and real images after some adjustments to the formulation. Recent work has incorporated bias field estimation to allow for intensity inhomogeneity, with great success in terms of segmentation quality. However, the framework and assumptions involved lead to inconsistencies in the method that can adversely affect results. In this paper we address the task of generalising the piecewise-constant formulation, to approximate minimisers of the original Mumford-Shah formulation. We first review existing methods for treating inhomogeneity, and demonstrate the inconsistencies with the bias field estimation framework. We propose a modified variational model to account for these problems by introducing an additional constraint, and detail how the exact minimiser can be approximated in the context of this new formulation. We extend this concept to selective segmentation with the introduction of a distance selection term. These models are minimised with convex relaxation methods, where the global minimiser can be found for a fixed fitting term. Finally, we present numerical results that demonstrate an improvement to existing methods in terms of reliability and parameter dependence, and results for selective segmentation in the case of intensity inhomogeneity.


2009 ◽  
Vol 36 (1) ◽  
pp. 46-53 ◽  
Author(s):  
Jian-Feng Cai ◽  
Raymond H. Chan ◽  
Mila Nikolova

Sign in / Sign up

Export Citation Format

Share Document