Convex representation for curvature dependent functionals

Similar documents
Continuous Primal-Dual Methods in Image Processing

Variational Image Restoration

Local semiconvexity of Kantorovich potentials on non-compact manifolds

arxiv: v1 [math.ap] 14 Apr 2015

A posteriori error control for the binary Mumford Shah model

Calculus of Variations. Final Examination

Sub-Riemannian geometry in models of the visual cortex

Coupled second order singular perturbations for phase transitions

RECONSTRUCTION AND PATTERN RECOGNITION VIA THE CITTI- PETITOT-SARTI MODEL

Spaces with Ricci curvature bounded from below

Key words. Disocclusion, Elastica, BV functions, Interpolation, Variational approach, Γ- convergence

On a weighted total variation minimization problem

Mathematical Problems in Image Processing

Splitting Techniques in the Face of Huge Problem Sizes: Block-Coordinate and Block-Iterative Approaches

Topology-preserving diffusion equations for divergence-free vector fields

Optimal controls for gradient systems associated with grain boundary motions

ECOLE POLYTECHNIQUE. Approximation of the anisotropic mean curvature ow CENTRE DE MATHÉMATIQUES APPLIQUÉES UMR CNRS A. Chambolle, M.

Entropy method for line-energies

ECOLE POLYTECHNIQUE. Uniqueness of the Cheeger set of a convex body CENTRE DE MATHÉMATIQUES APPLIQUÉES UMR CNRS 7641

für Mathematik in den Naturwissenschaften Leipzig

Sub-Riemannian Fast Marching in SE(2)

Convex Hodge Decomposition and Regularization of Image Flows

TRANSPORT IN POROUS MEDIA

A Ginzburg-Landau Type Problem for Nematics with Highly Anisotropic Elastic Term

Contact Geometry of the Visual Cortex

A Convex Relaxation of the Ambrosio Tortorelli Elliptic Functionals for the Mumford Shah Functional

Continuous Primal-Dual methods for Image Processing

P(E t, Ω)dt, (2) 4t has an advantage with respect. to the compactly supported mollifiers, i.e., the function W (t)f satisfies a semigroup law:

Dual methods for the minimization of the total variation

A few words about the MTW tensor

Convexity and Non-Convexity in Partitioning and Interpolation Problems

Branched transport limit of the Ginzburg-Landau functional

An introduction to Mathematical Theory of Control

Fine properties of the subdifferential for a class of one-homogeneous functionals

Dynamic Blocking Problems for Models of Fire Propagation

PDEs in Image Processing, Tutorials

Minimal elastic networks

A Necessary and Sufficient Condition for the Continuity of Local Minima of Parabolic Variational Integrals with Linear Growth

CONVERGENCE THEORY. G. ALLAIRE CMAP, Ecole Polytechnique. 1. Maximum principle. 2. Oscillating test function. 3. Two-scale convergence

Subharmonic functions

Lecture No 1 Introduction to Diffusion equations The heat equat

Motivation Power curvature flow Large exponent limit Analogues & applications. Qing Liu. Fukuoka University. Joint work with Prof.

MATHEMATICAL MODELS FOR SMALL DEFORMATIONS OF STRINGS

Existence of 1-harmonic map flow

Automorphic Equivalence Within Gapped Phases

Curvature-dependent energies: The elastic case

CONSTRAINED PERCOLATION ON Z 2

MATH 332: Vector Analysis Summer 2005 Homework

The Minimum Speed for a Blocking Problem on the Half Plane

Convex Representation for Lower Semicontinuous Envelopes of Functionals in L 1

Evolution of planar networks of curves with multiple junctions. Centro Ennio De Giorgi Pisa February 2017

Ancient solutions to Geometric Flows Lecture No 2

Examiner: D. Burbulla. Aids permitted: Formula Sheet, and Casio FX-991 or Sharp EL-520 calculator.

Belief Propagation, Information Projections, and Dykstra s Algorithm

Parcours OJD, Ecole Polytechnique et Université Pierre et Marie Curie 05 Mai 2015

The semi-geostrophic equations - a model for large-scale atmospheric flows

ENERGY METHODS IN IMAGE PROCESSING WITH EDGE ENHANCEMENT

Behaviour of Lipschitz functions on negligible sets. Non-differentiability in R. Outline

Universität des Saarlandes. Fachrichtung 6.1 Mathematik

Support Vector Machines for Regression

SEPARABILITY AND COMPLETENESS FOR THE WASSERSTEIN DISTANCE

BIHARMONIC WAVE MAPS INTO SPHERES

A function space framework for structural total variation regularization with applications in inverse problems

