Joint Photographic Experts Group Research Articles

Steganography Algorithms in Computed Tomography (CT) Scan Images

Steganography is a technique which allows to hide information or data inside a medium without giving an idea to people that the hidden data even existed. In the medical field, there are cases where patient’s medical images breached along with their sensitive and personal data because of poor security. This problem leads to a wanting of a good solution to have the medical image with secured patient data. Here is where the image steganography takes place to hide the patient data inside the medical images. This study is conducted to determine the effective image steganography algorithm to be used in the medical field to embed the patient information inside their medical images specifically in Computed Tomography (CT) scan images. The image steganography algorithms that will be used in this study are Least Significant Bit (LSB), Exploiting Modification Direction (EMD) and Discrete Wavelet Transform (DWT). The flow of the image steganography technique will be studied and analyzed and after that, the algorithms will be implemented with different file formats which are Portable Network Graphics (PNG), Bitmap (BMP) and Joint Photographic Experts Group (JPG) and different image sizes which are 1024x1024 and 2048x2048 pixels. After that, the results are evaluated with performance metrics which are Peak Signal-to-Noise Ratio (PSNR), Mean Squared Error (MSE), Structural Similarity Index Measure (SSIM) and Pairs Analysis. The results are then compared to determine the best image steganography algorithm along with the image file format which gives the highest robustness, visual quality, security and imperceptibility. The research result displays the EMD algorithm as the best paired with BMP file format in image steganography where it resulted in producing highest average of SSIM and PSNR which is 1.0 and 67.421 respectively and lowest MSE average of 0.012 with no traces in pairs analysis.

Security of Magnetic Resonance Medical Images using Region-based Lossless Image Compression in Healthcare Information Systems

Purpose The purpose of region-based medical image compression is to optimize the compression process by focusing on specific regions of interest within medical images. Unlike traditional compression methods that treat the entire image uniformly, region-based compression techniques identify and prioritize certain areas or regions within the image that are deemed more diagnostically significant or relevant. By allocating more resources to compressing these critical regions while reducing compression in less important areas, region-based compression methods aim to achieve higher compression efficiency while preserving diagnostic quality. This approach is particularly valuable in medical imaging, where accurate representation of anatomical structures or pathological findings is paramount for clinical diagnosis and decision-making. Region-based compression can help reduce storage requirements, transmission bandwidth, and processing time without compromising the diagnostic integrity of medical images, thereby facilitating more efficient healthcare delivery and telemedicine applications. Methods In this study, we utilized distortion-limiting compression techniques to optimize the compression process for specific regions within medical images. We employed lossless scalable RBC (Region-Based Compression) using Discrete Wavelet Transform (DWT) for Digital Imaging and Communication in Medicine (DICOM) images. The initial step involved medical image pre-processing, followed by segmentation to separate the image into regions of interest (ROI) and non-ROI. Compression techniques were then applied to reduce network bandwidth and storage requirements. Fractal lossy compression was employed for the non-ROI portion, while context-tree weighting lossless compression was proposed for the ROI portion, effectively compressing the image while rejecting noisy background elements. During decompression, the original medical image can be reconstructed using the reverse process. This approach optimizes storage and transmission efficiency while preserving diagnostic integrity in medical imaging applications. Results The experiment involved testing various medical images, and the proposed method outperformed previous techniques in terms of results. According to the findings, the improvement in Peak Signal-to-Noise Ratio (PSNR) over current techniques reached up to 24.23 dB compared to the Joint Photographic Experts Group (JPEG). Additionally, it achieved up to 12.22 dB improvement compared to other transform approaches. These significant enhancements prompted the development of a web and mobile platform for compressing and sending medical images, particularly microscopic ones, in real time. Conclusion This research focuses on employing wavelet transform techniques to compress the Region of Interest (ROI) within medical images. This ROI-based compression approach is particularly valuable as it retains essential diagnostic information while reducing the overall file size. Such a technique holds significant promise for telemedicine systems, especially in rural regions where network resources may be limited or constrained. By selectively compressing the most diagnostically relevant areas of medical images, this approach ensures that critical information is preserved while optimizing data transmission and storage efficiency. This can ultimately enhance access to medical imaging services and facilitate remote diagnosis and treatment in underserved areas with limited network infrastructure.

