Edge-preserving filtering by projection onto L0 gradient constraint
Abstract
We propose an edge-preserving filtering method with a novel use of the L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> gradient. Our method, termed as the L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> gradient projection, is formulated as the minimization of a quadratic data-fidelity to an input image subject to the constraint that the L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> gradient, the number of non-zero gradients, of the output image is less than a user-given parameter α. This strategy is much more intuitive than the conventional approach, the L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> gradient minimization, that minimizes the sum of the L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> gradient plus the quadratic data-fidelity, because one can directly impose a desired degree of flatness by α, which is impossible in the L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> gradient minimization. We also provide an efficient algorithm based on the so-called alternating direction method of multipliers for solving the nonconvex optimization problem associated with the L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> gradient projection. The utility of the L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> gradient projection is illustrated by experiments.
BibTeX
@inproceedings{icassp2017_edgepreservingfi,
title = {Edge-preserving filtering by projection onto L0 gradient constraint},
author = {Shunsuke Ono},
booktitle = {ICASSP 2017},
year = {2017}
}