Low-Rank Regularized Convex-Non-Convex Problems for Image Segmentation or Completion

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Guide, Mohamed El, Hachimi, Anas El, Jbilou, Khalide, Reichel, Lothar
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866912559060221952
author Guide, Mohamed El
Hachimi, Anas El
Jbilou, Khalide
Reichel, Lothar
author_facet Guide, Mohamed El
Hachimi, Anas El
Jbilou, Khalide
Reichel, Lothar
contents This work proposes a novel convex-non-convex formulation of the image segmentation and the image completion problems. The proposed approach is based on the minimization of a functional involving two distinct regularization terms: one promotes low-rank structure in the solution, while the other one enforces smoothness. To solve the resulting optimization problem, we employ the alternating direction method of multipliers (ADMM). A detailed convergence analysis of the algorithm is provided, and the performance of the methods is demonstrated through a series of numerical experiments.
format Preprint
id arxiv_https___arxiv_org_abs_2508_21765
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Low-Rank Regularized Convex-Non-Convex Problems for Image Segmentation or Completion
Guide, Mohamed El
Hachimi, Anas El
Jbilou, Khalide
Reichel, Lothar
Numerical Analysis
This work proposes a novel convex-non-convex formulation of the image segmentation and the image completion problems. The proposed approach is based on the minimization of a functional involving two distinct regularization terms: one promotes low-rank structure in the solution, while the other one enforces smoothness. To solve the resulting optimization problem, we employ the alternating direction method of multipliers (ADMM). A detailed convergence analysis of the algorithm is provided, and the performance of the methods is demonstrated through a series of numerical experiments.
title Low-Rank Regularized Convex-Non-Convex Problems for Image Segmentation or Completion
topic Numerical Analysis
url https://arxiv.org/abs/2508.21765