A Hybrid System Based on Three Levels to Hide Information using JPEG Color Images

Nowadays, due to the circulation of information among people, information security has become an important requirement to protect information from hacking. Many techniques have been discovered to protect this information and maintain its confidentiality from hacking, the most prominent of which are cryptography and steganography techniques. In this paper, a hybrid system based on three levels to hide information using Joint Photographic Experts Group (JPEG) color images, where this system works in both processes sender and receiver. The sender process at the first level uses a mixing of the Advanced Encryption Standard (AES) and Rivest Shamir Adleman (RSA), while at the second level uses a Fuzzy Stream Algorithm (FSA) adds a higher complexity and eliminates the non-linearity of the encrypted information. The third level is to hide encrypted information using the Least Significant Bit (LSB) technique, while the receiver process, performs the reverse process of three levels. This system provides high information embedding capability and the inability to perceive hidden information, the system was evaluated based on criteria like Peak Signal Noise Ratio (PSNR), Mean Square Error (MSE), Structure Similarity (SSIM), and correlation, which were characterized by high and good rates. The study was compared with modern steganography techniques.

Segmentation of coronary artery based on discriminative frequency learning and coronary-geometric refinement

Coronary artery segmentation is crucial for physicians to identify and locate plaques and stenosis using coronary computed tomography angiography (CCTA). However, the low contrast of CCTA images and the intricate structures of coronary arteries make this task challenging. To address these difficulties, we propose a novel model, the DFS–PDS network. This network comprises two subnetworks: a discriminative frequency segment subnetwork (DFS) and a position domain scales subnetwork (PDS). DFS introduced a gated mechanism within the feed-forward network, leveraging the Joint Photographic Experts Group (JPEG) compression algorithm, to discriminatively determine which low- and high-frequency information of the features should be preserved for latent image segmentation. The PDS aims to learn the shape prototype by predicting the radius. Additionally, our model has the consistent ability to guarantee region and boundary features through boundary consistency loss. During training, both subnetworks are optimized jointly, and in the testing stage, the coarse segmentation and radius prediction are produced. A coronary-geometric refinement method refines the segmentation masks by leveraging the shape prior to being reconstructed from the radius map, reducing the difficulty of segmenting coronary artery structures from complex surrounding structures. The DFS–PDS network is compared with state-of-the-art (SOTA) methods on two coronary artery datasets to evaluate its performance. The experimental results demonstrate that the DFS–PDS network performs better than the SOTA models, including Vnet, nnUnet, DDT, CS2-Net, Unetr, and CAS-Net, in terms of Dice or connectivity evaluation metrics.

RIHINNet: A robust image hiding method against JPEG compression based on invertible neural network

AbstractImage hiding is a task that embeds secret images in digital images without being detected. The performance of image hiding has been greatly improved by using the invertible neural network. However, current image hiding methods are less robust in the face of Joint Photographic Experts Group (JPEG) compression. The secret image cannot be extracted from the stego image after JPEG compression of the stego image. Some methods show good robustness for some certain JPEG compression quality factors but poor robustness for other common JPEG compression quality factors. An image‐hiding network (RIHINNet) that is robust to all common JPEG compression quality factors is proposed. First of all, the loss function is redesigned; thus, the secret image is hidden as much as possible in the area that is less likely to be changed after JPEG compression. Second, the classifier is designed, which can help the model to select the extractor according to the range of JPEG compression degree. Finally, the interval robustness of the secret image extraction is improved through the design of a denoising module. Experimental results show that this RIHINNet outperforms other state‐of‐the‐art image‐hiding methods in the face of JPEG compressed noise with random compression quality factors, with more than 10 dB peak signal‐to‐noise ratio improvement in secret image recovery on ImageNet, COCO and DIV2K datasets.

Multi-scale image compression and reconstruction algorithm for structural health monitoring system

Image data is increasingly common in structural health monitoring systems. However, due to the limitation of hardware resources such as network bandwidth, the data collected by sensors cannot be transmitted efficiently. In order to solve the problem of inefficient data transmission and ensure data recoverability, an end-to-end compression and reconstruction algorithm with an attention-enhanced residual module and a quantization mechanism is proposed. In order to meet the needs of SHM systems for image diversity, multi-scale images of local and global structural damage are used for research. The performance of the proposed algorithm is compared with traditional image compression standards and baseline models. Experimental results show that the peak signal-to-noise ratio of the reconstructed image is greater than 30 dB at different bit rates, effectively reconstructing the original image information; for images with complex textures, the residual block attention module can improve the rate-distortion performance of the proposed algorithm; when the bit rate is less than 0.44 bit per pixel, the peak signal-to-noise ratio and structural similarity of the reconstructed image of the proposed algorithm are better than those of the autoencoder baseline model and Joint Photographic Experts Group compression method. Structural damage detection examples verify the usability of compressed-reconstructed images in engineering applications.

Impact of LiDAR point cloud compression on 3D object detection evaluated on the KITTI dataset

The rapid growth on the amount of generated 3D data, particularly in the form of Light Detection And Ranging (LiDAR) point clouds (PCs), poses very significant challenges in terms of data storage, transmission, and processing. Point cloud (PC) representation of 3D visual information has shown to be a very flexible format with many applications ranging from multimedia immersive communication to machine vision tasks in the robotics and autonomous driving domains. In this paper, we investigate the performance of four reference 3D object detection techniques, when the input PCs are compressed with varying levels of degradation. Compression is performed using two MPEG standard coders based on 2D projections and octree decomposition, as well as two coding methods based on Deep Learning (DL). For the DL coding methods, we used a Joint Photographic Experts Group (JPEG) reference PC coder, that we adapted to accept LiDAR PCs in both Cartesian and cylindrical coordinate systems. The detection performance of the four reference 3D object detection methods was evaluated using both pre-trained models and models specifically trained using degraded PCs reconstructed from compressed representations. It is shown that LiDAR PCs can be compressed down to 6 bits per point with no significant degradation on the object detection precision. Furthermore, employing specifically trained detection models improves the detection capabilities even at compression rates as low as 2 bits per point. These results show that LiDAR PCs can be coded to enable efficient storage and transmission, without significant object detection performance loss.

Effect of an image compression scheme on optical camera communication

Optical camera communication (OCC) represents a subset of visible light communication with considerable potential applications in domains such as intelligent transportation systems. However, many related studies on OCC ignore the effect of image compression. Cameras typically compress captured image data to reduce the resources required to store the data. Taking Joint Photographic Experts Group (JPEG) and AV1 image file format (AVIF) compression as examples, the effect is studied based on a simplified OCC model. The simulation results indicate that image compression can achieve the effect of a low-pass filter. Image compression, especially AVIF compression, can effectively reduce the bit error ratio (BER) of the system. Compared with demodulating RAW images, the BER is reduced from 1.2×10−1 to 7.0×10−4 when the AVIF image compression ratio is approximately 140. In addition, image compression is one of the reasons for the different performance of the red, green, and blue channels.

Domain Transformation of Distortion Costs for Efficient JPEG Steganography with Symmetric Embedding

Nowadays, most image steganographic schemes embed secret messages by minimizing a well-designed distortion cost function for the corresponding domain, i.e., the spatial domain for spatial image steganography or the JPEG (Joint Photographic Experts Group) domain for JPEG image steganography. In this paper, we break the boundary between these two types of schemes by establishing a theoretical link between the distortion costs in the spatial domain and those in the JPEG domain and thus propose a scheme for domain transformations of distortion costs for efficient JPEG steganography with symmetric embedding, which can directly convert the spatial distortion cost into its JPEG counterpart. Specifically, by formulating the distortion cost function for JPEG images in the decompressed spatial domain, a closed-form expression for a distortion cost cross-domain transformation is derived theoretically, which precisely characterizes the conversion from the distortion costs obtained by existing spatial steganographic schemes to those applied in JPEG steganography. Experimental results demonstrate that the proposed method outperforms other advanced JPEG steganographic schemes, e.g., JUNIWARD (JPEG steganography with Universal Wavelet Relative Distortion), JMiPOD (JPEG steganography by Minimizing the Power of the Optimal Detector), and DCDT (Distortion Cost Domain Transformation), in resisting the detection of various advanced steganalyzers.

