Single-Image Super-Resolution Using Multihypothesis Prediction

Abstract-Single-image super-resolution driven by multihypothesis prediction is considered. The proposed strategy exploits self-similarities existing between image patches within a single image. Specifically, each patch of a low-resolution image is represented as a linear combination of spatially surrounding hypothesis patches. The coefficients of this representation are calculated using Tikhonov regularization and then used to generate a high-resolution image. Experimental results reveal that the proposed algorithm offers significantly higher-quality super-resolution than bicubic interpolation without the cost of training on an extensive training set of imagery as is typical of competing single-image techniques

Overview of compressed sensing: Sensing model, reconstruction algorithm, and its applications

With the development of intelligent networks such as the Internet of Things, network scales are becoming increasingly larger, and network environments increasingly complex, which brings a great challenge to network communication. The issues of energy-saving, transmission efficiency, and security were gradually highlighted. Compressed sensing (CS) helps to simultaneously solve those three problems in the communication of intelligent networks. In CS, fewer samples are required to reconstruct sparse or compressible signals, which breaks the restrict condition of a traditional Nyquist-Shannon sampling theorem. Here, we give an overview of recent CS studies, along the issues of sensing models, reconstruction algorithms, and their applications. First, we introduce several common sensing methods for CS, like sparse dictionary sensing, block-compressed sensing, and chaotic compressed sensing. We also present several state-of-the-art reconstruction algorithms of CS, including the convex optimization, greedy, and Bayesian algorithms. Lastly, we offer recommendation for broad CS applications, such as data compression, image processing, cryptography, and the reconstruction of complex networks. We discuss works related to CS technology and some CS essentials. © 2020 by the authors

Fully Scalable Video Coding Using Redundant-Wavelet Multihypothesis and Motion-Compensated Temporal Filtering

In this dissertation, a fully scalable video coding system is proposed. This system achieves full temporal, resolution, and fidelity scalability by combining mesh-based motion-compensated temporal filtering, multihypothesis motion compensation, and an embedded 3D wavelet-coefficient coder. The first major contribution of this work is the introduction of the redundant-wavelet multihypothesis paradigm into motion-compensated temporal filtering, which is achieved by deploying temporal filtering in the domain of a spatially redundant wavelet transform. A regular triangle mesh is used to track motion between frames, and an affine transform between mesh triangles implements motion compensation within a lifting-based temporal transform. Experimental results reveal that the incorporation of redundant-wavelet multihypothesis into mesh-based motion-compensated temporal filtering significantly improves the rate-distortion performance of the scalable coder. The second major contribution is the introduction of a sliding-window implementation of motion-compensated temporal filtering such that video sequences of arbitrarily length may be temporally filtered using a finite-length frame buffer without suffering from severe degradation at buffer boundaries. Finally, as a third major contribution, a novel 3D coder is designed for the coding of the 3D volume of coefficients resulting from the redundant-wavelet based temporal filtering. This coder employs an explicit estimate of the probability of coefficient significance to drive a nonadaptive arithmetic coder, resulting in a simple software implementation. Additionally, the coder offers the possibility of a high degree of vectorization particularly well suited to the data-parallel capabilities of modern general-purpose processors or customized hardware. Results show that the proposed coder yields nearly the same rate-distortion performance as a more complicated coefficient coder considered to be state of the art

MICCS: A Novel Framework for Medical Image Compression Using Compressive Sensing

The vision of some particular applications such as robot-guided remote surgery where the image of a patient body will need to be captured by the smart visual sensor and to be sent on a real-time basis through a network of high bandwidth but yet limited. The particular problem considered for the study is to develop a mechanism of a hybrid approach of compression where the Region-of-Interest (ROI) should be compressed with lossless compression techniques and Non-ROI should be compressed with Compressive Sensing (CS) techniques. So the challenge is gaining equal image quality for both ROI and Non-ROI while overcoming optimized dimension reduction by sparsity into Non-ROI. It is essential to retain acceptable visual quality to Non-ROI compressed region to obtain a better reconstructed image. This step could bridge the trade-off between image quality and traffic load. The study outcomes were compared with traditional hybrid compression methods to find that proposed method achieves better compression performance as compared to conventional hybrid compression techniques on the performances parameters e.g. PSNR, MSE, and Compression Ratio