Color Image Compression and Encryption Algorithm Based on 2D Compressed Sensing and Hyperchaotic System

With the advent of the information security era,it is necessary to guarantee the privacy,accuracy,and dependable transfer of pictures.This study presents a new approach to the encryption and compression of color images.It is predicated on 2D compressed sensing(CS)and the hyperchaotic system.First,an optimized Arnold scrambling algorithm is applied to the initial color images to ensure strong security.Then,the processed images are con-currently encrypted and compressed using 2D CS.Among them,chaotic sequences replace traditional random measurement matrices to increase the system’s security.Third,the processed images are re-encrypted using a combination of permutation and diffusion algorithms.In addition,the 2D projected gradient with an embedding decryption(2DPG-ED)algorithm is used to reconstruct images.Compared with the traditional reconstruction algorithm,the 2DPG-ED algorithm can improve security and reduce computational complexity.Furthermore,it has better robustness.The experimental outcome and the performance analysis indicate that this algorithm can withstand malicious attacks and prove the method is effective.

Target acquisition performance in the presence of JPEG image compression

This paper presents an investigation on the effect of JPEG compression on the similarity between the target image and the background,where the similarity is further used to determine the degree of clutter in the image.Four new clutter metrics based on image quality assessment are introduced,among which the Haar wavelet-based perceptual similarity index,known as HaarPSI,provides the best target acquisition prediction results.It is shown that the similarity between the target and the background at the boundary between visually lossless and visually lossy compression does not change significantly compared to the case when an uncompressed image is used.In future work,through subjective tests,it is necessary to check whether this presence of compression at the threshold of just noticeable differences will affect the human target acquisition performance.Similarity values are compared with the results of subjective tests of the well-known target Search_2 database,where the degree of agreement between objective and subjective scores,measured through linear correlation,reached a value of 90%.

Restoration of the JPEG Maximum Lossy Compressed Face Images with Hourglass Block-GAN

In the context of high compression rates applied to Joint Photographic Experts Group(JPEG)images through lossy compression techniques,image-blocking artifacts may manifest.This necessitates the restoration of the image to its original quality.The challenge lies in regenerating significantly compressed images into a state in which these become identifiable.Therefore,this study focuses on the restoration of JPEG images subjected to substantial degradation caused by maximum lossy compression using Generative Adversarial Networks(GAN).The generator in this network is based on theU-Net architecture.It features a newhourglass structure that preserves the characteristics of the deep layers.In addition,the network incorporates two loss functions to generate natural and high-quality images:Low Frequency(LF)loss and High Frequency(HF)loss.HF loss uses a pretrained VGG-16 network and is configured using a specific layer that best represents features.This can enhance the performance in the high-frequency region.In contrast,LF loss is used to handle the low-frequency region.The two loss functions facilitate the generation of images by the generator,which can mislead the discriminator while accurately generating high-and low-frequency regions.Consequently,by removing the blocking effects frommaximum lossy compressed images,images inwhich identities could be recognized are generated.This study represents a significant improvement over previous research in terms of the image resolution performance.

Chaotic CS Encryption:An Efficient Image Encryption Algorithm Based on Chebyshev Chaotic System and Compressive Sensing

Images are the most important carrier of human information. Moreover, how to safely transmit digital imagesthrough public channels has become an urgent problem. In this paper, we propose a novel image encryptionalgorithm, called chaotic compressive sensing (CS) encryption (CCSE), which can not only improve the efficiencyof image transmission but also introduce the high security of the chaotic system. Specifically, the proposed CCSEcan fully leverage the advantages of the Chebyshev chaotic system and CS, enabling it to withstand various attacks,such as differential attacks, and exhibit robustness. First, we use a sparse trans-form to sparse the plaintext imageand then use theArnold transformto perturb the image pixels. After that,we elaborate aChebyshev Toeplitz chaoticsensing matrix for CCSE. By using this Toeplitz matrix, the perturbed image is compressed and sampled to reducethe transmission bandwidth and the amount of data. Finally, a bilateral diffusion operator and a chaotic encryptionoperator are used to perturb and expand the image pixels to change the pixel position and value of the compressedimage, and ultimately obtain an encrypted image. Experimental results show that our method can be resistant tovarious attacks, such as the statistical attack and noise attack, and can outperform its current competitors.

Enhancing visual security: An image encryption scheme based on parallel compressive sensing and edge detection embedding

