2006
DOI: 10.1049/el:20064369
|View full text |Cite
|
Sign up to set email alerts
|

Fast bilateral filter for edge-preserving smoothing

Abstract: Edge-preserving lowpass filters are a valuable tool in several image processing tasks, including noise reduction and dynamic range compression. A high-quality algorithm is the bilateral filter, but its computational cost is very high. A fast but approximate implementation was introduced by Durand and Dorsey. Introduced are two modifications in this technique which allow further acceleration and a significant increase in quality

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
12
0

Year Published

2008
2008
2019
2019

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 24 publications
(12 citation statements)
references
References 1 publication
0
12
0
Order By: Relevance
“…Therefore, the RCR method [25] is used to adjust the object edge of the enhanced depth map. Thus, there exist several algorithms can effectively detect edges and eliminate jagged edges [26], such as guided filter [27,28], geodesic filters [29,30], weighted median filters [31,32], and bilateral filter [33][34][35]. In this paper, we suggest the rotating counsel refinement (RCR), the filtering, is used to remove the tiny jagged edge of enhanced depth maps.…”
Section: Rotating Counsel Refinement For Depth Mapmentioning
confidence: 99%
“…Therefore, the RCR method [25] is used to adjust the object edge of the enhanced depth map. Thus, there exist several algorithms can effectively detect edges and eliminate jagged edges [26], such as guided filter [27,28], geodesic filters [29,30], weighted median filters [31,32], and bilateral filter [33][34][35]. In this paper, we suggest the rotating counsel refinement (RCR), the filtering, is used to remove the tiny jagged edge of enhanced depth maps.…”
Section: Rotating Counsel Refinement For Depth Mapmentioning
confidence: 99%
“…By convention, it is customary to assume that the values taken by the range filter r satisfy r ∈ [0, 1], so that a small r forbids any sort of smoothing, and a large r authorizes the smoothing provided by the spatial filter s. By design, the denominator of (17) ensures a proper normalizationobserve that, through r , this normalization depends on data in a nonlinear fashion and must therefore be computed anew at every coordinate k. For the purpose of discussion, we assume 1-D data, with d = 1. Moreover, we take s to be the bi-exponential filter (11). This leads us to rewrite (17) as…”
Section: B Bilateral Filtermentioning
confidence: 99%
“…This method was used for instance in [10] to homogenize the illumination of an image by compressing its dynamic range, and further refined in [11]- [13]. Substantial acceleration was also achieved in [14], again at the cost of some form of quantization.…”
mentioning
confidence: 99%
“…͑8͒ becomes a convolution that can be efficiently computed using the fast Fourier transform ͑FFT͒ algorithm. In 2006, Guarnieri et al 17 improved the PWL approximation of the bilateral filter introducing the following modifications:…”
Section: Bf-based Deghostingmentioning
confidence: 99%