Communications on Applied Mathematics and Computation ›› 2024, Vol. 6 ›› Issue (2): 1369-1405.doi: 10.1007/s42967-023-00339-w

• ORIGINAL PAPERS • Previous Articles     Next Articles

An Efficient Smoothing and Thresholding Image Segmentation Framework with Weighted Anisotropic-Isotropic Total Variation

Kevin Bui1, Yifei Lou2, Fredrick Park3, Jack Xin1   

  1. 1. Department of Mathematics, University of California, Irvine, Irvine, CA 92697-3875, USA;
    2. Department of Mathematics, University of North Carolina, Chapel Hill, Chapel Hill, NC 27599, USA;
    3. Department of Mathematics and Computer Science, Whittier College, Whittier, CA 90602, USA
  • Received:2022-10-13 Revised:2023-09-28 Accepted:2023-10-09 Online:2024-01-24 Published:2024-01-24
  • Contact: Kevin Bui,E-mail:kevinb3@uci.edu;Yifei Lou,E-mail:yflou@unc.edu;Fredrick Park,E-mail:fpark@whittier.edu;Jack Xin,E-mail:jxin@math.uci.edu E-mail:kevinb3@uci.edu;yflou@unc.edu;fpark@whittier.edu;jxin@math.uci.edu
  • Supported by:
    The work was partially supported by the NSF grants DMS-1854434, DMS-1952644, DMS-2151235, DMS-2219904, and CAREER 1846690.

Abstract: In this paper, we design an efficient, multi-stage image segmentation framework that incorporates a weighted difference of anisotropic and isotropic total variation (AITV). The segmentation framework generally consists of two stages: smoothing and thresholding, thus referred to as smoothing-and-thresholding (SaT). In the first stage, a smoothed image is obtained by an AITV-regularized Mumford-Shah (MS) model, which can be solved efficiently by the alternating direction method of multipliers (ADMMs) with a closed-form solution of a proximal operator of the $\ell_1-\alpha \ell_2$ regularizer. The convergence of the ADMM algorithm is analyzed. In the second stage, we threshold the smoothed image by K-means clustering to obtain the final segmentation result. Numerical experiments demonstrate that the proposed segmentation framework is versatile for both grayscale and color images, efficient in producing high-quality segmentation results within a few seconds, and robust to input images that are corrupted with noise, blur, or both. We compare the AITV method with its original convex TV and nonconvex TVp(0<p<1) counterparts, showcasing the qualitative and quantitative advantages of our proposed method.

Key words: Image segmentation, Non-convex optimization, Mumford-Shah(MS) model, Alternating direction method of multipliers(ADMMs), Proximal operator