Online Multi-Frame Super-Resolution of Image Sequences Jieping Xu1* , Yonghui Liang2,Jinliu2, Zongfu Huang2 and Xuewen Liu2

Total Page:16

File Type:pdf, Size:1020Kb

Online Multi-Frame Super-Resolution of Image Sequences Jieping Xu1* , Yonghui Liang2,Jinliu2, Zongfu Huang2 and Xuewen Liu2 Xu et al. EURASIP Journal on Image and Video EURASIP Journal on Image Processing (2018) 2018:136 https://doi.org/10.1186/s13640-018-0376-5 and Video Processing RESEARCH Open Access Online multi-frame super-resolution of image sequences Jieping Xu1* , Yonghui Liang2,JinLiu2, Zongfu Huang2 and Xuewen Liu2 Abstract Multi-frame super-resolution recovers a high-resolution (HR) image from a sequence of low-resolution (LR) images. In this paper, we propose an algorithm that performs multi-frame super-resolution in an online fashion. This algorithm processes only one low-resolution image at a time instead of co-processing all LR images which is adopted by state- of-the-art super-resolution techniques. Our algorithm is very fast and memory efficient, and simple to implement. In addition, we employ a noise-adaptive parameter in the classical steepest gradient optimization method to avoid noise amplification and overfitting LR images. Experiments with simulated and real-image sequences yield promising results. Keywords: Super-resolution, Image processing, Image sequences, Online image processing 1 Introduction There are a variety of SR techniques, including multi- Images with higher resolution are required in most elec- frame SR and single-frame SR. Readers can refer to Refs. tronic imaging applications such as remote sensing, med- [1, 5, 6] for an overview of this issue. Our discussion below ical diagnostics, and video surveillance. For the past is limited to work related to fast multi-frame SR method, decades, considerable advancement has been realized in as it is the focus of our paper. imaging system. However, the quality of images is still lim- One SR category close to our alogorithm is dynamic SR ited by the cost and manufacturing technology [1]. Super- which means estimating a sequence of HR images from a resolution (SR) is a promising digital image processing sequence of LR images. A natural approach is to make an technique to obtain a single high-resolution image (or extension of the static SR methods, as is adopted by some sequence) from multiple blurred low-resolution images. video SR algorithms [7, 8]. Although these batch-based The basic idea of SR is that the low-resolution (LR) dynamic SR algorithms have the ability to enhance the images of the same scene contain different information resolution of images/videos, the high memory and com- because of relative subpixel shifts; thus, a high-resolution putational requirements restrict their practical use. Farsiu (HR) image with higher spatial information can be recon- et al. [9] proposed a fast and memory-efficient algorithm structed by image fusion. Subpixel motion can occur due for dynamic demosaicing and color SR of video sequences. to movement of local objects or vibrating of imaging sys- They first got a blurry HR image by shifting and adding tem, or even controlled micro-scanning [2, 3]. Numerous each LR frame recursively based on the Kalman filter, SR algorithms have been proposed since the concept was then the blurry HR image was deconvolved based on max- introduced by Tsai and Huang [4] in the year of 1984. imum a posteriori (MAP) technique. To make Farsiu’s Most of them operate in batch mode, i.e., a sequence of algorithm more robust, Kim et al. [10]proposedamea- images are co-processed at the same time. Thus, these surement validation method based on Mahalanobis dis- algorithms require a high memory resource to store the tance to eliminate the LR images whose motion estimation LR images and temporary data, and need a high com- errors were larger than a threshold. Recently, researchers puting resource as well. These disadvantages limit their pay more attention to SR methods based on neural net- practical application. work (NC)[11, 12], which can be trained from data to approximate complex nonlinear functions, while these *Correspondence: [email protected] algorithms require significant computational resources to 1Space Engineering University, No. 1, Bayi Road, Beijing, 101416 China achieve real-time throughput. Graphic processing unit Full list of author information is available at the end of the article (GPU)isusedtoaccelerate,asdonebyHuetal.[13–16]. © The Author(s). 2018 Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. Xu et al. EURASIP Journal on Image and Video Processing (2018) 2018:136 Page 2 of 10 2 2 Stefan Harmeling et al. [17] are the first to propose a size L MN × L MN, Bt represents blur matrix of size 2 2 blind deconvolution algorithm for astronomical imaging L MN × L MN, Dt denotes the down-sampling matrix of 2 working in online mode. Instead of minimizing the total size MN ×L MN, nt is the lexicographically ordered noise overall cost function for all blurry images, they just mini- vector, and yt represents the lexicographically ordered LR mized the cost function for one image at each time and the imagevectorofsizeMN × 1. current deblurred image was used as the initial estimate Mathematically, the SR problem is an inverse problem for the next time recursively. Thus, the deblurred image whose objective is to estimate an HR image from multiple was refined gradually along with the image capturing. observed blurry LR images. MAP estimator is a powerful Hirsch et al. [18] extended the online blind deconvolution tool to solve this type of problem. The MAP optimization algorithm by incorporating super-resolution. The differ- problem can be represented by ent information contained in different LR images results ˆ = ( | ) + ( ) from blurring with different blur kernels. Both online xMAP arg max ln P yt x ln P x (2) blind deconvolution (OBD) and its SR extension (OBDSR) where yt means all LR images, and P(x) represents a pri- get the HR image estimate by minimizing an auxiliary ori knowledge of the HR image. However, some complex function rather than minimizing the cost function directly priori models used by the MAP estimator may increase to avoid image overfitting, while sometimes the strategy the computational burden remarkably. If we omit the failed, especially when the noise of LR images is large. priori term, the MAP estimator degenerates to a maxi- Stimulated by the online blind deconvolution algorithm mum likelihood (ML) estimator. Under the assumption proposed by Stefan Harmeling et al. [17], we propose of independent and identical Gaussian distributed image a multi-frame super-resolution algorithm operating in noise with zero mean, ML optimization problem can be online mode which we name as online SR (OSR). Differ- simplified as a least square problem, i.e., ent from the OBDSR, the different information provided by different LR images in our algorithm results from rel- T ˆ = − 2 ative motion between each other instead of different blur xML arg min yt DtBtMtx (3) kernels. Another difference is that we employ a modified t=1 steepest gradient optimization method to estimate the HR Generally, due to the ill-posed nature of SR inverse prob- image instead of an auxiliary function, which is proved to lem, the MAP estimator is superior to the ML estima- be more robust to noise. In this paper, the LR images are tor. For both MAP estimator and ML estimator, all LR assumed to be obtained in a streaming fashion with a com- images should be stored in memory; thus, a high memory mon space-invariant blur, and the relative motion between resource is required. each other can be modeled as translation. At each time, we get an LR image, and we immediately use it to improve 3 The proposed method the current HR image estimate. 3.1 The loss function The rest of this paper is organized as follows. Section 2 In our OSR algorithm, when we get a new LR image in addresses the formulation of the SR problem. In Section 3, the data stream, we retrieve the new information immedi- we lay out the details of our algorithm and make it com- ately and add it to the HR image estimate. The process is patible with color images. In Section 4, we present exper- realized by minimizing the loss function incurred at time imental results with simulated and real-image sequences. t instead of overall loss. The problem can be expressed as The paper will conclude in Section 5 with a brief summary a non-negatively constrained problem: and future work plan. xˆ = min J (x; y ) = min y − D B M x2 (4) t ≥ t t ≥ t t t t 2 Problem statement x 0 x 0 To study the super-resolution problem, we first formu- The motion matrix Mt could vary in time, while the down- late the observation model. For notational simplicity, the sampling matrix Dt and blur matrix Bt remain constant image in our method is represented as a lexicographically over time for most situations (i.e., B = Bt, D = Dt). We ordered vector. Let us consider the desired HR image of further assume the relative motion between LR images size LM × LN,whereL denotes the down-sampling factor can be modeled as pure translation. Above assumptions in the observation model and M and N are the number of are valid in staring imaging and some videos during a cer- rows and columns of the LR images. The most commonly tain period of time. The matrices D, B,andM are quite used observation model is given by huge with few non-zero elements, thus can be constructed as sparse matrices.
Recommended publications
  • Multiframe Motion Coupling for Video Super Resolution
    Multiframe Motion Coupling for Video Super Resolution Jonas Geiping,* Hendrik Dirks,† Daniel Cremers,‡ Michael Moeller§ December 5, 2017 Abstract The idea of video super resolution is to use different view points of a single scene to enhance the overall resolution and quality. Classical en- ergy minimization approaches first establish a correspondence of the current frame to all its neighbors in some radius and then use this temporal infor- mation for enhancement. In this paper, we propose the first variational su- per resolution approach that computes several super resolved frames in one batch optimization procedure by incorporating motion information between the high-resolution image frames themselves. As a consequence, the number of motion estimation problems grows linearly in the number of frames, op- posed to a quadratic growth of classical methods and temporal consistency is enforced naturally. We use infimal convolution regularization as well as an automatic pa- rameter balancing scheme to automatically determine the reliability of the motion information and reweight the regularization locally. We demonstrate that our approach yields state-of-the-art results and even is competitive with machine learning approaches. arXiv:1611.07767v2 [cs.CV] 4 Dec 2017 1 Introduction The technique of video super resolution combines the spatial information from several low resolution frames of the same scene to produce a high resolution video. *University of Siegen, [email protected] †University of Munster,¨ [email protected] ‡Technical University of Munich, [email protected] §University of Siegen, [email protected] 1 A classical way of solving the super resolution problem is to estimate the motion from the current frame to its neighboring frames, model the data formation process via warping, blur, and downsampling, and use a suitable regularization to suppress possible artifacts arising from the ill-posedness of the underlying problem.
    [Show full text]
  • Video Super-Resolution Based on Spatial-Temporal Recurrent Residual Networks
    1 Computer Vision and Image Understanding journal homepage: www.elsevier.com Video Super-Resolution Based on Spatial-Temporal Recurrent Residual Networks Wenhan Yanga, Jiashi Fengb, Guosen Xiec, Jiaying Liua,∗∗, Zongming Guoa, Shuicheng Yand aInstitute of Computer Science and Technology, Peking University, Beijing, P.R.China, 100871 bDepartment of Electrical and Computer Engineering, National University of Singapore, Singapore, 117583 cNLPR, Institute of Automation, Chinese Academy of Sciences, Beijing, P.R.China, 100190 dArtificial Intelligence Institute, Qihoo 360 Technology Company, Ltd., Beijing, P.R.China, 100015 ABSTRACT In this paper, we propose a new video Super-Resolution (SR) method by jointly modeling intra-frame redundancy and inter-frame motion context in a unified deep network. Different from conventional methods, the proposed Spatial-Temporal Recurrent Residual Network (STR-ResNet) investigates both spatial and temporal residues, which are represented by the difference between a high resolution (HR) frame and its corresponding low resolution (LR) frame and the difference between adjacent HR frames, respectively. This spatial-temporal residual learning model is then utilized to connect the intra-frame and inter-frame redundancies within video sequences in a recurrent convolutional network and to predict HR temporal residues in the penultimate layer as guidance to benefit esti- mating the spatial residue for video SR. Extensive experiments have demonstrated that the proposed STR-ResNet is able to efficiently reconstruct videos with diversified contents and complex motions, which outperforms the existing video SR approaches and offers new state-of-the-art performances on benchmark datasets. Keywords: Spatial residue, temporal residue, video super-resolution, inter-frame motion con- text, intra-frame redundancy.
    [Show full text]
  • Versatile Video Coding and Super-Resolution For
    VERSATILE VIDEO CODING AND SUPER-RESOLUTION FOR EFFICIENT DELIVERY OF 8K VIDEO WITH 4K BACKWARD-COMPATIBILITY Charles Bonnineau, Wassim Hamidouche, Jean-Francois Travers, Olivier Deforges To cite this version: Charles Bonnineau, Wassim Hamidouche, Jean-Francois Travers, Olivier Deforges. VERSATILE VIDEO CODING AND SUPER-RESOLUTION FOR EFFICIENT DELIVERY OF 8K VIDEO WITH 4K BACKWARD-COMPATIBILITY. International Conference on Acoustics, Speech, and Sig- nal Processing (ICASSP), May 2020, Barcelone, Spain. hal-02480680 HAL Id: hal-02480680 https://hal.archives-ouvertes.fr/hal-02480680 Submitted on 16 Feb 2020 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. VERSATILE VIDEO CODING AND SUPER-RESOLUTION FOR EFFICIENT DELIVERY OF 8K VIDEO WITH 4K BACKWARD-COMPATIBILITY Charles Bonnineau?yz, Wassim Hamidouche?z, Jean-Franc¸ois Traversy and Olivier Deforges´ z ? IRT b<>com, Cesson-Sevigne, France, yTDF, Cesson-Sevigne, France, zUniv Rennes, INSA Rennes, CNRS, IETR - UMR 6164, Rennes, France ABSTRACT vary depending on the exploited transmission network, reducing the In this paper, we propose, through an objective study, to com- number of use-cases that can be covered using this approach. For pare and evaluate the performance of different coding approaches instance, in the context of terrestrial transmission, the bandwidth is allowing the delivery of an 8K video signal with 4K backward- limited in the range 30-40Mb/s using practical DVB-T2 [7] channels compatibility on broadcast networks.
    [Show full text]
  • On Bayesian Adaptive Video Super Resolution
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 1 On Bayesian Adaptive Video Super Resolution Ce Liu Member, IEEE, Deqing Sun Member, IEEE Abstract—Although multi-frame super resolution has been extensively studied in past decades, super resolving real-world video sequences still remains challenging. In existing systems, either the motion models are oversimplified, or important factors such as blur kernel and noise level are assumed to be known. Such models cannot capture the intrinsic characteristics that may differ from one sequence to another. In this paper, we propose a Bayesian approach to adaptive video super resolution via simultaneously estimating underlying motion, blur kernel and noise level while reconstructing the original high-res frames. As a result, our system not only produces very promising super resolution results outperforming the state of the art, but also adapts to a variety of noise levels and blur kernels. To further analyze the effect of noise and blur kernel, we perform a two-step analysis using the Cramer-Rao bounds. We study how blur kernel and noise influence motion estimation with aliasing signals, how noise affects super resolution with perfect motion, and finally how blur kernel and noise influence super resolution with unknown motion. Our analysis results confirm empirical observations, in particular that an intermediate size blur kernel achieves the optimal image reconstruction results. Index Terms—Super resolution, optical flow, blur kernel, noise level, aliasing F 1 INTRODUCTION image reconstruction, optical flow, noise level and blur ker- nel estimation. Using a sparsity prior for the high-res image, Multi-frame super resolution, namely estimating the high- flow fields and blur kernel, we show that super resolution res frames from a low-res sequence, is one of the fundamen- computation is reduced to each component problem when tal problems in computer vision and has been extensively other factors are known, and the MAP inference iterates studied for decades.
    [Show full text]
  • Video Super-Resolution Via Deep Draft-Ensemble Learning
    Video Super-Resolution via Deep Draft-Ensemble Learning Renjie Liao† Xin Tao† Ruiyu Li† Ziyang Ma§ Jiaya Jia† † The Chinese University of Hong Kong § University of Chinese Academy of Sciences http://www.cse.cuhk.edu.hk/leojia/projects/DeepSR/ Abstract Difficulties It has been observed for long time that mo- tion estimation critically affects MFSR. Erroneous motion We propose a new direction for fast video super- inevitably distorts local structure and misleads final recon- resolution (VideoSR) via a SR draft ensemble, which is de- struction. Albeit essential, in natural video sequences, suf- fined as the set of high-resolution patch candidates before ficiently high quality motion estimation is not easy to ob- final image deconvolution. Our method contains two main tain even with state-of-the-art optical flow methods. On components – i.e., SR draft ensemble generation and its op- the other hand, the reconstruction and point spread func- timal reconstruction. The first component is to renovate tion (PSF) kernel estimation steps could introduce visual traditional feedforward reconstruction pipeline and greatly artifacts given any errors produced in this process or the enhance its ability to compute different super-resolution re- low-resolution information is not enough locally. sults considering large motion variation and possible er- These difficulties make methods finely modeling all con- rors arising in this process. Then we combine SR drafts straints in e.g., [12], generatively involve the process with through the nonlinear process in a deep convolutional neu- sparse regularization for iteratively updating variables – ral network (CNN). We analyze why this framework is pro- each step needs to solve a set of nonlinear functions.
    [Show full text]
  • A Bayesian Approach to Adaptive Video Super Resolution
    A Bayesian Approach to Adaptive Video Super Resolution Ce Liu Deqing Sun Microsoft Research New England Brown University (a) Input low-res (b) Bicubic up-sampling ×4 (c) Output from our system (d) Original frame Figure 1. Our video super resolution system is able to recover image details after×4 up-sampling. trary, the video may be contaminated with noise of unknown Abstract level, and motion blur and point spread functions can lead Although multi-frame super resolution has been exten- to an unknown blur kernel. sively studied in past decades, super resolving real-world Therefore, a practical super resolution system should si- video sequences still remains challenging. In existing sys- multaneously estimate optical flow [9], noise level [18] and tems, either the motion models are oversimplified, or impor- blur kernel [12] in addition to reconstructing the high-res tant factors such as blur kernel and noise level are assumed frames. As each of these problems has been well studied in to be known. Such models cannot deal with the scene and computer vision, it is natural to combine all these compo- imaging conditions that vary from one sequence to another. nents in a single framework without making oversimplified In this paper, we propose a Bayesian approach to adaptive assumptions. video super resolution via simultaneously estimating under- In this paper, we propose a Bayesian framework for lying motion, blur kernel and noise level while reconstruct- adaptive video super resolution that incorporates high-res ing the original high-res frames. As a result, our system not image reconstruction, optical flow, noise level and blur ker- only produces very promising super resolution results that nel estimation.
    [Show full text]
  • Video Super-Resolution Based on Generative Adversarial Network and Edge Enhancement
    electronics Article Video Super-Resolution Based on Generative Adversarial Network and Edge Enhancement Jialu Wang , Guowei Teng * and Ping An Department of Signal and Information Processing, School of Communication and Information Engineering, Shanghai University, Shanghai 200444, China; [email protected] (J.W.); [email protected] (P.A.) * Correspondence: [email protected]; Tel.: +86-021-6613-5051 Abstract: With the help of deep neural networks, video super-resolution (VSR) has made a huge breakthrough. However, these deep learning-based methods are rarely used in specific situations. In addition, training sets may not be suitable because many methods only assume that under ideal circumstances, low-resolution (LR) datasets are downgraded from high-resolution (HR) datasets in a fixed manner. In this paper, we proposed a model based on Generative Adversarial Network (GAN) and edge enhancement to perform super-resolution (SR) reconstruction for LR and blur videos, such as closed-circuit television (CCTV). The adversarial loss allows discriminators to be trained to distinguish between SR frames and ground truth (GT) frames, which is helpful to produce realistic and highly detailed results. The edge enhancement function uses the Laplacian edge module to perform edge enhancement on the intermediate result, which helps further improve the final results. In addition, we add the perceptual loss to the loss function to obtain a higher visual experience. At the same time, we also tried training network on different datasets. A large number of experiments show that our method has advantages in the Vid4 dataset and other LR videos. Citation: Wang, J.; Teng, G.; An, P. Keywords: video super-resolution; generative adversarial networks; edge enhancement Video Super-Resolution Based on Generative Adversarial Network and Edge Enhancement.
    [Show full text]
  • Learning to Have an Ear for Face Super-Resolution
    Learning to Have an Ear for Face Super-Resolution Givi Meishvili Simon Jenni Paolo Favaro University of Bern, Switzerland {givi.meishvili, simon.jenni, paolo.favaro}@inf.unibe.ch Abstract We propose a novel method to use both audio and a low- resolution image to perform extreme face super-resolution (a 16× increase of the input size). When the resolution of the input image is very low (e.g., 8 × 8 pixels), the loss of information is so dire that important details of the origi- nal identity have been lost and audio can aid the recovery (a) (b) (c) (d) (e) (f) of a plausible high-resolution image. In fact, audio car- Figure 1: Audio helps image super-resolution. (a) and ries information about facial attributes, such as gender and (b) are the ground-truth and 16× downsampled images re- age. To combine the aural and visual modalities, we pro- spectively; (c) results of the SotA super-resolution method pose a method to first build the latent representations of a of Huang et al. [22]; (d) our super-resolution from only the face from the lone audio track and then from the lone low- low-res image; (e) audio only super-resolution; (f) fusion of resolution image. We then train a network to fuse these two both the low-res image and audio. In these cases all meth- representations. We show experimentally that audio can ods fail to restore the correct gender without audio. assist in recovering attributes such as the gender, the age and the identity, and thus improve the correctness of the age might be incorrect (see Fig.
    [Show full text]
  • Video Super Resolution Based on Deep Learning: a Comprehensive Survey
    1 Video Super Resolution Based on Deep Learning: A Comprehensive Survey Hongying Liu, Member, IEEE, Zhubo Ruan, Peng Zhao, Chao Dong, Member, IEEE, Fanhua Shang, Senior Member, IEEE, Yuanyuan Liu, Member, IEEE, Linlin Yang Abstract—In recent years, deep learning has made great multiple successive images/frames at a time so as to uti- progress in many fields such as image recognition, natural lize relationship within frames to super-resolve the target language processing, speech recognition and video super- frame. In a broad sense, video super-resolution (VSR) resolution. In this survey, we comprehensively investigate 33 state-of-the-art video super-resolution (VSR) methods based can be regarded as a class of image super-resolution on deep learning. It is well known that the leverage of and is able to be processed by image super-resolution information within video frames is important for video algorithms frame by frame. However, the SR perfor- super-resolution. Thus we propose a taxonomy and classify mance is always not satisfactory as artifacts and jams the methods into six sub-categories according to the ways of may be brought in, which causes unguaranteed temporal utilizing inter-frame information. Moreover, the architectures and implementation details of all the methods are depicted in coherence within frames. detail. Finally, we summarize and compare the performance In recent years, many video super-resolution algo- of the representative VSR method on some benchmark rithms have been proposed. They mainly fall into two datasets. We also discuss some challenges, which need to categories: the traditional methods and deep learning be further addressed by researchers in the community of based methods.
    [Show full text]
  • Image Super-Resolution: the Techniques, Applications, and Future
    Signal Processing 128 (2016) 389–408 Contents lists available at ScienceDirect Signal Processing journal homepage: www.elsevier.com/locate/sigpro Review Image super-resolution: The techniques, applications, and future Linwei Yue a, Huanfeng Shen b,c,n, Jie Li a, Qiangqiang Yuan c,d, Hongyan Zhang a,c, Liangpei Zhang a,c,n a The State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan, PR China b School of Resource and Environmental Science, Wuhan University, Wuhan, PR China c Collaborative Innovation Center of Geospatial Technology, Wuhan University, Wuhan, PR China d School of Geodesy and Geomatics, Wuhan University, Wuhan, PR China article info abstract Article history: Super-resolution (SR) technique reconstructs a higher-resolution image or sequence from the observed Received 8 October 2015 LR images. As SR has been developed for more than three decades, both multi-frame and single-frame SR Received in revised form have significant applications in our daily life. This paper aims to provide a review of SR from the per- 1 March 2016 spective of techniques and applications, and especially the main contributions in recent years. Reg- Accepted 1 May 2016 ularized SR methods are most commonly employed in the last decade. Technical details are discussed in Available online 14 May 2016 this article, including reconstruction models, parameter selection methods, optimization algorithms and Keywords: acceleration strategies. Moreover, an exhaustive summary of the current applications using SR techni- Super resolution ques has been presented. Lastly, the article discusses the current obstacles for future research. Resolution enhancement & 2016 Elsevier B.V.
    [Show full text]
  • Arxiv:2103.10081V1 [Cs.CV] 18 Mar 2021 Trained VSR Networks to Generate Training Targets for the Imaging, and Electronics (E.G., Smartphones, TV)
    Self-Supervised Adaptation for Video Super-Resolution Jinsu Yoo and Tae Hyun Kim Hanyang University, Seoul, Korea fjinsuyoo,[email protected] Abstract have studied “zero-shot” SR approaches, which exploit sim- ilar patches across different scales within the input image Recent single-image super-resolution (SISR) networks, and video [9, 13, 33, 32]. However, searching for LR-HR which can adapt their network parameters to specific input pairs of patches within LR images is also difficult. More- images, have shown promising results by exploiting the in- over, the number of self-similar patches critically decreases formation available within the input data as well as large as the scale factor increases [41], and the searching problem external datasets. However, the extension of these self- becomes more challenging. To improve the performance supervised SISR approaches to video handling has yet to by easing the searching phase, a coarse-to-fine approach is be studied. Thus, we present a new learning algorithm widely used [13, 33]. Recently, several neural approaches that allows conventional video super-resolution (VSR) net- that utilize external and internal datasets have been intro- works to adapt their parameters to test video frames with- duced and have produced satisfactory results [28, 34, 21]. out using the ground-truth datasets. By utilizing many self- However, these methods remain bounded to the smaller similar patches across space and time, we improve the per- scaling factor possibly because of a conventional approach formance of fully pre-trained VSR networks and produce to self-supervised data pair generation during the test phase. temporally consistent video frames.
    [Show full text]
  • A New Adaptive Video Super-Resolution Algorithm with Improved Robustness to Innovations
    1 A New Adaptive Video Super-Resolution Algorithm With Improved Robustness to Innovations Ricardo Augusto Borsoi, Guilherme Holsbach Costa, Member, IEEE, José Carlos Moreira Bermudez, Senior Member, IEEE Abstract—In this paper, a new video super-resolution recon- from multiple observations, and video SRR algorithms, which struction (SRR) method with improved robustness to outliers is reconstruct an entire HR image sequence. Video SRR algo- proposed. Although the R-LMS is one of the SRR algorithms with rithms often include a temporal regularization that constrains the best reconstruction quality for its computational cost, and is naturally robust to registration inaccuracies, its performance is the norm of the changes in the solution between adjacent known to degrade severely in the presence of innovation outliers. time instants [4]–[9]. This introduces information about the By studying the proximal point cost function representation correlation between adjacent frames, and tends to ensure of the R-LMS iterative equation, a better understanding of video consistency over time, improving the quality of the its performance under different situations is attained. Using reconstructed sequences [10]. statistical properties of typical innovation outliers, a new cost function is then proposed and two new algorithms are derived, A typical characteristic of SRR algorithms is the high which present improved robustness to outliers while maintaining computational cost. Recent developments in both image and computational costs comparable to that of R-LMS. Monte Carlo video SRR have been mostly directed towards achieving simulation results illustrate that the proposed method outper- increased reconstruction quality, either using more appropriate forms the traditional and regularized versions of LMS, and is a priori information about the underlying image and the competitive with state-of-the-art SRR methods at a much smaller computational cost.
    [Show full text]