1 / 11

Blind motion deblurring from a single image using sparse approximation

Blind motion deblurring from a single image using sparse approximation. Jian-Feng Caiy, Hui Jiz, Chaoqiang Liuy and Zuowei Shenz National University of Singapore, Singapore 117542 Center for Wavelets, Approx. and Info. Proc.y and Department of Mathematicsz. CVPR 2009. 報告者:黃智勇. Outline.

lyre
Download Presentation

Blind motion deblurring from a single image using sparse approximation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Blind motion deblurring from a single image using sparse approximation Jian-Feng Caiy, Hui Jiz, Chaoqiang Liuy and Zuowei Shenz National University of Singapore, Singapore 117542 Center for Wavelets, Approx. and Info. Proc.y and Department of Mathematicsz CVPR 2009 報告者:黃智勇

  2. Outline • Introduction • Tight framelet system and curvelet system • Sparse representation under framelet andcurvelet system • Formulation of our minimization • Numerical algorithm and analysis • Experiments

  3. Introduction We propose to use framelet system (Ron and Shen et al.[24]) to find the sparseapproximation to the image underframelet domain. Weuse the curvelet system (Candes and Donoho [8]) to find thesparse approximation to the blur kernel under curvelet domain.

  4. Tight famelet system

  5. Sparse representation under framelet andcurvelet system

  6. Formulation of our minimization Wedenote the image g (or the kernel p) as a vector g (or p). Let “。” denote theusual 2D convolution after column concatenation, thenwehave Let u = Ag denote the framelet coefficients of the clearimage g, and let v = Cp denote the curvelet coefficientsof the blur kernel p.

  7. Numerical algorithm and analysis there exist only two difficult problems (14) and (15) ofthe same type. For such a large-scale minimization problemwith up to millions of variables, there exists a very efficientalgorithm based on so-called linearized Bregman iterationtechnique.

  8. Numerical algorithm and analysis

  9. Experiments

  10. Experiments

  11. Experiments

More Related