2 research outputs found
Group Sparsity Residual with Non-Local Samples for Image Denoising
Inspired by group-based sparse coding, recently proposed group sparsity
residual (GSR) scheme has demonstrated superior performance in image
processing. However, one challenge in GSR is to estimate the residual by using
a proper reference of the group-based sparse coding (GSC), which is desired to
be as close to the truth as possible. Previous researches utilized the
estimations from other algorithms (i.e., GMM or BM3D), which are either not
accurate or too slow. In this paper, we propose to use the Non-Local Samples
(NLS) as reference in the GSR regime for image denoising, thus termed GSR-NLS.
More specifically, we first obtain a good estimation of the group sparse
coefficients by the image nonlocal self-similarity, and then solve the GSR
model by an effective iterative shrinkage algorithm. Experimental results
demonstrate that the proposed GSR-NLS not only outperforms many
state-of-the-art methods, but also delivers the competitive advantage of speed
3D Point Cloud Denoising using Graph Laplacian Regularization of a Low Dimensional Manifold Model
3D point cloud - a new signal representation of volumetric objects - is a
discrete collection of triples marking exterior object surface locations in 3D
space. Conventional imperfect acquisition processes of 3D point cloud - e.g.,
stereo-matching from multiple viewpoint images or depth data acquired directly
from active light sensors - imply non-negligible noise in the data. In this
paper, we adopt a previously proposed low-dimensional manifold model for the
surface patches in the point cloud and seek self-similar patches to denoise
them simultaneously using the patch manifold prior. Due to discrete
observations of the patches on the manifold, we approximate the manifold
dimension computation defined in the continuous domain with a patch-based graph
Laplacian regularizer and propose a new discrete patch distance measure to
quantify the similarity between two same-sized surface patches for graph
construction that is robust to noise. We show that our graph Laplacian
regularizer has a natural graph spectral interpretation, and has desirable
numerical stability properties via eigenanalysis. Extensive simulation results
show that our proposed denoising scheme can outperform state-of-the-art methods
in objective metrics and can better preserve visually salient structural
features like edges