Nonsmooth Convex Joint Estimation of Local Regularity and Local Variance for Fractal Texture Segmentation

by   Pascal Barbara, et al.

Fractal models are widely used to describe realworld textures in numerous real-world applications very different in nature. The present work investigates estimation/segmentation of piecewise fractal textures by framing the problem into several alternative convex optimization formulations, aiming to favor piecewise constancy of local regularity and local variance, the two parameters that characterize fractal textures. Two categories of proximal algorithms (dual forward-backward and primaldual), used to solve convex nonsmooth optimization problems, are devised and compared. An in-depth study of the objective functions, notably strong convexity, permits to propose significantly accelerated algorithms. A synthetic model of piecewise fractal texture is constructed and studied. It enables, by means of Monte Carlo simulations, to quantity the benefits in texture segmentation of using together local regularity and local variance (as opposed to the regularity only) as well as of using stongconvexity accelerated primal-dual algorithms. Achieved results also permit to discuss the gains/costs in imposing or not in the problem formulation co-localizations of changes in local regularity and local variance.


page 4

page 18


Combining local regularity estimation and total variation optimization for scale-free texture segmentation

Texture segmentation constitutes a standard image processing task, cruci...

UNLocBoX: A MATLAB convex optimization toolbox for proximal-splitting methods

Convex optimization is an essential tool for machine learning, as many o...

Sharper Rates for Separable Minimax and Finite Sum Optimization via Primal-Dual Extragradient Methods

We design accelerated algorithms with improved rates for several fundame...

Model-based learning of local image features for unsupervised texture segmentation

Features that capture well the textural patterns of a certain class of i...

Piecewise Convex Function Estimation: Representations, Duality and Model Selection

We consider spline estimates which preserve prescribed piecewise convex ...

Fast Saddle-Point Algorithm for Generalized Dantzig Selector and FDR Control with the Ordered l1-Norm

In this paper we propose a primal-dual proximal extragradient algorithm ...

Please sign up or login with your details

Forgot password? Click here to reset