A Blind Print-Recapture Robust Watermark Scheme by Calculating Self-Convolution

A Blind Print-Recapture Robust Watermark Scheme by Calculating Self-Convolution

Mengmeng Zhang (Beijing Key Laboratory of Advanced Information Science and Network Technology, Beijing Jiaotong Univ, Beijing, China), Rongrong Ni (Beijing Key Laboratory of Advanced Information Science and Network Technology, Beijing Jiaotong Univ, Beijing, China) and Yao Zhao (Beijing Key Laboratory of Advanced Information Science and Network Technology, Beijing Jiaotong Univ, Beijing, China)
Copyright: © 2019 |Pages: 22
DOI: 10.4018/IJDCF.2019100103

Abstract

A blind print-recapture robust watermark scheme is proposed. Watermark patterns are embedded into the space domain of a color image and can be detected from a print-recaptured version of the image without knowledge of the original image. The process of embedding invisible watermarks to convert RGB color images to CIE Lab color spaces and embed periodic watermarks in both color channels at the same time. Watermark extraction is achieved by calculating self-convolution and inverting the geometric transformation such as rotation and scale. Normalized correlation coefficients between the extracted and the embedded watermark pattern is calculated to determine whether there is watermark. The decision about the presence/absence of the watermark pattern is then determined by a threshold which is set 0.13, and the detection rate of 241 pictures is about 0.79.
Article Preview
Top

This chapter introduces related work from two aspects. First review some papers about print-scan watermark scheme. Then make a description of several watermark synchronization schemes that are common used.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 12: 4 Issues (2020): 1 Released, 3 Forthcoming
Volume 11: 4 Issues (2019)
Volume 10: 4 Issues (2018)
Volume 9: 4 Issues (2017)
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing