Reversible Data Hiding and Reversible Authentication Watermarking for Binary Images

Pamboukian, Sergio Vicente Denser; Kim, Hae Yong

doi:10.14209/jcis.2008.4

Cited by 5 publications

(10 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The decoding process nonetheless ends up with incorrect extraction of two bits "00". This problem was also identified by other literatures [12]. As for the RATC scheme, a 3 × 3 block is adopted as the basic unit of operation.…”

Section: Related Workmentioning

confidence: 87%

“…One of them was proposed by Tsai et al [14] in 2005 using pair-wise logical computation (PWLC) approach. The other one was presented by Pamboukian et al [12] in 2006 by way of template ranking with symmetrical central pixels (RATC). Despite their pioneering work, close examines of these two schemes reveal some deficiencies in certain cases, which hinder the watermarked binary images from full recovery.…”

Section: Related Workmentioning

confidence: 99%

“…It can always be identified after watermarking. Comparing with other schemes such as template-comparison [12] and block-shuffling [18], DPB approach is much simpler and more efficient. As mentioned, there are a total of 6 different patterns of DPBs.…”

Section: × 2 Dual-pair Block (Dpb)mentioning

confidence: 99%

“…n ≥ n hd + n SHC + n au (12) For n hd = 9 and n au ≈ 60 , plus the information needed for the Huffman coding tables, the saving from the compression should be around 180 DPBs. In our experiments, a DPB set of size n greater than 1000 is sufficient for the purpose.…”

Section: Senary Huffman Compression Authentication (Shca) Watermarkinmentioning

confidence: 99%

See 3 more Smart Citations

NovelWatermarking Authentication Schemes for Binary Images Based on Dual-Pair Block Pixel Patterns

Wang

Chang

2009

Fundamenta Informaticae

View full text Add to dashboard Cite

In this paper, watermarking authentication schemes for binary images are investigated. Dual-Pair Blocks (DPBs), 2 × 2 blocks with two black and two white pixels, are employed as the basic units of information embedding. With 6 distinctive patterns obtained by pixel patterns, a DPB can be represented by a senary value as the embedding information. Variable length coding is adopted to enhance the information embedding capacity of the DPB. The secret key of the watermarking is a pseudo random function with a seed value, which selects DPBs for information embedding. Based on the aforementioned framework, two novel watermarking schemes are presented. The first one, named dual-pair block authentication (DPBA), is an irreversible one featuring high information embedding capacity, and well visual quality. The second scheme, named senary Huffman compression authentication (SHCA) scheme, supports reversible watermarking unique in the literature. Matching-pair technique is further employed both schemes to reduce the number of altered bits after watermarking for better visual quality. Experimental results show that, the DPBA scheme has the highest information embedding capacity on all comparing schemes. The average compression ratio of the reversible SHCA scheme is up to 38.96%. The average distortion rates per accessed DPB for the proposed DPBA and SHCA schemes are 0.485 and 0.46, respectively.

show abstract

Section: Related Workmentioning

confidence: 87%

Section: Related Workmentioning

confidence: 99%

Section: × 2 Dual-pair Block (Dpb)mentioning

confidence: 99%

Section: Senary Huffman Compression Authentication (Shca) Watermarkinmentioning

confidence: 99%

See 2 more Smart Citations

NovelWatermarking Authentication Schemes for Binary Images Based on Dual-Pair Block Pixel Patterns

Wang

Chang

2009

Fundamenta Informaticae

View full text Add to dashboard Cite

show abstract

“…Another algorithm focused on this concept was previously proposed by (Pamboukian and Kim, 2006). In this approach a reversible data hiding method was proposed for binary images and applied in text.…”

Section: Reversible Vs Irreversible Watermarkingmentioning

confidence: 99%

State-of-the-Art in Techniques of Text Digital Watermarking: Challenges and Limitations

Al-Maweri¹,

Ali²,

Adnan³

et al. 2016

Journal of Computer Science

View full text Add to dashboard Cite

Data protection from malicious attacks and misuse has become a crucial issue. Various types of data, including images, videos, audio and text documents, have given cause for the development of different methods for their protection. Cryptography, digital signatures and steganography are the most well known technologies used to protect data. During the last decade, digital watermarking technology has also been utilized as an alternative to prevent media forgery and tampering or falsification to ensure both copyright and authentication. Much work has been done to protect images, videos and audio but only a few algorithms have been considered for text document protection with digital watermarking. However, our survey observed that available text watermarking algorithms are neither robust nor imperceptible and as such remain unsecured methods of protection. Hence, research to improve the performance of text watermarking algorithms is required. This paper reviews current watermarking algorithms for text documents and categorizes text watermarking methods based on the way the text was treated during the watermarking process. It also discusses merits and demerits of available methods as well as recent proposed methods for evaluating text watermarking systems and the need for further research on digital text watermarking.

show abstract

Performance evaluation of spread spectrum watermarking using error control coding

Das

Mankar

Sarkar

2007

IET-UK International Conference on Information and Communication Technology in Electrical Sciences (ICTES 2007)

View full text Add to dashboard Cite

This paper proposes an oblivious watermarking algorithm with blind detection approach for high volume data hiding in image signals. We present a detection reliable signal adaptive embedding scheme for multiple messages in selective sub-bands of wavelet (DWT) coefficients using direct sequence spread spectrum (DS-SS) modulation technique. Here the impact of volumetric distortion sources is analyzed on the ability of analytical bounds in order to recover the watermark messages. In this context, the joint source-channel coding scheme has been employed to obtain the better control of the system robustness. This structure prevents the desynchronisation between encoder and decoder due to selective embedding. The experimental results obtained for Spread Spectrum (SS) transformed domain watermarking demonstrate the efficiency of the proposed system. This algorithmic architecture utilizes the existing allocated bandwidth in the data transmission channel in a more efficient manner.

show abstract

Reversible Data Hiding and Reversible Authentication Watermarking for Binary Images

Cited by 5 publications

References 6 publications

NovelWatermarking Authentication Schemes for Binary Images Based on Dual-Pair Block Pixel Patterns

NovelWatermarking Authentication Schemes for Binary Images Based on Dual-Pair Block Pixel Patterns

State-of-the-Art in Techniques of Text Digital Watermarking: Challenges and Limitations

Performance evaluation of spread spectrum watermarking using error control coding

Contact Info

Product

Resources

About