- About this Journal
- Abstracting and Indexing
- Aims and Scope
- Annual Issues
- Article Processing Charges
- Articles in Press
- Author Guidelines
- Bibliographic Information
- Citations to this Journal
- Contact Information
- Editorial Board
- Editorial Workflow
- Free eTOC Alerts
- Publication Ethics
- Reviewers Acknowledgment
- Submit a Manuscript
- Subscription Information
- Table of Contents
Abstract and Applied Analysis
Volume 2012 (2012), Article ID 930978, 8 pages
There Are Thin Minimizers of the L1TV Functional
Department of Mathematics, Washington State University, Pullman, WA 99164-3113, USA
Received 18 June 2012; Accepted 30 July 2012
Academic Editor: Ondřej Došlý
Copyright © 2012 Benjamin Van Dyke and Kevin R. Vixie. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
We show the surprising results that while the local reach of the boundary of an minimizer is bounded below by , the global reach can be smaller. We do this by demonstrating several example minimizing sets not equal to the union of the -balls they contain.
The functional introduced and studied in  is defined to be where and are functions from to . If the input function is binary, Chan and Esedoḡlu observed that the functional reduces to: where is the support of the function , is the perimeter of the set , denotes the symmetric difference, and is the support of the binary data . In this paper, we will give examples to show that when is the characteristic function of a set , the minimizer of the functional is sometimes the set itself, instead of the union of all the -balls it contains, even though there are parts of that cannot contain such a ball.
We present these examples not only because they have interesting properties, but also to illustrate useful applications for many of the results found about minimizers of (1.1), specifically those found in [2, 3]. Furthermore, one can use these examples to test computational schemes for minimizing (1.1).
In [2, 4, 5], Allard used techniques from geometric measure theory to produce a study of minimizers for a class of functionals that include (1.1). In , he shows that if is convex, then the minimizer of (1.1) is either the empty set or the union of all -balls contained in . This leads us to a question: Under what circumstances can the condition of convexity be relaxed in order to obtain the same result? The examples in this paper explore this idea and show that the answer may be difficult. To construct these examples, we will rely on many of the results from . These results, as they relate to minimizers of (1.1) with , are summarized below (for the full results see ).(i)The boundary is of class . (ii)The curvature of is bounded above by . (iii) differs from in arcs of -curvature. (iv)These arcs subtend angles of not more than radians. (v) is contained in the closed convex hull of .
Note 1. If then and must share part of their boundaries, otherwise the third and fourth results would be violated. These results also imply that and must meet tangentially or is comprised of arcs of -curvature that meet tangentially to one another at points on (see Figure 1).
The following theorem from  can be used to eliminate the second case, illustrated in Figure 1, for the three possible choices of given in this paper.
Theorem 1.1. Let be a bounded, measurable subset of . Let be any minimizer of (1.2). Assume that a ball, , of radius lies completely in . Then is also a minimizer. Moreover, if , then is also a minimizer.
For the examples that follow, one will always be able to find a ball of radius contained within . Thus, if a minimizer did exist with boundary as in Figure 1, one would be able to find the new minimizer . This new minimizer would then have boundary containing an arc of radius -curvature (see Figure 1) contradicting the third result listed above. Note, it does not matter whether is to the left or right of in Figure 1, the contradiction would still be obtained. Consequently, all the examples that follow will have minimizers with boundaries that meet tangentially. one can then use the five results listed above to find the set of all possible minimizers, , for a given set and then compute and compare their values for (1.2) to find the actual minimizer. In each case, one generates a large set of examples for which the set is the minimizer despite the facts that and there are parts of that cannot contain such a ball.
2. Nonconcentric Annulus
For the first example, we take to be the region contained between two nonconcentric circles of radii and with and minimum distance between the two circles being (shown in Figure 2) and compute (1.2) for the five choices of : (The large outer disc), , , , and (The small inner disc).
Since is equal to the closed convex hull of , all possible minimizers must be a subset of this disc. This fact, along with the fact that , , , and do not violate the curvature requirement and do not have boundaries not contained in , explain why they are considered as possible minimizers. Since any minimizer must meet tangentially, the only other possibilities would be combinations of subsets of and that meet the annulus tangentially with arcs of -curvature of not more than radians.
We can consider both cases separately and then take unions of the possible subsets of and . The above mentioned requirement would disallow any nonempty proper subset of because the restriction would make it impossible for an arc of -curvature of not more than radians to meet tangentially. We can now turn our attention to possible subsets of . If we only consider arcs of -curvature of not more than radians that meet tangentially, then we are limited to arcs that are simultaneously tangent to both circles comprising the annulus. The only possible set that can satisfy this requirement is . Now any minimizer besides those listed previously must be either or the union of this set with one of the others. This only leaves the possibility of , but this set does not have boundary and so is not a possible candidate.
This leads to the following equations derived from (1.2): where and . The angles and are the angles between the vertical axis and the lines from the centers of the two circular boundaries of to the center of one of the two -balls that are tangent to both of the circular boundaries, as shown in Figure 2.
From (2.1)–(2.5), many examples can be created. For illustrative purposes, we have chosen with and let and vary. We can then compute (2.1)–(2.5) for any values of and and determine which equation has minimum value, thus indicating the minimizer. Figure 3 summarizes the results for many such choices of and . Since the value obtained from (2.4) is not meaningful for all values of , we have indicated with a curve on the figure where the two tangent -balls pictured in Figure 2 would touch. Anything to the left of this curve would indicate either the two balls pictured overlap, coincide, or is too small for such a ball to touch both boundaries and would make (2.4) meaningless. In the first case would not have boundary and so is not a possible minimizer and in the latter two cases and so again should not be considered. Consequently, we see that to the right of the curve there is a significant region where the entire annulus obtains a lower value for (1.2) than the union of -balls, giving the desired examples.
When the two tangent -balls touch, the angle satisfies the equation . We also know from above that satisfies the equation . The curve in Figure 3 is then derived from the identity . It is, also, of interest to observe that when the annulus is concentric, that is, , the minimizers for (1.1) are known  and coincide with the top line of Figure 3.
3. Square Annulus
For the second example, we take to be the region contained within the “square annulus” shown in Figure 4, where the corners are arcs of a circle of radius with , is the length of each side on the inside of the annulus from arc to arc, and is the distance between the straight edges on each side of the annulus. We then compute (1.2) for the five choices of : The large rounded square (the region contained within the outer boundary), , , , and The small rounded square (the region contained within the inner boundary).As long as we note that the curvature at any point of is less than , we can argue as in the preceding section that these are the only possible minimizers of (1.2).
This leads to the following equations derived from (1.2): where and . The angles and are the angles between the line from the centers of the circles defining the arcs to the corners and the lines from the centers of the circles to the center of one of the eight -balls, that is, tangent to both boundaries, as shown in Figure 4.
From (3.1)–(3.5), many examples can be created. For illustrative purposes, we have chosen , and let and vary. We can then compute (3.1)–(3.5) for any values of and and determine which equation has minimum value. Figure 5 summarizes the results for many such choices of and . We can then see that in the lower left portion of Figure 5 there is a significant region where the entire annulus obtains a lower value for (1.2) than the union of -balls, giving the desired examples.
Note 3. We restrict so that it does not exceed the widest part of the corners and so that the -balls can only be tangent to the two arcs and never to the flat region (in which case equation (3.4) would be incorrect). This yields the following bounds .
For the third example, we take to be the region contained within the “dumbbell” shown in Figure 6, where the ends of the dumbbell are circles of radius , the corners between the ends and the “handle” are arcs of a circle of radius with , is the length of the “handle” stretching from arc to arc, and is the width of the “handle” with . We then compute (1.2) for the three choices of : , , and .
Again, we can argue that these are the only possible minimizers of (1.2). First, it is important to note that we have restricted , otherwise would not be a candidate for minimizer because the curvature would exceed . Since the curvature of is always smaller than the minimizer must be contained within because it is impossible for an arc of -curvature of not more than radians to meet tangentially from the outside. One can then argue as before that the only possible nonempty minimizer that is a subset of is .
This leads to the following equations: where , , , and are all shown in Figure 6 and are given by , , , and .
From (4.1)–(4.3), many examples can be created. For illustrative purposes, we have chosen , , and let and vary. We can then compute (4.1)–(4.3) for any values of and and determine which equation has minimum value. Figure 7 summarizes the results for many such choices of and . We can then see that in the lower left portion of Figure 7 there is a significant region where the entire “dumbbell” obtains a lower value for (1.2) than the union of -balls, giving the desired examples.
- T. F. Chan and S. Esedoḡlu, “Aspects of total variation regularized function approximation,” SIAM Journal on Applied Mathematics, vol. 65, no. 5, pp. 1817–1837, 2005.
- W. K. Allard, “Total variation regularization for image denoising. I. Geometric theory,” SIAM Journal on Mathematical Analysis, vol. 39, no. 4, pp. 1150–1190, 2007.
- Kevin R. Vixie, “Some properties of minimizers for the Chan-Esedoḡlu functional,” Optimization and Control. In press.
- W. K. Allard, “Total variation regularization for image denoising. II. Examples,” SIAM Journal on Imaging Sciences, vol. 1, no. 4, pp. 400–417, 2008.
- W. K. Allard, “Total variation regularization for image denoising. III. Examples,” SIAM Journal on Imaging Sciences, vol. 2, no. 2, pp. 532–568, 2009.
- D. Goldfarb, W. Yin, and S. Osher, “The total variation regularized model for multiscale decomposition,” Multiscale Modeling & Simulation, vol. 6, no. 1, pp. 190–211, 2007.