Evaluation on high-performance image compaction algorithms in spatio-temporal data processing

With the passage of time, the importance of spatio-temporal data (STD) is increasing day by day, but the spatiotemporal characteristics of STD bring huge challenges to data processing. Aiming at the problems of image information loss, limited compression ratio, slow compression speed and low compression efficiency, this method based on image compression. This article intended to focus on aircraft trajectory data, meteorological data, and remote sensing image data as the main research objects. The research results would provide more accurate and effective data support for research in related fields. The image compaction algorithm based on deep learning in this article consisted of two parts: encoder and decoder, and this method was compared with the JPEG (Joint Photographic Experts Group) method. When compressing meteorological data, the algorithm proposed in this paper can achieve a maximum compaction rate of 0.400, while the maximum compaction rate of the JPEG compaction algorithm was only 0.322. If a set of aircraft trajectory data containing 100 data points is compressed to 2:1, the storage space required for the algorithm in this paper is 4.2 MB, while the storage space required for the lossless compression algorithm is 5.6 MB, which increases the compression space by 33.33%. This article adopted an image compaction algorithm based on deep learning and data preprocessing, which can significantly improve the speed and quality of image compaction while maintaining the same compaction rate, and effectively compress spatial and temporal dimensional data.

An Efficient Approximate Multiplier with Encoded Partial Products and Inexact Counter for Joint Photographic Experts Group Compression

An Efficient Approximate Multiplier with Encoded Partial Products and Inexact Counter for Joint Photographic Experts Group Compression

End-to-end compression-aware computer-generated holography.

Joint photographic experts group (JPEG) compression standard is widely adopted for digital images. However, as JPEG encoding is not designed for holograms, applying it typically leads to severe distortions in holographic projections. In this work, we overcome this problem by taking into account the influence of JPEG compression on hologram generation in an end-to-end fashion. To this end, we introduce a novel approach to merge the process of hologram generation and JPEG compression with one differentiable model, enabling joint optimization via efficient first-order solvers. Our JPEG-aware end-to-end optimized holograms show significant improvements compared to conventional holograms compressed using JPEG standard both in simulation and on experimental display prototype. Specifically, the proposed algorithm shows improvements of 4 dB in peak signal-to-noise ratio (PSNR) and 0.27 in structural similarity (SSIM) metrics, under the same compression rate. When maintained with the same reconstruction quality, our method reduces the size of compressed holograms by about 35% compared to conventional JPEG-compressed holograms. Consistent with simulations, the experimental results further demonstrate that our method is robust to JPEG compression loss. Moreover, our method generates holograms compatible with the JPEG standard, making it friendly to a wide range of commercial software and edge devices.

Quantum JPEG

The joint photographic expert group algorithm compresses a digital image by filtering its high spatial-frequency components. Similarly, we introduce a quantum algorithm that uses the quantum Fourier transform to discard the high spatial-frequency qubits of an image, downsampling it to a lower resolution. This allows one to capture, compress, and send images even with limited quantum resources for storage and communication. We show under which conditions this protocol is advantageous with respect to its classical counterpart.

A robust watermarking algorithm against JPEG compression based on multiscale autoencoder

AbstractThe network structure of digital watermarking algorithm based on deep learning is usually encoder‐noise layer‐decoder. Most of the existing encoders suffer from the problem of insufficient feature extraction, and the introduction of simulated differentiable joint photographic experts group (JPEG) compression in the noise layer cannot ensure the robustness under real JPEG. In this paper, a watermarking algorithm based on multi‐scale auto‐encoder is proposed, which can effectively extract the image feature information by combining with the channel attention mechanism. At the same time, some parameters of decoder and encoder are shared to reduce redundant feature embedding and improve extraction accuracy. This paper also proposes a robust training scheme against JPEG compression, which can guide the model to store the watermark in the low‐frequency region needed for decoding. Experimental results show that the peak signal‐to‐noise ratio (PSNR) of the proposed algorithm is above 48 and the decoding rate is above 99% under JPEG compression with quality factor Q = 50. Moreover, this scheme can effectively promote the combination of noise layer in training. In addition, the proposed algorithm is also robust to other common network noises.

