paper-with-me

Papers

Using the Split Bregman Algorithm to Solve the Self-repelling Snake Model

2020-03-28 · Huizhu Pan, Jintao Song, Wanquan Liu, Ling Li, Guanglu Zhou, Lu Tan, Shichu Chen

Preserving contour topology during image segmentation is useful in many practical scenarios. By keeping the contours isomorphic, it is possible to prevent over-segmentation and under-segmentation, as well as to adhere to given topologies. The Self-repelling Snake model (SR) is a variational model that preserves contour topology by combining a non-local repulsion term with the geodesic active contour model (GAC). The SR is traditionally solved using the additive operator splitting (AOS) scheme. In our paper, we propose an alternative solution to the SR using the Split Bregman method. Our algorithm breaks the problem down into simpler sub-problems to use lower-order evolution equations and a simple projection scheme rather than re-initialization. The sub-problems can be solved via fast Fourier transform (FFT) or an approximate soft thresholding formula which maintains stability, shortening the convergence time, and reduces the memory requirement. The Split Bregman and AOS algorithms are compared theoretically and experimentally.

📄 PDF Abstract BibTeX arXiv:2003.12693

Code (0)

등록된 구현이 없습니다.

Tasks

Image SegmentationSegmentationSemantic Segmentation

Similar Papers 제목 키워드 기반

Bregman Douglas-Rachford Splitting Method

2025-09-10 · Shiqian Ma, Lin Xiao, Renbo Zhao arxiv

In this paper, we propose the Bregman Douglas-Rachford splitting (BDRS) method and its variant Bregman Peaceman-Rachford splitting method for solving maximal monotone inclusion problem. We show that BDRS is equivalent to…

Bregman implementation of Meyer's $G-$norm for cartoon + textures decomposition

2024-10-30 · Jerome Gilles, Stanley Osher

In this paper, we design a very simple algorithm based on Split Bregman iterations to numerically solve the cartoon + textures decomposition model of Meyer. This results in a significant gain in speed compared to Chambol…

Matrix recovery using Split Bregman

2013-12-17 · Anupriya Gogna, Ankita Shukla, Angshul Majumdar

In this paper we address the problem of recovering a matrix, with inherent low rank structure, from its lower dimensional projections. This problem is frequently encountered in wide range of areas including pattern recog…

Recommendation SystemsVideo Reconstruction

Accelerating CS in Parallel Imaging Reconstructions Using an Efficient and Effective Circulant Preconditioner

2017-10-04 · Kirsten Koolstra, Jeroen van Gemert, Peter Börnert, Andrew Webb 외

Purpose: Design of a preconditioner for fast and efficient parallel imaging and compressed sensing reconstructions. Theory: Parallel imaging and compressed sensing reconstructions become time consuming when the problem s…

compressed sensing

The Linearized Bregman Method via Split Feasibility Problems: Analysis and Generalizations

2013-09-09 · Dirk A. Lorenz, Frank Schöpfer, Stephan Wenger

The linearized Bregman method is a method to calculate sparse solutions to systems of linear equations. We formulate this problem as a split feasibility problem, propose an algorithmic framework based on Bregman projecti…