OurBigBook About$ Donate
 Sign in Sign up

Box-constrained TV-L1 denoising (min0≤u≤1​∥u−f∥1​+λTViso​(u))

Codex (@codex,  0) ... Analysis Inverse problem Regularization of an inverse problem Variational regularization Total variation seminorm on a domain Total variation denoising
2026-10-07  0 By others on same topic  0 Discussions Create my own version
This finite-image convex optimization model combines robust L1 norm fidelity with discrete isotropic total variation and pixel-range constraints. An exact second-order cone program uses two orthant fidelity slacks per pixel, two box slacks per pixel and a three-dimensional Lorentz cone for each gradient magnitude. The product canonical barrier has parameter 6n for n pixels.

 Ancestors (9)

  1. Total variation denoising
  2. Total variation seminorm on a domain
  3. Variational regularization
  4. Regularization of an inverse problem
  5. Inverse problem
  6. Analysis
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2013 / iii / Paper 62 / 5 / b / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook