scholarly journals A Distortion-Free Data Hiding Scheme for Triangular Meshes Based on Recursive Subdivision

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Yuan-Yu Tsai
Keyword(s):  
Principal Component Analysis ◽  
Data Hiding ◽  
Similarity Transformation ◽  
Principal Component ◽  
Secret Message ◽  
Subdivision Scheme ◽  
Data Embedding ◽  
Embedding Capacity ◽  
Free Data ◽  
Reversible Data Embedding

This study adopts a triangle subdivision scheme to achieve reversible data embedding. The secret message is embedded into the newly added vertices. The topology of added vertex is constructed by connecting it with the vertices of located triangle. For further raising the total embedding capacity, a recursive subdivision mechanism, terminated by a given criterion, is employed. Finally, a principal component analysis can make the stego model against similarity transformation and vertex/triangle reordering attacks. Our proposed algorithm can provide a high and adjustable embedding capacity with reversibility. The experimental results demonstrate the feasibility of our proposed algorithm.

scholarly journals Efficient Reversible Data Hiding Scheme for AMBTC-Compressed Images

2021 ◽  
Vol 11 (15) ◽  
pp. 6741
Author(s):  
Chia-Chen Lin ◽  
Thai-Son Nguyen ◽  
Chin-Chen Chang ◽  
Wen-Chi Chang
Keyword(s):  
Data Hiding ◽  
Free Space ◽  
Reversible Data Hiding ◽  
Secret Message ◽  
Embedding Capacity ◽  
Absolute Moment ◽  
Compressed Images ◽  
High Embedding Capacity ◽  
Significant Attention ◽  
Efficiency Rate

Reversible data hiding has attracted significant attention from researchers because it can extract an embedded secret message correctly and recover a cover image without distortion. In this paper, a novel, efficient reversible data hiding scheme is proposed for absolute moment block truncation code (AMBTC) compressed images. The proposed scheme is based on the high correlation of neighboring values in two mean tables of AMBTC-compressed images to further losslessly encode these values and create free space for containing a secret message. Experimental results demonstrated that the proposed scheme obtained a high embedding capacity and guaranteed the same PSNRs as the traditional AMBTC algorithm. In addition, the proposed scheme achieved a higher embedding capacity and higher efficiency rate than those of some previous schemes while maintaining an acceptable bit rate.

Reversible Data Hiding Based on Statistical Correlation of Blocked Sub-Sampled Image

2012 ◽  
Vol 2 (1) ◽  
pp. 42-59
Author(s):  
Mona Nafari ◽  
Mansour Nejati Jahromi ◽  
Gholam Hosein Sheisi
Keyword(s):  
Image Quality ◽  
Data Hiding ◽  
Reversible Data Hiding ◽  
Statistical Correlation ◽  
Experimental Results ◽  
Data Embedding ◽  
Embedding Capacity ◽  
Stego Image

In this paper, a reversible data hiding scheme has been proposed which is based on correlation of subsample images. The proposed method modifies the blocks of sub-sampled image to prepare vacant positions for data embedding. The PSNR of the stego image produced by the proposed method is guaranteed to be above 47.5 dB, while the embedding capacity is at least, almost 6.5 times higher than that of the Kim et al. techniques with the same PSNR. This technique has the capability to control the capacity-PSNR. Experimental results support that the proposed method exploits the correlation of blocked sub-sampled image outperforms the prior works in terms of larger capacity and stego image quality. On various test images, the authors demonstrate the validity of the proposed method by comparing it with other existing reversible data hiding algorithms.

scholarly journals High-Capacity and High-Quality Reversible Data Hiding Method Using Recurrent Round-Trip Embedding Strategy in the Quotient Image

2021 ◽  
Vol 11 (21) ◽  
pp. 10157
Author(s):  
Chin-Feng Lee ◽  
Hua-Zhe Wu
Keyword(s):  
Image Quality ◽  
Data Hiding ◽  
Information Hiding ◽  
Reversible Data Hiding ◽  
High Capacity ◽  
Secret Message ◽  
Embedding Capacity ◽  
Round Trip ◽  
Pixel Value ◽  
Embedding Strategy

In previous research, scholars always think about how to improve the information hiding algorithm and strive to have the largest embedding capacity and better image quality, restoring the original image. This research mainly proposes a new robust and reversible information hiding method, recurrent robust reversible data hiding (triple-RDH), with a recurrent round-trip embedding strategy. We embed the secret message in a quotient image to increase the image robustness. The pixel value is split into two parts, HiSB and LoSB. A recurrent round-trip embedding strategy (referred to as double R-TES) is designed to adjust the predictor and the recursive parameter values, so the pixel value carrying the secret data bits can be first shifted to the right and then shifted to the left, resulting in pixel invariance, so the embedding capacity can be effectively increased repeatedly. Experimental results show that the proposed triple-RDH method can effectively increase the embedding capacity up to 310,732 bits and maintain a certain level of image quality. Compared with the existing pixel error expansion (PEE) methods, the triple-RDH method not only has a high capacity but also has robustness for image processing against unintentional attacks. It can also be used for capacity and image quality according to the needs of the application, performing adjustable embedding.

scholarly journals Research on Image Steganography Based on Sudoku Matrix

Symmetry ◽  
2021 ◽  
Vol 13 (3) ◽  
pp. 387
Author(s):  
Tsung-Chih Hsiao ◽  
Dong-Xu Liu ◽  
Tzer-Long Chen ◽  
Chih-Cheng Chen
Keyword(s):  
Data Hiding ◽  
Signal To Noise Ratio ◽  
Low Cost ◽  
Data Embedding ◽  
Embedding Capacity ◽  
Signal To Noise ◽  
Good Image Quality ◽  
Shell Matrix ◽  
Embedding Methods

At present, the Sudoku matrix, turtle shell matrix, and octagonal matrix have been put forward according to the magic matrix-based data hiding methods. Moreover, the magic matrices to be designed depend on the size of the embedding capacity. In addition, by determining the classification of points of pixel pairs after applying a magic matrix and by determining the traversal area, the average peak signal-to-noise ratio (PSNR) can be improved. Therefore, this topic intends to propose a data hiding method based on a 16 × 16 Sudoku matrix by using the 16 × 16 Sudoku matrix and extending it to a double-layer magic matrix. Low-cost data embedding methods are also studied, in order to improve the PSNR and maintain good image quality with the same embedding capacity.

scholarly journals High-Capacity Embedding Method Based on Double-Layer Octagon-Shaped Shell Matrix

Symmetry ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 583
Author(s):  
Chin-Feng Lee ◽  
Jau-Ji Shen ◽  
Somya Agrawal ◽  
Yen-Hsi Li
Keyword(s):  
Double Layer ◽  
Data Hiding ◽  
Signal To Noise Ratio ◽  
High Capacity ◽  
Secret Message ◽  
Embedding Capacity ◽  
Secret Data ◽  
Shell Matrix ◽  
Pixel Pair ◽  
Geometrical Shapes

Data hiding is a technique that embeds a secret message into a cover medium and transfers the hidden information in the secret message to the recipient. In the past, several data hiding methods based on magic matrix have used various geometrical shapes to transmit secret data. The embedding capacity achieved in these methods was often limited due to simple geometrical layouts. This paper proposes a data hiding scheme based on a double-layer octagon-shaped shell matrix. Compared to previous octagon-shaped data hiding methods, the proposed method embeds a total of 7 bits in each pixel pair, reaching an embedding capacity of 3.5 bits per pixel (bpp). Experimental results show that the proposed scheme has a higher embedding capacity compared to other irreversible data hiding schemes. Using the proposed method, it is possible to maintain the Peak Signal to Noise Ratio (PSNR) within an acceptable range with the embedding time less than 2 s.

Scanning x-ray fluorescence microscopy and principal component analysis

1992 ◽  
Vol 50 (2) ◽  
pp. 1752-1753
Author(s):  
Brian Cross
Keyword(s):  
Principal Component Analysis ◽  
Fluorescence Microscopy ◽  
Spatial Resolution ◽  
High Speed ◽  
Image Acquisition ◽  
Principal Component ◽  
Fluorescence Microscope ◽  
Acquisition Rate ◽  
X Ray ◽  
Speed Up

A relatively new entry, in the field of microscopy, is the Scanning X-Ray Fluorescence Microscope (SXRFM). Using this type of instrument (e.g. Kevex Omicron X-ray Microprobe), one can obtain multiple elemental x-ray images, from the analysis of materials which show heterogeneity. The SXRFM obtains images by collimating an x-ray beam (e.g. 100 μm diameter), and then scanning the sample with a high-speed x-y stage. To speed up the image acquisition, data is acquired "on-the-fly" by slew-scanning the stage along the x-axis, like a TV or SEM scan. To reduce the overhead from "fly-back," the images can be acquired by bi-directional scanning of the x-axis. This results in very little overhead with the re-positioning of the sample stage. The image acquisition rate is dominated by the x-ray acquisition rate. Therefore, the total x-ray image acquisition rate, using the SXRFM, is very comparable to an SEM. Although the x-ray spatial resolution of the SXRFM is worse than an SEM (say 100 vs. 2 μm), there are several other advantages.

Sign in / Sign up

Export Citation Format

Share Document