139 research outputs found
Nonlocal Means-Based Denoising for Medical Images
Medical images often consist of low-contrast objects corrupted by random noise arising in the image acquisition process. Thus, image denoising is one of the fundamental tasks required by medical imaging analysis. Nonlocal means (NL-means) method provides a powerful framework for denoising. In this work, we investigate an adaptive denoising scheme based on the patch NL-means algorithm for medical imaging denoising. In contrast with the traditional NL-means algorithm, the proposed adaptive NL-means denoising scheme has three unique features. First, we use a restricted local neighbourhood where the true intensity for each noisy pixel is estimated from a set of selected neighbouring pixels to perform the denoising process. Second, the weights used are calculated thanks to the similarity between the patch to denoise and the other patches candidates. Finally, we apply the steering kernel to preserve the details of the images. The proposed method has been compared with similar state-of-art methods over synthetic and real clinical medical images showing an improved performance in all cases analyzed
Image Restoration Using Joint Statistical Modeling in Space-Transform Domain
This paper presents a novel strategy for high-fidelity image restoration by
characterizing both local smoothness and nonlocal self-similarity of natural
images in a unified statistical manner. The main contributions are three-folds.
First, from the perspective of image statistics, a joint statistical modeling
(JSM) in an adaptive hybrid space-transform domain is established, which offers
a powerful mechanism of combining local smoothness and nonlocal self-similarity
simultaneously to ensure a more reliable and robust estimation. Second, a new
form of minimization functional for solving image inverse problem is formulated
using JSM under regularization-based framework. Finally, in order to make JSM
tractable and robust, a new Split-Bregman based algorithm is developed to
efficiently solve the above severely underdetermined inverse problem associated
with theoretical proof of convergence. Extensive experiments on image
inpainting, image deblurring and mixed Gaussian plus salt-and-pepper noise
removal applications verify the effectiveness of the proposed algorithm.Comment: 14 pages, 18 figures, 7 Tables, to be published in IEEE Transactions
on Circuits System and Video Technology (TCSVT). High resolution pdf version
and Code can be found at: http://idm.pku.edu.cn/staff/zhangjian/IRJSM
Image Denoising via L
The L0 gradient minimization (LGM) method has been proposed for image smoothing very recently. As an improvement of the total variation (TV) model which employs the L1 norm of the gradient, the LGM model yields much better results for the piecewise constant image. However, just as the TV model, the LGM model also suffers, even more seriously, from the staircasing effect and the inefficiency in preserving the texture in image. In order to overcome these drawbacks, in this paper, we propose to introduce an effective fidelity term into the LGM model. The fidelity term is an exemplar of the moving least square method using steering kernel. Under this framework, these two methods benefit from each other and can produce better results. Experimental results show that the proposed scheme is promising as compared with the state-of-the-art methods
Recent Progress in Image Deblurring
This paper comprehensively reviews the recent development of image
deblurring, including non-blind/blind, spatially invariant/variant deblurring
techniques. Indeed, these techniques share the same objective of inferring a
latent sharp image from one or several corresponding blurry images, while the
blind deblurring techniques are also required to derive an accurate blur
kernel. Considering the critical role of image restoration in modern imaging
systems to provide high-quality images under complex environments such as
motion, undesirable lighting conditions, and imperfect system components, image
deblurring has attracted growing attention in recent years. From the viewpoint
of how to handle the ill-posedness which is a crucial issue in deblurring
tasks, existing methods can be grouped into five categories: Bayesian inference
framework, variational methods, sparse representation-based methods,
homography-based modeling, and region-based methods. In spite of achieving a
certain level of development, image deblurring, especially the blind case, is
limited in its success by complex application conditions which make the blur
kernel hard to obtain and be spatially variant. We provide a holistic
understanding and deep insight into image deblurring in this review. An
analysis of the empirical evidence for representative methods, practical
issues, as well as a discussion of promising future directions are also
presented.Comment: 53 pages, 17 figure
Mathematical approaches to digital color image denoising
Many mathematical models have been designed to remove noise from images. Most of them focus on grey value images with additive artificial noise. Only very few specifically target natural color photos taken by a digital camera with real noise. Noise in natural color photos have special characteristics that are substantially different
from those that have been added artificially.
In this thesis previous denoising models are reviewed. We analyze the strengths and weakness of existing denoising models by showing where they perform well and where they don't. We put special focus on two models: The steering kernel regression model and the non-local model. For Kernel Regression model, an adaptive bilateral
filter is introduced as complementary to enhance it. Also a non-local bilateral filter is proposed as an application of the idea of non-local means filter. Then the idea of cross-channel denoising is proposed in this thesis. It is effective in
denoising monochromatic images by understanding the characteristics of digital noise in natural color images. A non-traditional color space is also introduced specifically for this purpose. The cross-channel paradigm can be applied to most of the exisiting models to greatly improve their performance for denoising natural color images.Ph.D.Committee Chair: Haomin Zhou; Committee Member: Luca Dieci; Committee Member: Ronghua Pan; Committee Member: Sung Ha Kang; Committee Member: Yang Wan
Group-based Sparse Representation for Image Restoration
Traditional patch-based sparse representation modeling of natural images
usually suffer from two problems. First, it has to solve a large-scale
optimization problem with high computational complexity in dictionary learning.
Second, each patch is considered independently in dictionary learning and
sparse coding, which ignores the relationship among patches, resulting in
inaccurate sparse coding coefficients. In this paper, instead of using patch as
the basic unit of sparse representation, we exploit the concept of group as the
basic unit of sparse representation, which is composed of nonlocal patches with
similar structures, and establish a novel sparse representation modeling of
natural images, called group-based sparse representation (GSR). The proposed
GSR is able to sparsely represent natural images in the domain of group, which
enforces the intrinsic local sparsity and nonlocal self-similarity of images
simultaneously in a unified framework. Moreover, an effective self-adaptive
dictionary learning method for each group with low complexity is designed,
rather than dictionary learning from natural images. To make GSR tractable and
robust, a split Bregman based technique is developed to solve the proposed
GSR-driven minimization problem for image restoration efficiently. Extensive
experiments on image inpainting, image deblurring and image compressive sensing
recovery manifest that the proposed GSR modeling outperforms many current
state-of-the-art schemes in both PSNR and visual perception.Comment: 34 pages, 6 tables, 19 figures, to be published in IEEE Transactions
on Image Processing; Project, Code and High resolution PDF version can be
found: http://idm.pku.edu.cn/staff/zhangjian/. arXiv admin note: text overlap
with arXiv:1404.756
A new bandwidth adaptive non-local kernel regression algorithm for image/video restoration and its GPU realization
This paper presents a new bandwidth adaptive nonlocal kernel regression (BA-NLKR) algorithm for image and video restoration. NLKR is a recent approach for improving the performance of conventional steering kernel regression (SKR) and local polynomial regression (LPR) in image/video processing. Its bandwidth, which controls the amount of smoothing, however is chosen empirically. The proposed algorithm incorporates the intersecting confidence intervals (ICI) bandwidth selection method into the framework of NLKR to facilitate automatic bandwidth selection so as to achieve better performance. A parallel implementation of the proposed algorithm is also introduced to reduce significantly its computation time. The effectiveness of the proposed algorithm is illustrated by experimental results on both single image and videos super resolution and denoising.published_or_final_versio
- …