Removing Gaussian Noise by Optimization of Weights in Non-Local Means

Statistics – Other Statistics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

35 pages, 6 figures and 5 tables

Scientific paper

A new image denoising algorithm to deal with the additive Gaussian white noise model is given. Like the non-local means method, the filter is based on the weighted average of the observations in a neighborhood, with weights depending on the similarity of local patches. But in contrast to the non-local means filter, instead of using a fixed Gaussian kernel, we propose to choose the weights by minimizing a tight upper bound of mean square error. This approach makes it possible to define the weights adapted to the function at hand, mimicking the weights of the oracle filter. Under some regularity conditions on the target image, we show that the obtained estimator converges at the usual optimal rate. The proposed algorithm is parameter free in the sense that it automatically calculates the bandwidth of the smoothing kernel; it is fast and its implementation is straightforward. The performance of the new filter is illustrated by numerical simulations.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Removing Gaussian Noise by Optimization of Weights in Non-Local Means does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Removing Gaussian Noise by Optimization of Weights in Non-Local Means, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Removing Gaussian Noise by Optimization of Weights in Non-Local Means will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-689924

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.