Compensated Convexity on Bounded Domains, Mixed Moreau Envelopes and Computational Methods
We introduce local compensated convex transforms for functions defined in bounded convex closed domains by making specific extensions of the function to the whole space, and establish their relations to globally defined compensated convex transforms via the mixed critical Moreau envelopes. We also propose a numerical scheme for computing Moreau envelopes, establishing convergence of the scheme with the rate of convergence depending on the regularity of the original function. We give an estimate of the number of iterations needed for computing the discrete Moreau envelope. We then apply the local compensated convex transforms to image inpainting and shape interrogation. Our results are compared with those obtained by using schemes based on computing the convex envelope from the original definition of compensated convex transforms.
READ FULL TEXT