Copyright protection for the electronic distribution of text documents

Brassil, Jack; Low, Steven H.; Maxemchuk, Nicholas F.

doi:10.1109/5.771071

Cited by 288 publications

(139 citation statements)

References 14 publications

Supporting

Mentioning

135

Contrasting

Unclassified

Order By: Relevance

“…After rotation normalization in the preshape space, the Procrustes distance [8], as shown in Fig. 2 between a database segment in the i th data slot and the input configuration si is given by dP (vi,j, si) = ||zi,j − vi,j|| 2 …”

Section: Procrustes Distance Calculationmentioning

confidence: 99%

“…To make the embedding unobtrusive, these changes are necessarily very light and thus may not survive photocopying. Methods to embed data by modulating the distance between successive lines of text [2] or words [3] are robust to noise but have very low embedding capacity because the modifications become very obtrusive at high embedding rates. Message bits can also be embedded into individual text characters by modulating their grayscale values or halftone patterns [4].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Hiding information inside structured shapes

Das

Rane²,

Vetro³

2010

2010 IEEE International Conference on Acoustics, Speech and Signal Processing

View full text Add to dashboard Cite

This paper describes a new technique for embedding a message within structured shapes. It is desired that my changes in the shape owing to the embedded message are invisible to a casual observer but detectable by a specialized decoder. The message embedding algorithm represents shape outline as a set of cubic Bezier curves and straight line segments. By slightly perturbing the Bezier curves, a single shape can spawn a library of similar-looking shapes each corresponding to a unique message. This library is efficiently stored using Adaptively Sampled Distance Fields (ADFs) which also facilitate rendering of the modified shapes at the desired resolution and fidelity. Given any modified shape, a forensic detector applies Procrustes analysis to determine the embedded message. Results of an extensive subjective test confirm that the shape modifications are indeed unobtrusive. Further, to test the recovery of the message bits in noisy physical environments, a text document is put through a print-photocopy-scan process. Message recovery is found to be stable even after multiple rounds of photocopying. IEEE International Conference on Acoustics, Speech and Signal ProcessingThis work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole or in part without payment of fee is granted for nonprofit educational and research purposes provided that all such whole or partial copies include the following: a notice that such copying is by permission of Mitsubishi Electric Research Laboratories, Inc.; an acknowledgment of the authors and individual contributions to the work; and all applicable portions of the copyright notice. Copying, reproduction, or republishing for any other purpose shall require a license with payment of fee to Mitsubishi Electric Research Laboratories, Inc. All rights reserved. ABSTRACT This paper describes a new technique for embedding a message within structured shapes. It is desired that any changes in the shape owing to the embedded message are invisible to a casual observer but detectable by a specialized decoder. The message embedding algorithm represents shape outlines as a set of cubic Bezier curves and straight line segments. By slightly perturbing the Bezier curves, a single shape can spawn a library of similar-looking shapes each corresponding to a unique message. This library is efficiently stored using Adaptively Sampled Distance Fields (ADFs) which also facilitate rendering of the modified shapes at the desired resolution and fidelity. Given any modified shape, a forensic detector applies Procrustes analysis to determine the embedded message. Results of an extensive subjective test confirm that the shape modifications are indeed unobtrusive. Further, to test the recovery of the message bits in noisy physical environments, a text document is put through a print-photocopy-scan process. Message recovery is found to be stable even after multiple rounds of photocopying.

show abstract

Section: Procrustes Distance Calculationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Hiding information inside structured shapes

Das

Rane²,

Vetro³

2010

2010 IEEE International Conference on Acoustics, Speech and Signal Processing

View full text Add to dashboard Cite

show abstract

“…Researchers have studied various image features, which can be modified for localization and avoid destroy the original image. Mici et al [7] in 2005 and Brassil et al [8] in 1999 studied the copyright protection and provided methods of digital watermarking on binary images. They adjusted the space between lines and words.…”

Section: Introductionmentioning

confidence: 99%

Forgery detection using chaotic watermarking in image key areas

2017

View full text Add to dashboard Cite

