Topic
Bilateral filter
About: Bilateral filter is a research topic. Over the lifetime, 3500 publications have been published within this topic receiving 75582 citations.
Papers published on a yearly basis
Papers
More filters
••
07 Aug 2002TL;DR: In this paper, the quality of images using square pixels with that of images employing hexagonal pixels was compared using various images, each considering a different aspect of geometry (i.e., lines at different angles, curves, etc).
Abstract: In most image processing applications, data is collected and displayed in square pixels. Hexagonal pixels offer the advantage of greater rotational symmetry, a close packed structure and a nearly circular pixel. We compared the quality of images using square pixels with that of images employing hexagonal pixels. The comparison was done using various images, each considering a different aspect of geometry (i.e., lines at different angles, curves, etc). The square pixel images were constructed using the average of a square area of smaller square pixels. Hexagonal pixel images were constructed using two techniques. The first one was called the "two-template approach", wherein two different templates were used to create a close packed hexagonal image from smaller square pixels. The second approach was called the "six-neighbor approach"; it creates a rectangular template using the six neighbors of a hexagonal pixel. A Euclidean distance measure was used to compare the square pixel and hexagonal pixel images. A brief explanation of the algorithm and the results are provided. Based on our results obtained using the Euclidean distance as a quality measure, we conclude that, contrary to our intuition and their widespread use in nature (retinas and ommatidia), hexagonal pixels do not offer any advantage over conventional square pixels.
15 citations
•
01 Sep 2000TL;DR: In this paper, a method and apparatus for driving a liquid crystal panel in a line-inversion system is described, in which at least one pixel block each of which includes at least two data lines within the liquid crystal panels is set, so that the brightness difference between the adjacent pixels can be reduced to eliminate a noise pattern in the vertical direction.
Abstract: A method and apparatus for driving a liquid crystal panel in a line-inversion system is disclosed. In the method, at least one pixel block each of which includes at least two data lines within the liquid crystal panel is set. The adjacent pixels in a gate line direction within the pixel block respond to data signals having the same polarity. The pixels within the other pixel areas except for the pixel block respond to data signals having a polarity contrary to the adjacent pixels at the left and right sides thereof. Accordingly, a current amount charged in the adjacent pixels having a large brightness difference is supplied always equally, so that the brightness difference between the adjacent pixels can be reduced to eliminate a noise pattern in the vertical direction.
15 citations
••
12 Aug 2011TL;DR: A hierarchical joint bilateral filtering method is proposed to improve the coarse depth map by suppressing outliers in a hierarchical structure and can achieve significant improvement of initial depth map with low computational complexity.
Abstract: Various 3D applications require accurate and smooth depth map, and post-processing is necessary for depth map directly generated by different correspondence algorithms. A hierarchical joint bilateral filtering method is proposed to improve the coarse depth map. By first carrying out depth confidence measuring, pixels are put into different categories according to their matching confidence. Then the initial coarse depth map is down-sampled together with the corresponding confidence map. Depth map is progressively fixed during multistep up sampling. Different from many filtering approaches, confident matches are propagated to unconfident regions by suppressing outliers in a hierarchical structure. Experiment results present that the proposed method can achieve significant improvement of initial depth map with low computational complexity.
15 citations
••
03 Nov 2002TL;DR: This paper presents a relation between the bilateral filter and the Bayesian methodology and shows how this filter can be improved and extended to treat more general signal characteristics.
Abstract: Effective methods for image denoising are typically based on iterative and locally adaptive algorithms. Recently, an alternative algorithm called 'bilateral filter' was proposed for the same task. This filter was shown to give similar and possibly better results compared to the ones obtained by the best iterative approaches. In this paper we present a relation between the bilateral filter and the Bayesian methodology. Based on this observation, we show how the bilateral filter can be improved and extended to treat more general signal characteristics.
15 citations
••
TL;DR: The Alternating Guided Filter (AGF) is presented that achieves edge preserving smoothing by combining two recently introduced filters: the Rolling Guided filter (RGF) and the Smooth and iteratively Restore Filter (SiR).
Abstract: Edge preserving filters aim to simplify the representation of images (e.g., by reducing noise or eliminating irrelevant detail) while preserving their most significant edges. These filters are typically nonlinear and locally smooth the image structure while minimizing both blurring and over-sharpening of visually important edges. Here we present the Alternating Guided Filter (AGF) that achieves edge preserving smoothing by combining two recently introduced filters: the Rolling Guided Filter (RGF) and the Smooth and iteratively Restore Filter (SiR). We show that the integration of RGF and SiR in an alternating iterative framework results in a new smoothing operator that preserves significant image edges while effectively eliminating small scale details. The AGF combines the large scale edge and local intensity preserving properties of the RGF with the edge restoring properties of the SiR while eliminating the drawbacks of both previous methods (i.e., edge curvature smoothing by RGF and local intensity reduction and restoration of small scale details near large scale edges by SiR). The AGF is simple to implement and efficient, and produces high-quality results. We demonstrate the effectiveness of AGF on a variety of images, and provide a public code to facilitate future studies. Subjects Algorithms and Analysis of Algorithms, Computer Vision
15 citations