We present standards-compliant visible watermarking schemes for digital images and video in DCT-based compressed formats. The watermarked data is in the same compressed format as the original and can be viewed with standard tools and applications. Moreover, for most of the schemes presented, the watermarked data has exactly the same compressed size as the original. The watermark can be inserted and removed using a key for applications requiring content protection. The watermark application and removal algorithms are very efficient and exploit some features of compressed data formats (such as JPEG and MPEG) which allow most of the work to be done in the compressed domain.
Runlength encoding is used in image and video compression methods to efficiently store quantized Discrete Cosine Transform coefficients. The coefficients for each block are scanned in a zig-zag fashion, and runs of zeros are entropy coded. In this paper we present a comparison of the bit-rate resulting from runlength encoding with the bit-rate calculated as the coefficient-wise sum of entropies. Our experiments with several images show that the two are very close in practice. This is a useful result, for example, for designing quantization matrices to meet any bit-rate requirement. We also present an analytical framework to study these bit- rates. We consider two variants of runlength encoding. In the first one, the symbols that are entropy-coded are (runlength, value) pairs. In the second variant, which is the one used in JPEG, values are grouped together into categories based on magnitude.
Fractal compression has not lived up to its promise as a high-quality low bit-rate image compression scheme. The existing algorithms for finding self-mapping contractive transforms for images are computationally expensive and offer a poor rate-quality tradeoff. In this paper we explore the error images resulting from a simple fractal compression scheme. We use a set of fractal maps as a predictor for the image, and store the error-image using the Discrete Cosine Transform (DCT). Our experiments show that such a composite scheme has worse rate-quality tradeoff than DCT alone.
Conference Committee Involvement (2)
Visual Communications and Image Processing 2004
20 January 2004 | San Jose, California, United States
Image and Video Communications and Processing 2003
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.