2,617 research outputs found
Accelerated graph-based nonlinear denoising filters
Denoising filters, such as bilateral, guided, and total variation filters,
applied to images on general graphs may require repeated application if noise
is not small enough. We formulate two acceleration techniques of the resulted
iterations: conjugate gradient method and Nesterov's acceleration. We
numerically show efficiency of the accelerated nonlinear filters for image
denoising and demonstrate 2-12 times speed-up, i.e., the acceleration
techniques reduce the number of iterations required to reach a given peak
signal-to-noise ratio (PSNR) by the above indicated factor of 2-12.Comment: 10 pages, 6 figures, to appear in Procedia Computer Science, vol.80,
2016, International Conference on Computational Science, San Diego, CA, USA,
June 6-8, 201
Bilateral Filter: Graph Spectral Interpretation and Extensions
In this paper we study the bilateral filter proposed by Tomasi and Manduchi,
as a spectral domain transform defined on a weighted graph. The nodes of this
graph represent the pixels in the image and a graph signal defined on the nodes
represents the intensity values. Edge weights in the graph correspond to the
bilateral filter coefficients and hence are data adaptive. Spectrum of a graph
is defined in terms of the eigenvalues and eigenvectors of the graph Laplacian
matrix. We use this spectral interpretation to generalize the bilateral filter
and propose more flexible and application specific spectral designs of
bilateral-like filters. We show that these spectral filters can be implemented
with k-iterative bilateral filtering operations and do not require expensive
diagonalization of the Laplacian matrix
Static/Dynamic Filtering for Mesh Geometry
The joint bilateral filter, which enables feature-preserving signal smoothing
according to the structural information from a guidance, has been applied for
various tasks in geometry processing. Existing methods either rely on a static
guidance that may be inconsistent with the input and lead to unsatisfactory
results, or a dynamic guidance that is automatically updated but sensitive to
noises and outliers. Inspired by recent advances in image filtering, we propose
a new geometry filtering technique called static/dynamic filter, which utilizes
both static and dynamic guidances to achieve state-of-the-art results. The
proposed filter is based on a nonlinear optimization that enforces smoothness
of the signal while preserving variations that correspond to features of
certain scales. We develop an efficient iterative solver for the problem, which
unifies existing filters that are based on static or dynamic guidances. The
filter can be applied to mesh face normals followed by vertex position update,
to achieve scale-aware and feature-preserving filtering of mesh geometry. It
also works well for other types of signals defined on mesh surfaces, such as
texture colors. Extensive experimental results demonstrate the effectiveness of
the proposed filter for various geometry processing applications such as mesh
denoising, geometry feature enhancement, and texture color filtering
Graph Spectral Image Processing
Recent advent of graph signal processing (GSP) has spurred intensive studies
of signals that live naturally on irregular data kernels described by graphs
(e.g., social networks, wireless sensor networks). Though a digital image
contains pixels that reside on a regularly sampled 2D grid, if one can design
an appropriate underlying graph connecting pixels with weights that reflect the
image structure, then one can interpret the image (or image patch) as a signal
on a graph, and apply GSP tools for processing and analysis of the signal in
graph spectral domain. In this article, we overview recent graph spectral
techniques in GSP specifically for image / video processing. The topics covered
include image compression, image restoration, image filtering and image
segmentation
Fast and Robust Pyramid-based Image Processing
Multi-scale manipulations are central to image editing but they are also prone to halos. Achieving artifact-free results requires sophisticated edgeaware techniques and careful parameter tuning. These shortcomings were recently addressed by the local Laplacian filters, which can achieve a broad range of effects using standard Laplacian pyramids. However, these filters are slow to evaluate and their relationship to other approaches is unclear. In this paper, we show that they are closely related to anisotropic diffusion and to bilateral filtering. Our study also leads to a variant of the bilateral filter that produces cleaner edges while retaining its speed. Building upon this result, we describe an acceleration scheme for local Laplacian filters that yields speed-ups on the order of 50x. Finally, we demonstrate how to use local Laplacian filters to alter the distribution of gradients in an image. We illustrate this property with a robust algorithm for photographic style transfer
Fast Local Laplacian Filters: Theory and Applications
International audienceMulti-scale manipulations are central to image editing but they are also prone to halos. Achieving artifact-free results requires sophisticated edge- aware techniques and careful parameter tuning. These shortcomings were recently addressed by the local Laplacian filters, which can achieve a broad range of effects using standard Laplacian pyramids. However, these filters are slow to evaluate and their relationship to other approaches is unclear. In this paper, we show that they are closely related to anisotropic diffusion and to bilateral filtering. Our study also leads to a variant of the bilateral filter that produces cleaner edges while retaining its speed. Building upon this result, we describe an acceleration scheme for local Laplacian filters on gray-scale images that yields speed-ups on the order of 50Ă—. Finally, we demonstrate how to use local Laplacian filters to alter the distribution of gradients in an image. We illustrate this property with a robust algorithm for photographic style transfer
A model based on local graphs for colour images and its application for Gaussian noise smoothing
[EN] In this paper, a new model for processing colour images is presented. A graph is built for each image pixel taking into account some constraints on links. Each pixel is characterized depending on the features of its related graph, which allows to process it appropriately. As an example, we provide a characterization of each pixel based on the link cardinality of its connected component. This feature enables us to properly distinguish flat image regions respect to edge and detail regions. According to this, we have designed a hybrid filter for colour image smoothing. It combines a filter able to properly process flat image regions with another one that is more appropriate for details and texture. Experimental results show that our model performs appropriately. We also see that our proposed filter is competitive with respect to state-of-the-art methods. It is close closer to the corresponding optimal switching filter respect to other analogous hybrid method.Samuel Morillas acknowledges the support of grant MTM2015-64373-P (MINECO/FEDER, UE). Cristina Jordan acknowledges the support of grant TEC2016-79884-C2-2-R.PĂ©rez-Benito, C.; Morillas, S.; Jordan-Lluch, C.; Conejero, JA. (2018). A model based on local graphs for colour images and its application for Gaussian noise smoothing. Journal of Computational and Applied Mathematics. 330:955-964. https://doi.org/10.1016/j.cam.2017.05.013S95596433
Alternately denoising and reconstructing unoriented point sets
We propose a new strategy to bridge point cloud denoising and surface
reconstruction by alternately updating the denoised point clouds and the
reconstructed surfaces. In Poisson surface reconstruction, the implicit
function is generated by a set of smooth basis functions centered at the
octnodes. When the octree depth is properly selected, the reconstructed surface
is a good smooth approximation of the noisy point set. Our method projects the
noisy points onto the surface and alternately reconstructs and projects the
point set. We use the iterative Poisson surface reconstruction (iPSR) to
support unoriented surface reconstruction. Our method iteratively performs iPSR
and acts as an outer loop of iPSR. Considering that the octree depth
significantly affects the reconstruction results, we propose an adaptive depth
selection strategy to ensure an appropriate depth choice. To manage the
oversmoothing phenomenon near the sharp features, we propose a
-projection method, which means to project the noisy points onto the
surface with an individual control coefficient for each point.
The coefficients are determined through a Voronoi-based feature detection
method. Experimental results show that our method achieves high performance in
point cloud denoising and unoriented surface reconstruction within different
noise scales, and exhibits well-rounded performance in various types of inputs.
The source code is available
at~\url{https://github.com/Submanifold/AlterUpdate}.Comment: Accepted by Computers & Graphics from CAD/Graphics 202
- …