A new method for digital watermarking based on combination of DCT and PCA

Saboori, Arash; Hosseini, S. Abolfazl

doi:10.1109/telfor.2014.7034461

Cited by 7 publications

(5 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Table 4 and Fig. 8 show a comparison between the proposed method and the counterparts [7], [20] and [21]. The NC values for the proposed system obtained higher results compared to the NC values in the previous works, where it is very close to the ideal value which is 1.…”

Section: Table 3 Several Attacks On Watermarked Imagementioning

confidence: 72%

“…Table 5 shows the comparison of the proposed method and other methods in term of availability, reliability, and confidentiality. Therefore, the proposed method is more robust and secured than [7], [20] and [21]. [20] high medium high low S. A et al [21] medium medium medium low Figure 8.…”

Section: Table 3 Several Attacks On Watermarked Imagementioning

confidence: 94%

“…Therefore, the proposed method is more robust and secured than [7], [20] and [21]. [20] high medium high low S. A et al [21] medium medium medium low Figure 8. Comparison of NC between the proposed method and the other methods…”

Section: Table 3 Several Attacks On Watermarked Imagementioning

confidence: 94%

See 2 more Smart Citations

Improving Encryption Digital Watermark by Using Blue Monkey Algorithm

Abdulhammed¹

2021

IJC

View full text Add to dashboard Cite

Watermarking enables the users to share the digital contents in public domain without any issue. In the present day, the tremendous development in the digital technologies and networks caused an increase in the threats of unauthorized copying, tampering of digital media and image theft. To face these threats, digital watermark technology can be applied. However, the current paper uses new technique with two main algorithms that are the following ones: improved honey algorithm that is used to encrypt the digital watermark and blue monkey meta-heuristic algorithm which is used to find the best location in the host image to hide the digital watermark. Furthermore, in order to check the security and the robustness of the proposed method against various common image processing attacks such as Gaussian noise, Rotation, Salt and pepper noise, Sharpen, Median filter, Average filter, compression and Cropping is computed, certain performance metrics such as Peak to Signal Noise Ratio (PSNR)and Mean Square Error (MSE) also are computed. Likewise, Normalized Correlation (NC) is used to check similarity between the original and extracted digital watermark. The results demonstrate that the proposed method is efficient, provides high security and robustness against most attacks compared to the pervious methods.

show abstract

Section: Table 3 Several Attacks On Watermarked Imagementioning

confidence: 72%

Section: Table 3 Several Attacks On Watermarked Imagementioning

confidence: 94%

See 1 more Smart Citation

Improving Encryption Digital Watermark by Using Blue Monkey Algorithm

Abdulhammed¹

2021

IJC

View full text Add to dashboard Cite

show abstract

“…Multimedia information, including image, has become one of the most communication contents. Due to the fast growth of internet and boundless use of image processing and multimedia technologies, People can easily obtain the extensive multimedia files through the internet, create problems such as prohibited copying, forge ownership claims, because of the ease of copying or altering digital documents quickly and without quality loss (Saboori and Hosseini, 2014). The watermarking system has been proposed for avoiding these problems (Hasoon and Khalifa, 2012;Hosseini and Saboori, 2015).…”

Section: Introductionmentioning

confidence: 99%

Image Watermarking Using All Phase Discrete Cosine Biorthogonal Transform in Selected Pixel Blocks

Khalifa

Saeed

2020

Polytechnic j.

View full text Add to dashboard Cite

In the past decade, a transform called all phase discrete cosine biorthogonal transform (APDCBT) appeared in the field of digital image processing. It is mainly used to solve the negativity found in discrete cosine transform (DCT), especially in a low bit rate. In this paper, the APDCBT is employed for watermark insertion based on selected regions of an image. The insertion is depending on the homogeneity of each part of the image. To determine the extent of homogeneity, there are two criteria: Mean and standard deviation are applied for the intensity of the image. Medium frequency bands of APDCBT in image pixel blocks are used to hold the embedded watermark. Then, the transform is inversed to obtain the resultant watermarked image. The robustness of APDCBT against watermark removal attacks is tested and the experimental results showed the superiority of the APDCBT over traditional DCT in the watermark embedding system. More specifically, when the LSB reset attack applied. For instance, when the contrast adjustment attack applied, the average of normalized cross-correlation (NCC) values of extracted watermark images with the original watermark, it was 0.992 for the proposed method. This is a promised result, if it is compared with the NCC of the DCT method, which was 0.423. The proposed method can be used for copyright protection purpose.

show abstract

“…Image compression is divided into lossless compression and lossy compression [2][3]. Principal component analysis algorithm is a kind of feature vector based lossy compression algorithm, which has many applications in image compression and digital watermarking [4][5][6][7][8]. Principal component analysis converts the data set into a low dimensional feature space, and retains most of the original data information content [9].…”

Section: Introductionmentioning

confidence: 99%

Lossy Image Compression Using PCA and Contourlet Transform

Chen

Huang

Sun

et al. 2016

MATEC Web of Conferences

View full text Add to dashboard Cite

Abstract. With the rapid development of Internet, image information is growing. It requires a lot of image storage and transmission. In order to reduce the storage and get better image quality, image compression algorithm is studied. The paper proposes a new image compression algorithm that combines principal component analysis (PCA) and Contourlet Transform (CT). Because PCA has good image quality, but the compression ratio is low, and CT compression algorithm has high compression ratio and good PNSR value. The image is decomposed by PCA. The image data is divided into blocks, and each block is used as a sample vector, then select covariance matrix of k larger eigenvalues corresponding eigenvector to realize image compression. Then the image is compressed again using CT compression algorithm. Compared with the results of JEPG2000 and CT compression algorithm, the results show that the proposed algorithm has better performance than JEPG2000 and CT compression algorithm. In the same compression ratio, PNSR value of proposed algorithm is about 3dB higher than that of JEPG2000, and 2dB higher than that of CT compression algorithm.

show abstract

A new method for digital watermarking based on combination of DCT and PCA

Cited by 7 publications

References 9 publications

Improving Encryption Digital Watermark by Using Blue Monkey Algorithm

Improving Encryption Digital Watermark by Using Blue Monkey Algorithm

Image Watermarking Using All Phase Discrete Cosine Biorthogonal Transform in Selected Pixel Blocks

Lossy Image Compression Using PCA and Contourlet Transform

Contact Info

Product

Resources

About