Name
Abstract | ||
|---|---|---|
Today, digital content distribution is already common practice for media types like audio. It is expected that in the near future, systems like Video-on-Demand will also increase in popularity. Many Digital Right Management (DRM) models exist enforcing the copyrights associated with the distributed content. We argue that a simplified model based on so-called forensic watermarks is a viable alternative approach that closely mimics the current model of physical music and video distribution by providing a reasonable compromise between the conflicting interests of consumers and content owners. In this paper, we address the forensic watermark DRM model and introduce a generalized architecture for the distribution server and the forensic watermark tracker. In this model, important attack scenarios are identified as being the `copy attack' and the watermark `rendering'. We show that it is more difficult to successfully work out these attack scenarios by (i) integrating a content identification and watermarking system and (ii) making the watermark (both the carrier signal as well as the payload) content dependent. In addition to these security aspects, we also focus on efficiency of the distribution server. By separating the computational efforts in so-called pre-coding and on-line computational phases, the required signal processing resources of the distribution server can be reduced significantly. The general architecture including security and efficiency requirements are analyzed in a practical example of Electronic Music Delivery (EMD). We show that computational complexity can be reduced up to a factor 4 compared to a straightforward approach. In practice, it means that with current state-of-the art computers (Pentium IV, 1 GHz) watermark embedding speeds of about 40 times Real Time (RT) can be achieved. In addition to the embedding architecture, we also demonstrate an efficient method for detecting watermarks in a forensic watermark tracker. Having multimedia identification fingerprints available (required for working with content-dependent watermarks), the efficiency of watermark detection can be enhanced by using them as side information. Again, in our EMD prototype, we demonstrate that (depending on the parameter settings) the detector can run up to 50 times faster than a blind detector, in which the original or the fingerprint is not available. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/s00530-005-0200-9 | Multimedia Systems |
Keywords | Field | DocType |
watermarking,signal processing,computational complexity,fingerprinting | Signal processing,Digital watermarking,Computer science,Real-time computing,Fingerprint,Watermark,Pentium,Digital content,Computational complexity theory,Payload | Journal |
Volume | Issue | ISSN |
11 | 2 | 0942-4962 |
Citations | PageRank | References |
4 | 0.76 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michiel Van Der Veen | 1 | 214 | 20.06 |
| Aweke Negash Lemma | 2 | 34 | 4.25 |
| Ton Kalker | 3 | 1203 | 140.78 |