Method and device for processing and watermarking a set of coefficients representing a digital image

• US 6,990,213 B2
• Filed: 01/10/2002
• Issued: 01/24/2006
• Est. Priority Date: 01/10/2001
• Status: Expired due to Fees

• Current Assignee: Canon Kabushiki Kaisha (Canon Inc.)
• Original Assignee: Canon Kabushiki Kaisha (Canon Inc.)
• Inventors: Donescu, Ioana
• Primary Examiner(s): Patel, Kanjibhai
• Assistant Examiner(s): Bayat, Ali
• Application Number:
  US10/041,576
• Publication Number:
  US 20020141612A1
• Time in Patent Office: 1,475 Days
• Field of Search: 382/100, 382/232, 382/240, 358/3.28, 713/176, 713/179, 380/51, 380/54, 380/201, 380/210, 380/252, 380/287, 348/461, 348/463, 370/522, 370/523, 370524-529
• US Class Current: 382/100
• CPC Class Codes: G06T 1/0064 Geometric transfor invariant watermarking, e.g. affine transform invariant
• CPC Class Codes: G06T 2201/0052 Embedding of the watermark in the frequency domain

Abstract

The invention concerns a method of processing a set of coefficients representing a digital image (300) with a view to an insertion of at least one item of watermarking information in said image, this image being liable to undergo a set of geometric transformations and said coefficients being grouped together in regions, said method being characterized in that it includes a step (E220) of determining, amongst at least some of said regions, a set of so-called acceptable regions, adapted to receive said at least one item of watermarking information; and a step (E230) of sequencing, according to at least one predetermined criterion, at least one part of said set of acceptable regions, in an order which is invariant with respect to at least one of said geometric transformations.

Claims

1. Method of processing a set of coefficients (X_i,j) representing a digital image (300) with a view to an insertion of at least one item of watermarking information (W^r) in said image, this image being liable to undergo a set of geometric transformations and said coefficients being grouped together in regions (Bⁱ), said method being characterised in that it includes the following steps:

determining (E220), amongst at least some of said regions (Bⁱ), a set of so-called acceptable regions, adapted to receive said at least one item of watermarking information (W^r); and

sequencing (E230), according to at least one predetermined criterion, at least one part of said set of acceptable regions (Bⁱ), in an order which is invariant with respect to at least one of said geometric transformations.

2. Method according to claim 1, characterised in that said at least one part of said set of acceptable regions is sequenced, according to said at least one predetermined criterion, in an order which is invariant with respect to at least one combination of at least some of said geometric transformations.

3. Method according to claim 1 or 2, characterised in that the set of geometric transformations includes identity, rotations through 90, 180 (A20) and 270 degrees, vertical axis symmetry (A10), vertical axis symmetry (A10) followed by a rotation through 90 degrees, vertical axis symmetry followed by a rotation through 180 degrees and vertical axis symmetry followed by a rotation through 270 degrees.

4. Method according to either of claim 1 or 2, characterised in that the step (E230) of sequencing said at least one part of said set of acceptable regions (Bⁱ) is performed according to at least one predetermined geometric criterion (G_k) whose value for a set of coefficients (X_i,j) is independent of said coefficients of the image.

5. Method according to either of claim 1 or 2, characterised in that said regions (Bⁱ) of coefficients representing a digital image correspond to the frequency sub-bands of a wavelet decomposition (DWT) of said digital image.

6. Method according to claim 4, characterised in that said geometric criterion (G_k) is chosen from amongst the size of a region, its index of the resolution level, its type of sub-band and the distance from its centre to the centre of its sub-band.

7. Method according to either of claim 1 or 2, characterised in that the step (E230) of sequencing said at least one part of said set of acceptable regions (Bⁱ) is performed according to at least one predetermined criterion (S_k) whose value for a set of coefficients (X_i,j) depends on the coefficients of said set.

8. Method according to claim 7, characterised in that the step (E230) of sequencing said at least one part of said set of acceptable regions (Bⁱ) includes notably an evaluation of the values (Sⁱ_k(+1), Sⁱ_k(−

1)) which would be taken by said criterion (S_k) during the insertion of said at least one item of watermarking information (W^r).

9. Method according to claim 4, characterised in that the sequencing step (E230) is performed according to a subset of geometric criteria (G_k) before being performed according to a subset of criteria (S_k) whose value for a set of coefficients (X_i,j) depends on the coefficients of said set.

10. Method according to either of claim 1 or 2, characterised in that said acceptable regions (Bⁱ) are such that the probability of detection of said at least one item of watermarking information received by these regions is greater than a predetermined threshold.

11. Method of watermarking a set of coefficients (X_i,j) representing a digital image (300) which is liable to undergo a set of geometric transformations and said coefficients being grouped together in regions (Bⁱ), said method being characterised in that it includes the following steps:

determining (E220) a set of so-called acceptable regions (Bⁱ) and sequencing (E230), according to at least one predetermined criterion, of at least one part of said set of acceptable regions, in an order which is invariant with respect to at least one of said geometric transformations, according to claim 1; and

inserting at least one item of watermarking information (W^r), for at least certain regions of said at least one part of said set of acceptable regions, said at least one item of watermarking information (W^r) being invariant with respect to at least one of said geometric transformations.

12. Method according to claim 11, characterised in that said at least one item of watermarking information (W^r) is invariant with respect to at least one combination of at least some of said geometric transformations.

13. Method according to claim 11 or 12, characterised in that the insertion of said at least one item of watermarking information (W^r) for a region (B^r) of said one part of said set of acceptable regions corresponds to a spreading of a pseudo-random signal in all the coefficients (X_i,j) of said region.

14. Method according to claim 13, characterised in that the pseudo-random signal spread in all the coefficients of a region is dependent on said region.

15. Method according to claim 14, characterised in that it includes a step of generating the pseudo-random signal dependent on said region (B^r) using a key (K(B^r)) specific to said region (B^r) and which is dependent on a secret global key (K).

29. Programmable apparatus, characterised in that it has means adapted to implement the processing method according to claim 1.

30. Programmable apparatus, characterised in that it has means adapted to implement the watermarking method according to claim 11.

32. Information storage means, possibly totally or partially removable, which can be read by a computer or a processor containing instructions of a computer program, characterised in that it makes it possible to implement the processing method according to claim 1.

33. Information storage means, possibly totally or partially removable, which can be read by a computer or a processor containing instructions of a computer program, characterised in that it makes it possible to implement the watermarking method according to claim 11.

35. Computer program product stored on a computer readable medium which can be loaded into a programmable apparatus, containing sequences of instructions or portions of software code for implementing the steps of the processing method according to claim 1, when said computer program is executed by a programmable apparatus.

36. Computer program product stored on a computer readable medium which can be loaded into a programmable apparatus, containing sequences of instructions or portions of software code for implementing the steps of the watermarking method according to claim 11, when said computer program is executed by a programmable apparatus.

16. Method of decoding a watermarking code (C′

) obtained from at least one item of watermarking information (W′

ⁱ) inserted in a set of coefficients (X′

_i,j) representing a digital image (320), this image (320) being liable to have undergone a set of geometric transformations and said coefficients being grouped together in regions (B′

ⁱ), said method being characterised in that it includes the following steps;

determining (E720), amongst at least some of said regions (B′

ⁱ), a set of so-called acceptable regions, adapted to receive said at least one item of watermarking information (W′

ⁱ);

determining a set of so-called watermarked regions (B′

ⁱ) amongst said set of acceptable regions, said watermarked regions (B′

ⁱ) having received said at least one item of watermarking information (W′

ⁱ);

decoding (E730) said at least one item of watermarking information (W′

ⁱ) for each of said watermarked regions (B′

ⁱ);

sequencing (E740) said watermarked regions (B′

ⁱ) according to at least one predetermined criterion, in an order which is invariant with respect to at least one of said geometric transformations; and

reconstituting said watermarking code (C′

) by sequencing said watermarking information (W′

ⁱ) as a function of said sequencing of said watermarked regions.

17. Method according to claim 16, characterised in that said watermarked regions (B′

ⁱ) are sequenced, according to said at least one predetermined criterion, in an order which is invariant with respect to at least one combination of at least some of said geometric transformations.

18. Method according to claim 16 or 17, characterised in that said at least one item of watermarking information (W′

ⁱ) is invariant with respect to at least one of said geometric transformations.

19. Method according to either of claim 16 or 17, characterised in that said at least one item of watermarking information (W′

ⁱ) is invariant with respect to at least one combination of at least some of said geometric transformations.

20. Method according to either of claim 16 or 17, characterised in that said acceptable regions (B′

_i) are such that the probability of detection of said at least one item of watermarking information received by these regions is greater than a predetermined threshold.

21. Method according to either of claim 16 or 17, characterised in that said at least one item of watermarking information (W′

^r) received by a watermarked region (B′

^r) is a pseudo-random signal spread in all the coefficients (X′

_i,j) of said region.

22. Method according to claim 21, characterised in that said pseudo-random signal spread in all the coefficients of a watermarked region is dependent on said watermarked region.

31. Programmable apparatus, characterised in that it has means adapted to implement the decoding method according to claim 16.

34. Information storage means, possibly totally or partially removable, which can be read by a computer or a processor containing instructions of a computer program, characterised in that it makes it possible to implement the decoding method according to claim 16.

37. Computer program product stored on a computer readable medium which can be loaded into a programmable apparatus, containing sequences of instructions or portions of software code for implementing the steps of the decoding method according to claim 16, when said computer program is executed by a programmable apparatus.

23. Device for processing a set of coefficients (X_i,j) representing a digital image (300) with a view to an insertion of at least one item of watermarking information (W^r) in said image, this image (300) being liable to undergo a set of geometric transformations and said coefficients (X_i,j) being grouped together in regions (Bⁱ), said device being characterised in that it has:

means of determining, amongst at least some of said regions, a set of so-called acceptable regions (Bⁱ), adapted to receive said at least one item of watermarking information (W^r); and

means of sequencing, according to at least one predetermined criterion, at least one part of said set of acceptable regions (Bⁱ), in an order which is invariant with respect to at least one of said geometric transformations.

24. Processing device according to claim 23, characterised in that the determination and sequencing means are incorporated in:

a microprocessor (1001);

a read only memory (1008) containing at least one program (P1) for processing the coefficients (X_i,j); and

a random access memory (1011) containing registers adapted to record variables modified during the execution of said at least one program.

25. Device for watermarking a set of coefficients (X_i,j) representing a digital image (300) which is liable to undergo a set of geometric transformations and said coefficients (X_i,j) being grouped together in regions (Bⁱ), said device being characterised in that it has:

means of determining, from amongst at least some of said regions, a set of so-called acceptable regions (Bⁱ), adapted to receive said at least one item of watermarking information (W^r);

means of sequencing, according to at least one predetermined criterion, at least one part of said set of acceptable regions (Bⁱ), in an order which is invariant with respect to at least one of said geometric transformations; and

means of inserting at least one item of watermarking information (W^r), for at least certain regions (B^r) in said at least one part of said set of acceptable regions, said at least one item of watermarking information (W^r) being invariant with respect to at least one of said geometric transformations.

26. Watermarking device according to claim 25, characterised in that the determination, sequencing and insertion means are incorporated in:

a microprocessor (1001);

a read only memory (1008) containing at least one program (P2) for watermarking the coefficients (X_i,j); and

a random access memory (1011) containing registers adapted to record variables modified during the execution of said at least one program.

27. Device for decoding a watermarking code (C′

) consisting of at least one item of watermarking information (W′

ⁱ) inserted in a set of coefficients (X′

_i,j) representing a digital image (320), this image being liable to have undergone a set of geometric transformations and said coefficients (X′

_i,j) being grouped together in regions (B′

ⁱ), said device being characterised in that it has;

means of determining, amongst at least some of said regions, a set of so-called acceptable regions (B′

ⁱ), adapted to receive said at least one item of watermarking information (W′

ⁱ);

means of determining a set of so-called watermarked regions (B′

ⁱ) amongst said set of acceptable regions, said watermarked regions having received said at least one item of watermarking information (W′

ⁱ);

means of decoding said at least one item of watermarking information (W′

ⁱ) for each of said watermarked regions;

means of sequencing said watermarked regions (B′

ⁱ) according to at least one predetermined criterion, in an order which is invariant with respect to at least one of said geometric transformations; and

means of reconstituting said watermarking code (C′

) by sequencing the said watermarking information (W′

ⁱ) as a function of said sequencing of said watermarked regions (B′

ⁱ).

28. Device for decoding a watermarking code (C′

) according to claim 27, characterised in that the means of determining a set of so-called acceptable regions (B′

ⁱ), of determining a set of so-called watermarked regions (B′

ⁱ), of decoding and of reconstituting said watermarking code are incorporated in;

a microprocessor (1001);

a read only memory (2008) containing at least one program (P3) for decoding the watermarking code (C′

); and

a random access memory (2011) containing registers adapted to record variables modified during the execution of said at least one program.