Filters

2007 - 200912010 - 20131

More filters

2019 - 20202
Reset filters

Settings

Subject: Separation × WGL Institute: WIAS ×

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    Adaptive smoothing of digital images: The R package adimpro
    (Los Angeles, Calif. : UCLA, Dept. of Statistics, 2007) Polzehl, J.; Tabelow, K.
    Digital imaging has become omnipresent in the past years with a bulk of applications ranging from medical imaging to photography. When pushing the limits of resolution and sensitivity noise has ever been a major issue. However, commonly used non-adaptive filters can do noise reduction at the cost of a reduced effective spatial resolution only. Here we present a new package adimpro for R, which implements the propagationseparation approach by (Polzehl arid Spokoiriy 2006) for smoothing digital images. This method naturally adapts to different structures of different size in the image and thus avoids oversmoothing edges and fine structures. We extend the method for imaging data with spatial correlation. Furthermore we show how the estimation of the dependence between variance and mean value can be included. We illustrate the use of the package through some examples.
  • Thumbnail Image
    Item
    A new perspective on the propagation-separation approach: Taking advantage of the propagation condition
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2013) Becker, Saskia; Mathé, Peter
    The Propagation-Separation approach is an iterative procedure for pointwise estimation of local constant and local polynomial functions. The estimator is defined as a weighted mean of the observations with data-driven weights. Within homogeneous regions it ensures a similar behavior as non-adaptive smoothing (propagation), while avoiding smoothing among distinct regions (separation). In order to enable a proof of stability of estimates, the authors of the original study introduced an additional memory step aggregating the estimators of the successive iteration steps. Here, we study theoretical properties of the simplified algorithm, where the memory step is omitted. In particular, we introduce a new strategy for the choice of the adaptation parameter yielding propagation and stability for local constant functions with sharp discontinuities