Preliminary communicationIn this paper we study watermarking algorithm for compressed images in the application of antiforgery in financial bills. First, the basic watermarking algorithm based on image edge information is studied. The encrypted watermark is converted into binary values and embedded into the edges, meanwhile the original edge shape is preserved from noticeable destruction. Second, the flip-invariant SIFT features are used to localize the key content area like digits and letters in the image. Third, Tent map and a hash function is used to further protect the secrete watermark. The property of Tent map ensured the sensitivity towards changes in the initial value. Therefore we can better protect and encrypt the original watermark. The operations performing on the binary coded image are based on the encryption sequences generated from chaotic map. Different operations are chosen to generate robust encrypted watermark. Finally, we verify our algorithm in antiforgery detection. The sensitivity towards secrete key values is further investigated. The proposed system is sensitive to the key values, hence it effectively protects the watermark from attack. The computational cost is also measured for practical application of the chaotic watermarking. Experimental results show that the proposed method is reliably efficient. Keywords: antiforgery; binary image; chaotic system; digital watermark Otkrivanje falsifikata pomoću kaotičnog vodenog žiga u ključnim dijelovima slikePrethodno priopćenje U radu proučavamo algoritam za nanošenje vodenog žiga na komprimiranim slikama u primjeni protiv falsifikata na novčanicama. Najprije se proučava osnovni algoritam za nanošenje vodenog žiga na osnovu informacije o rubu slike. Šifrirani vodeni žig se pretvara u binarne vrijednosti i ugrađuje u rubove, a u međuvremenu se originalni oblik ruba štiti od vidljivog uništenja. Zatim se uz pomoć flip-invariantnih SIFT karakteristika lokalizira ključno područje sadržaja poput brojki i slova na slici. Treće, primjenjuju se Tent mapa i hash funkcija u daljnjoj zaštiti tajnog vodenog žiga. Svojstvo Tent mape osiguralo je osjetljivost na promjene u početnoj vrijednosti. Stoga možemo bolje zaštititi i prikriti originalni vodeni žig. Izvršenje operacija na binarno kodiranoj slici zasniva se na kodiranim nizovima dobivenim iz kaotične mape. Odabrane su razne operacije kako bi se generirao robustni prikriveni vodeni žig. Konačno smo verificirali naš algoritam u otkrivanju falsifikata. Istraživala se i osjetljivost prema tajnim ključnim vrijednostima. Predloženi je sustav osjetljiv na ključne vrijednosti pa učinkovito štiti vodeni žig od napada. Trošak izračuna se također mjerio u praktičnoj primjeni kaotičkog vodenog žiga. Eksperimentalni rezultati pokazuju da je predložena metoda pouzdano učinkovita.

show abstract

“…The format-based methods always hide message by character spaces assignment, line shifting and word shifting [1], changing font format in compound documents or some sole characteristics in specific documents [2]. Linguistic steganography referred to natural language steganogra- phy [3], mainly uses mimicking techniques to directly generate a new cover text [4], or linguistically modifies content of cover text by synonym substitution (SS) [5]- [11], syntactic transformation [12], [13], or translation [14], [15] to camouflage the secret message.…”

Section: Introductionmentioning

confidence: 99%

A Novel Linguistic Steganography Based on Synonym Run-Length Encoding

Xiang

Wang

Yang

et al. 2017

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARY In order to prevent the synonym substitution breaking the balance among frequencies of synonyms and improve the statistical undetectability, this paper proposed a novel linguistic steganography based on synonym run-length encoding. Firstly, taking the relative word frequency into account, the synonyms appeared in the text are digitized into binary values and expressed in the form of runs. Then, message are embedded into the parities of runs' lengths by self-adaptively making a positive or negative synonym transformation on boundary elements of two adjacent runs, while preserving the number of relative high and low frequency synonyms to reduce the embedding distortion. Experimental results have shown that the proposed synonym run-length encoding based linguistic steganographic algorithm makes fewer changes on the statistical characteristics of cover texts than other algorithms, and enhances the capability of anti-steganalysis.

show abstract

Copyright protection for the electronic distribution of text documents

Cited by 288 publications

References 14 publications

Hiding information inside structured shapes

Hiding information inside structured shapes

Forgery detection using chaotic watermarking in image key areas

A Novel Linguistic Steganography Based on Synonym Run-Length Encoding

Contact Info

Product

Resources

About