High capacity blind information hiding schemes using Tchebichef moments

Elshoura, S. M.; Megherbi, Dalila B.

doi:10.1109/icfcc.2010.5497707

Cited by 7 publications

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hong mei wang et al, [16] proposed a triangular algorithm of image hiding which is of higher security and lower distortion y exploring the differences between the blocks of cover image and secret image. Elshoura and Megharbi [17] presented an information can be hidden in gray level images with high transparency using tchebichef moments. A water mark image for hidden data authentication and tampering localization purpose.…”

Section: Literature Surveymentioning

confidence: 99%

Hybrid Domain in LSB Steganography

Kumar¹,

Raja²,

Pattnaik³

2011

IJCA

View full text Add to dashboard Cite

The maintenance of privacy and secrecy of information in modern communication is accomplished through steganographic technique. Spatial domain techniques are popular ones in image steganography. In this paper, we propose hybrid steganography (HDLS) which is an integration of both spatial and transform domains. The cover image as well as the payload is divided into two cells each. The RGB components of cover image cell I are separated and then transformed individually from spatial to transform domain using DCT/DWT/FFT and embedded in a special manner, the components of cell II retained in spatial domain itself. The proposed algorithm has better PSNR and security as compared to existing techniques.

show abstract

Section: Literature Surveymentioning

confidence: 99%

Hybrid Domain in LSB Steganography

Kumar¹,

Raja²,

Pattnaik³

2011

IJCA

View full text Add to dashboard Cite

show abstract

“…DTT has an advantage in reducing code complexity and memory requirements for computation, thus speeding up the transformation calculation process [21][22][23], besides many similarities property with the DCT [9,24]. DTT can also be implemented in image watermarking [25]. DTT is not a new algorithm as well as DCT, it is just that the use of DTT in watermarking on images is not as popular as DCT.…”

Section: Introductionmentioning

confidence: 99%

Image watermarking using discrete wavelet-tchebichef transform

Setyono

Setiadi

2019

IJEECS

View full text Add to dashboard Cite

<span>Image watermarking is one of the most popular techniques for authenticating copyright on the digital image. Many research on image watermarking has proved that the joint of Discrete Cosine Transform (DCT) and Discrete Wavelet Transform (DWT) combinations can improve both imperceptibility and robustness when compared to DCT or DWT only. Discrete Tchebichef Transform (DTT) denotes an alternative transformation that has a similarity property with DCT. DTT has an advantage in reducing memory requirements during computing, so the calculation speed is much faster than DCT. This study tested the performance of DTT and DCT on non-blind image watermarking method, where DTT and DCT are performed after DWT. Based on the experimental results, this research proved that the DTT was combined successfully with DWT and very potential for further investigation because it has a computing performance much better than DCT. While the image watermarking quality, both the imperceptibility and robustness aspects were completely identical with the combination of DCT and DWT transformation.</span>

show abstract

“…In steganography field, there are a couple of contributions that use orthogonal moments. Elshoura and Megherbi [18] proposed two high capacity information hiding schemes in the frequency domain, in which large amounts of information can be hidden in gray level images with high transparency using Tchebichef moments. Whereas in [19], the authors presented a secure high capacity image information hiding scheme where two completely separate arbitrary full-scale gray level images, one hidden information image and one authentication watermark image are embedded hidden in the Tchebichef moments of a carrier image with very high imperceptibility.…”

Section: Introductionmentioning

confidence: 99%

Hiding data inside images using orthogonal moments

Soria-Lorente¹,

Berres²,

Avila-Domenech³

2019

Preprint

View full text Add to dashboard Cite

In this contribution we propose a novel steganographic method based on several orthogonal polynomials and their combinations. The steganographic algorithm embeds a secrete message at the first eight coefficients of high frequency image. Moreover, this embedding method uses the Beta chaotic map to determine the order of the blocks where the secret bits will be inserted. In addition, from a 128-bit private key and the steps of a cryptography algorithm according to the Advanced Encryption Standard (AES) to generate the key expansion, the proposed method generates a key expansion of 2560 bits, with the purpose to permute the first eight coefficients of high frequency before the insertion. The insertion takes eventually place at the first eight high frequency coefficients in the transformed orthogonal moments domain. Before the insertion of the message the image undergoes a series of transformations. After the insertion the inverse transformations are applied to the original transformations in reverse order. The experimental work on the validation of the algorithm consists of the calculation of the Peak Signal-to-Noise Ratio (PSNR), the Universal Image Quality Index (UIQI), the Image Fidelity (IF), and the Relative Entropy (RE), comparing the same characteristics for the cover and stego image. The proposed algorithm improves the level of imperceptibility and security analyzed through the PSNR and RE values, respectively.

show abstract

High capacity blind information hiding schemes using Tchebichef moments

Cited by 7 publications

References 8 publications

Hybrid Domain in LSB Steganography

Hybrid Domain in LSB Steganography

Image watermarking using discrete wavelet-tchebichef transform

Hiding data inside images using orthogonal moments

Contact Info

Product

Resources

About