Image Smoothing Via Gradient Sparsity and Surface Area Minimization
Lists
Only you see this
Abstract
Image smoothing is a very important topic in image processing. Among these image smoothing methods, the L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> gradient minimization method is one of the most popular ones. However, the L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> gradient minimization method suffers from the staircasing effect and over-sharpening issue, which highly degrade the quality of the smoothed image. To overcome these issues, we use not only the L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> gradient term for finding edges, but also a surface area based term for the purpose of smoothing the inside of each region. An alternating minimization algorithm is suggested to efficiently solve the proposed model, where each subproblem has a closed-form solution. Leveraging the introduced surface area term, the proposed method can effectively alleviate the staircasing effect and the over-sharpening issue. The superiority of our method over the state-of-the-art methods is demonstrated by a series of experiments.
BibTeX
@inproceedings{liu2019image,
author = {Jun Liu and Ming Yan and Jinshan Zeng and Tieyong Zeng},
title = {{Image Smoothing Via Gradient Sparsity and Surface Area Minimization}},
booktitle = {ICIP},
year = {2019},
doi = {10.1109/icip.2019.8804271},
}Loading related content...