Iterative Network for Image Super-Resolution

Single image super-resolution (SISR), as a traditional ill-conditioned inverse problem, has been greatly revitalized by the recent development of convolutional neural networks (CNN). These CNN-based methods generally map a low-resolution image to its corresponding high-resolution version with sophisticated network structures and loss functions, showing impressive performances. This paper proposes a substantially different approach relying on the iterative optimization on HR space with an iterative super-resolution network (ISRN). We first analyze the observation model of image SR problem, inspiring a feasible solution by mimicking and fusing each iteration in a more general and efficient manner. Considering the drawbacks of batch normalization, we propose a feature normalization (FNorm) method to regulate the features in network. Furthermore, a novel block with F-Norm is developed to improve the network representation, termed as FNB. Residual-in-residual structure is proposed to form a very deep network, which groups FNBs with a long skip connection for better information delivery and stabling the training phase. Extensive experimental results on testing benchmarks with bicubic (BI) degradation show our ISRN can not only recover more structural information, but also achieve competitive or better PSNR/SSIM results with much fewer parameters compared to other works. Besides BI, we simulate the real-world degradation with blur-downscale (BD) and downscalenoise (DN). ISRN and its extension ISRN+ both achieve better performance than others with BD and DN degradation models.Comment: 12 pages, 14 figure

Model-Based Super-Resolution Reconstruction of T2 Maps

Purpose High-resolution isotropic T-2 mapping of the human brain with multi-echo spin-echo (MESE) acquisitions is challenging. When using a 2D sequence, the resolution is limited by the slice thickness. If used as a 3D acquisition, specific absorption rate limits are easily exceeded due to the high power deposition of nonselective refocusing pulses. A method to reconstruct 1-mm(3) isotropic T-2 maps is proposed based on multiple 2D MESE acquisitions. Data were undersampled (10-fold) to compensate for the prolonged scan time stemming from the super-resolution acquisition. Theory and Methods The proposed method integrates a classical super-resolution with an iterative model-based approach to reconstruct quantitative maps from a set of undersampled low-resolution data. The method was tested on numerical and multipurpose phantoms, and in vivo data. T-2 values were assessed with a region-of-interest analysis using a single-slice spin-echo and a fully sampled MESE acquisition in a phantom, and a MESE acquisition in healthy volunteers. Results Numerical simulations showed that the best trade-off between acceleration and number of low-resolution datasets is 10-fold acceleration with 4 acquisitions (acquisition time = 18 min). The proposed approach showed improved resolution over low-resolution images for both phantom and brain. Region-of-interest analysis of the phantom compartments revealed that at shorter T-2, the proposed method was comparable with the fully sampled MESE. For the volunteer data, the T-2 values found in the brain structures were consistent across subjects (8.5-13.1 ms standard deviation). Conclusion The proposed method addresses the inherent limitations associated with high-resolution T-2 mapping and enables the reconstruction of 1 mm(3) isotropic relaxation maps with a 10 times faster acquisition

Robust Super-resolution by Fusion of Interpolated Frames for Color and Grayscale Images

Multi-frame super-resolution (SR) processing seeks to overcome undersampling issues that can lead to undesirable aliasing artifacts in imaging systems. A key factor in effective multi-frame SR is accurate subpixel inter-frame registration. Accurate registration is more difficult when frame-to-frame motion does not contain simple global translation and includes locally moving scene objects. SR processing is further complicated when the camera captures full color by using a Bayer color filter array (CFA). Various aspects of these SR challenges have been previously investigated. Fast SR algorithms tend to have difficulty accommodating complex motion and CFA sensors. Furthermore, methods that can tolerate these complexities tend to be iterative in nature and may not be amenable to real-time processing. In this paper, we present a new fast approach for performing SR in the presence of these challenging imaging conditions. We refer to the new approach as Fusion of Interpolated Frames (FIF) SR. The FIF SR method decouples the demosaicing, interpolation, and restoration steps to simplify the algorithm. Frames are first individually demosaiced and interpolated to the desired resolution. Next, FIF uses a novel weighted sum of the interpolated frames to fuse them into an improved resolution estimate. Finally, restoration is applied to improve any degrading camera effects. The proposed FIF approach has a lower computational complexity than many iterative methods, making it a candidate for real-time implementation. We provide a detailed description of the FIF SR method and show experimental results using synthetic and real datasets in both constrained and complex imaging scenarios. Experiments include airborne grayscale imagery and Bayer CFA image sets with affine background motion plus local motion

Partially Constrained Adaptive Beamforming

The ReIterative Super-Resolution (RISR) was developed based on an iterative implementation of the Minimum Mean Squared Error (MMSE) estimator. Here, a novel approach to direction of arrival estimation, partially constrained beamforming is introduced by building from existing work on the RISR algorithm. First, RISR is rederived with the addition of a unity gain constraint, with the result denoted as Gain Constrained RISR (GC-RISR), though this formulation exhibits some loss in resolution. However, by taking advantage of the similar structure of RISR and GC-RISR, they can be combined using a geometric weighting term $\alpha$ to form a partially constrained version of RISR, which we denote as PC-RISR. Simulations are used to characterize PC-RISR's performance, where it is shown that the geometric weighting term can be used to control the speed of convergence. It is also demonstrated that this weighting term enables increased super-resolution capability compared to RISR, improves robustness to low sample support for super-resolving signals with low SNR, and the ability to detect signals with an SNR as low as -10dB given higher sample support