Compactness in Ginzburg-Landau energy by kinetic averaging

LECTURE 3: DISCRETE GRADIENT FLOWS

APPLICATIONS OF DIFFERENTIABILITY IN R n.

FINITE ENERGY SOLUTIONS OF MIXED 3D DIV-CURL SYSTEMS

Rectifiability of sets and measures

Convex Hodge Decomposition of Image Flows

Applied Analysis (APPM 5440): Final exam 1:30pm 4:00pm, Dec. 14, Closed books.

Anisotropic and Crystalline Mean Curvature Flow

arxiv: v2 [cs.cv] 29 Aug 2016

Flux-limited solutions for quasi-convex Hamilton-Jacobi equations on networks

Master 2 MathBigData. 3 novembre CMAP - Ecole Polytechnique

Geodesics on Shape Spaces with Bounded Variation and Sobolev Metrics

Comparison for infinitesimal automorphisms. of parabolic geometries

Optimality Conditions for Constrained Optimization

Continuous Sets and Non-Attaining Functionals in Reflexive Banach Spaces

arxiv: v1 [math.na] 17 Nov 2018

Approximating Riemannian Voronoi Diagrams and Delaunay triangulations.

Existence of minimizers for the pure displacement problem in nonlinear elasticity

THE ASYMPTOTIC BEHAVIOUR OF HEEGAARD GENUS

PATH FUNCTIONALS OVER WASSERSTEIN SPACES. Giuseppe Buttazzo. Dipartimento di Matematica Università di Pisa.

