Abstract

The removal of mixed Gaussian-impulse noise plays an important role in many areas, such as remote sensing. However, traditional methods may be unaware of promoting the degree of the sparsity adaptively after decomposing into low rank component and sparse component. In this paper, a new problem formulation with regular spectral k-support norm and regular k-support l1 norm is proposed. A unified framework is developed to capture the intrinsic sparsity structure of all two components. To address the resulting problem, an efficient minimization scheme within the framework of accelerated proximal gradient is proposed. This scheme is achieved by alternating regular k-shrinkage thresholding operator. Experimental comparison with the other state-of-the-art methods demonstrates the efficacy of the proposed method.

Highlights

  • Image restoration [1,2,3,4] attempts to recover a clear image from the observations of real scenes

  • It has been applied to various application areas, such as image fusion [5] and action recognition [6]

  • We focus on the removal of mixed Gaussianimpulse noise

Read more

Summary

Introduction

Image restoration [1,2,3,4] attempts to recover a clear image from the observations of real scenes. It has been applied to various application areas, such as image fusion [5] and action recognition [6]. The noise characteristics of imaging camera is completely or partially unknown. The removal of mixed noise has not been investigated because the noise model is not easy to establish accurately. A patch based method [7] for video restoration has attracted much attention [8,9,10]. This method is extended to video in-painting for archived films. The mechanisms of modeling the sparsity level of the grouping patches remain unclear

Methods
Discussion
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.