DOCSLIB.ORG

Math 641 Lecture #19 ¶6.1,6.2,6.6 Total Variation Definitions

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Math 641 Lecture #19 ¶6.1,6.2,6.6 Total Variation Definitions Math 641 Lecture #19 ¶6.1,6.2,6.6 Total Variation Definitions (6.1). Let M be a σ-algebra in a set X. A partition of E ∈ M is a countable collection {Ei} ⊂ M such that Ei ∩ Ej = ∅ for all ∞ i 6= j and E = ∪i=1Ei. A complex measure on M is a function µ : M → C such that ∞ X µ(E) = µ(Ei) for all partitions {Ei} of E. (1) i=1 [NOTE: this condition is “countable additivity.”] A real (or signed) measure on M is a function µ : M → R which satisfies (1). Elementary Properties. (a) The class of real measures on M is a subclass of the complex measures on M. P (b) Since µ(E) ∈ C, the series i µ(Ei) converges for every partition {Ei} of E. (c) Since relabeling the indices of the Ei gives another partition of E, the series P∞ i=1 µ(Ei) converges to the same quantity, µ(E), for every rearrangement of the µ(Ei)’s; hence the series is absolutely convergent. Examples. 1 R (a) If µ is a positive measure and f ∈ L (µ), then ν(E) = E f dµ is a complex measure. Pn Proof. Let {Ei} be any partition of E, and set fn = i=1 χEi f. 1 Then fn → f pointwise, and |fn| ≤ |f| ∈ L (µ). By LDCT, Z Z ν(E) = f dµ = lim fn dµ E n→∞ E n n Z X X Z = lim χE f dµ = lim χE f dµ n→∞ i n→∞ i E i=1 i=1 E n n X Z X = lim f dµ = lim ν(Ei) n→∞ n→∞ i=1 Ei i=1 ∞ X = ν(Ei). i=1 1 R (b) If µ is a positive measure and f ∈ L (µ) is extended real-valued, then ν(E) = E f dµ is a real measure. [Same argument as in (a) applies here.] Problem. If µ is a complex measure on M, is there a positive measure λ on M such that |µ(E)| ≤ λ(E) for all E ∈ M? If there is such a positive measure, it must satisfy ∞ ∞ X X λ(E) = λ(Ei) ≥ |µ(Ei)| i=1 i=1 for every partition {Ei} of any E ∈ M. [NOTE: the equality is countable additivity of a positive measure on countable collections of pairwise disjoint measurable sets; the inequality is λ(E) ≥ |µ(E)| for ALL E ∈ M; P∞ the last series converges since i=1 µ(Ei) converges absolutely.] A candidate for λ is the set function ∞ X |µ|(E) = sup |µ(Ei)| : {Ei} is a partition of E . i=1 Certainly |µ|(E) ≥ |µ(E)| [take E1 = E, Ei = ∅ for i > 1], but equality need not hold. However, if |µ| is a positive measure, then it is the smallest of all positive measures λ that satisfy |µ(E)| ≤ λ(E) for all E ∈ M [this follows from the supremum in the definition of |µ|]. Theorem (6.2). If µ is a complex measure on M, then |µ| is a positive measure on M. Proof. For a partition {Ei} of E ∈ M, let ti ∈ R satisfy ti < |µ|(Ei). By the supremum in the definition of |µ| there is for each i a partition {Aij} of Ei such that X ti < |µ(Aij)| ≤ |µ|(Ei). j The countable collection {Aij} is a partition of E, so that X X ti ≤ |µ(Aij)| ≤ |µ|(E). i i,j It follows that X X |µ|(Ei) = sup ti : ti < |µ|(Ei) ≤ |µ|(E). i i To prove the opposite inequality, let {Ei} and {Aj} be partitions of E. For any fixed j, the collection {Aj ∩ Ei} is a partition of Aj, and for any fixed i, the collection {Aj ∩ Ei} is a partition of Ei. Then X X X |µ(Aj)| = µ(Aj ∩ Ei) [use partition of Aj] j j i X X ≤ |µ(Aj ∩ Ei)| j i X X ≤ |µ(Aj ∩ Ei)| [switch order of summation] i j X ≤ |µ|(Ei) [definition of |µ|(Ei)]. i It follows that X X |µ|(E) = sup |µ(Aj)| : {Aj} a partition of E ≤ |µ|(Ei). j i Thus, |µ| is countably additive. The set function |µ| is not identically ∞ because, using the only partition of ∅, X µ(∅) = µ(∅) and |µ(∅)| < ∞ ⇒ µ(∅) = 0 ⇒ |µ|(∅) = 0. i Therefore, |µ| is a positive measure on M. Definition. The positive measure |µ| is the total variation of a complex measure µ. Observation. If µ is a positive measure, then the set function |µ| is equal to µ by countable additivity; hence the “total variation” of µ is itself. Definitions (6.6) Let µ be a real measure. The positive and negative variations of µ are the positive measures µ+ = (1/2)|µ| + µ and µ− = (1/2)|µ| − µ. Clearly, |µ| = µ+ + µ−. The Jordon decomposition of µ is µ = µ+ − µ−. Definitions Let X be a LCH space. A complex (real) Borel measure is a complex (real) measure defined on BX . A complex (real) Borel measure µ is regular if |µ| is a regular positive Borel measure on BX ..
Load more

