<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05912459</id>
  <dt>j</dt>
  <an>05912459</an>
  <augroup>
    <au>Asaki, Thomas J.</au>
    <au>Vixie, Kevin R.</au>
    <au>Sottile, Matthew</au>
    <au>Cherapanov, Pavlo</au>
  </augroup>
  <ti>Image denoising by regularization on characteristic graphs.</ti>
  <so>Appl. Math. Sci., Ruse 4, No. 49-52, 2541-2560 (2010).</so>
  <py>2010</py>
  <pu>Hikari Ltd, Ruse</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>image restoration</ut>
    <ut>denoising</ut>
    <ut>graph regularization</ut>
    <ut>graphical examples</ut>
    <ut>numerical examples</ut>
    <ut>graph representations of images</ut>
    <ut>graph constructions</ut>
    <ut>regularization</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>http://www.m-hikari.com/ams/ams-2010/ams-49-52-2010/index.html</li>
  </ligroup>
  <abgroup>
    <ab>Summary: This paper introduces improvements to a now classical family of image denoising methods through rather minimal changes to the way derivatives are computed. In particular, we ask, and answer, the question ``How much can we improve the common denoising methods by local, completely non-parametric modifications to image graphs?'' We present the concept of non-parametric characteristic graph representations of images and detail two such graph constructions. Their use in image denoising is demonstrated within a regularization framework. The results are compared with those of more traditional approaches of Tikhonov, total variation and $L^1TV$ regularization. We show that in some denoising scenarios our methods perform more favorably in preserving intensity levels and geometric details of object boundaries. They are particularly useful for denoising images with both smooth and discontinuous intensity variations, preserving detail to the pixel level.</ab>
    <rv></rv>
  </abgroup>
</item>