A set C R n is convex if and only if δ C is convex if and only if. f : R n R is strictly convex if and only if f is convex and the inequality (1.

3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?

and in each case give the range of values of x for which the expansion is valid.

Probabilistic Graphical Models. Theory of Variational Inference: Inner and Outer Approximation. Lecture 15, March 4, 2013

THE STEINER REARRANGEMENT IN ANY CODIMENSION

Checkerboard instabilities in topological shape optimization algorithms

Unified Models for Second-Order TV-Type Regularisation in Imaging

Open Questions in Quantum Information Geometry

Examiner: D. Burbulla. Aids permitted: Formula Sheet, and Casio FX-991 or Sharp EL-520 calculator.

MINIMAL GRAPHS PART I: EXISTENCE OF LIPSCHITZ WEAK SOLUTIONS TO THE DIRICHLET PROBLEM WITH C 2 BOUNDARY DATA

On the distributional divergence of vector fields vanishing at infinity

On duality theory of conic linear problems

Convex Optimization and SVM

LECTURE 16: CONJUGATE AND CUT POINTS

Piecewise rigid curve deformation via a Finsler steepest descent

arxiv: v1 [math.oc] 3 Jul 2014

OHSx XM521 Multivariable Differential Calculus: Homework Solutions 14.1

Transcription:

Convex representation for curvature dependent functionals Antonin Chambolle CMAP, Ecole Polytechnique, CNRS, Palaiseau, France joint work with T. Pock (T.U. Graz) Laboratoire Jacques-Louis Lions, 25 nov. 2016

Introduction based on roto-translation group; a simple formula for curvature-dependent line energies; a general relaxation for functions; tightness result (C 2 sets); dual formulation and link with previous works [Bredies-Pock-Wirth 15]; numerical results

Curvature information: a natural idea Experiments and discovery of Hubel-Wiesel (62, 77) Observation: the brain reacts to orientation. Corresponding cells are stacked and connected together to provide sensitivity to curvature. First mathematical theories: Koenderink-van Doorn (87), Hoffman (89), Zucker (2000), Petitot-Tondut (98/2003), Citti-Sarti (2003/2006). Main idea: use the sub-riemanian structure of the roto-translation group ((a, R) SE(2) R 2 SO(2) R 2 S 1 in dimension 2) to describe the geometry of the visual cortex sub-riemanian diffusion and mean curvature motion (Citti-Sarti 3/6, Duits-Franken 10, Boscain et al 14, Citti et al, 2015) for inpainting.

Variational approaches To complete contours, Mumford (94) suggested to use the elastica functional κ 2 dh 1 γ for contour completion. (Idea suggested by psychological experiments, cf for instance Kanizsa 1980.) General theory by Masnou-Morel 98. Issues: not lower semicontinuous. Studied by Bellettini-Mugnai 2004/2005, Nardi (PhD 2011), Dayrens-Masnou 16, Ambrosio-Masnou 2003. [Examples] Minimisation is computationally challenging. A few approaches trying to exploit the roto-translation metric: Schoenemann with Cremers (2007), Kahl and Cremers (2009), Masnou and Cremers (2011): discrete approach on a graph (or LP) where vertices encode position and orientation (also, El Zehiry-Grady 2010,...); Length computation by JM Mirebeau (anisotropic Eikonal equations, 2014)

Variational approaches Bredies-Pock-Wirth 2013, 2015: vertex penalization ( TVX ), then general energies γ f (x, τ, κ), f convex, f 1. Need to lift the image in R 2 S 1 R where last component = curvature, with compatibility condition. This work: a new (and simpler) representation for the latter approach (with f (κ)).

Example: a C 2 curve γ(t) planar curve, with γ = 1 ( γ = τ γ ), and γ = κ γ τ γ. Lifted as Γ(t) = (γ(t), θ(t)) where τ γ = (cos θ, sin θ). Then: the length of Γ(t) in Ω S 1 is Finite: sub-riemanian structure, local metric is infinite in direction θ (we will also take into account orientation); Given by L γ 0 2 + θ 2 dt = L 0 1 + κ2 dt: encoding curvature penalization information.

Example: a C 2 curve Let now f : R R be convex, assume f 1, and consider the energy L 0 f (κ) = L 0 f ( Γ θ (t))dt. Observe that if one considers a reparametrization λ(s), s [0, a], of the curve Γ, then λ x (s) is a reparametrization of γ, λ x = λ x τ, κ = dθ/dt = λ θ ds/dt = λ θ / λ x hence the energy becomes L 0 f (κ)dt = a 0 f ( λ θ / λ x ) λ x ds.

Example: a C 2 curve Denoting σ the measure (charge) in M 1 (Ω S 1 ; R 3 ) defined by the curve Γ(t): L ψ σ = ψ(γ(t)) Γ(t)dt, Ω S 1 0 one obtains that where L 0 f (κ) = h(σ x θ, σ θ ) Ω S 1 sf (t/s) if s > 0, h(s, t) = f (t) if s = 0, + else. where f (t) = lim s 0 sf (t/s) is the recession function of f.

Example: a C 2 curve It is standard that if f is convex lsc, then also h is, with h(s, t) = sup {as + bt : a + f (b) 0}. In addition, as σ x = λθ where λ is a positive measure in Ω S 1, introducing for p = (p x, p θ ) R 3 h(θ, p) = { h(px θ, p θ ) if p x θ = p x p x θ, p x θ 0 + else, which encodes the sub-riemanian structure of Ω S 1 : we also have L 0 f (κ) = h(σx θ, σ θ ) = Ω S 1 h(θ, σ). Ω S 1

Example: a C 2 curve Now, observe that div σ = δ Γ(L) δ Γ(0), in particular if γ is a closed curve or has its endpoints on Ω, then div σ = 0. Obviously, if one considers the marginal σ = σ x M 1 (Ω; R 2 ) defined S 1 by (ψ, 0) σ = ψ σ Ω S 1 Ω for any ψ C c (Ω; R 2 ), then it also has zero divergence (as it vanishes if ψ = φ for some φ). In dimension 2, it follows that (assuming Ω is connected) there exists a BV function u such that Du = σ. In our case, u is the characteristic function of a set E with E Ω = γ([0, T ]) Ω.

Generalization to BV functions One can define for any u BV (Ω) { } F (u) = inf h(θ, σ) : div σ = 0, Ω S 1 σ x = Du S 1. If we assume that f (t) 1 + t 2, then one sees that h(s, t) s 2 + t 2 and h(θ, σ) σ. It easily follows that the inf is a min, Ω S 1 Ω S 1 and that F defines a convex, lower semicontinuous function on BV with F (u) Du (Ω). From the example above, we readily see that if E is a C 2 set, then F (χ E ) f (κ)dh 1. E

Tightness of the representation We can show the following result: Theorem if E is a C 2 set, then F (χ E ) = f (κ)dh 1. E Proof: we need to show. In other words, we need to show the obvious fact that if σ is a measure with σ x = Dχ S 1 E, then σ, above E, consists at least in the measure defined by the lifted curve above E (with its orientation as third component). Maybe there is a simple way to do this (as it is obvious). We used S. Smirnov s theorem which shows that if σ is a measure with div σ = 0, then it is a superposition of curves.

Smirnov s Theorem A (1994) If div σ = 0 then it can be decomposed in the following way: σ = λdµ(λ), C 1 σ = λ dµ(λ), C 1 where λ are of the form λ γ = τ γ H 1 for rectifiable (possibly closed) curves γ Ω S 1 of length at most one. (C 1 is the corresponding set.) [We do not need here the more precise Theorem B ] γ

Smirnov s Theorem A (1994) Thanks to the fact that the decomposition is convex (ie with σ = C 1 λ dµ(λ)) we can show that σ -a.e., for µ-a.e. curve λ one has σ/ σ = λ/ λ λ -a.e., and in particular λ x is oriented along θ, and ( ) ( ) h(θ, σ) = h(θ, λ) dµ(λ) = h(θ, τ γ )dh 1 dµ(λ γ ). Ω S 1 Ω S 1 γ C 1 C 1 The horizontal projection λ x is a rectifiable curve, and one can deduce that its curvature is a bounded measure. For this we reparametrize λ with the length of λ x : that is we define λ(t) = λ(s(t)) in such a way that H 1 ( λ x ([0, t])) = t) [if simple]. Then we show that λ θ (t), which is the orientation of the tangent [because the energy is finite], has bounded variation.

Tightness Then one can show that if Γ + = {x E λ x (0, L) : the curves have the same orientation } then a.e. on Γ +, the absolutely continuous part of the curvature κ = λθ coincides with κ E. Using that for any set I, f (κ a ) λ x (I ) h(θ, λ), I S 1 which more or less follows because this is precisely the way we have built h, we can deduce since κ a = κ E a.e.: f (κ E )dh 1 = E f (κ a )dµ(λ) E λ x h(θ, λ)dµ(λ) E S 1 C 1 which implies our inequality. C 1

Tightness More cases? We know that F can be below the standard (L 1 ) relaxation of f (κ) (Bellettini-Mugnai 04/05, Dayrens-Masnou 16) (simple E examples).

Dual representation We can compute the dual problem of { } F (u) = inf h(θ, σ) : div σ = 0, Ω S 1 σ x = Du S 1. by the standard perturbation technique, which consists in defining { } G(p) = inf h(θ, σ + p) : div σ = 0, σ x = Du, Ω S 1 S 1 showing (exactly as for F ) that p G(p) is (weakly- ) lsc and therefore that G = G, and in particular F (u) = G(0) = sup G (η) η C0 0(Ω S1 ;R 3 )

Dual representation Then, it remains to compute G (η): G (η) = sup η p h(θ, σ + p) p,σ:div σ=0 Ω S S 1 1 σ=du = sup η σ + sup σ:div σ=0 Ω S 1 p S 1 σ=du η (σ + p) h(θ, σ + p) We find θ η x + f (η θ ) 0, and then η = ψ(x) + ϕ(x, θ) so that: { F (u) = sup ψ Du : ψ Cc 0 (Ω; R 2 ), Ω ϕ C 1 c (Ω S 1 ), θ ( x ϕ + ψ) + f ( θ ϕ) 0 }. SAME as Bredies-Pock-Wirth 2015... This is how we find out that this representation is a simpler variant of theirs...

Numerical discretization This is work in progress. We have a few approaches which work in theory but yield poorly concentrated measures σ. And better approaches which are not clearly justified. We use both the primal and dual representation and solve the discretized problem using a saddle-point optimisation.

Examples: shape completion (a) Original shape (b) Input (c) Inpainted shape Figure : Weickert s cat: Shape completion using the function f 2 = 1 + k κ 2.

Examples: shape denoising

Examples: shape denoising (a) AC, λ = 8 (b) AC, λ = 4 (c) AC, λ = 2 (d) EL, λ = 8 (e) EL, λ = 4 (f) EL, λ = 2 Figure : Shape denoising: First row: Using the function f 1 = 1 + k κ, second row: Using the function f 3 = 1 + k κ 2.

Examples: Willmore flow (cf for instance Dayrens-Masnou-Novaga 2016) (a) AC (b) EL Figure : Motion by the gradient flow of different curvature depending energies. Energy 1 + κ gives the same as standard mean curvature flow for convex curves. Elastica/Willmore flow converges to a circle (shrinkage is still present due to the length term).

Conclusion, perspectives We have introduced a relatively simple systematic way to represent curvature-dependent energies in 2D; It simplifies the (energetically equivalent) framework of [Bredies-Pock-Wirth 15]; Open questions: characterize the functions for which the relaxation is tight (conjecture: functions with continuous curvature?); Discretization needs some improvement (issues: measure with orientation constraint).

Conclusion, perspectives We have introduced a relatively simple systematic way to represent curvature-dependent energies in 2D; It simplifies the (energetically equivalent) framework of [Bredies-Pock-Wirth 15]; Open questions: characterize the functions for which the relaxation is tight (conjecture: functions with continuous curvature?); Discretization needs some improvement (issues: measure with orientation constraint). Thank you for your attention