A novel image encryption scheme based on parallel compressive sensing and edge detection embedding technology is proposed to improve visual security. Firstly, the plain image is sparsely represented using the discrete wavelet transform.Then, the coefficient matrix is scrambled and compressed to obtain a size-reduced image using the Fisher–Yates shuffle and parallel compressive sensing. Subsequently, to increase the security of the proposed algorithm, the compressed image is re-encrypted through permutation and diffusion to obtain a noise-like secret image. Finally, an adaptive embedding method based on edge detection for different carrier images is proposed to generate a visually meaningful cipher image. To improve the plaintext sensitivity of the algorithm, the counter mode is combined with the hash function to generate keys for chaotic systems. Additionally, an effective permutation method is designed to scramble the pixels of the compressed image in the re-encryption stage. The simulation results and analyses demonstrate that the proposed algorithm performs well in terms of visual security and decryption quality.

Secure Transmission of Compressed Medical Image Sequences on Communication Networks Using Motion Vector Watermarking

Medical imaging plays a key role within modern hospital management systems for diagnostic purposes.Compression methodologies are extensively employed to mitigate storage demands and enhance transmission speed,all while upholding image quality.Moreover,an increasing number of hospitals are embracing cloud computing for patient data storage,necessitating meticulous scrutiny of server security and privacy protocols.Nevertheless,considering the widespread availability of multimedia tools,the preservation of digital data integrity surpasses the significance of compression alone.In response to this concern,we propose a secure storage and transmission solution for compressed medical image sequences,such as ultrasound images,utilizing a motion vector watermarking scheme.The watermark is generated employing an error-correcting code known as Bose-Chaudhuri-Hocquenghem(BCH)and is subsequently embedded into the compressed sequence via block-based motion vectors.In the process of watermark embedding,motion vectors are selected based on their magnitude and phase angle.When embedding watermarks,no specific spatial area,such as a region of interest(ROI),is used in the images.The embedding of watermark bits is dependent on motion vectors.Although reversible watermarking allows the restoration of the original image sequences,we use the irreversible watermarking method.The reason for this is that the use of reversible watermarks may impede the claims of ownership and legal rights.The restoration of original data or images may call into question ownership or other legal claims.The peak signal-to-noise ratio(PSNR)and structural similarity index(SSIM)serve as metrics for evaluating the watermarked image quality.Across all images,the PSNR value exceeds 46 dB,and the SSIM value exceeds 0.92.Experimental results substantiate the efficacy of the proposed technique in preserving data integrity.

A New Multi Chaos-Based Compression Sensing Image Encryption

The advancements in technology have substantially grown the size of image data.Traditional image encryption algorithms have limited capabilities to deal with the emerging challenges in big data,including compression and noise toleration.An image encryption method that is based on chaotic maps and orthogonal matrix is proposed in this study.The proposed scheme is built on the intriguing characteristics of an orthogonal matrix.Gram Schmidt disperses the values of pixels in a plaintext image by generating a random orthogonal matrix using logistic chaotic map.Following the diffusion process,a block-wise random permutation of the data is performed using multi-chaos.The proposed scheme provides sufficient security and resilience to JPEG compression and channel noise through a series of experiments and security evaluations.It enables Partial Encryption(PE)for faster processing as well as complete encryption for increased security.The higher values of the number of pixels change rates and unified average change intensity confirm the security of the encryption scheme.In contrast to other schemes,the proposed approach can perform full and partial encryption depending on security requirements.

Three-Stages Hyperspectral Image Compression Sensing with Band Selection

Compressed sensing(CS),as an efficient data transmission method,has achieved great success in the field of data transmission such as image,video and text.It can robustly recover signals from fewer Measurements,effectively alleviating the bandwidth pressure during data transmission.However,CS has many shortcomings in the transmission of hyperspectral image(HSI)data.This work aims to consider the application of CS in the transmission of hyperspectral image(HSI)data,and provides a feasible research scheme for CS of HSI data.HSI has rich spectral information and spatial information in bands,which can reflect the physical properties of the target.Most of the hyperspectral image compressed sensing(HSICS)algorithms cannot effectively use the inter-band information of HSI,resulting in poor reconstruction effects.In this paper,A three-stage hyperspectral image compression sensing algorithm(Three-stages HSICS)is proposed to obtain intra-band and inter-band characteristics of HSI,which can improve the reconstruction accuracy of HSI.Here,we establish a multi-objective band selection(Mop-BS)model,amulti-hypothesis prediction(MHP)model and a residual sparse(ReWSR)model for HSI,and use a staged reconstruction method to restore the compressed HSI.The simulation results show that the three-stage HSICS successfully improves the reconstruction accuracy of HSICS,and it performs best among all comparison algorithms.

