A Survey on Image Steganography & its Techniques in Spatial & Frequency Domain

Steganography is an intelligent art of communicating in a way which hides the endurance of the communication. The image steganography technique takes the asset of confined power of visual system of human being. The art of hiding information such that it averts ferreting out of hidden messages is getting very popular nowadays, which is referred as Steganography. The word Steganography has been educed from the two Greek words - Steganos, which mean covered or secret and Graphy mean writing or drawing. There have been many techniques for hiding information or messages in images in such a manner that the modifications made to the image are perceptually undetected. This paper proposes the evaluation of a few techniques of the Image Steganography in spatial domain and frequency domain. The Image Steganography techniques in spatial domain that would be discussed are Least-Significant-Bit (LSB), LSB Replacement, LSB Matching, and Bit Plane Complexity Segmentation Steganography and frequency domain techniques to be conferred in this paper are Discrete Wavelet Transform (DWT), Discrete Cosine Transform (DCT), Discrete Fourier Transform (DFT) and Singular Valued Decomposition (SVD). Steganography technique is intended to be compared with the Watermarking Technique. DOI: 10.17762/ijritcc2321-8169.15027

A comparative study of steganography using watermarking and modifications pixels versus least significant bit

This article presents a steganography proposal based on embedding data expressed in base 10 by directly replacing the pixel values from images red, green blue (RGB) with a novel compression technique based on watermarks. The method considers a manipulation of the object to be embedded through a data compression triple process via LZ77 and base 64, watermark from low-quality images, embedded via discrete wavelet transformation-singular value decomposition (DWT-SVD), message embedded by watermark is recovered with data loss calculated, the watermark image and lost data is compressed again using LZ77 and base 64 to generate the final message. The final message is embedded in portable network graphic (PNG) images taken from the Microsoft common objects in context (COCO), ImageNet and uncompressed color image database (UCID) datasets, through a filtering process pixel of the images, where the selected pixels expressed in base 10, and the final message data is embedded by replacing units’ position of each pixel. In experimentation results an average of 40 dB in peak signal noise to ratio (PSNR) and 0.98 in the similarity structural index metric (SSIM) evaluation were obtained, and evasion steganalysis rates of up to 93% for stego-images, the data embedded average is 3.2 bpp

Entropy Based Robust Watermarking Algorithm

Tänu aina kasvavale multimeedia andmeedastus mahtudele Internetis, on esile kerkinud mured turvalisusest ja piraatlusest. Digitaalse meedia paljundamise ja muutmise maht on loonud vajaduse digitaalse meedia vesimärgistamise järgi. Selles töös on tutvustatud vastupidavaid vesimärkide lisamise algoritme, mis lisavad vesimärgid madala entroopiaga pildi osadesse. Välja pakutud algoritmides jagatakse algne pilt blokkidesse ning arvutatakse iga bloki entroopia. Kõikide blokkide keskmine entroopia väärtus valitakse künniseks, mille järgi otsustatakse, millistesse blokkidesse vesimärk lisada. Kõik blokid, mille entroopia on väiksem kui künnis, viiakse signaali sageduse kujule kasutades Discrete Wavelet Transform algoritmi. Madala sagedusega sagedusvahemikule rakendatakse Chirp Z-Transform algoritmi ja saadud tulemusele LU-dekompositsiooni või QR-dekompositsiooni. Singular Value Decomposition meetodi rakendamisel diagonaalmaatriksile, mis saadi eelmisest sammust, saadakse iga bloki vastav väärtus. Vesimärk lisatakse pildile, liites iga bloki arvutatud väärtusele vesimärgi Singular Value Decomposition meetodi tulemused. Kirjeldatud algoritme testiti ning võrreldi teiste tavapärast ning uudsete vesimärkide lisamise tehnoloogiatega. Kvantitatiivsed ja kvalitatiivsed eksperimendid näitavad, et välja pakutud meetodid on tajumatud ning vastupidavad signaali töötlemise rünnakutele.With growth of digital media distributed over the Internet, concerns about security and piracy have emerged. The amount of digital media reproduction and tampering has brought a need for content watermarking. In this work, multiple robust watermarking algorithms are introduced. They embed watermark image into singular values of host image’s blocks with low entropy values. In proposed algorithms, host image is divided into blocks, and the entropy of each block is calculated. The average of all entropies indicates the chosen threshold value for selecting the blocks in which watermark image should be embedded. All blocks with entropy lower than the calculated threshold are decomposed into frequency subbands using discrete wavelet transform (DWT). Subsequently chirp z-transform (CZT) is applied to the low-frequency subband followed by an appropriate matrix decomposition such as lower and upper decomposition (LUD) or orthogonal-triangular decomposition (QR decomposition). By applying singular value decomposition (SVD) to diagonal matrices obtained by the aforementioned matrix decompositions, the singular values of each block are calculated. Watermark image is embedded by adding singular values of the watermark image to singular values of the low entropy blocks. Proposed algorithms are tested on many host and watermark images, and they are compared with conventional and other state-of-the-art watermarking techniques. The quantitative and qualitative experimental results are indicating that the proposed algorithms are imperceptible and robust against many signal processing attacks

Audio, Text, Image, and Video Digital Watermarking Techniques for Security of Media Digital

The proliferation of multimedia content as digital media assets, encompassing audio, text, images, and video, has led to increased risks of unauthorized usage and copyright infringement. Online piracy serves as a prominent example of such misuse. To address these challenges, watermarking techniques have been developed to protect the copyright of digital media while maintaining the integrity of the underlying content. Key characteristics evaluated in watermarking methods include capability, privacy, toughness, and invisibility, with robustness playing a crucial role. This paper presents a comparative analysis of digital watermarking methods, highlighting the superior security and effective watermark image recovery offered by singular value decomposition. The research community has shown significant interest in watermarking, resulting in the development of various methods in both the spatial and transform domains. Transform domain approaches such as Discrete Cosine Transform, Discrete Wavelet Transform, and Singular Value Decomposition, along with their interconnections, have been explored to enhance the effectiveness of digital watermarking methods

A New Double Color Image Watermarking Algorithm Based on the SVD and Arnold Scrambling

We propose a new image watermarking scheme based on the real SVD and Arnold scrambling to embed a color watermarking image into a color host image. Before embedding watermark, the color watermark image W with size of M×M is scrambled by Arnold transformation to obtain a meaningless image W~. Then, the color host image A with size of N×N is divided into nonoverlapping N/M×N/M pixel blocks. In each (i,j) pixel block Ai,j, we form a real matrix Ci,j with the red, green, and blue components of Ai,j and perform the SVD of Ci,j. We then replace the three smallest singular values of Ci,j by the red, green, and blue values of W~ij with scaling factor, to form a new watermarked host image A~ij. With the reserve procedure, we can extract the watermark from the watermarked host image. In the process of the algorithm, we only need to perform real number algebra operations, which have very low computational complexity and are more effective than the one using the quaternion SVD of color image