5,636 research outputs found
Optimal multiple description and multiresolution scalar quantizer design
The author presents new algorithms for fixed-rate multiple description and multiresolution scalar quantizer design. The algorithms both run in time polynomial in the size of the source alphabet and guarantee globally optimal solutions. To the author's knowledge, these are the first globally optimal design algorithms for multiple description and multiresolution quantizers
Combining local regularity estimation and total variation optimization for scale-free texture segmentation
Texture segmentation constitutes a standard image processing task, crucial to
many applications. The present contribution focuses on the particular subset of
scale-free textures and its originality resides in the combination of three key
ingredients: First, texture characterization relies on the concept of local
regularity ; Second, estimation of local regularity is based on new multiscale
quantities referred to as wavelet leaders ; Third, segmentation from local
regularity faces a fundamental bias variance trade-off: In nature, local
regularity estimation shows high variability that impairs the detection of
changes, while a posteriori smoothing of regularity estimates precludes from
locating correctly changes. Instead, the present contribution proposes several
variational problem formulations based on total variation and proximal
resolutions that effectively circumvent this trade-off. Estimation and
segmentation performance for the proposed procedures are quantified and
compared on synthetic as well as on real-world textures
Nonparametric Regression, Confidence Regions and Regularization
In this paper we offer a unified approach to the problem of nonparametric
regression on the unit interval. It is based on a universal, honest and
non-asymptotic confidence region which is defined by a set of linear
inequalities involving the values of the functions at the design points.
Interest will typically centre on certain simplest functions in that region
where simplicity can be defined in terms of shape (number of local extremes,
intervals of convexity/concavity) or smoothness (bounds on derivatives) or a
combination of both. Once some form of regularization has been decided upon the
confidence region can be used to provide honest non-asymptotic confidence
bounds which are less informative but conceptually much simpler
- …