Recommended publications
  • Complex Measures 1 11
    Tutorial 11: Complex Measures 1 11. Complex Measures In the following, (Ω, F) denotes an arbitrary measurable space. Definition 90 Let (an)n≥1 be a sequence of complex numbers. We a say that ( n)n≥1 has the permutation property if and only if, for ∗ ∗ +∞ 1 all bijections σ : N → N ,theseries k=1 aσ(k) converges in C Exercise 1. Let (an)n≥1 be a sequence of complex numbers. 1. Show that if (an)n≥1 has the permutation property, then the same is true of (Re(an))n≥1 and (Im(an))n≥1. +∞ 2. Suppose an ∈ R for all n ≥ 1. Show that if k=1 ak converges: +∞ +∞ +∞ + − |ak| =+∞⇒ ak = ak =+∞ k=1 k=1 k=1 1which excludes ±∞ as limit. www.probability.net Tutorial 11: Complex Measures 2 Exercise 2. Let (an)n≥1 be a sequence in R, such that the series +∞ +∞ k=1 ak converges, and k=1 |ak| =+∞.LetA>0. We define: + − N = {k ≥ 1:ak ≥ 0} ,N = {k ≥ 1:ak < 0} 1. Show that N + and N − are infinite. 2. Let φ+ : N∗ → N + and φ− : N∗ → N − be two bijections. Show the existence of k1 ≥ 1 such that: k1 aφ+(k) ≥ A k=1 3. Show the existence of an increasing sequence (kp)p≥1 such that: kp aφ+(k) ≥ A k=kp−1+1 www.probability.net Tutorial 11: Complex Measures 3 for all p ≥ 1, where k0 =0. 4. Consider the permutation σ : N∗ → N∗ defined informally by: φ− ,φ+ ,...,φ+ k ,φ− ,φ+ k ,...,φ+ k ,..
    [Show full text]
  • The Total Variation Flow∗
    THE TOTAL VARIATION FLOW∗ Fuensanta Andreu and Jos´eM. Maz´on† Abstract We summarize in this lectures some of our results about the Min- imizing Total Variation Flow, which have been mainly motivated by problems arising in Image Processing. First, we recall the role played by the Total Variation in Image Processing, in particular the varia- tional formulation of the restoration problem. Next we outline some of the tools we need: functions of bounded variation (Section 2), par- ing between measures and bounded functions (Section 3) and gradient flows in Hilbert spaces (Section 4). Section 5 is devoted to the Neu- mann problem for the Total variation Flow. Finally, in Section 6 we study the Cauchy problem for the Total Variation Flow. 1 The Total Variation Flow in Image Pro- cessing We suppose that our image (or data) ud is a function defined on a bounded and piecewise smooth open set D of IRN - typically a rectangle in IR2. Gen- erally, the degradation of the image occurs during image acquisition and can be modeled by a linear and translation invariant blur and additive noise. The equation relating u, the real image, to ud can be written as ud = Ku + n, (1) where K is a convolution operator with impulse response k, i.e., Ku = k ∗ u, and n is an additive white noise of standard deviation σ. In practice, the noise can be considered as Gaussian. ∗Notes from the course given in the Summer School “Calculus of Variations”, Roma, July 4-8, 2005 †Departamento de An´alisis Matem´atico, Universitat de Valencia, 46100 Burjassot (Va- lencia), Spain, [email protected], [email protected] 1 The problem of recovering u from ud is ill-posed.
    [Show full text]
  • Appendix A. Measure and Integration
    Appendix A. Measure and integration We suppose the reader is familiar with the basic facts concerning set theory and integration as they are presented in the introductory course of analysis. In this appendix, we review them briefly, and add some more which we shall need in the text. Basic references for proofs and a detailed exposition are, e.g., [[ H a l 1 ]] , [[ J a r 1 , 2 ]] , [[ K F 1 , 2 ]] , [[ L i L ]] , [[ R u 1 ]] , or any other textbook on analysis you might prefer. A.1 Sets, mappings, relations A set is a collection of objects called elements. The symbol card X denotes the cardi- nality of the set X. The subset M consisting of the elements of X which satisfy the conditions P1(x),...,Pn(x) is usually written as M = { x ∈ X : P1(x),...,Pn(x) }.A set whose elements are certain sets is called a system or family of these sets; the family of all subsystems of a given X is denoted as 2X . The operations of union, intersection, and set difference are introduced in the standard way; the first two of these are commutative, associative, and mutually distributive. In a { } system Mα of any cardinality, the de Morgan relations , X \ Mα = (X \ Mα)and X \ Mα = (X \ Mα), α α α α are valid. Another elementary property is the following: for any family {Mn} ,whichis { } at most countable, there is a disjoint family Nn of the same cardinality such that ⊂ \ ∪ \ Nn Mn and n Nn = n Mn.Theset(M N) (N M) is called the symmetric difference of the sets M,N and denoted as M #N.
    [Show full text]
  • 1.5. Set Functions and Properties. Let Л Be Any Set of Subsets of E
    1.5. Set functions and properties. Let A be any set of subsets of E containing the empty set ∅. A set function is a function µ : A → [0, ∞] with µ(∅)=0. Let µ be a set function. Say that µ is increasing if, for all A, B ∈ A with A ⊆ B, µ(A) ≤ µ(B). Say that µ is additive if, for all disjoint sets A, B ∈ A with A ∪ B ∈ A, µ(A ∪ B)= µ(A)+ µ(B). Say that µ is countably additive if, for all sequences of disjoint sets (An : n ∈ N) in A with n An ∈ A, S µ An = µ(An). n ! n [ X Say that µ is countably subadditive if, for all sequences (An : n ∈ N) in A with n An ∈ A, S µ An ≤ µ(An). n ! n [ X 1.6. Construction of measures. Let A be a set of subsets of E. Say that A is a ring on E if ∅ ∈ A and, for all A, B ∈ A, B \ A ∈ A, A ∪ B ∈ A. Say that A is an algebra on E if ∅ ∈ A and, for all A, B ∈ A, Ac ∈ A, A ∪ B ∈ A. Theorem 1.6.1 (Carath´eodory’s extension theorem). Let A be a ring of subsets of E and let µ : A → [0, ∞] be a countably additive set function. Then µ extends to a measure on the σ-algebra generated by A. Proof. For any B ⊆ E, define the outer measure ∗ µ (B) = inf µ(An) n X where the infimum is taken over all sequences (An : n ∈ N) in A such that B ⊆ n An and is taken to be ∞ if there is no such sequence.
    [Show full text]
  • A Bayesian Level Set Method for Geometric Inverse Problems
    Interfaces and Free Boundaries 18 (2016), 181–217 DOI 10.4171/IFB/362 A Bayesian level set method for geometric inverse problems MARCO A. IGLESIAS School of Mathematical Sciences, University of Nottingham, Nottingham NG7 2RD, UK E-mail: [email protected] YULONG LU Mathematics Institute, University of Warwick, Coventry CV4 7AL, UK E-mail: [email protected] ANDREW M. STUART Mathematics Institute, University of Warwick, Coventry CV4 7AL, UK E-mail: [email protected] [Received 3 April 2015 and in revised form 10 February 2016] We introduce a level set based approach to Bayesian geometric inverse problems. In these problems the interface between different domains is the key unknown, and is realized as the level set of a function. This function itself becomes the object of the inference. Whilst the level set methodology has been widely used for the solution of geometric inverse problems, the Bayesian formulation that we develop here contains two significant advances: firstly it leads to a well-posed inverse problem in which the posterior distribution is Lipschitz with respect to the observed data, and may be used to not only estimate interface locations, but quantify uncertainty in them; and secondly it leads to computationally expedient algorithms in which the level set itself is updated implicitly via the MCMC methodology applied to the level set function – no explicit velocity field is required for the level set interface. Applications are numerous and include medical imaging, modelling of subsurface formations and the inverse source problem; our theory is illustrated with computational results involving the last two applications.
    [Show full text]
  • Generalized Stochastic Processes with Independent Values
    GENERALIZED STOCHASTIC PROCESSES WITH INDEPENDENT VALUES K. URBANIK UNIVERSITY OF WROCFAW AND MATHEMATICAL INSTITUTE POLISH ACADEMY OF SCIENCES Let O denote the space of all infinitely differentiable real-valued functions defined on the real line and vanishing outside a compact set. The support of a function so E X, that is, the closure of the set {x: s(x) F 0} will be denoted by s(,o). We shall consider 3D as a topological space with the topology introduced by Schwartz (section 1, chapter 3 in [9]). Any continuous linear functional on this space is a Schwartz distribution, a generalized function. Let us consider the space O of all real-valued random variables defined on the same sample space. The distance between two random variables X and Y will be the Frechet distance p(X, Y) = E[X - Yl/(l + IX - YI), that is, the distance induced by the convergence in probability. Any C-valued continuous linear functional defined on a is called a generalized stochastic process. Every ordinary stochastic process X(t) for which almost all realizations are locally integrable may be considered as a generalized stochastic process. In fact, we make the generalized process T((p) = f X(t),p(t) dt, with sp E 1, correspond to the process X(t). Further, every generalized stochastic process is differentiable. The derivative is given by the formula T'(w) = - T(p'). The theory of generalized stochastic processes was developed by Gelfand [4] and It6 [6]. The method of representation of generalized stochastic processes by means of sequences of ordinary processes was considered in [10].
    [Show full text]
  • Total Variation Deconvolution Using Split Bregman
    Published in Image Processing On Line on 2012{07{30. Submitted on 2012{00{00, accepted on 2012{00{00. ISSN 2105{1232 c 2012 IPOL & the authors CC{BY{NC{SA This article is available online with supplementary materials, software, datasets and online demo at http://dx.doi.org/10.5201/ipol.2012.g-tvdc 2014/07/01 v0.5 IPOL article class Total Variation Deconvolution using Split Bregman Pascal Getreuer Yale University ([email protected]) Abstract Deblurring is the inverse problem of restoring an image that has been blurred and possibly corrupted with noise. Deconvolution refers to the case where the blur to be removed is linear and shift-invariant so it may be expressed as a convolution of the image with a point spread function. Convolution corresponds in the Fourier domain to multiplication, and deconvolution is essentially Fourier division. The challenge is that since the multipliers are often small for high frequencies, direct division is unstable and plagued by noise present in the input image. Effective deconvolution requires a balance between frequency recovery and noise suppression. Total variation (TV) regularization is a successful technique for achieving this balance in de- blurring problems. It was introduced to image denoising by Rudin, Osher, and Fatemi [4] and then applied to deconvolution by Rudin and Osher [5]. In this article, we discuss TV-regularized deconvolution with Gaussian noise and its efficient solution using the split Bregman algorithm of Goldstein and Osher [16]. We show a straightforward extension for Laplace or Poisson noise and develop empirical estimates for the optimal value of the regularization parameter λ.
    [Show full text]
  • Old Notes from Warwick, Part 1
    Measure Theory, MA 359 Handout 1 Valeriy Slastikov Autumn, 2005 1 Measure theory 1.1 General construction of Lebesgue measure In this section we will do the general construction of σ-additive complete measure by extending initial σ-additive measure on a semi-ring to a measure on σ-algebra generated by this semi-ring and then completing this measure by adding to the σ-algebra all the null sets. This section provides you with the essentials of the construction and make some parallels with the construction on the plane. Throughout these section we will deal with some collection of sets whose elements are subsets of some fixed abstract set X. It is not necessary to assume any topology on X but for simplicity you may imagine X = Rn. We start with some important definitions: Definition 1.1 A nonempty collection of sets S is a semi-ring if 1. Empty set ? 2 S; 2. If A 2 S; B 2 S then A \ B 2 S; n 3. If A 2 S; A ⊃ A1 2 S then A = [k=1Ak, where Ak 2 S for all 1 ≤ k ≤ n and Ak are disjoint sets. If the set X 2 S then S is called semi-algebra, the set X is called a unit of the collection of sets S. Example 1.1 The collection S of intervals [a; b) for all a; b 2 R form a semi-ring since 1. empty set ? = [a; a) 2 S; 2. if A 2 S and B 2 S then A = [a; b) and B = [c; d).
    [Show full text]
  • Guaranteed Deterministic Bounds on the Total Variation Distance Between Univariate Mixtures
    Guaranteed Deterministic Bounds on the Total Variation Distance between Univariate Mixtures Frank Nielsen Ke Sun Sony Computer Science Laboratories, Inc. Data61 Japan Australia [email protected] [email protected] Abstract The total variation distance is a core statistical distance between probability measures that satisfies the metric axioms, with value always falling in [0; 1]. This distance plays a fundamental role in machine learning and signal processing: It is a member of the broader class of f-divergences, and it is related to the probability of error in Bayesian hypothesis testing. Since the total variation distance does not admit closed-form expressions for statistical mixtures (like Gaussian mixture models), one often has to rely in practice on costly numerical integrations or on fast Monte Carlo approximations that however do not guarantee deterministic lower and upper bounds. In this work, we consider two methods for bounding the total variation of univariate mixture models: The first method is based on the information monotonicity property of the total variation to design guaranteed nested deterministic lower bounds. The second method relies on computing the geometric lower and upper envelopes of weighted mixture components to derive deterministic bounds based on density ratio. We demonstrate the tightness of our bounds in a series of experiments on Gaussian, Gamma and Rayleigh mixture models. 1 Introduction 1.1 Total variation and f-divergences Let ( R; ) be a measurable space on the sample space equipped with the Borel σ-algebra [1], and P and QXbe ⊂ twoF probability measures with respective densitiesXp and q with respect to the Lebesgue measure µ.
    [Show full text]
  • Calculus of Variations
    MIT OpenCourseWare http://ocw.mit.edu 16.323 Principles of Optimal Control Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 16.323 Lecture 5 Calculus of Variations • Calculus of Variations • Most books cover this material well, but Kirk Chapter 4 does a particularly nice job. • See here for online reference. x(t) x*+ αδx(1) x*- αδx(1) x* αδx(1) −αδx(1) t t0 tf Figure by MIT OpenCourseWare. Spr 2008 16.323 5–1 Calculus of Variations • Goal: Develop alternative approach to solve general optimization problems for continuous systems – variational calculus – Formal approach will provide new insights for constrained solutions, and a more direct path to the solution for other problems. • Main issue – General control problem, the cost is a function of functions x(t) and u(t). � tf min J = h(x(tf )) + g(x(t), u(t), t)) dt t0 subject to x˙ = f(x, u, t) x(t0), t0 given m(x(tf ), tf ) = 0 – Call J(x(t), u(t)) a functional. • Need to investigate how to find the optimal values of a functional. – For a function, we found the gradient, and set it to zero to find the stationary points, and then investigated the higher order derivatives to determine if it is a maximum or minimum. – Will investigate something similar for functionals. June 18, 2008 Spr 2008 16.323 5–2 • Maximum and Minimum of a Function – A function f(x) has a local minimum at x� if f(x) ≥ f(x �) for all admissible x in �x − x�� ≤ � – Minimum can occur at (i) stationary point, (ii) at a boundary, or (iii) a point of discontinuous derivative.
    [Show full text]
  • Calculus of Variations in Image Processing
    Calculus of variations in image processing Jean-François Aujol CMLA, ENS Cachan, CNRS, UniverSud, 61 Avenue du Président Wilson, F-94230 Cachan, FRANCE Email : [email protected] http://www.cmla.ens-cachan.fr/membres/aujol.html 18 september 2008 Note: This document is a working and uncomplete version, subject to errors and changes. Readers are invited to point out mistakes by email to the author. This document is intended as course notes for second year master students. The author encourage the reader to check the references given in this manuscript. In particular, it is recommended to look at [9] which is closely related to the subject of this course. Contents 1. Inverse problems in image processing 4 1.1 Introduction.................................... 4 1.2 Examples ....................................... 4 1.3 Ill-posedproblems............................... .... 6 1.4 Anillustrativeexample. ..... 8 1.5 Modelizationandestimator . ..... 10 1.5.1 Maximum Likelihood estimator . 10 1.5.2 MAPestimator ................................ 11 1.6 Energymethodandregularization. ....... 11 2. Mathematical tools and modelization 14 2.1 MinimizinginaBanachspace . 14 2.2 Banachspaces.................................... 14 2.2.1 Preliminaries ................................. 14 2.2.2 Topologies in Banach spaces . 17 2.2.3 Convexity and lower semicontinuity . ...... 19 2.2.4 Convexanalysis................................ 23 2.3 Subgradient of a convex function . ...... 23 2.4 Legendre-Fencheltransform: . ....... 24 2.5 The space of funtions with bounded variation . ......... 26 2.5.1 Introduction.................................. 26 2.5.2 Definition ................................... 27 2.5.3 Properties................................... 28 2.5.4 Decomposability of BV (Ω): ......................... 28 2.5.5 SBV ...................................... 30 2.5.6 Setsoffiniteperimeter . 32 2.5.7 Coarea formula and applications .
    [Show full text]
  • Radon Measures
    MAT 533, SPRING 2021, Stony Brook University REAL ANALYSIS II FOLLAND'S REAL ANALYSIS: CHAPTER 7 RADON MEASURES Christopher Bishop 1. Chapter 7: Radon Measures Chapter 7: Radon Measures 7.1 Positive linear functionals on Cc(X) 7.2 Regularity and approximation theorems 7.3 The dual of C0(X) 7.4* Products of Radon measures 7.5 Notes and References Chapter 7.1: Positive linear functionals X = locally compact Hausdorff space (LCH space) . Cc(X) = continuous functionals with compact support. Defn: A linear functional I on C0(X) is positive if I(f) ≥ 0 whenever f ≥ 0, Example: I(f) = f(x0) (point evaluation) Example: I(f) = R fdµ, where µ gives every compact set finite measure. We will show these are only examples. Prop. 7.1; If I is a positive linear functional on Cc(X), for each compact K ⊂ X there is a constant CK such that jI(f)j ≤ CLkfku for all f 2 Cc(X) such that supp(f) ⊂ K. Proof. It suffices to consider real-valued I. Given a compact K, choose φ 2 Cc(X; [0; 1]) such that φ = 1 on K (Urysohn's lemma). Then if supp(f) ⊂ K, jfj ≤ kfkuφ, or kfkφ − f > 0;; kfkφ + f > 0; so kfkuI(φ) − I)f) ≥ 0; kfkuI(φ) + I)f) ≥ 0: Thus jI(f)j ≤ I(φ)kfku: Defn: let µ be a Borel measure on X and E a Borel subset of X. µ is called outer regular on E if µ(E) = inffµ(U): U ⊃ E; U open g; and is inner regular on E if µ(E) = supfµ(K): K ⊂ E; K open g: Defn: if µ is outer and inner regular on all Borel sets, then it is called regular.
    [Show full text]