$L_{0}$ Gradient Projection

Minimizing L ₀ gradient, the number of the non-zero gradients of an image, together with a quadratic data-fidelity to an input image has been recognized as a powerful edge-preserving filtering method. However, the L ₀ gradient minimization has an inherent difficulty: a user-given parameter controlling the degree of flatness does not have a physical meaning since the parameter just balances the relative importance of the L ₀ gradient term to the quadratic data-fidelity term. As a result, the setting of the parameter is a troublesome work in the L ₀ gradient minimization. To circumvent the difficulty, we propose a new edge-preserving filtering method with a novel use of the L ₀ gradient. Our method is formulated as the minimization of the quadratic data-fidelity subject to the hard constraint that the L ₀ gradient is less than a user-given parameter α. This strategy is much more intuitive than the L ₀ gradient minimization because the parameter α has a clear meaning: the L ₀ gradient value of the output image itself, so that one can directly impose a desired degree of flatness by α. We also provide an efficient algorithm based on the so-called alternating direction method of multipliers for computing an approximate solution of the nonconvex problem, where we decompose it into two subproblems and derive closed-form solutions to them. The advantages of our method are demonstrated through extensive experiments.