Photo-Stacking Technique for Neuroanatomical High-Definition Photography and 3-Dimensional Modeling

Three-dimensional (3D) neuroanatomical knowledge is vital in neurosurgery. Technological advances improved 3D anatomical perception, but they are usually expensive and not widely available. The aim of the present study was to provide a detailed description of the photo-stacking technique for high-resolution neuroanatomical photography and 3D modeling. The photo-stacking technique was described in a step-by-step approach. The time for image acquisition, file conversion, processing, and final production was measured using 2 processing methods. The total number and file size of images are presented. Measures of central tendency and dispersion report the measured values. Ten models were used in both methods achieving 20 models with high-definition images. The mean number of acquired images was 40.6 (14-67), image acquisition time 51.50±18.8 s, file conversion time 250±134.6s, processing time 50.46±21.46s and 41.97±20.84s, and 3D reconstruction time was 4.29±0.74s and 3.89±0.60s for methods B and C, respectively. The mean file size of RAW files is 1010±452megabyte (MB) and 101.06±38.09MB for Joint Photographic Experts Group files after conversion. The mean size of the final image means size is 71.9±0.126MB, and the mean file size of the 3D model means is 37.4±0.516MB for both methods. The total equipment used was less expensive than other reported systems. The photo-stacking technique is a simple and inexpensive method to create 3D models and high-definition images that could prove valuable in neuroanatomy training.

Iban plaited mat motif classification with adaptive smoothing

<span lang="EN-US">Decorative mats plaited by the Iban communities in Borneo contains motifs that reflect their traditional beliefs. Each motif has its own special meaning and taboos. A typical mat motif contains multiple smaller patterns that surround the main motif hence is likely to cause misclassification. We introduce a classification framework with adaptive sampling to remove smaller features whilst retaining larger (and discriminative) image structures. Canny filter and probabilistic hough transform are gradually applied to a clean greyscale image until a threshold value pertaining to the image’s structural information is reached. Morphological dilation is then applied to improve the appearance of the retained edges. The resulting image is described using binary robust invariant scalable keypoints (BRISK) features with random sample consensus (RANSAC). We reported the classification accuracy against six common image deformations at incremental degrees: scale+rotation, viewpoint, image blur, joint photographic experts group (JPEG) compression, scale and illumination. From our sensitivity analysis, we found the optimal threshold for adaptive smoothing to be 75.0%. The optimal scheme obtained 100.0% accuracy for JPEG compression, illumination, and viewpoint set. Using adaptive smoothing, we achieved an average increase in accuracy of 11.0% compared to the baseline.</span>

Deep Learning-Based Modified YOLACT Algorithm on Magnetic Resonance Imaging Images for Screening Common and Difficult Samples of Breast Cancer.

Computer-aided methods have been extensively applied for diagnosing breast lesions with magnetic resonance imaging (MRI), but fully-automatic diagnosis using deep learning is rarely documented. Deep-learning-technology-based artificial intelligence (AI) was used in this work to classify and diagnose breast cancer based on MRI images. Breast cancer MRI images from the Rider Breast MRI public dataset were converted into processable joint photographic expert group (JPG) format images. The location and shape of the lesion area were labeled using the Labelme software. A difficult-sample mining mechanism was introduced to improve the performance of the YOLACT algorithm model as a modified YOLACT algorithm model. Diagnostic efficacy was compared with the Mask R-CNN algorithm model. The deep learning framework was based on PyTorch version 1.0. Four thousand and four hundred labeled data with corresponding lesions were labeled as normal samples, and 1600 images with blurred lesion areas as difficult samples. The modified YOLACT algorithm model achieved higher accuracy and better classification performance than the YOLACT model. The detection accuracy of the modified YOLACT algorithm model with the difficult-sample-mining mechanism is improved by nearly 3% for common and difficult sample images. Compared with Mask R-CNN, it is still faster in running speed, and the difference in recognition accuracy is not obvious. The modified YOLACT algorithm had a classification accuracy of 98.5% for the common sample test set and 93.6% for difficult samples. We constructed a modified YOLACT algorithm model, which is superior to the YOLACT algorithm model in diagnosis and classification accuracy.

