Proceedings of ISP RAS


Fast L1 Gauss Transforms for Edge-Aware Image Filtering

D.R. Bashkirova (RIKEN, Wako, Japan; KFU, Kazan, Russia)
S. Yoshizawa (RIKEN, Wako, Japan)
R.H. Latypov (KFU, Kazan, Russia)
H. Yokota (RIKEN, Wako, Japan)

Abstract

Gaussian convolution and its discrete analogue, Gauss transform, have many science and engineering applications, such as mathematical statistics, thermodynamics and machine learning, and are widely applied to computer vision and image processing tasks. Due to its computational expense (quadratic and exponential complexities with respect to the number of points and dimensionality, respectively) and rapid spreading of high quality data (bit depth/dynamic range), accurate approximation has become important in practice compared with conventional fast methods, such as recursive or box kernel methods. In this paper, we propose a novel approximation method for fast Gaussian convolution of two-dimensional uniform point sets, such as 2D images. Our method employs L1 distance metric for Gaussian function and domain splitting approach to achieve fast computation (linear computational complexity) while preserving high accuracy. Our numerical experiments show the advantages over conventional methods in terms of speed and precision. We also introduce a novel and effective joint image filtering approach based on the proposed method, and demonstrate its capability on edge-aware smoothing and detail enhancement. The experiments show that filters based on the proposed L1 Gauss transform give higher quality of the result and are faster than the original filters that use box kernel for Gaussian convolution approximation.  

Keywords

Gaussian smoothing, Laplace distribution, fast approximation algorithms

Edition

Proceedings of the Institute for System Programming, vol. 29, issue 4, 2017, pp. 55-72.

ISSN 2220-6426 (Online), ISSN 2079-8156 (Print).

DOI: 10.15514/ISPRAS-2017-29(4)-4

Full text of the paper in pdf Back to the contents of the volume