Image super‐resolution reconstruction based on adaptive sparse representation

Summary There are two problems in global over‐complete dictionary: lack of adaptability to image local structure and low computational efficiency. Based on the study of the adaptive sparse representation reconstruction, this paper obtained a series of corresponding sub‐dictionaries by image block su...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Concurrency and computation 2018-12, Vol.30 (24), p.n/a
Hauptverfasser: Xu, Mengxi, Yang, Yun, Sun, Quansen, Wu, Xiaobin
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Summary There are two problems in global over‐complete dictionary: lack of adaptability to image local structure and low computational efficiency. Based on the study of the adaptive sparse representation reconstruction, this paper obtained a series of corresponding sub‐dictionaries by image block subset, then the optimal sub‐dictionary for each reconstruction image block is adaptively selected, which can be more accurately sparse represented modeled to improve the effect and efficiency of the algorithm. In order to promote the ability of sparse representation model, nonlocal self‐similarity prior item is introduced. Meanwhile, the nonlocal self‐similarity model is improved by using the idea of the bilateral filter, and the space distance restraint between pixels is introduced to better keep the image edge information. Moreover, the nonlocal self‐similar distance measure is improved to reduce the amount of calculation. Experimental results show that the proposed algorithm can effectively suppress noise effects and can maintain the image edge details, at the same time, there are certain advantages at both the peak signal to noise ratio (PSNR) and visual effects.
ISSN:1532-0626
1532-0634
DOI:10.1002/cpe.4968