Abstract

Image smoothing algorithm based on l<sub>0</sub> gradient minimization can smooth details and textures of image while preserving edges. Since the algorithm uses image gradient to determine the smoothed component, the region with smaller image gradients (weak edge) can be smoothed. However, the region with larger image gradients (strong edge) will be preserved. In order to overcome this drawback, we propose an image-patch based l<sub>0</sub> gradient minimization image smoothing algorithm (IP-<italic>l</italic><sub>0</sub>). Instead of globally smoothing the input image, our algorithm smoothed each image patch first and then combined the smoothed patches together to obtain the final smoothed image. The weight parameters in the objective function used to smooth each image patch are dynamically changed according to the local statistics of image patch, so that the patches containing strong textures will be smoothed with greater force, and vice versa. The experimental results show that compared to the original l<sub>0</sub> gradient minimization algorithm and several other state-of-the-art edge-preserving image smoothing algorithms including the local Laplacian filter based algorithm, the relative total variation based algorithm, the tree filter based algorithm, and two kinds of deep-learning based smoothing algorithms, the proposed algorithm can effectively smooth strong textures and well preserve weak edges or structures, and the ability of edge preservation and texture smoothing is better than other algorithms.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.