Skip to content
2000
Volume 10, Issue 3
  • ISSN: 2213-2759
  • E-ISSN: 1874-4796

Abstract

Background: Recently, sparse representation has been significantly used in various image inverse problems, such as image deblurring, super resolution and compressive sensing, and has shown promising results. The key issue of sparse representation is how to find a reasonable dictionary, by which the image can present more sparsity, as described in various patents. Method: In this paper, we address the image restoration and propose a novel cost function. Considering the significant difference of underlying structure within different patches, we independently train the dictionary using a set of self-similarity patches to present each patch more sparsely. Result: To solve the proposed cost function, an approach based on alternating optimization is presented to obtain the approximate solution. Conclusion: Experimental results demonstrate that the proposed method is superior to many existing excellent algorithms.

Loading

Article metrics loading...

/content/journals/cseng/10.2174/2213275910666170502151050
2017-08-01
2025-12-16
Loading full text...

Full text loading...

/content/journals/cseng/10.2174/2213275910666170502151050
Loading
This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error
Please enter a valid_number test