Imperceptible image watermarking based on Chinese remainder theorem over the edges

Adi, Prajanto Wahyu; Astuti, Yani Parti; Subhiyakto, Egia Rosi

doi:10.1109/eecsi.2017.8239117

Cited by 6 publications

(3 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…4. It is extremely serviceable for use in applications that compress video, such as JPEG and MPEG [15][16][17][18][19]. 5.…”

Section: Ycbcr Color Spacementioning

confidence: 99%

Color image steganography in YCbCr space

Alwan¹,

Farhan²,

Mahdi³

2020

IJECE

View full text Add to dashboard Cite

Steganography is a best method for in secret communicating information during the transference of data. Images are an appropriate method that used in steganography can be used to protection the simple bits and pieces. Several systems, this one as color scale images steganography and grayscale images steganography, are used on color and store data in different techniques. These color images can have very big amounts of secret data, by using three main color modules. The different color modules, such as HSV-(hue, saturation, and value), RGB-(red, green, and blue), YCbCr-(luminance and chrominance), YUV, YIQ, etc. This paper uses unusual module to hide data: an adaptive procedure that can increase security ranks when hiding a top secret binary image in a RGB color image, which we implement the steganography in the YCbCr module space. We performed Exclusive-OR (XOR) procedures between the binary image and the RGB color image in the YCBCR module space. The converted byte stored in the 8-bit LSB is not the actual bytes; relatively, it is obtained by translation to another module space and applies the XOR procedure. This technique is practical to different groups of images. Moreover, we see that the adaptive technique ensures good results as the peak signal to noise ratio (PSNR) and stands for mean square error (MSE) are good. When the technique is compared with our previous works and other existing techniques, it is shown to be the best in both error and message capability. This technique is easy to model and simple to use and provides perfect security with unauthorized.

show abstract

“…4. It is extremely serviceable for use in applications that compress video, such as JPEG and MPEG [15][16][17][18][19]. 5.…”

Section: Ycbcr Color Spacementioning

confidence: 99%

Color image steganography in YCbCr space

Alwan¹,

Farhan²,

Mahdi³

2020

IJECE

View full text Add to dashboard Cite

show abstract

“…One of the most popular algorithms is singular value decomposition [3]- [6] which has good robustness against compression and filtering but requires a complex mathematical operation for the decomposition and reconstruction. On the other hand, the Chinese remainder theorem model [7], [8] has a good imperceptibility with less complexity but weak against most of the watermark attacks. Currently, the Chinese remainder is mostly developed in secret image sharing [9], [10] Some models are developed to improve the performance through transformation domain models such as cosine transform [11]- [13], wavelet transform [14]- [16], contourlet transform [17], [18] and even using an optimazion algorithm [19] with the consequences of an increase in processing time.…”

Section: Introductionmentioning

confidence: 99%

Fast image watermarking based on signum of cosine matrix

Ernawan

Adi

Liew

et al. 2022

IJEECS

Self Cite

View full text Add to dashboard Cite

<span>In the field of image watermarking, the singular value decomposition has good imperceptibility and robustness, but it has high complexity. It divides a host image into matrices of U, S, and V. Singular matrix S has been widely used for embedding and extracting watermark, while orthogonal matrices of U and V are used in decomposition and reconstruction. The proposed signum of cosine matrix method is carried out to eliminate the generation of the three matrices at each block and replace it with a signum of cosine matrix. The proposed signum of cosine matrix is performed faster on the decomposition and reconstruction. The image is transformed into a coefficient matrix C using the signum matrix. The C matrix values are closer to the S value of singular value decomposition which can preserve high quality of the watermarked image. The experimental results show that our method is able to produce similar imperceptibility and robustness level of the watermarked image with less computational time.</span>

show abstract

“…Transform domain methods are used to improve either the robustness or the imperceptibility by transmuting the raw pixel value into a certain coefficient, inserting the watermark, and then performing inverse transformation to get the embedded pixel value. They are combined with several spatial methods, such as the Chinese remainder theorem [8,9], histogram [10,11], and Singular Value Decomposition [12,13] to get good robustness or imperceptibility at the expense of computational time. Among them, Singular Value Decomposition (SVD) is one of the most popular methods due to its robustness against different types of attacks.…”

Section: Introductionmentioning

confidence: 99%

A Novel Watermarking Method using Hadamard Matrix Quantization

Adi

Arsiwi

2020

J. ICT Res. Appl.

Self Cite

View full text Add to dashboard Cite

One of the most used watermarking algorithms is Singular Value Decomposition (SVD), which has a balanced level of imperceptibility and robustness. However, SVD uses a singular matrix for embedding and two orthogonal matrices for reconstruction, which is inefficient. In this paper, a Hadamard matrix is used to get a singular matrix for the reconstruction process. Moreover, SVD works with a floating-point value, which takes long processing time, while the Hadamard matrix works with an integer range, which is more efficient. Visual measurement showed that SVD and the new method had average NC values of 0.8321 and 0.8293, whereas the average SSIM values resulted in the same value (0.9925). In terms of processing time, the proposed method ran faster than SVD with an embedding and extraction time of 0.6308 and 0.2163 seconds against 0.8419 and 0.2935 seconds. The proposed method successfully reduced the running time while maintaining imperceptibility and robustness.

show abstract

Imperceptible image watermarking based on Chinese remainder theorem over the edges

Cited by 6 publications

References 13 publications

Color image steganography in YCbCr space

Color image steganography in YCbCr space

Fast image watermarking based on signum of cosine matrix

A Novel Watermarking Method using Hadamard Matrix Quantization

Contact Info

Product

Resources

About