High capacity data hiding scheme based on multi-bit encoding function

Kuo, Way; Kuo, Shao-Hung; Wang, Chuncheng; Wuu, Lih‐Chyau

doi:10.1016/j.ijleo.2015.08.056

Cited by 28 publications

(10 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here, we consider the efficiency of a data hiding scheme to be based on two main factors, those are embedding capacity of the cover image and quality of its stego image [15,18,29]. Our schemes are the near optimal data hiding scheme (2,9,8) for gray and palette images with q color = 3, and the optimal data hiding scheme (1, 2 1, ) n n − for palette images with q color = 1.…”

Section: Resultsmentioning

confidence: 99%

“…where ( , ), ( , ), ( , ), ( , ), ( , ) B i j G i j R i j B i j G i j ′ ′ and ( , ) R i j ′ are the color value of the Blue, Green and Red components of a pixel at position ( , ) i j in the cover and stego image, respectively. For human's eyes, the threshold value of PSNR value is 30dB [8,15,18,29], it means that the PSNR value is higher than 30dB, it is hard to distinguish between the cover image and its stego image.…”

Section: Resultsmentioning

confidence: 99%

“…In addition to the three main factors, speed of the embedding and extracting functions also plays an important role in steganographic schemes. It is considered as a last constraint to determine efficiency of schemes [11,15,18,20,24,29].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A New Digital Image Steganography Approach Based on The Galois Field GF(pm) Using Graph and Auto

2019

KSII TIIS

View full text Add to dashboard Cite

In this paper, we introduce concepts of optimal and near optimal secret data hiding schemes. We present a new digital image steganography approach based on the Galois field () m GF p using graph and automata to design the data hiding scheme of the general form 2 (, , log) mn k N p     for binary, gray and palette images with the given assumptions, where , , , k m n N are positive integers and p is prime, show the sufficient conditions for the existence and prove the existence of some optimal and near optimal secret data hiding schemes. These results are derived from the concept of the maximal secret data ratio of embedded bits, the module approach and the fastest optimal parity assignment method proposed by Huy et al. in 2011 and 2013. An application of the schemes to the process of hiding a finite sequence of secret data in an image is also considered. Security analyses and experimental results confirm that our approach can create steganographic schemes which achieve high efficiency in embedding capacity, visual quality, speed as well as security, which are key properties of steganography.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

A New Digital Image Steganography Approach Based on The Galois Field GF(pm) Using Graph and Auto

2019

KSII TIIS

View full text Add to dashboard Cite

show abstract

“…Kuo et al [20] proposed a high hiding capacity and acceptable stego-image quality steganography method based on multi-bit encoding function.…”

Section: E Kkww16 Methodsmentioning

confidence: 99%

“…A hiding method based on adaptive difference expansion is presented in [19] which has embedding capacity of 3 bpp. In 2016, Kuo et al [20] proposed a method(KKWW16) based on a multi-bit encoding function. They use a geometric series with common ratio r = 2 to generate the extraction function coefficient.…”

Section: Introductionmentioning

confidence: 99%

Modulus Calculations on Prime Number Algorithm for Information Hiding With High Comprehensive Performance

Zhang

Wang

et al. 2020

IEEE Access

View full text Add to dashboard Cite

Information hiding is an important technique for information security, which is wildly studied by researchers. Recently embedding methods are proposed in spatial, frequency and other domains. After investigating previous literatures, we find that there is still room for embedding performance improvement. Inspired by some literatures, we propose a new method (Modulus Calculations on Prime Number Algorithm, MOPNA) for embedding secret data into cover-images. The main idea of MOPNA is hiding confidential data in paired cover-pixels with modulus calculation based on weight parameters consisting of prime numbers. MOPNA improves the embedding capacity while maintaining good stego-image quality. The correctness of MOPNA method is proved by a combination of mathematical and programming proof. The experimental results prove that the proposed method has high embedding capacity and achieves better comprehensive performance than existing methods.

show abstract

Generalization of Multi-bit Encoding Function Based Data Hiding Scheme

Sanyal¹,

Jana²

2019

Computational Intelligence in Pattern Recognition

View full text Add to dashboard Cite

High capacity data hiding scheme based on multi-bit encoding function

Cited by 28 publications

References 16 publications

A New Digital Image Steganography Approach Based on The Galois Field GF(pm) Using Graph and Auto

A New Digital Image Steganography Approach Based on The Galois Field GF(pm) Using Graph and Auto

Modulus Calculations on Prime Number Algorithm for Information Hiding With High Comprehensive Performance

Generalization of Multi-bit Encoding Function Based Data Hiding Scheme

Contact Info

Product

Resources

About