Remote Sensing Image Compression Based on the Multiple Prior Information

Learned image compression has achieved a series of breakthroughs for nature images, but there is little literature focusing on high-resolution remote sensing image (HRRSI) datasets. This paper focuses on designing a learned lossy image compression framework for compressing HRRSIs. Considering the local and non-local redundancy contained in HRRSI, a mixed hyperprior network is designed to explore both the local and non-local redundancy in order to improve the accuracy of entropy estimation. In detail, a transformer-based hyperprior and a CNN-based hyperprior are fused for entropy estimation. Furthermore, to reduce the mismatch between training and testing, a three-stage training strategy is introduced to refine the network. In this training strategy, the entire network is first trained, and then some sub-networks are fixed while the others are trained. To evaluate the effectiveness of the proposed compression algorithm, the experiments are conducted on an HRRSI dataset. The results show that the proposed algorithm achieves comparable or better compression performance than some traditional and learned image compression algorithms, such as Joint Photographic Experts Group (JPEG) and JPEG2000. At a similar or lower bitrate, the proposed algorithm is about 2 dB higher than the PSNR value of JPEG2000.

A Novel Multimedia Player for International Standard—JPEG Snack

The advancement in mobile communication and technologies has led to the usage of short-form digital content increasing daily. This short-form content is mainly based on images that urged the joint photographic experts' group (JPEG) to introduce a novel international standard, JPEG Snack (International Organization for Standardization (ISO)/ International Electrotechnical Commission (IEC) IS, 19566-8). In JPEG Snack, the multimedia content is embedded into a main background JPEG file, and the resulting JPEG Snack file is saved and transmitted as a .jpg file. If someone does not have a JPEG Snack Player, their device decoder will treat it as a JPEG file and display a background image only. As the standard has been proposed recently, the JPEG Snack Player is needed. In this article, we present a methodology to develop JPEG Snack Player. JPEG Snack Player uses a JPEG Snack decoder and renders media objects on the background JPEG file according to the instructions in the JPEG Snack file. We also present some results and computational complexity metrics for the JPEG Snack Player.

Random embedded calibrated statistical blind steganalysis using cross validated support vector machine and support vector machine with particle swarm optimization

The evolvement in digital media and information technology over the past decades have purveyed the internet to be an effectual medium for the exchange of data and communication. With the advent of technology, the data has become susceptible to mismanagement and exploitation. This led to the emergence of Internet Security frameworks like Information hiding and detection. Examples of domains of Information hiding and detection are Steganography and steganalysis respectively. This work focus on addressing possible security breaches using Internet security framework like Information hiding and techniques to identify the presence of a breach. The work involves the use of Blind steganalysis technique with the concept of Machine Learning incorporated into it. The work is done using the Joint Photographic Expert Group (JPEG) format because of its wide use for transmission over the Internet. Stego (embedded) images are created for evaluation by randomly embedding a text message into the image. The concept of calibration is used to retrieve an estimate of the cover (clean) image for analysis. The embedding is done with four different steganographic schemes in both spatial and transform domain namely LSB Matching and LSB Replacement, Pixel Value Differencing and F5. After the embedding of data with random percentages, the first order, the second order, the extended Discrete Cosine Transform (DCT) and Markov features are extracted for steganalysis.The above features are a combination of interblock and intra block dependencies. They had been considered in this paper to eliminate the drawback of each one of them, if considered separately. Dimensionality reduction is applied to the features using Principal Component Analysis (PCA). Block based technique had been used in the images for better accuracy of results. The technique of machine learning is added by using classifiers to differentiate the stego image from a cover image. A comparative study had been during with the classifier names Support Vector Machine and its evolutionary counterpart using Particle Swarm Optimization. The idea of cross validation had also been used in this work for better accuracy of results. Further parameters used in the process are the four different types of sampling namely linear, shuffled, stratified and automatic and the six different kernels used in classification specifically dot, multi-quadratic, epanechnikov, radial and ANOVA to identify what combination would yield a better result.