A semantic segmentation-based underwater acoustic image transmission framework for cooperative SLAM

With the development of underwater sonar detection technology,simultaneous localization and mapping(SLAM)approach has attracted much attention in underwater navigation field in recent years.But the weak detection ability of a single vehicle limits the SLAM performance in wide areas.Thereby,cooperative SLAM using multiple vehicles has become an important research direction.The key factor of cooperative SLAM is timely and efficient sonar image transmission among underwater vehicles.However,the limited bandwidth of underwater acoustic channels contradicts a large amount of sonar image data.It is essential to compress the images before transmission.Recently,deep neural networks have great value in image compression by virtue of the powerful learning ability of neural networks,but the existing sonar image compression methods based on neural network usually focus on the pixel-level information without the semantic-level information.In this paper,we propose a novel underwater acoustic transmission scheme called UAT-SSIC that includes semantic segmentation-based sonar image compression(SSIC)framework and the joint source-channel codec,to improve the accuracy of the semantic information of the reconstructed sonar image at the receiver.The SSIC framework consists of Auto-Encoder structure-based sonar image compression network,which is measured by a semantic segmentation network's residual.Considering that sonar images have the characteristics of blurred target edges,the semantic segmentation network used a special dilated convolution neural network(DiCNN)to enhance segmentation accuracy by expanding the range of receptive fields.The joint source-channel codec with unequal error protection is proposed that adjusts the power level of the transmitted data,which deal with sonar image transmission error caused by the serious underwater acoustic channel.Experiment results demonstrate that our method preserves more semantic information,with advantages over existing methods at the same compression ratio.It also improves the error tolerance and packet loss resistance of transmission.

Lossless embedding: A visually meaningful image encryption algorithm based on hyperchaos and compressive sensing

A novel visually meaningful image encryption algorithm is proposed based on a hyperchaotic system and compressive sensing(CS), which aims to improve the visual security of steganographic image and decrypted quality. First, a dynamic spiral block scrambling is designed to encrypt the sparse matrix generated by performing discrete wavelet transform(DWT)on the plain image. Then, the encrypted image is compressed and quantified to obtain the noise-like cipher image. Then the cipher image is embedded into the alpha channel of the carrier image in portable network graphics(PNG) format to generate the visually meaningful steganographic image. In our scheme, the hyperchaotic Lorenz system controlled by the hash value of plain image is utilized to construct the scrambling matrix, the measurement matrix and the embedding matrix to achieve higher security. In addition, compared with other existing encryption algorithms, the proposed PNG-based embedding method can blindly extract the cipher image, thus effectively reducing the transmission cost and storage space. Finally, the experimental results indicate that the proposed encryption algorithm has very high visual security.

Optical image encryption algorithm based on a new four-dimensional memristive hyperchaotic system and compressed sensing

Some existing image encryption schemes use simple low-dimensional chaotic systems, which makes the algorithms insecure and vulnerable to brute force attacks and cracking. Some algorithms have issues such as weak correlation with plaintext images, poor image reconstruction quality, and low efficiency in transmission and storage. To solve these issues,this paper proposes an optical image encryption algorithm based on a new four-dimensional memristive hyperchaotic system(4D MHS) and compressed sensing(CS). Firstly, this paper proposes a new 4D MHS, which has larger key space, richer dynamic behavior, and more complex hyperchaotic characteristics. The introduction of CS can reduce the image size and the transmission burden of hardware devices. The introduction of double random phase encoding(DRPE) enables this algorithm has the ability of parallel data processing and multi-dimensional coding space, and the hyperchaotic characteristics of 4D MHS make up for the nonlinear deficiency of DRPE. Secondly, a construction method of the deterministic chaotic measurement matrix(DCMM) is proposed. Using DCMM can not only save a lot of transmission bandwidth and storage space, but also ensure good quality of reconstructed images. Thirdly, the confusion method and diffusion method proposed are related to plaintext images, which require both four hyperchaotic sequences of 4D MHS and row and column keys based on plaintext images. The generation process of hyperchaotic sequences is closely related to the hash value of plaintext images. Therefore, this algorithm has high sensitivity to plaintext images. The experimental testing and comparative analysis results show that proposed algorithm has good security and effectiveness.

