Abstract
This article aims at lightweight, blind detection of additive spread-spectrum watermarks in the DWT domain. We focus on two host signal noise models and two types of hypothesis tests for watermark detection. As a crucial point of our work we take a closer look at the computational requirements of watermark detectors. This involves the computation of the detection response, parameter estimation and threshold selection. We show that by switching to approximate host signal parameter estimates or even fixed parameter settings we achieve a remarkable improvement in runtime performance without sacrificing detection performance. Our experimental results on a large number of images confirm the assumption that there is not necessarily a tradeoff between computation time and detection performance.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
