OFCS: Optimized Framework of Compressive Sensing for Medical Images in Bottleneck Network Condition

Compressive sensing is one of teh cost effective solution towards performing compression of heavier form of signals. We reviewed the existing research contribution towards compressive sensing to find that existing system doesnt offer any form of optimization for which reason the signal are superiorly compressed but at the cost of enough resources. Therefore, we introduce a framework that optimizes the performance of the compressive sensing by introducing 4 sequential algorithms for performing Random Sampling, Lossless Compression for region-of-interest, Compressive Sensing using transform-based scheme, and optimization. The contribution of proposed paper is a good balance between computational efficiency and quality of reconstructed medical image when transmitted over network with low channel capacity. The study outcome shows that proposed system offers maximum signal quality and lower algorithm processing time in contrast to existing compression techniuqes on medical images

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

Roadmap on optical security

Postprint (author's final draft

IoT-Based Multi-Dimensional Chaos Mapping System for Secure and Fast Transmission of Visual Data in Smart Cities

A “smart city” sends data from many sensors to a cloud server for local authorities and the public to connect. Smart city residents communicate mostly through images and videos. Many image security algorithms have been proposed to improve locals’ lives, but a high-class redundancy method with a small space requirement is still needed to acquire and protect this sensitive data. This paper proposes an IoT-based multi-dimensional chaos mapping system for secure and fast transmission of visual data in smart cities, which uses the five dimensional Gauss Sine Logistic system to generate hyper-chaotic sequences to encrypt images. The proposed method also uses pixel position permutation and Singular Value Decomposition with Discrete fractional cosine transform to compress and protect the sensitive image data. To increase security, we use a chaotic system to construct the chaotic sequences and a diffusion matrix. Furthermore, numerical simulation results and theoretical evaluations validate the suggested scheme’s security and efficacy after compression encryption.publishedVersio

A fast patch-dictionary method for whole image recovery

Various algorithms have been proposed for dictionary learning. Among those for image processing, many use image patches to form dictionaries. This paper focuses on whole-image recovery from corrupted linear measurements. We address the open issue of representing an image by overlapping patches: the overlapping leads to an excessive number of dictionary coefficients to determine. With very few exceptions, this issue has limited the applications of image-patch methods to the local kind of tasks such as denoising, inpainting, cartoon-texture decomposition, super-resolution, and image deblurring, for which one can process a few patches at a time. Our focus is global imaging tasks such as compressive sensing and medical image recovery, where the whole image is encoded together, making it either impossible or very ineffective to update a few patches at a time. Our strategy is to divide the sparse recovery into multiple subproblems, each of which handles a subset of non-overlapping patches, and then the results of the subproblems are averaged to yield the final recovery. This simple strategy is surprisingly effective in terms of both quality and speed. In addition, we accelerate computation of the learned dictionary by applying a recent block proximal-gradient method, which not only has a lower per-iteration complexity but also takes fewer iterations to converge, compared to the current state-of-the-art. We also establish that our algorithm globally converges to a stationary point. Numerical results on synthetic data demonstrate that our algorithm can recover a more faithful dictionary than two state-of-the-art methods. Combining our whole-image recovery and dictionary-learning methods, we numerically simulate image inpainting, compressive sensing recovery, and deblurring. Our recovery is more faithful than those of a total variation method and a method based on overlapping patches