BM3D Frames and Variational Image Deblurring

Mathematics – Optimization and Control

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Submitted to IEEE Transactions on Image Processing on May 18, 2011. implementation of the proposed algorithm is available as p

Scientific paper

A family of the Block Matching 3-D (BM3D) algorithms for various imaging problems has been recently proposed within the framework of nonlocal patch-wise image modeling [1], [2]. In this paper we construct analysis and synthesis frames, formalizing the BM3D image modeling and use these frames to develop novel iterative deblurring algorithms. We consider two different formulations of the deblurring problem: one given by minimization of the single objective function and another based on the Nash equilibrium balance of two objective functions. The latter results in an algorithm where the denoising and deblurring operations are decoupled. The convergence of the developed algorithms is proved. Simulation experiments show that the decoupled algorithm derived from the Nash equilibrium formulation demonstrates the best numerical and visual results and shows superiority with respect to the state of the art in the field, confirming a valuable potential of BM3D-frames as an advanced image modeling tool.

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

BM3D Frames and Variational Image Deblurring 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 BM3D Frames and Variational Image Deblurring, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and BM3D Frames and Variational Image Deblurring will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-34928

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