Digital Watermarking: Third International Workshop, IWDW 2004, Seoul, Korea, October 30 - November 1, 2004, Revised Selected PapersIngemar J. Cox, Ton Kalker, Heung-Kyu Lee Springer, 2005. gada 9. febr. - 306 lappuses We are happy to present to you the proceedings of the 3rd International Workshop on Digital Watermarking, IWDW 2004. Since its modern reappearance in the academic community in the early 1990s, great progress has been made in understanding both the capabilities and the weaknesses of digital watermarking. On the theoretical side, we all are now well aware of the fact that digital watermarking is best viewed as a form of communication using side information. In the case of digital watermarking the side information in question is the document to be watermarked. This insight has led to a better understanding of the limits of the capacity and robustness of digital watermarking algorithms. It has also led to new and improved watermarking algorithms, both in terms of capacity and imperceptibility. Similarly, the role of human perception, and models thereof, has been greatly enhanced in the study and design of digital watermarking algorithms and systems. On the practical side, applications of watermarking are not yet abundant. The original euphoria on the role of digital watermarking in copy protection and copyright protection has not resulted in widespread use in practical systems. With hindsight, a number of reasons can be given for this lack of practical applications. |
No grāmatas satura
1.–5. rezultāts no 29.
3. lappuse
... marked image by subtracting the payload from the marked image, thus reversibly recovering the original image. By using modulo-256 addition, the issue of over/underflow is avoided. Here, by over/underflow, it is meant that grayscale ...
... marked image by subtracting the payload from the marked image, thus reversibly recovering the original image. By using modulo-256 addition, the issue of over/underflow is avoided. Here, by over/underflow, it is meant that grayscale ...
4. lappuse
... image block-by-block, resulting in a socalled RS-vector formed by representing, say, an R-block by binary 1 and an S ... marked image in the same manner as in the data embedding. From the resultant RS-vector, the embedded data can be ...
... image block-by-block, resulting in a socalled RS-vector formed by representing, say, an R-block by binary 1 and an S ... marked image in the same manner as in the data embedding. From the resultant RS-vector, the embedded data can be ...
7. lappuse
... image goes through JPEG compression with a high quality factor, the content of this image is considered unchanged ... marked image has not been changed at all, the hidden signature can be extracted and the original image can be recovered ...
... image goes through JPEG compression with a high quality factor, the content of this image is considered unchanged ... marked image has not been changed at all, the hidden signature can be extracted and the original image can be recovered ...
8. lappuse
... image as authentic. Obviously, if the marked image goes through a compression with the compression ratio higher than the pre-specified ratio will render the image un-authentic. Any malicious attack will render the attacked image non ...
... image as authentic. Obviously, if the marked image goes through a compression with the compression ratio higher than the pre-specified ratio will render the image un-authentic. Any malicious attack will render the attacked image non ...
14. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
Saturs
1 | |
Informed Detection Revisited | 29 |
A CounterGeometric Distortions Data Hiding Scheme Using | 42 |
A Secure InternetBased Personal Identity Verification System Using | 55 |
Watermarking System for QoS Aware Content Adaptation | 77 |
Robust Estimation of Amplitude Modification for Scalar Costa Scheme | 101 |
Reversible Data Hiding Using Integer Wavelet Transform | 115 |
Authentication and Stego | 125 |
Security of WSS Techniques | 171 |
Flaws in Generic Watermarking Protocols Based | 184 |
A Generalized Method for Constructing and Proving | 204 |
Towards the Public but Noninvertible Watermarking | 218 |
A Generalization of an Anonymous BuyerSeller Watermarking | 232 |
Watermarking Technique for Authentication of 3D Polygonal Meshes | 259 |
FidelityControlled Robustness Enhancement of Blind Watermarking | 271 |
A Video Watermarking Using the 3D Wavelet Transform | 294 |
Citi izdevumi - Skatīt visu
Digital Watermarking: Third International Workshop, IWDW 2004, Seoul, Korea ... Ingemar J. Cox Ierobežota priekšskatīšana - 2005 |
Digital Watermarking Ingemar Cox,Matthew Miller,Jeffrey Bloom,Mathew Miller Ierobežota priekšskatīšana - 2001 |
Bieži izmantoti vārdi un frāzes
affine transformation algorithm applied attacks authentication B-spline binary images bit-plane block buyer capacity coding companding compression Computer control points Costa’s cover-object cryptography define denotes detector digital watermarking distribution domain embed embedded watermark embedding pattern encrypted equation estimated experimental results extracted fingerprint frequency geometric distortions histogram I.J. Cox IEEE Image Processing imperceptibility Information Hiding invertible IWDW JPEG LNCS marked image marking frequencies matrix mesh model method modified Multimedia multiresolution analysis noninvertibility obtained optimal original image paper perceptual performance pixels polygonal mesh Proc proposed protocol PSNR quantization step random reverse engineering reversible data hiding robustness scaling Section sequence Signal Processing spatial spread spectrum Springer-Verlag steganographic termark transcoding transcoding parameter triangle verify vertex norms video transcoding visual watermark bit watermark detection watermark embedding watermark signal watermarked image watermarking algorithm watermarking scheme watermarking technique wavelet coefficient vectors wavelet transform zero-knowledge ZKWP system