EP0855681A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Method of embedding watermark-information into digital data
Assignee: NTT Inc
•
Filing: 1998-01-28
•
Granted: —
•
Expires: 2018-01-28
Abstract
Abstract An apparatus for embedding information comprises: a blocking step for dividing data to be processed into blocks; an orthogonal transform step for obtaining coefficients by carrying out orthogonal transformation for each block; an embedding coefficient selecting step for determining coefficients in which the watermark-information will be embedded by using a random sequence which is generated by initial value; an information embedding step for sequentially embedding the watermark-information, which has arbitrary length of bits, by quantizing value of said coefficients using a predetermined value for quantization; and an inverse orthogonal transform step for carrying out inverse orthogonal transformation for modified coefficients to form block in which the watermark-information is embedded, as well as combining the divided blocks and reconstructing the original form.
Inventors
- 👤 Takao Nakamura
- 👤 Yoichi Takashima
- 👤 Hiroshi Ogawa
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-09 13:50
CPC Classifications
H; H04; H04N; H04N19/00; G; G06; G06T; G06T1/00; G06T1/0021; G06T1/005; G06T1/0057; H04N1/00; H04N1/32; H04N1/32101; H04N1/32144; H04N1/32149; H04N1/32154; H04N1/32187; H04N1/32267; H04N1/32277; H04N19/46; H04N19/467; H04N21/00; H04N21/20; H04N21/23; H04N21/238; H04N21/2389; H04N21/23892; H04N21/80; H04N21/83; H04N21/835; H04N21/8358; G06T2201/00; G06T2201/005; G06T2201/0051; G06T2201/0052; G06T2201/0061; H04N2201/00; H04N2201/32; H04N2201/3201; H04N2201/3225; H04N2201/3233; H04N2201/3269; H04N2201/327
Claims Analysis
Total Claims: 65
Claim 1
Independent Claim
121 words
A method of embedding information comprising: a blocking step for dividing data to be processed into blocks; an orthogonal transform step for obtaining coefficients by carrying out orthogonal
transformation for each block; an embedding coefficient selecting step for determining coefficients in which the watermark-information
will be embedded by using a random sequence which is generated by initial value; an information embedding step for sequentially embedding the watermark-information, which
has arbitrary length of bits, by quantizing value of said coefficients using a predetermined
value for quantization; and an inverse orthogonal transform step for carrying out inverse orthogonal transformation for
modified coefficients to form block in which the watermark-information is embedded, as well
as combining the divided blocks and reconstructing the original form.
Claim 2
Dependent Claim
52 words
A method of embedding information according to claim 1, wherein in said information
embedding step, the embedding of the watermark-information is carried out by selecting a
quantization value closest to the minimum of said determined orthogonal transform coefficient,
corresponding to the bit value which becomes the object of embeding in said watermark-information.
Claim 3
Dependent Claim
60 words
A method of embedding information according to claim 1, wherein in said information
embedding step, the embedding of the watermark-information is carried out by selecting a
quantization value which is larger or smaller than said determined orthogonal transform
coefficient, in accordance with a rule which is dependant on the bit value which becomes the
object of embedding in said watermark-information.
Claim 4
Dependent Claim
48 words
A method of embedding information according to any one of claim 1 through claim 3,
wherein in said orthogonal transform step said orthogonal transform is a one dimensional
orthogonal transform, and in said inverse orthogonal transform step, said inverse orthogonal
transform is a one dimensional inverse orthogonal transform.
Claim 5
Dependent Claim
48 words
A method of embedding information according to any one of claim 1 through claim 3,
wherein in said orthogonal transform step said orthogonal transform is a two dimensional
orthogonal transform, and in said inverse orthogonal transform step, said inverse orthogonal
transform is a two dimensional inverse orthogonal transform.
Claim 6
Dependent Claim
48 words
A method of embedding information according to any one of claim 1 through claim 3,
wherein in said orthogonal transform step said orthogonal transform is a three dimensional
orthogonal transform, and in said inverse orthogonal transform step, said inverse orthogonal
transform is a three dimensional inverse orthogonal transform.
Claim 7
Dependent Claim
91 words
A method of embedding information according to any one of claim 1 through claim 3,
wherein in said orthogonal transform step, the block from said blocking step is down-sampled so that the block size is smaller, after
which the down-sampled block is orthogonally transformed to obtain the orthogonal transform
coefficient, and in said inverse orthogonal transform step, after inverse orthogonally transforming the
orthogonal transform coefficients obtained by said information embedding step, up sampling is
performed so as to give a block of the size prior to down-sampling by said blocking step.
Claim 8
Dependent Claim
85 words
A method of embedding information according to claim 4, wherein in said orthogonal
transform step, the block from said blocking step is down-sampled so that the block size is smaller, after
which the down-sampled block is orthogonally transformed to obtain the orthogonal transform
coefficient, and in said inverse orthogonal transform step, after inverse orthogonally transforming the
orthogonal transform coefficients obtained by said information embedding step, up sampling is
performed so as to give a block of the size prior to down-sampling by said blocking step.
Claim 9
Dependent Claim
85 words
A method of embedding information according to claim 5, wherein in said orthogonal
transform step, the block from said blocking step is down-sampled so that the block size is smaller, after
which the down-sampled block is orthogonally transformed to obtain the orthogonal transform
coefficient, and in said inverse orthogonal transform step, after inverse orthogonally transforming the
orthogonal transform coefficients obtained by said information embedding step, up sampling is
performed so as to give a block of the size prior to down-sampling by said blocking step.
Claim 10
Dependent Claim
85 words
A method of embedding information according to claim 6, wherein in said orthogonal
transform step, the block from said blocking step is down-sampled so that the block size is smaller, after
which the down-sampled block is orthogonally transformed to obtain the orthogonal transform
coefficient, and in said inverse orthogonal transform step, after inverse orthogonally transforming the
orthogonal transform coefficients obtained by said information embedding step, up sampling is
performed so as to give a block of the size prior to down-sampling by said blocking step.
Claim 11
Dependent Claim
39 words
A method of embedding information according to any one of claim 1 through claim 3,
wherein in said information embedding step, the entropy of the data value of the block to be
processed is utilized for said predetermined value.
Claim 12
Dependent Claim
33 words
A method of embedding information according to claim 4, wherein in said information
embedding step, the entropy of the data value of the block to be processed is utilized for said
predetermined value.
Claim 13
Dependent Claim
33 words
A method of embedding information according to claim 5, wherein in said information
embedding step, the entropy of the data value of the block to be processed is utilized for said
predetermined value.
Claim 14
Dependent Claim
33 words
A method of embedding information according to claim 6, wherein in said information
embedding step, the entropy of the data value of the block to be processed is utilized for said
predetermined value.
Claim 15
Dependent Claim
33 words
A method of embedding information according to claim 7, wherein in said information
embedding step, the entropy of the data value of the block to be processed is utilized for said
predetermined value.
Claim 16
Dependent Claim
33 words
A method of embedding information according to claim 8, wherein in said information
embedding step, the entropy of the data value of the block to be processed is utilized for said
predetermined value.
Claim 17
Dependent Claim
33 words
A method of embedding information according to claim 9, wherein in said information
embedding step, the entropy of the data value of the block to be processed is utilized for said
predetermined value.
Claim 18
Dependent Claim
33 words
A method of embedding information according to claim 10, wherein in said
information embedding step, the entropy of the data value of the block to be processed is
utilized for said predetermined value.
Claim 19
Dependent Claim
45 words
A method of embedding information according to any one of claim 1 through claim 3,
wherein in said information embedding step, a value of a low frequency domain in the
orthogonal transform coefficient obtained by said orthogonal transform step is utilized for said
predetermined value.
Claim 20
Dependent Claim
39 words
A method of embedding information according to claim 4, wherein in said information
embedding step, a value of a low frequency domain in the orthogonal transform coefficient
obtained by said orthogonal transform step is utilized for said predetermined value.
Claim 21
Dependent Claim
39 words
A method of embedding information according to claim 5, wherein in said information
embedding step, a value of a low frequency domain in the orthogonal transform coefficient
obtained by said orthogonal transform step is utilized for said predetermined value.
Claim 22
Dependent Claim
39 words
A method of embedding information according to claim 6, wherein in said information
embedding step, a value of a low frequency domain in the orthogonal transform coefficient
obtained by said orthogonal transform step is utilized for said predetermined value.
Claim 23
Dependent Claim
39 words
A method of embedding information according to claim 7, wherein in said information
embedding step, a value of a low frequency domain in the orthogonal transform coefficient
obtained by said orthogonal transform step is utilized for said predetermined value.
Claim 24
Dependent Claim
39 words
A method of embedding information according to claim 8, wherein in said information
embedding step, a value of a low frequency domain in the orthogonal transform coefficient
obtained by said orthogonal transform step is utilized for said predetermined value.
Claim 25
Dependent Claim
39 words
A method of embedding information according to claim 9, wherein in said information
embedding step, a value of a low frequency domain in the orthogonal transform coefficient
obtained by said orthogonal transform step is utilized for said predetermined value.
Claim 26
Dependent Claim
39 words
A method of embedding information according to claim 10, wherein in said
information embedding step, a value of a low frequency domain in the orthogonal transform
coefficient obtained by said orthogonal transform step is utilized for said predetermined value.
Claim 27
Dependent Claim
43 words
A method of embedding information according to any one of claim 1 through claim 3,
wherein in said information embedding step, said information embedding is sequentially performed after said watermark-information is
made into information for which error detection or error correction is possible.
Claim 28
Dependent Claim
39 words
A method of embedding information according to claim 27, wherein in said
information embedding step, discrimination information being fixed information is added to said watermark-information so
that said watermark-information is made into information for which error detection is possible.
Claim 29
Dependent Claim
55 words
A method of embedding information according to any one of claim 1 through claim 3,
wherein in said inverse orthogonal transform step, when the orthogonal transform coefficient obtained by said information embedding step is
inverse orthogonal transformed, processing is further performed so that the value after inverse
orthogonal transform does not exceed a defined range.
Claim 30
Dependent Claim
67 words
A method of embedding information according to claim 29, wherein in said inverse
orthogonal transform step, the processing so that the value after inverse orthogonal transform does not exceed a defined
range, uses the orthogonal transform coefficient obtained in said information embedding step,
and the values of the coefficients in the orthogonal transform coefficient, apart from the
coefficient which becomes the object of information embedding, are changed.
Claim 31
Dependent Claim
57 words
A method of embedding information according to claim 29, wherein in said inverse
orthogonal transform step, the processing so that the value after inverse orthogonal transform does not exceed a defined
range, uses the data obtained by said inverse orthogonal transform, and the whole data is
reduced with the mean value of the data as the center.
Claim 32
Dependent Claim
124 words
A method of embedding information according to any one of claim 1 through claim 3,
wherein a plurality of watermark-information is embedded, and in order to embed a first information, then in said blocking step, this is divided into blocks of a predetermined size, and in said
information embedding step, the first information is embedded, and in order to embed second and subsequent N information, then in said blocking step, this is divided into blocks of a different size to the block divided for
embedding from the first to the (N-1)-th information, and of a size having little influence with
each other due to the orthogonal transform and in said information embedding step, the N-the information is embedded, thereby embedding a plurality of watermark-information.
Claim 33
Dependent Claim
99 words
A method of reading information from data embedded with information by the method
according to claim 1 comprising: a blocking step for dividing said data into blocks; an embedding coefficient selecting step for determining coefficients from which the
watermark-information will be read by using a random sequence which is generated by initial
value which is used at the time of embedding the watermark-information; an object coefficient computing step for obtaining the coefficients by carry out orthogonal
transformation for each block; and a bit reading step for sequentially reading each bit of the embedded watermark-information
and outputting the read watermark-information.
Claim 34
Dependent Claim
61 words
A method of reading information according to claim 33, wherein in said bit reading
step, the reading of each bit is carried out with respect to the orthogonal transform coefficient
obtained in said object coefficient computing step, by quantization using the predetermined
value for quantization used at the time of information embedding, and using a value closest to
the quantization value.
Claim 35
Dependent Claim
55 words
A method of reading information according to claim 33, wherein in said bit reading
step, the reading of each bit is carried out using a differential value of the orthogonal transform
coefficient obtained by said object coefficient computing step, and an orthogonal transform
coefficient of the corresponding position in the data prior to information embedding.
Claim 36
Dependent Claim
48 words
A method of reading information according to any one of claim 33 to claim 35, wherein
in said object coefficient computing step, said orthogonal transform is an orthogonal transform of a dimension corresponding to the
dimension number of the orthogonal transform used at the time of information embedding.
Claim 37
Dependent Claim
64 words
A method of reading information according to any one of claim 33 to claim 35, wherein
in the case where down-sampling of the block is carried out at the time of information
embedding, then in said object coefficient computing step, an orthogonal transform coefficient is obtained
from the block which is down-sampled so that the block obtained from said blocking step is
the same.
Claim 38
Dependent Claim
58 words
A method of reading information according to claim 36, wherein in the case where
down-sampling of the block is carried out at the time of information embedding, then in said object coefficient computing step, an orthogonal transform coefficient is obtained
from the block which is down-sampled so that the block obtained from said blocking step is
the same.
Claim 39
Dependent Claim
67 words
A method of reading information according to any one of claim 33 to claim 35, wherein
in the case where entropy of the data value of the block to be processed is utilized in the
quantization processing at the time of information embedding, then in said bit reading step, the entropy of the data value of the block to be processed is
utilized for said predetermined value.
Claim 40
Dependent Claim
61 words
A method of reading information according to claim 36, wherein in the case where
entropy of the data value of the block to be processed is utilized in the quantization processing
at the time of information embedding, then in said bit reading step, the entropy of the data value of the block to be processed is
utilized for said predetermined value.
Claim 41
Dependent Claim
60 words
A method of reading information according to claim 37, wherein in the case where
entropy of the data value of the block to be processed is utilized the quantization processing at
the time of information embedding, then in said bit reading step, the entropy of the data value of the block to be processed is
utilized for said predetermined value.
Claim 42
Dependent Claim
61 words
A method of reading information according to claim 38, wherein in the case where
entropy of the data value of the block to be processed is utilized in the quantization processing
at the time of information embedding, then in said bit reading step, the entropy of the data value of the block to be processed is
utilized for said predetermined value.
Claim 43
Dependent Claim
70 words
A method of reading information according to any one of claim 33 to claim 35, wherein
in the case where the value of a low frequency domain in the orthogonal transform coefficient
is utilized in the quantization processing at the time of information embedding, then in said bit reading step, the orthogonal transform coefficient of the low frequency domain
in the orthogonal transform coefficient is utilized for said predetermined value.
Claim 44
Dependent Claim
64 words
A method of reading information according to claim 36, wherein in the case where the
value of a low frequency domain in the orthogonal transform coefficient is utilized in the
quantization processing at the time of information embedding, then in said bit reading step, the orthogonal transform coefficient of the low frequency domain
in the orthogonal transform coefficient is utilized for said predetermined value.
Claim 45
Dependent Claim
64 words
A method of reading information according to claim 37, wherein in the case where the
value of a low frequency domain in the orthogonal transform coefficient is utilized in the
quantization processing at the time of information embedding, then in said bit reading step, the orthogonal transform coefficient of the low frequency domain
in the orthogonal transform coefficient is utilized for said predetermined value.
Claim 46
Dependent Claim
64 words
A method of reading information according to claim 38, wherein in the case where the
value of a low frequency domain in the orthogonal transform coefficient is utilized in the
quantization processing at the time of information embedding, then in said bit reading step, the orthogonal transform coefficient of the low frequency domain
in the orthogonal transform coefficient is utilized for said predetermined value.
Claim 47
Dependent Claim
70 words
A method of reading information according to any one of claim 33 to claim 35, wherein
in the case where at the time of information embedding, the information to be embedded is
made into information for which error detection or error correction is possible, and then
embedded, then in said bit reading step, there is further included processing for carrying out error detection or error correction in said
read bit.
Claim 48
Dependent Claim
65 words
A method of reading information according to any one of claim 33 to claim 35, wherein
in the case where at the time of information embedding, information is embedded in a block,
then in said bit reading step, there is further included processing for forming information which has been embedded from
each bit read from said block, at block units obtained by said blocking step.
Claim 49
Dependent Claim
59 words
A method of reading information according to claim 47, wherein in the case where at
the time of information embedding, information is embedded in a block, then in said bit reading step, there is further included processing for forming information which has been embedded from
each bit read from said block at block units obtained by said blocking step.
Claim 50
Dependent Claim
69 words
A method of reading information according to any one of claim 33 to claim 35, wherein
in the case where at the time of information embedding, information which is spread over a
plurality of blocks is embedded, then in said bit reading step, there is further included processing for forming information which has been embedded from
each bit read from the plurality of blocks obtained by said blocking step.
Claim 51
Dependent Claim
63 words
A method of reading information according to claim 47, wherein in the case where at
the time of information embedding, information which is spread over a plurality of blocks is
embedded, then in said bit reading step, there is further included processing for forming information which has been embedded from
each bit read from the plurality of blocks obtained by said blocking step.
Claim 52
Dependent Claim
62 words
A method of reading information according to claim 51, wherein in said bit reading
step, then of said respective bits which have been read, there is further included processing for
obtaining the reliability of the read bits in the respective blocks from the bit information for
error detection, and for carrying out determination of information which has been embedded,
using said reliability.
Claim 53
Dependent Claim
97 words
A method of reading information according to any one of claim 33 to claim 35, wherein
in the case where a plurality of embedding information is embedded by a plurality of block
sizes, then in said blocking step, this is successively divided into blocks having the same size as the
size into which the blocks were divided at the time of embedding the information, and in said bit reading step, the bits are read for each block of the respective block sizes, and the
successively embedded watermark-information is read, to thereby read the plurality of
embedded watermark-information.
Claim 54
Independent Claim
121 words
An apparatus for embedding information comprising: a blocking section for dividing data to be processed into blocks; an orthogonal transform section for obtaining coefficients by carrying out orthogonal
transformation for each block; an embedding coefficient selecting section for determining coefficients in which the
watermark-information will be embedded by using a random sequence which is generated by
initial value; an information embedding section for sequentially embedding the watermark-information,
which has arbitrary length of bits, by quantizing value of said coefficients using a
predetermined value for quantization; and an inverse orthogonal transform section for carrying out inverse orthogonal transformation for
modified coefficients to form block in which the watermark-information is embedded, as well
as combining the divided blocks and reconstructing the original form.
Claim 55
Dependent Claim
49 words
An apparatus for embedding information according to claim 54, wherein said
information embedding section, carries out embedding of the watermark-information by
selecting a quantization value closest to the minimum of said determined orthogonal transform
coefficient, corresponding to the bit value which becomes the object of embedding in said
watermark-information.
Claim 56
Dependent Claim
57 words
An apparatus for embedding information according to claim 54, wherein said
information embedding section, carries out embedding of the watermark-information by
selecting a quantization value which is larger or smaller than said determined orthogonal
transform coefficient, in accordance with a rule which is dependant on the bit value which
becomes the object of embedding in said watermark-information.
Claim 57
Dependent Claim
99 words
An apparatus for reading information from data embedded with information by the
method according to claim 1 comprising: a blocking section for dividing said data into blocks; an embedding coefficient selecting section for determining coefficients from which the
watermark-information will be read by using a random sequence which is generated by initial
value which is used at the time of embedding the watermark-information; an object coefficient computing section for obtaining the coefficients by carry out orthogonal
transformation for each block; and a bit reading section for sequentially reading each bit of the embedded watermark-information
and outputting the read watermark-information.
Claim 58
Dependent Claim
58 words
An apparatus for reading information according to claim 57, wherein said bit reading
section, carries out reading of each bit with respect to the orthogonal transform coefficient obtained by
said object coefficient computing section, by quantization using the predetermined value for
quantization used at the time of information embedding, and using a value closest to the
quantization value.
Claim 59
Dependent Claim
52 words
An apparatus for reading information according to claim 57, wherein said bit reading
section, carries out reading of each bit using a differential value of the orthogonal transform coefficient
obtained by said object coefficient computing section, and an orthogonal transform coefficient
of the corresponding position in the data prior to information embedding.
Claim 60
Dependent Claim
139 words
A recording medium which can be read by a computer and on which is recorded an
information embedding program for realizing on a computer: a blocking function for dividing data to be processed into blocks; an orthogonal transform function for obtaining coefficients by carrying out orthogonal
transformation for each block; an embedding coefficient selecting function for determining coefficients in which the
watermark-information will be embedded by using a random sequence which is generated by
initial value; an information embedding function for sequentially embedding the watermark-information,
which has arbitrary length of bits, by quantizing value of said coefficients using a
predetermined value for quantization; and an inverse orthogonal transform function for carrying out inverse orthogonal transformation for
modified coefficients to form block in which the watermark-information is embedded, as well
as combining the divided blocks and reconstructing the original form.
Claim 61
Dependent Claim
55 words
A recording medium on which is recorded an information embedding program
according to claim 60, wherein said information embedding function, carries out embedding of
the watermark-information by selecting a quantization value closest to the minimum of said
determined orthogonal transform coefficient, corresponding to the bit value which becomes the
object of embedding in said watermark-information.
Claim 62
Dependent Claim
63 words
A recording medium on which is recorded an information embedding program
according to claim 60, wherein said information embedding function, carries out embedding of
the watermark-information by selecting a quantization value which is larger or smaller than
said determined orthogonal transform coefficient, in accordance with a rule which is dependant
on the bit value which becomes the object of embedding in said watermark-information.
Claim 63
Dependent Claim
120 words
A recording medium which can be read by a computer and on which is recorded an
information reading program for reading information from data embedded with information by
the method according to claim 1, for realizing on a computer: a blocking function for dividing said data into blocks; an embedding coefficient selecting function for determining coefficients from which the
watermark-information will be read by using a random sequence which is generated by initial
value which is used at the time of embedding the watermark-information; an object coefficient computing function for obtaining the coefficients by carry out orthogonal
transformation for each block; and a bit reading function for sequentially reading each bit of the embedded watermark-information
and outputting the read watermark-information.
Claim 64
Dependent Claim
64 words
A recording medium on which is recorded an information reading program according
to claim 63, wherein said bit reading function, carries out reading of each bit with respect to the orthogonal transform coefficient obtained by
said object coefficient computing function, by quantization using the predetermined value for
quantization used at the time of information embedding, and using a value closest to the
quantization value.
Claim 65
Dependent Claim
58 words
A recording medium on which is recorded an information reading program according
to claim 63, wherein said bit reading function, carries out reading of each bit using a differential value of the orthogonal transform coefficient
obtained by said object coefficient computing function; and an orthogonal transform coefficient
of the corresponding position in the data prior to information embedding.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.