TY - JOUR
T1 - A message-passing approach to combating desynchronization attacks
AU - Sadasivam, Shankar
AU - Moulin, Pierre
AU - Coleman, Todd P.
N1 - Funding Information:
Manuscript received April 15, 2010; revised January 06, 2011; accepted February 14, 2011. Date of publication March 17, 2011; date of current version August 17, 2011. This work was supported by NSF Grant CCF 07-29061. This work was presented in part at the International Conference on Image Processing, San Antonio, TX, in September 2007, and in Cairo, Egypt, in November 2009. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Fernando Perez-Gonzalez.
PY - 2011/9
Y1 - 2011/9
N2 - 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.
AB - 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.
KW - Blind watermark decoding
KW - Forney factor graphs
KW - Markov random fields
KW - data hiding
KW - desynchronization attacks
KW - graphical models
KW - joint estimator-detector
KW - message passing
KW - quantization index modulation (QIM)
UR - http://www.scopus.com/inward/record.url?scp=80051761553&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80051761553&partnerID=8YFLogxK
U2 - 10.1109/TIFS.2011.2129511
DO - 10.1109/TIFS.2011.2129511
M3 - Article
AN - SCOPUS:80051761553
SN - 1556-6013
VL - 6
SP - 894
EP - 905
JO - IEEE Transactions on Information Forensics and Security
JF - IEEE Transactions on Information Forensics and Security
IS - 3 PART 2
M1 - 5734843
ER -