A Convex Programming Approach to Anisotropic Smoothing

We develop a computationally efficient algorithm for the problem of anisotropic smoothing in images, i.e., smoothing an image along its directional fields. Whereas similar problems are often posed and solved as PDE problems in the literature, we formulate the problem as a convex programming problem. We present efficient implementations of interior-point algorithms for solving large instances of this problem.