Procedure for marking binary coded data sets
First Claim
Patent Images
1. A procedure for marking binary coded data sets, in particular image data and audio signals, by embedding at least one information unit in a data set, comprising the steps of:
- generating a discrete position sequence using properties characteristics of said data set and using a key;
selecting, on the basis of said discrete position sequence, at least one block of image pixels or audio time signals;
transforming said selected block of pixels or time signal from the spatial or time domain into a frequency domain wherein said transformed block has a plurality of frequency coefficients;
embedding said information unit into said transformed block at positions which are within a predetermined frequency coefficient range.
2 Assignments
0 Petitions
Accused Products
Abstract
Disclosed is a method of marking binary-coded data sets, especially image data or audio signals, by applying at least one information unit to a data set. The invention is characterized by the generation of a discrete position sequence for the application of information units to the data set to be marked, taking into account data-specific characteristics and using a key; and by the fact that the information unit to be applied is written and read at the positions established in the position sequence in the data set.
-
Citations
20 Claims
-
1. A procedure for marking binary coded data sets, in particular image data and audio signals, by embedding at least one information unit in a data set, comprising the steps of:
-
generating a discrete position sequence using properties characteristics of said data set and using a key;
selecting, on the basis of said discrete position sequence, at least one block of image pixels or audio time signals;
transforming said selected block of pixels or time signal from the spatial or time domain into a frequency domain wherein said transformed block has a plurality of frequency coefficients;
embedding said information unit into said transformed block at positions which are within a predetermined frequency coefficient range. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)
-
-
13. A procedure for marking binary coded bi-level image data sets by embedding at least one information unit in a data set, comprising the steps of:
-
generating a discrete position sequence using property characteristics of the data set and using a key;
selecting, on the basis of said discrete position sequence, a plurality of blocks each containing a plurality of picture elements, each of said picture elements having a value of “
1”
or “
0”
;
specifying a predetermined relationship between the number of picture elements having a “
1”
value and the number of picture elements having the “
0”
value;
determining the actual relationship between the number of “
1”
values and the number of “
0”
values in said selected block;
comparing said determined relationship with said predefined relationship and adjusting the relationship between the numbers of “
1” and
the numbers of “
0”
in said block until said determined relationship is equal to said predefined relationship wherein the embedding of an information unit equivalent to a “
1”
bit encoded in a block b satisfies the following requirement;
- View Dependent Claims (14, 15, 16, 17, 18)
-
-
19. A procedure for reading marked binary coded data sets, in particular image data and audio signals wherein said binary coded data sets have been marked by embedding at least one information unit in a data set, said procedure comprising the steps of:
-
generating a discrete position sequence using properties characteristic of said data set and using a key;
selecting, on the basis of said discrete position sequence, a block of image pixels or audio time signals;
transforming said selected block from a spatial or time domain into a frequency domain having a plurality of frequency coefficients;
determining the relationship of ones of said frequency coefficients in a predefined frequency range; and
recovering said information unit on the basis of said determined relationship.
-
-
20. A procedure for marking binary coded bi-level image data sets by embedding at least one information unit in a data set, comprising the steps of:
-
generating a discrete position sequence using property characteristics of the data set and using a key;
selecting, on the basis of said discrete position sequence, a plurality of blocks each containing a plurality of picture elements, each of said picture elements having a value of “
1”
or “
0”
;
specifying a predetermined relationship between the number of picture elements having a “
1”
value and the number of picture elements having the “
0”
value;
determining the actual relationship between the number of “
1”
values and the number of “
0”
values in said selected block;
comparing said determined relationship with said predefined relationship and adjusting the relationship between the numbers of “
1” and
the numbers of “
0”
in said block until said determined relationship is equal to said predefined relationship wherein the embedding of an information unit equivalent to a “
0”
bit encoded in a block b satisfies the following requirement;
-
Specification