Abstract
The dictionary based super-resolution (SR) approach has received much attention in recent years because sparse representation is very effective for image restoration tasks. By sparse representation, original image patches are represented as a sparse linear combination of atoms in an over-complete dictionary. However, the dictionary based SR approach has some disadvantages that it produces some ringing artifacts especially along the object boundaries and is not effective in reconstructing images which contain the patterns with strong edge. In this paper, we improve the dictionary based SR using nonlocal total variation regularization. In the training stage, we jointly train two dictionaries, D <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">h</sub> and D <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">l</sub> , from the low-resolution (LR) and high-resolution (HR) training data sets by using KSVD algorithm as in conventional methods. In the synthesis stage, we obtain the sparse coefficient vector from the LR test image over the LR dictionary, and reconstruct SR image patches using the coefficient vectors. Then, we employ nonlocal total variation regularization to remove annoying ringing artifacts and recover the patterns with strong edge in images. Experimental results on various test images demonstrate that the proposed method is very effective in enhancing the dictionary based SR approaches in terms of quantitative performance and visual quality.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.