Name
Abstract | ||
|---|---|---|
We propose a new paradigm for blind watermark decoding in the presence of desynchronization attacks. Employing Forney-style factor graphs to model the watermarking system, we cast the blind watermark decoding problem as a probabilistic inference problem on a graph, and solve it via message-passing. We study a wide range of moderate to strong attacks including scaling, amplitude modulation, fractional shift, arbitrary linear and shift-invariant filtering, and blockwise filtering, and show that the graph-based iterative decoders perform almost as well as if they had exact knowledge of the desynchronization attack parameters. Other desirable features of the graph-based decoders include the flexibility to adapt to other types of attacks and the ability to cope with the “curse of dimensionality” problem that seemingly results when the desynchronization parameter space has high dimensionality. These properties are unlike most blind watermark decoders proposed to date. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/TIFS.2011.2129511 | IEEE Transactions on Information Forensics and Security |
Keywords | Field | DocType |
desynchronization attack,desynchronization attacks,graph-based decoder,curse of dimensionality problem,inference mechanisms,graphical models,image watermarking,forney factor graphs,quantization index modulation (qim),probabilistic inference problem,blind watermark,employing forney-style factor graph,desynchronization parameter space,blind watermark decoding,forney-style factor graphs,message-passing approach,amplitude modulation,graph-based iterative decoder,high dimensionality,data hiding,graph theory,joint estimator-detector,message passing,combating desynchronization attacks,desynchronization attack parameter,graph-based iterative decoders,blind watermark decoding problem,markov random fields,probability,parameter space,curse of dimensionality,indexation,shift invariant,indexing terms,factor graph,graphical model,probabilistic logic | Factor graph,Graph theory,Digital watermarking,Pattern recognition,Computer science,Theoretical computer science,Watermark,Curse of dimensionality,Artificial intelligence,Decoding methods,Graphical model,Message passing | Journal |
Volume | Issue | ISSN |
6 | 3 | 1556-6013 |
Citations | PageRank | References |
7 | 0.48 | 24 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. Sadasivam | 1 | 7 | 0.48 |
| P. Moulin | 2 | 270 | 34.41 |
| T. P. Coleman | 3 | 7 | 0.48 |