Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Comput Optim Appl

Search In Journal Title:

Abbravation: Computational Optimization and Applications

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1016/0003-6870(90)90226-n

Search In DOI:

ISSN

1573-2894

Search In ISSN:
Search In Title Of Papers:

Compression and denoising using Emphasis Type="It

Authors: Andy C Yau Xuecheng Tai Michael K Ng
Publish Date: 2010/11/30
Volume: 50, Issue: 2, Pages: 425-444
PDF Link

Abstract

In this paper we deal with l 0norm data fitting and total variation regularization for image compression and denoising The l 0norm data fitting is used for measuring the number of nonzero wavelet coefficients to be employed to represent an image The regularization term given by the total variation is to recover image edges Due to intensive numerical computation of using l 0norm it is usually approximated by other functions such as the l 1norm in many image processing applications The main goal of this paper is to develop a fast and effective algorithm to solve the l 0norm data fitting and total variation minimization problem Our idea is to apply an alternating minimization technique to solve this problem and employ a graphcuts algorithm to solve the subproblem related to the total variation minimization Numerical examples in image compression and denoising are given to demonstrate the effectiveness of the proposed algorithm

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. A benchmark library and a comparison of heuristic methods for the linear ordering problem
  2. AAR-based decomposition algorithm for non-linear convex optimisation
  3. Classification of companies using maximal margin ellipsoidal surfaces
  4. Multi-step nonlinear conjugate gradient methods for unconstrained minimization
  5. Optimization-based design of plant-friendly multisine signals using geometric discrepancy criteria
  6. Minimization of the Tikhonov functional in Banach spaces smooth and convex of power type by steepest descent in the dual
  7. Numerical experiments with an inexact Jacobian trust-region algorithm
  8. An interior-point approach for primal block-angular problems
  9. Computing the metric dimension of graphs by genetic algorithms
  10. Some non-interior path-following methods based on a scaled central path for linear complementarity problems
  11. On the resolution of certain discrete univariate max–min problems
  12. A coordinate gradient descent method for ℓ 1 -regularized convex minimization
Search Result: