Lagrangian multipliers and split Bregman methods for minimization problems constrained on S n-1

Fang Li, Tieyong ZENG, Guixu Zhang*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

Abstract

The numerical methods of total variation (TV) model for image denoising, especially Rudin-Osher-Fatemi (ROF) model, is widely studied in the literature. However, the S n-1 constrained counterpart is less addressed. The classical gradient descent method for the constrained problem is limited in two aspects: one is the small time step size to ensure stability; the other is that the data must be projected onto S n-1 during evolution since the unit norm constraint is poorly satisfied. In order to avoid these drawbacks, in this paper, we propose two alternative numerical methods based on the Lagrangian multipliers and split Bregman methods. Both algorithms are efficient and easy to implement. A number of experiments demonstrate that the proposed algorithms are quite effective in denoising of data constrained on S 1 or S 2, including general direction data diffusion and chromaticity denoising.

Original languageEnglish
Pages (from-to)1041-1050
Number of pages10
JournalJournal of Visual Communication and Image Representation
Volume23
Issue number7
DOIs
Publication statusPublished - Oct 2012

Scopus Subject Areas

  • Signal Processing
  • Media Technology
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering

User-Defined Keywords

  • Lagrangian method
  • Split Bregman method
  • Total variation

Fingerprint

Dive into the research topics of 'Lagrangian multipliers and split Bregman methods for minimization problems constrained on S <sup>n-1</sup>'. Together they form a unique fingerprint.

Cite this