Convex Variational Image Restoration with Histogram Priors

نویسندگان

  • Paul Swoboda
  • Christoph Schnörr
چکیده

We present a novel variational approach to image restoration (e.g., denoising, inpainting, labeling) that enables us to complement established variational approaches with a histogram-based prior, enforcing closeness of the solution to some given empirical measure. By minimizing a single objective function, the approach utilizes simultaneously two quite different sources of information for restoration: spatial context in terms of some smoothness prior and nonspatial statistics in terms of the novel prior utilizing the Wasserstein distance between probability measures. We study the combination of the functional lifting technique with two different relaxations of the histogram prior and derive a jointly convex variational approach. Mathematical equivalence of both relaxations is established, and cases where optimality holds are discussed. Additionally, we present an efficient algorithmic scheme for the numerical treatment of the presented model. Experiments using the basic total variation based denoising approach as a case study demonstrate our novel regularization approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weakly Convex Coupling Continuous Cuts and Shape Priors

We introduce a novel approach to variational image segmentation with shape priors. Key properties are convexity of the joint energy functional and weak coupling of convex models from different domains by mapping corresponding solutions to a common space. Specifically, we combine total variation based continuous cuts for image segmentation and convex relaxations of Markov Random Field based shap...

متن کامل

A Fast Solver for Truncated-Convex Priors: Quantized-Convex Split Moves

This paper addresses the problem of minimizing multilabel energies with truncated convex priors. Such priors are known to be useful but difficult and slow to optimize because they are not convex. We propose two novel classes of binary Graph-Cuts (GC) moves, namely the convex move and the quantized move. The moves are complementary. To significantly improve efficiency, the label range is divided...

متن کامل

Single Image Defogging Method Using Variational Approach for Edge-Preserving Regularization

Abstract—In this paper, we propose the variational approach to solve single image defogging problem. In the inference process of the atmospheric veil, we defined new functional for atmospheric veil that satisfy edge-preserving regularization property. By using the fundamental lemma of calculus of variations, we derive the EulerLagrange equation foratmospheric veil that can find the maxima of a ...

متن کامل

Partial Regularity for Degenerate Variational Problems and Image Restoration Models in Bv

We establish partial and local C1,α-regularity results for vectorial almost-minimizers of convex variational integrals in BV. In particular, we investigate cases with a degenerate or singular behavior of p-Laplace type, and we cover (local) minimizers of the exemplary integrals ∫

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Imaging Sciences

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2013