Upload
neeraj-kumar
View
229
Download
0
Tags:
Embed Size (px)
DESCRIPTION
An introduction to Polynomial Neural Network based Single Image Super Resolution
Citation preview
Observation Model
• Blur matrix is a sparse matrix because of the localized degradation process
• Degraded image can be modeled as the convolution of original image with a finite support point spread function
Proposed Algorithm (SR PNN)• Input: Data Available M x N LR image• Output: Desired sM x sN HR image, s being SR factor
1. Generate an image LR’ (low resolution approximation of input LR image) by applying blurring kernel and downsampling according to LR generation process to given LR image.
2. Extract vectorised, n x n (n being odd) patches from LR’ with one pixel over-lap and corresponding vectorised high resolution child pixels from given LR image.
3. Apply ZCA whitening on vectorised LR’ patches and LR pixels.
4. Train a polynomial neural network using GMDH type algorithm, to learn an inverse mapping g(.) from parent LR’ patches (ZCA whitened) to child LR pixels (ZCA whitened).
5. Extract vectorised, n x n (n being odd) patches from given LR image with one pixel over-lap and apply ZCA whitening.
6. Generate desired HR pixels using vectorised patches of step 5 as input to trained polynomial neural network of step 4.
7. After undoing ZCA whitening, re-arrange vectorised HR pixels at their respective locations and return reconstructed HR image.
Wavelet based SR
• Presented in previous progress seminar• Algorithm 1- Detail to Detail coefficient prediction• Algorithm 2- Approximation to Detail coefficient prediction• Algorithm 3- Combine Algorithm 1 and 2
• Submitted in Transactions on Circuits and Systems for Video Technology• Response- Major review