### Abstract

Desynchronization attacks have been a particularly serious threat to watermarking applications. Therefore, there has been a concerted effort to solve this problem. It was Martin Kutter who first proposed to use watermark itself as a tool for estimating the affine transform parameters by its periodicity, what is called the "self-reference" scheme. His brilliant idea has led to many variations. This scheme is resistant to general geometric transform attacks and the "reference" is more difficult to destroy than templates. However, this scheme has some drawbacks such as relatively low capacity and high computational complexity, especially in calculating the autocorrelation function. In this paper, we propose a robust watermarking scheme particularly resilient to desynchronization attacks by embedding the watermark periodically. We solve these two problems of the "self-reference" scheme. For the problem of low channel capacity, we propose to use a finite field sequence to partition a given block and M-ary modulation. For the other problem of high computational complexity, we introduce bit-wise computations in calculating the autocorrelation function. Also, we separate the estimation of a translation factor and affine transform factors, respectively, which results in performance improvement.

Original language | English |
---|---|

Pages (from-to) | 323-333 |

Number of pages | 11 |

Journal | Proceedings of SPIE - The International Society for Optical Engineering |

Volume | 4675 |

DOIs | |

State | Published - 2002 Jan 1 |

Event | Security and Watermarking of Multimedia Contents IV - San Jose, CA, United States Duration: 2002 Jan 21 → 2002 Jan 24 |

### Fingerprint

### Keywords

- Affine transform attack
- Cropping attack
- Desynchronization attack
- Finite field sequence
- Watermarking

### Cite this

}

**Robust image watermarking scheme resilient to desynchronization attacks.** / Choi, Changryoul; Jeong, Jechang.

Research output: Contribution to journal › Conference article

TY - JOUR

T1 - Robust image watermarking scheme resilient to desynchronization attacks

AU - Choi, Changryoul

AU - Jeong, Jechang

PY - 2002/1/1

Y1 - 2002/1/1

N2 - Desynchronization attacks have been a particularly serious threat to watermarking applications. Therefore, there has been a concerted effort to solve this problem. It was Martin Kutter who first proposed to use watermark itself as a tool for estimating the affine transform parameters by its periodicity, what is called the "self-reference" scheme. His brilliant idea has led to many variations. This scheme is resistant to general geometric transform attacks and the "reference" is more difficult to destroy than templates. However, this scheme has some drawbacks such as relatively low capacity and high computational complexity, especially in calculating the autocorrelation function. In this paper, we propose a robust watermarking scheme particularly resilient to desynchronization attacks by embedding the watermark periodically. We solve these two problems of the "self-reference" scheme. For the problem of low channel capacity, we propose to use a finite field sequence to partition a given block and M-ary modulation. For the other problem of high computational complexity, we introduce bit-wise computations in calculating the autocorrelation function. Also, we separate the estimation of a translation factor and affine transform factors, respectively, which results in performance improvement.

AB - Desynchronization attacks have been a particularly serious threat to watermarking applications. Therefore, there has been a concerted effort to solve this problem. It was Martin Kutter who first proposed to use watermark itself as a tool for estimating the affine transform parameters by its periodicity, what is called the "self-reference" scheme. His brilliant idea has led to many variations. This scheme is resistant to general geometric transform attacks and the "reference" is more difficult to destroy than templates. However, this scheme has some drawbacks such as relatively low capacity and high computational complexity, especially in calculating the autocorrelation function. In this paper, we propose a robust watermarking scheme particularly resilient to desynchronization attacks by embedding the watermark periodically. We solve these two problems of the "self-reference" scheme. For the problem of low channel capacity, we propose to use a finite field sequence to partition a given block and M-ary modulation. For the other problem of high computational complexity, we introduce bit-wise computations in calculating the autocorrelation function. Also, we separate the estimation of a translation factor and affine transform factors, respectively, which results in performance improvement.

KW - Affine transform attack

KW - Cropping attack

KW - Desynchronization attack

KW - Finite field sequence

KW - Watermarking

UR - http://www.scopus.com/inward/record.url?scp=0036028615&partnerID=8YFLogxK

U2 - 10.1117/12.465290

DO - 10.1117/12.465290

M3 - Conference article

AN - SCOPUS:0036028615

VL - 4675

SP - 323

EP - 333

JO - Proceedings of SPIE - The International Society for Optical Engineering

JF - Proceedings of SPIE - The International Society for Optical Engineering

SN - 0277-786X

ER -