Method and apparatus for digital watermarking
First Claim
1. A method for reading digital watermark data embedded in digital data contents, said method comprising the steps of:
- receiving said digital data contents;
determining threshold α
of reliability of digital watermark data which is read;
obtaining a binary distribution function F(x) which represents a probability that a number x of ‘
1’
bits or ‘
0’
bits are included in a bit sequence which is read at random from digital data contents, said binary distribution function F(x) being obtained by using a probability q of reading ‘
1’
or ‘
0’
in said bit sequence and a repeating number of embedding each bit of digital watermark data;
reading an ith digital watermark sequence of said digital watermark data from a digital watermark area of said digital data contents;
calculating the number ki of ‘
1’
or ‘
0’
included in said digital watermark sequence;
calculating a probability F(ki) by using said binary distribution function F(x); and
reconstituting ‘
1’
or ‘
0’
from ith digital watermark data wi if F(ki)>
α
, reconstituting ‘
0’
or ‘
1’
from ith digital watermark data wi if 1−
F(ki)>
α
, and determining that there is no watermark data or the presence is unknown if both of F(ki)>
α and
1−
F(ki)>
α
are not satisfied.
1 Assignment
0 Petitions
Accused Products
Abstract
A method for embedding digital watermark data in digital data contents includes the steps of obtaining a frequency coefficient of block data of digital data contents, obtaining a complexity of the block data, obtaining an amount of transformation of the frequency coefficient from the complexity and the digital watermark data, and embedding the digital watermark data by transforming the frequency coefficient. In addition, a method for reading digital watermark data includes the steps of calculating a probability of reading ‘1’ or ‘0’ in a read bit sequence by using a test method on the basis of binary distribution, determining the presence or absence of digital watermark data according to the probability, and reconstituting digital watermark data. Another method includes the steps of performing soft decision in code theory by assigning weights to the digital watermark sequence with a weighting function, and reconstituting digital watermark data.
-
Citations
32 Claims
-
1. A method for reading digital watermark data embedded in digital data contents, said method comprising the steps of:
-
receiving said digital data contents;
determining threshold α
of reliability of digital watermark data which is read;
obtaining a binary distribution function F(x) which represents a probability that a number x of ‘
1’
bits or ‘
0’
bits are included in a bit sequence which is read at random from digital data contents, said binary distribution function F(x) being obtained by using a probability q of reading ‘
1’
or ‘
0’
in said bit sequence and a repeating number of embedding each bit of digital watermark data;
reading an ith digital watermark sequence of said digital watermark data from a digital watermark area of said digital data contents;
calculating the number ki of ‘
1’
or ‘
0’
included in said digital watermark sequence;
calculating a probability F(ki) by using said binary distribution function F(x); and
reconstituting ‘
1’
or ‘
0’
from ith digital watermark data wi if F(ki)>
α
, reconstituting ‘
0’
or ‘
1’
from ith digital watermark data wi if 1−
F(ki)>
α
, and determining that there is no watermark data or the presence is unknown if both of F(ki)>
α and
1−
F(ki)>
α
are not satisfied.- View Dependent Claims (2, 5)
outputting F(ki) as reliability if said reconstituted digital watermark data wi is ‘
1’
; and
outputting 1−
F(ki) as the reliability if said reconstituted digital watermark data wi is ‘
0’
.
-
-
5. The method as claimed in claim 1, if a data sequence which is embedded as said digital watermark data is modulated by a pseudo-random sequence, said method further comprising the steps of:
-
demodulating said digital watermark sequence by said pseudo-random sequence; and
reconstituting digital watermark data from said demodulated digital watermark sequence.
-
-
3. A method for reading digital watermark data embedded in digital data contents, said method comprising the steps of:
-
receiving said digital data contents;
determining a threshold α
of reliability of digital watermark data which is read;
obtaining a binary distribution function F(x) which represents a probability that a number x of ‘
1’
bits or ‘
0’
bits are included in a bit sequence which is read at random from digital data contents, said binary distribution function F(x) being obtained by using a probability q of reading ‘
1’
or ‘
0’
in said bit sequence and a repeating number of embedding each bit of digital watermark data;
reading an ith digital watermark sequence of said digital watermark data from a digital watermark area of said digital data contents;
checking whether a probability that said digital watermark sequence is digital watermark data exceeds said threshold α
by using said binary distribution function F(x); and
reconstituting digital watermark data from said digital watermark sequence by using majority decision processing if said probability exceeds α
, and determining that there is no watermark data or the presence is unknown if said probability does not exceed α
.- View Dependent Claims (4)
-
-
6. A method for reading digital watermark data embedded in digital data contents, if a data sequence which is embedded as said digital watermark data is modulated by a pseudo-random sequence, said method comprising the steps of:
-
receiving said digital data contents;
determining a threshold α
of reliability of digital watermark data which is read;
obtaining a binary distribution function F(x) which represents a probability that a number of x of ‘
1’
bits or ‘
0’
bits are included in a bit sequence which is read at random from digital data contents, said binary distribution function F(x) being obtained by using a probability q of reading ‘
1’
or ‘
0’
in said bit sequence and a repeating number of embedding each bit of digital watermark data;
reading an ith digital watermark sequence of said digital watermark data from a digital watermark area of said digital data contents;
demodulating said digital watermark sequence by said pseudo-random sequence;
assigning ½
to said probability q;
obtaining a maximum number x0 which satisfies 0≦
F(x=x0)≦
1−
α and
a minimum number x1 which satisfies α
≦
(x=x1)≦
1;
obtaining the number ki of ‘
1’
or ‘
0’
included in said ith digital watermark sequence; and
reconstituting ith digital watermark data wi as ‘
0’
or ‘
1’
if ki≦
x0, and reconstituting said ith digital watermark data wi as ‘
1’
or ‘
0’
if ki≧
xi.
-
-
7. A method for reading digital watermark data embedded in digital data contents;
- if a data sequence which is embedded as said digital watermark data is modulated by a pseudo-random sequence, said method comprising the steps of;
receiving said digital data contents;
determining a threshold α
of reliability of digital watermark data which is read;
obtaining a binary distribution function F(x) which represents a probability that x of ‘
1’
bits or ‘
0’
bits are included in a bit sequence which is read at random from digital data contents, said binary distribution function F(x) being obtained by using a probability q of reading ‘
1’
or ‘
0’
in said bit sequence and a repeating number t of embedding each bit of digital watermark data;
reading an ith digital watermark sequence of said digital watermark data from a digital watermark area of said digital data contents;
demodulating said digital watermark sequence by said pseudo-random sequence;
assigning ½
to said probability q;
obtaining x0 or x1 which satisfies 0≦
F(x=x0)≦
1−
α
or α
≦
(x=x1)≦
1;
determining whether a value is equal to or less than x0 or equal to or more than x1, said value being a mean value of absolute values of a difference between the number of ‘
0’
or ‘
1’
included in said ith digital watermark sequence and a central value q×
t of a binary distribution;
reconstituting digital watermark data by performing majority decision processing for said ith digital watermark sequence if said value is equal to or less than x0 or equal to or more than x1; and
determining that there is no digital watermark data or the presence is unknown if said value is not equal to or less than x0 or equal to or more than x1. - View Dependent Claims (8)
calculating a value of said binary distribution function F(z), z being said mean value obtained from the number of ‘
0’
or ‘
1’
included in said ith digital watermark sequence and said central value q×
t; and
outputting said value of F(z) as reliability of digital watermark data.
- if a data sequence which is embedded as said digital watermark data is modulated by a pseudo-random sequence, said method comprising the steps of;
-
9. An apparatus for reading digital watermark data embedded in digital data contents, said apparatus comprising;
-
means for receiving said digital data contents;
means for obtaining a binary distribution function F(x) which represents a probability that a number x of ‘
1’
bits or ‘
0’
bits are included in a bit sequence which is read at random from digital data contents, said binary distribution function F(x) being obtained by using a probability q of reading ‘
1’
or ‘
0’
in said bit sequence and a repeating number of embedding each bit of digital watermark data;
means for reading an ith digital watermark sequence of said digital watermark data from a digital watermark area of said digital data contents;
means for calculating the number ki of ‘
1’
or ‘
0’
included in said digital watermark sequence;
means for calculating a probability F(ki) by using said binary distribution function F(x); and
means for reconstituting ‘
1’
or ‘
0’
from ith digital watermark data wi if F(ki)>
α
, reconstituting ‘
0’
or ‘
1’
from ith digital watermark data wi if 1−
F(ki)>
α
, and, determining that there is no watermark data or the presence is unknown if both of F(ki)>
α and
1−
F(ki)>
α
are not satisfied, α
being a threshold of reliability of digital watermark data which is read.- View Dependent Claims (10, 13)
means for outputting F(ki) as reliability if said reconstituted digital watermark data wi is ‘
1’
; and
means for outputting 1−
F(ki) as reliability if said reconstituted digital watermark data wi is ‘
0’
.
-
-
13. The apparatus as claimed in claim 9, if a data sequence which is embedded as said digital watermark data is modulated by a pseudo-random sequence, said apparatus further comprising:
-
means for demodulating said digital watermark sequence by said pseudo-random sequence; and
means for reconstituting digital watermark data from said demodulated digital watermark sequence.
-
-
11. An apparatus for reading digital watermark data embedded in digital data contents, said apparatus comprising:
-
means for receiving said digital data contents;
means for obtaining a binary distribution function F(x) which represents a probability that a number x of ‘
1’
bits or ‘
0’
bits are included in a bit sequence which is read at random from digital data contents, said binary distribution function F(x) being obtained by using a probability q of reading ‘
1’
or ‘
0’
in said bit sequence and a repeating number of embedding each bit of digital watermark data;
means for reading an ith digital watermark sequence of said digital watermark data from a digital watermark area of said digital data contents;
means for checking whether a probability that said digital watermark sequence is digital watermark data exceeds said threshold α
by using said binary distribution function F(x), α
being a threshold of reliability of digital watermark data which is read; and
means for reconstituting and generating digital watermark data from said digital watermark sequence by using majority decision processing if said probability exceeds α
, and, determining that there is no watermark data or the presence is unknown if said probability does not exceed α
.- View Dependent Claims (12)
-
-
14. An apparatus for reading digital watermark data embedded in digital data contents, if a data sequence which is embedded as said digital watermark data is modulated by a pseudo-random sequence, said apparatus comprising:
-
means for receiving said digital data contents;
means for obtaining a binary distribution function F(x) which represents a probability that a number x of ‘
1’
bits or ‘
0’
bits are included in a bit sequence which is read at random from digital data contents, said binary distribution function F(x) being obtained by using a probability q of reading ‘
1’
or ‘
0’
in said bit sequence and a repeating number of embedding each bit of digital watermark data;
means for reading an ith digital watermark sequence of said digital watermark data from a digital watermark area of said digital data contents;
means for demodulating said digital watermark sequence by said pseudo-random sequence;
means for assigning ½
to said probability q;
means for obtaining a maximum number x0 which satisfies 0≦
F(x=x0)≦
1−
α and
a minimum number x1 which satisfies α
≦
F(x=x1)≦
1, α
being a threshold of reliability of digital watermark data which is read;
means for obtaining the number ki of ‘
1’
or ‘
0’
included in said ith digital watermark sequence; and
means for reconstituting ith digital watermark data wi as ‘
0’
or ‘
1’
if ki≦
x0, and, reconstituting said ith digital watermark data wi as ‘
1’
or ‘
0’
if ki≧
x1.
-
-
15. An apparatus for reading digital watermark data embedded in digital data contents:
- , if a data sequence which is embedded as said digital watermark data is modulated by a pseudo-random sequence, said apparatus comprising;
means for receiving said digital data contents;
means for obtaining a binary distribution function F(x) which represents a probability that a number x of ‘
1’
bits or ‘
0’
bits are included in a bit sequence which is read at random from digital data contents, said binary distribution function F(x) being obtained by using a probability q of reading ‘
1’
or ‘
0’
in said bit sequence and a repeating number t of embedding each bit of digital watermark data;
means for reading an ith digital watermark sequence of said digital watermark data from a digital watermark area of said digital data contents;
means for demodulating said digital watermark sequence by said pseudo-random sequence;
means for assigning ½
to said probability q;
means for obtaining x0 or x1 which satisfies 0≦
F(x=x0)≦
1−
α
or α
≦
F(x=x1)≦
1, α
being a threshold of reliability of digital watermark data which is read;
means for determining whether a value is equal to or less than x0 or equal to or more than x1, said value being a mean value of absolute values of a difference between the number of ‘
0’
or ‘
1’
included in said ith digital watermark sequence and a central value q×
t of a binary distribution;
means for reconstituting digital watermark data by performing majority decision processing for said ith digital watermark sequence if said value is equal to or less than x0 or equal to or more than x1; and
means for determining that there is no digital watermark data or the presence is unknown if said value is not equal to or less than x0 or equal to or more than x1. - View Dependent Claims (16)
means for calculating a value of said binary distribution function F(z), z being said mean value obtained from the number of ‘
0’
or ‘
1’
included in said ith digital watermark sequence and said central value q×
t; and
means for outputting said value of F(z) as reliability of digital watermark data.
- , if a data sequence which is embedded as said digital watermark data is modulated by a pseudo-random sequence, said apparatus comprising;
-
17. An integrated circuit for reading digital watermark data embedded in digital data contents, said integrated circuit comprising:
-
means for receiving said digital data contents;
means for obtaining a binary distribution function F(x) which represents a probability that a number x of ‘
1’
bits or ‘
0’
bits are included in a bit sequence which is read at random from digital data contents, said binary distribution function F(x) being obtained by using a probability q of reading ‘
1’
or ‘
0’
in said bit sequence and a repeating number of embedding each bit of digital watermark data;
means for reading an ith digital watermark sequence of said digital watermark data from a digital watermark area of said digital data contents;
means for calculating the number ki of ‘
1’
or ‘
0’
included in said digital watermark sequence;
means for calculating a probability F(ki) by using said binary distribution function F(x); and
means for reconstituting ‘
1’
or ‘
0’
from ith digital watermark data wi if F(ki)>
α
, reconstituting ‘
0’
or ‘
1’
from ith digital watermark data wi if 1−
F(ki)>
α
, and determining that there is no watermark data or the presence is unknown if both of F(ki)>
α and
1−
F(ki)>
α
are not satisfied, α
being a threshold of reliability of digital watermark data which is read.- View Dependent Claims (18, 21)
means for outputting F(ki) as reliability if said reconstituted digital watermark data wi is ‘
1’
; and
means for outputting 1−
F(ki) as reliability if said reconstituted digital watermark data wi is ‘
0’
.
-
-
21. The integrated circuit as claimed in claim 17, if a data sequence which is embedded as said digital watermark data is modulated by a pseudo-random sequence, said integrated circuit further comprising:
-
means for demodulating said digital watermark sequence by said pseudo-random sequence; and
means for reconstituting digital watermark data from said demodulated digital watermark sequence.
-
-
19. An integrated circuit for reading digital watermark data embedded in digital data contents, said integrated circuit comprising:
-
means for receiving said digital data contents;
means for obtaining a binary distribution function F(x) which represents a probability that a number of x of ‘
1’
bits or ‘
0’
bits are included in a bit sequence which is read at random from digital data contents, said binary distribution function F(x) being obtained by using a probability q of reading ‘
1’
or ‘
0’
in said bit sequence and a repeating number of embedding each bit of digital watermark data;
means for reading an ith digital watermark sequence of said digital watermark data from a digital watermark area of said digital data contents;
means for checking whether a probability that said digital watermark sequence is digital watermark data exceeds said threshold a by using said binary distribution function F(x), α
being a threshold of reliability of digital watermark data which is read; and
means for reconstituting and generating digital watermark data from said digital watermark sequence by using majority decision processing if said probability exceeds α
, and, determining that there is no watermark data or the presence is unknown if said probability does not exceed α
.- View Dependent Claims (20)
-
-
22. An integrated circuit for reading digital watermark data embedded in digital data contents, if a data sequence which is embedded as said digital watermark data is modulated by a pseudo-random sequence, said integrated circuit comprising:
-
means for receiving said digital data contents;
means for obtaining a binary distribution function F(x) which represents a probability that a number x of ‘
1’
bits or ‘
0’
bits are included in a bit sequence which is read at random from digital data contents, said binary distribution function F(x) being obtained by using a probability q of reading ‘
1’
or ‘
0’
in said bit sequence and a repeating number of embedding each bit of digital watermark data;
means for reading an ith digital watermark sequence of said digital watermark data from a digital watermark area of said digital data contents;
means for demodulating said digital watermark sequence by said pseudo-random sequence;
means for assigning ½
to said probability q;
means for obtaining a maximum number x0 which satisfies 0≦
F(x=x0)≦
1−
α and
a minimum number x1 which satisfies a α
≦
F(x=x1)≦
1, α
being a threshold of reliability of digital watermark data which is read; and
means for obtaining the number ki of ‘
1’
or ‘
0’
included in said ith digital watermark sequence;
means for reconstituting ith digital watermark data wi as ‘
0’
or ‘
1’
if ki≦
x0, and, reconstituting said ith digital watermark data wi as ‘
1’
or ‘
0’
if ki≦
x1.
-
-
23. An integrated circuit for reading digital watermark data embedded in digital data contents, if a data sequence which is embedded as said digital watermark data is modulated by a pseudo-random sequence, said integrated circuit comprising:
-
means for receiving said digital data contents;
means for obtaining a binary distribution function F(x) which represents a probability that a number x of ‘
1’
bits or ‘
0’
bits are included in a bit sequence which is read at random from digital data contents, said binary distribution function F(x) being obtained by using a probability q of reading ‘
1’
or ‘
0’
in said bit sequence and a repeating number t of embedding each bit of digital watermark data;
means for reading an ith digital watermark sequence of said digital watermark data from a digital watermark area of said digital data contents;
means for demodulating said digital watermark sequence by said pseudo-random sequence;
means for assigning ½
to said probability q;
means for obtaining x0 or x1 which satisfies 0≦
F(x=x0)≦
1−
α
or α
≦
F(x=x1)≦
1, α
being a threshold of reliability of digital watermark data which is read;
means for determining whether a value is equal to or less than x0 or equal to or more than x1, said value being a mean value of absolute values of a difference between the number of ‘
0’
or ‘
1’
included in said ith digital watermark sequence and a central value q×
t of a binary distribution;
means for reconstituting digital watermark data by performing majority decision processing for said ith digital watermark sequence if said value is equal to or less than x0 or equal to or more than x1; and
means for determining that there is no digital watermark data or the presence is unknown if said value is not equal to or less than x0 or equal to or more than x1. - View Dependent Claims (24)
means for calculating a value of said binary distribution function F(z), z being said mean value obtained from the number of ‘
0’
or ‘
1’
included in said ith digital watermark sequence and said central value q×
t; and
means for outputting said value of F(z) as reliability of digital watermark data.
-
-
25. A computer readable medium storing program code for causing a computer system to read digital watermark data embedded in digital data contents, said computer readable medium comprising:
-
program code means for receiving said digital data contents;
program code means for obtaining a binary distribution function F(x) which represents a probability that a number x of ‘
1’
bits or ‘
0’
bits are included in a bi;
sequence which is read at random from digital data contents, said binary distribution function F(x) being obtained by using a probability a of reading ‘
1’
or ‘
0’
in said bit sequence and a repeating number of embedding each bit of digital watermark data;
program code means for reading an ith digital watermark sequence of said digital watermark data from a digital watermark area of said digital data contents;
program code means for calculating the number ki of ‘
1’
or ‘
0’
included in said digital watermark sequence; and
program code means for calculating a probability F(ki) by using said binary distribution function F(x);
program code means for reconstituting ‘
1’
or ‘
0’
from ith digital watermark data wiif F(ki)>
α
, reconstituting ‘
0’
or ‘
1’
from ith digital watermark data wi if 1−
F(ki)>
α
, and, determining that there is no watermark data or the presence is unknown if both of F(ki)>
α and
1−
F(ki)>
α
are not satisfied, α
being a threshold of reliability of digital watermark data which is read.- View Dependent Claims (26, 29)
program code means for outputting F(ki) as reliability if said reconstituted digital watermark data wi is ‘
1’
; and
program code means for outputting 1−
F(ki) as reliability if said reconstituted digital watermark data wi is ‘
0’
.
-
-
29. The computer readable medium as claimed in claim 25, if a data sequence which is embedded as said digital watermark data is modulated by a pseudo-random sequence, said computer readable medium further comprising:
-
program code means for demodulating said digital watermark sequence by said pseudo-random sequence; and
program code means for reconstituting digital watermark data from said demodulated digital watermark sequence.
-
-
27. A computer readable medium storing program code for causing a computer system to read digital watermark data embedded in digital data contents, said computer readable medium comprising:
-
program code means for receiving said digital data contents;
program code means for obtaining a binary distribution function F(x) which represents a probability that a number x of ‘
1’
bits or ‘
0’
bits are included in a bi;
sequence which is read at random from digital data contents, said binary distribution function F(x) being obtained by using a probability a of reading ‘
1’
or ‘
0’
in said bit sequence and a repeating number of embedding each bit of digital watermark data;
program code means for reading an ith digital watermark sequence of said digital watermark data from a digital watermark area of said digital data contents;
program code means for checking whether a probability that said digital watermark sequence is digital watermark data exceeds said threshold by rising said binary distribution function F(x), α
being a threshold of reliability of digital watermark data which is read; and
program code means for reconstituting and generating digital watermark data from said digital watermark sequence by using majority decision processing if said probability exceeds α
, and determining that there is no watermark data or the presence is unknown if said probability does not exceed α
.- View Dependent Claims (28)
-
-
30. A computer readable medium storing program code for causing a computer system to read digital watermark data embedded in digital data contents, if data sequence which is embedded as said digital watermark data is modulated by a pseudo-random sequence, said computer readable medium comprising:
-
program code means for receiving said digital data contents;
program code means for obtaining a binary distribution function F(x) which represents a probability that a number x of ‘
1’
bits or ‘
0’
bits are included in a bit sequence which is read at random from digital data contents, said binary distribution function F(x) being obtained by using a probability q of reading ‘
1’
or ‘
0’
in said bit sequence and a repeating number of embedding each bit of digital watermark data;
program code means for reading an ith digital watermark sequence of said digital watermark data from a digital watermark area of said digital data contents;
program code means for demodulating said digital watermark sequence by said pseudo-random sequence;
program code means for assigning ½
to said probability q;
program code means for obtaining a maximum number x0 which satisfies 0≦
F(x=x0)≦
1−
α and
a minimum number x1 which satisfies a α
≦
F(x=x1)≦
1, α
being a threshold of reliability of digital watermark data which is read; and
program code means for obtaining the number ki of ‘
1’
or ‘
0’
included in said ith digital watermark sequence;
program code means for reconstituting ith digital watermark data wi as ‘
0’
or ‘
1’
if ki≦
x0, and, reconstituting said ith digital watermark data wi as ‘
1’
or ‘
0’
if ki≦
x1.
-
-
31. A computer readable medium storing program code for causing a computer system to read digital watermark data embedded in digital data contents, if data sequence which is embedded as said digital watermark data is modulated by a pseudo-random sequence, said computer readable medium comprising:
-
program code means for receiving said digital data contents;
program code means for obtaining a binary distribution function F(x) which represents a probability that a number x of ‘
1’
bits or ‘
0’
bits are included in a bit sequence which is read at random from digital data contents, said binary distribution function F(x) being obtained by using a probability q of reading ‘
1’
or ‘
0’
in said bit sequence and a repeating number t of embedding each bit of digital watermark data;
program code means for reading an ith digital watermark sequence of said digital watermark data from a digital watermark area of said digital data contents;
program code means for demodulating said digital watermark sequence by said pseudo-random sequence;
program code means for assigning ½
to said probability q;
program code means for obtaining x0 or x1 which satisfies 0≦
F(x=x0)≦
1−
α
or α
≦
F(x=x1)≦
1, α
being a threshold of reliability of digital watermark data which is read;
program code means for determining whether a value is equal to or less than x0 or equal to or more than x1, said value being a mean value of absolute values of a difference between the number of ‘
0’
or ‘
1’
included in said ith digital watermark sequence and a central value q×
t of a binary distribution;
program code means for reconstituting digital watermark data by performing majority decision processing for said ith digital watermark sequence if said value is equal to or less than x0 or equal to or more than x1; and
program code means for determining that there is no digital watermark data or the presence is unknown if said value is not equal to or less than x0 or equal to or more than x1. - View Dependent Claims (32)
program code means for calculating a value of said binary distribution function F(z), z being said mean value obtained from the number of ‘
0’
or ‘
1’
included in said ith digital watermark sequence and said central value q×
t; and
program code means for outputting said value of F(z) as reliability of digital watermark data.
-
Specification