Detecting Double JPEG Compressed Color Images via an Improved Approach

Detecting double Joint Photographic Experts Group (JPEG) compressionfor color images is vital in the field of image forensics. In previousresearches, there have been various approaches to detecting double JPEGcompression with different quantization matrices. However, the detectionof double JPEG color images with the same quantization matrix is stilla challenging task. An effective detection approach to extract features isproposed in this paper by combining traditional analysis with ConvolutionalNeural Networks (CNN). On the one hand, the number of nonzero pixels andthe sum of pixel values of color space conversion error are provided with 12-dimensional features through experiments. On the other hand, the roundingerror, the truncation error and the quantization coefficient matrix are used togenerate a total of 128-dimensional features via a specially designed CNN. Insuch aCNN, convolutional layers with fixed kernel of 1×1 and Dropout layersare adopted to prevent overfitting of the model, and an average pooling layeris used to extract local characteristics. In this approach, the Support VectorMachine (SVM) classifier is applied to distinguishwhether a given color imageis primarily or secondarily compressed. The approach is also suitable for thecase when customized needs are considered. The experimental results showthat the proposed approach is more effective than some existing ones whenthe compression quality factors are low.

Reduced Imaging Time and Improved Image Quality of 3D Isotropic T2-Weighted Magnetic Resonance Imaging with Compressed Sensing for the Female Pelvis

This study is to compare three-dimensional(3D)isotropic T2-weighted magnetic resonance imaging(MRI)with compressed sensing-sampling perfection with application optimized contrast(CS-SPACE)and the conventional image(3D-SPACE)sequence in terms of image quality,estimated signal-to-noise ratio(SNR),relative contrast-to-noise ratio(CNR),and the lesions’conspicuous of the female pelvis.Thirty-six females(age:51,28-73)with cervical carcinoma(n=20),rectal carcinoma(n=7),or uterine fibroid(n=9)were included.Patients underwent magnetic resonance(MR)imaging at a 3T scanner with the sequences of 3D-SPACE,CS-SPACE,and twodimensional(2D)T2-weighted turbo-spin echo(TSE).Quantitative analyses of estimated SNR and relative CNR between tumors and other tissues,image quality,and tissue conspicuity were performed.Two radiologists assessed the difference in diagnostic findings for carcinoma.Quantitative values and qualitative scores were analyzed,respectively.The estimated SNR and the relative CNR of tumor-to-muscle obturator internus,tumor-to-myometrium,and myometrium-to-muscle obturator internus was comparable between 3D-SPACE and CS-SPACE.The overall image quality and the conspicuity of the lesion scores of the CS-SPACE were higher than that of the 3D-SPACE(P<0.01).The CS-SPACE sequence offers shorter scan time,fewer artifacts,and comparable SNR and CNR to conventional 3D-SPACE,and has the potential to improve the performance of T2-weighted images.

Characterization of neurovascular compression in facial neuralgia patients by 3D high-resolution MRI and image fusion technique

Objective:To describe the anatomical characteristics and patterns of neurovascular compression (NVC) in patients suffering trigeminal neuralgia(TN) by 3D high-resolution magnetic resonance imaging(MRI) method and image fusion technique.Methods:The anatomic structure of trigeminal nerve,brain stem and blood vessel was observed in 100 consecutive TN patients by 3D high resolution MRI(3D SPGR,contrast-enhanced T1 3D MP-RAGE and T2/T1 3D FIESTA). The 3D image sources were fused and visualized using 3D DOCTOR software.Results:One or several NVC sites,which usually appeared 0-9.8 mm away from brain stem,were found on the symptomatic side in 93%of the TN cases.Superior cerebellar artery was involved in 76%(71/93) of these cases.The other vessels including antero-inferior cerebellar artery,vertebral artery, basilar artery and veins also contributed to the occurrence of NVC.The NVC sites were found to be located in the proximal segment in 42%of these cases(39/93) and in the distal segment in 45% (42/93).Nerve dislocation or distortion was observed in 32%(30/93).Conclusions:Various 3D high resolution MRI methods combined with the image fusion technique could provide pathologic anatomic information for the diagnosis and treatment of TN.

Specimen aspect ratio and progressive field strain development of sandstone under uniaxial compression by three-dimensional digital image correlation

The complete stress-strain characteristics of sandstone specimens were investigated in a series of quasistatic monotonic uniaxial compression tests.Strain patterns development during pre-and post-peak behaviours in specimens with different aspect ratios was also examined.Peak stress,post-peak portion of stress-strain,brittleness,characteristics of progressive localisation and field strain patterns development were affected at different extents by specimen aspect ratio.Strain patterns of the rocks were obtained by applying three-dimensional(3D) digital image correlation(DIC) technique.Unlike conventional strain measurement using strain gauges attached to specimen,3D DIC allowed not only measuring large strains,but more importantly,mapping the development of field strain throughout the compression test,i.e.in pre-and post-peak regimes.Field strain development in the surface of rock specimen suggests that strain starts localising progressively and develops at a lower rate in pre-peak regime.However,in post-peak regime,strains increase at different rates as local deformations take place at different extents in the vicinity and outside the localised zone.The extent of localised strains together with the rate of strain localisation is associated with the increase in rate of strength degradation.Strain localisation and local inelastic unloading outside the localised zone both feature post-peak regime.

A hybrid quantum encoding algorithm of vector quantization for image compression

Many classical encoding algorithms of vector quantization （VQ） of image compression that can obtain global optimal solution have computational complexity O（N）. A pure quantum VQ encoding algorithm with probability of success near 100% has been proposed, that performs operations 45√N times approximately. In this paper, a hybrid quantum VQ encoding algorithm between the classical method and the quantum algorithm is presented. The number of its operations is less than √N for most images, and it is more efficient than the pure quantum algorithm.

Empirical data decomposition and its applications in image compression

A nonlinear data analysis algorithm, namely empirical data decomposition （EDD） is proposed, which can perform adaptive analysis of observed data. Analysis filter, which is not a linear constant coefficient filter, is automatically determined by observed data, and is able to implement multi-resolution analysis as wavelet transform. The algorithm is suitable for analyzing non-stationary data and can effectively wipe off the relevance of observed data. Then through discussing the applications of EDD in image compression, the paper presents a 2-dimension data decomposition framework and makes some modifications of contexts used by Embedded Block Coding with Optimized Truncation （EBCOT） . Simulation results show that EDD is more suitable for non-stationary image data compression.

An improved fast fractal image compression using spatial texture correlation

This paper utilizes a spatial texture correlation and the intelligent classification algorithm （ICA） search strategy to speed up the encoding process and improve the bit rate for fractal image compression. Texture features is one of the most important properties for the representation of an image. Entropy and maximum entry from co-occurrence matrices are used for representing texture features in an image. For a range block, concerned domain blocks of neighbouring range blocks with similar texture features can be searched. In addition, domain blocks with similar texture features are searched in the ICA search process. Experiments show that in comparison with some typical methods, the proposed algorithm significantly speeds up the encoding process and achieves a higher compression ratio, with a slight diminution in the quality of the reconstructed image; in comparison with a spatial correlation scheme, the proposed scheme spends much less encoding time while the compression ratio and the quality of the reconstructed image are almost the same.

An effective fractal image compression algorithm based on plane fitting

A new method using plane fitting to decide whether a domain block is similar enough to a given range block is proposed in this paper. First, three coefficients are computed for describing each range and domain block. Then, the best-matched one for every range block is obtained by analysing the relation between their coefficients. Experimental results show that the proposed method can shorten encoding time markedly, while the retrieved image quality is still acceptable. In the decoding step, a kind of simple line fitting on block boundaries is used to reduce blocking effects. At the same time, the proposed method can also achieve a high compression ratio.

Nonlinear Adaptive Wavelet Transform for Lossless Image Compression

The paper presents a class of nonlinear adaptive wavelet transforms for lossless image compression. In update step of the lifting the different operators are chosen by the local gradient of original image. A nonlinear morphological predictor follows the update adaptive lifting to result in fewer large wavelet coefficients near edges for reducing coding. The nonlinear adaptive wavelet transforms can also allow perfect reconstruction without any overhead cost. Experiment results are given to show lower entropy of the adaptive transformed images than those of the non-adaptive case and great applicable potentiality in lossless image compresslon.