IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v513y2026ics0096300325005284.html

A three-step framework for noisy image segmentation in brain MRI

Author

Listed:
  • Antonelli, Laura
  • De Simone, Valentina
  • Viola, Marco

Abstract

Magnetic Resonance Imaging (MRI) is essential for noninvasive generation of high-quality images of human tissues. Accurate segmentation of MRI data is critical for medical applications like brain anatomy analysis and disease detection. However, challenges such as intensity inhomogeneity, noise, and artifacts complicate this process. To address these issues, we propose a three-step framework exploiting the idea of Cartoon-Texture evolution to produce a denoised and debiased MR image. The first step involves identifying statistical information about the nature of the noise using a suitable image decomposition. In the second step, a multiplicative intrinsic component model is applied to a smother version of the image, simultaneously reconstructing the bias and removing noise using noise information from the previous step. At the final step, standard clustering techniques are used to create an accurate segmentation. Additionally, we present a convergence analysis of the ADMM scheme for solving the nonlinear optimization problem with multiaffine constraints resulting from the second step. Numerical tests demonstrate the effectiveness of our framework, especially in noisy brain segmentation, both from a qualitative and a quantitative viewpoint, compared to similar methods.

Suggested Citation

  • Antonelli, Laura & De Simone, Valentina & Viola, Marco, 2026. "A three-step framework for noisy image segmentation in brain MRI," Applied Mathematics and Computation, Elsevier, vol. 513(C).
  • Handle: RePEc:eee:apmaco:v:513:y:2026:i:c:s0096300325005284
    DOI: 10.1016/j.amc.2025.129803
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300325005284
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2025.129803?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Spyridon Pougkakiotis & Jacek Gondzio, 2021. "An interior point-proximal method of multipliers for convex quadratic programming," Computational Optimization and Applications, Springer, vol. 78(2), pages 307-351, March.
    2. Samad Wali & Chunming Li & Lingyan Zhang, 2023. "MRI Bias Field Estimation and Tissue Segmentation Using Multiplicative Intrinsic Component Optimization and Its Extensions," Springer Books, in: Ke Chen & Carola-Bibiane Schönlieb & Xue-Cheng Tai & Laurent Younes (ed.), Handbook of Mathematical Models and Algorithms in Computer Vision and Imaging, chapter 34, pages 1203-1234, Springer.
    3. Laura Antonelli & Valentina De Simone & Marco Viola, 2023. "Cartoon-texture evolution for two-region image segmentation," Computational Optimization and Applications, Springer, vol. 84(1), pages 5-26, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Silvia Berra & Alessandro Torraca & Federico Benvenuto & Sara Sommariva, 2024. "Combined Newton-Gradient Method for Constrained Root-Finding in Chemical Reaction Networks," Journal of Optimization Theory and Applications, Springer, vol. 200(1), pages 404-427, January.
    2. Xin Jiang & Lieven Vandenberghe, 2022. "Bregman primal–dual first-order method and application to sparse semidefinite programming," Computational Optimization and Applications, Springer, vol. 81(1), pages 127-159, January.
    3. Stefano Cipolla & Jacek Gondzio, 2023. "Proximal Stabilized Interior Point Methods and Low-Frequency-Update Preconditioning Techniques," Journal of Optimization Theory and Applications, Springer, vol. 197(3), pages 1061-1103, June.
    4. Tran Ngoc Nguyen, 2025. "Convergence analysis of a mixed logarithmic barrier-augmented Lagrangian algorithm without constraint qualification," Computational Optimization and Applications, Springer, vol. 91(3), pages 1105-1134, July.
    5. Spyridon Pougkakiotis & Jacek Gondzio, 2022. "An Interior Point-Proximal Method of Multipliers for Linear Positive Semi-Definite Programming," Journal of Optimization Theory and Applications, Springer, vol. 192(1), pages 97-129, January.
    6. Jacek Gondzio & Spyridon Pougkakiotis & John W. Pearson, 2022. "General-purpose preconditioning for regularized interior point methods," Computational Optimization and Applications, Springer, vol. 83(3), pages 727-757, December.
    7. Gao-Xi Li & Xin-Min Yang, 2025. "Cardinality objective nonlinear programs for facility capacity expansion," Computational Optimization and Applications, Springer, vol. 92(1), pages 179-214, September.
    8. Rui-Jin Zhang & Xin-Wei Liu & Yu-Hong Dai, 2023. "IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming," Journal of Global Optimization, Springer, vol. 87(2), pages 1027-1053, November.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:513:y:2026:i:c:s0096300325005284. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.