Classifications

• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
  • G06T1/00—General purpose image data processing
  • G06T1/0021—Image watermarking
  • G06T1/005—Robust watermarking, e.g. average attack or collusion attack resistant
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
  • G06F21/10—Protecting distributed programs or content, e.g. vending or licensing of copyrighted material ; Digital rights management [DRM]
  • G06F21/16—Program or content traceability, e.g. by watermarking
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
  • G06T2201/00—General purpose image data processing
  • G06T2201/005—Image watermarking
  • G06T2201/0063—Image watermarking in relation to collusion attacks, e.g. collusion attack resistant
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
  • G06T2201/00—General purpose image data processing
  • G06T2201/005—Image watermarking
  • G06T2201/0065—Extraction of an embedded watermark; Reliable detection

Definitions

• the present invention relates to a digital file marked by a series of marks whose concatenation forms a message and a method of extracting a mark from a marked digital file.
• a marked digital file of the type comprising several parts, some of which are marked by a mark of a series of marks so as to form a sequence. of marked parts, the concatenation of the marks of the sequel forming a message.
• mark will be called a set of bits inserted into a portion of a digital file and may be extracted by a trademark extraction program likely to interpret these marks.
• Each bit of a mark is usually associated with a numerical quantity, and corresponds to a variation of this numerical quantity.
• a bit of a mark can be determined by analyzing the associated numerical quantity, this bit being 1 if the numerical quantity is greater than a predetermined value, and equaling 0 if the numerical quantity is less than the predetermined value.
• each bit of the mark may correspond to an increase or decrease in the luminance of one of the red, green or blue components of an area of the image, such as than a pixel or a set of pixels.
• each mark is hidden in the file, so that it is impossible to know the existence of this mark without a thorough study of the file, in particular by means of a program of extraction of brands. Indeed, the variations of the digital quantities corresponding to the bits of the mark are generally imperceptible. However, it may be preferable in some cases that a mark is visible.
• the extraction program is also likely to concatenate the extracted marks so as to reconstruct the message and extract the information it contains.
• the message formed by the concatenated marks is, for example, applied to the fight against the illegal copy of the marked digital file. Indeed, this message includes, for example, identifying information of the author, the owner and / or a recipient of this marked digital file.
• the message may include a description of the digital file, or may be used for audience monitoring.
• a digital file transits into a network, for example using an Open Systems Interconnection (OSI) model or an IP (Internet acronym) Protocol "), or when a digital file is broadcast, for example by radio waves, this digital file is generally transmitted in the form of packets, these packets being then concatenated so as to reconstitute the digital file.
• OSI Open Systems Interconnection
• IP Internet acronym
• packets are transmitted with errors that can modify, often without impact, the reconstituted file compared to the original file.
• the message may be changed or become unreadable.
• a message whose marks have been changed might, for example, no longer identify the author or owner of the file, and therefore could no longer be applied to the fight against illegal copying or, in a way more general, could no longer be applied to the use for which it is intended.
• each mark of the message is usually coded using an error correction code such as a BCH code (acronym for Bose-Chaudhuri-Hocquenghem, the names of the creators of this code).
• BCH code acronym for Bose-Chaudhuri-Hocquenghem, the names of the creators of this code.
• an error correction code only allows correction of a predefined number of bits, depending on the complexity of this error correction code. If the message has a number of errors greater than this predefined number of bits, the error correction code no longer makes it possible to reconstitute the original mark.
• the object of the invention is in particular to remedy this drawback by providing a digital file making it possible to limit the effects that any transmission errors would have on a message it contains, regardless of the format and purpose of the message. this message, and whatever the means of transmission of the message.
• the subject of the invention is a digital file of the aforementioned type, characterized in that: - each mark contains an identifier of the mark, defined by a numerical value, this value varying from one mark to another according to the order of the marks in the series of marks,
• the sequence of marked games includes sub-suites of at least two marked games, such that all parts of the same sub-play are marked with the same mark.
• Each mark being repeated at least once, and each mark comprising an identifier, it is possible to identify all the identical marks, to the possible transmission errors, contained in the digital file.
• Each bit of the repeated mark is also repeated. In the following, we will call "same bits of identical marks" bits of identical marks corresponding to the same bit of the original mark repeated.
• a mark extracted from a digital file according to the invention therefore has fewer errors than a mark extracted from a conventional digital file.
• the identifier of the mark of the first subset of marked portions is defined by a predetermined numerical value, called the starting value, and the identifier of each other mark is defined by a numerical value greater than those defining the identifiers of the marks which precede it.
• the digital file may comprise several series of marks, the concatenation of the marks of each suite forming a different message.
• the extraction program extracts a mark whose identifier is defined by a value greater than those defining the identifiers of the marks that it has previously extracted, it deduces that this mark is part of the same series of marks. than previously extracted marks.
• the extraction program extracts a mark whose identifier is defined by the initial value, it deduces that this mark is part of a new series of marks.
• each subsequence has the same number of parts.
• the extraction program can determine how much each subsequence has parts. The extraction program therefore expects to find each mark as many times as there are parts in each subsequence.
• the extraction program can correct this error by observing the rank of this part in the subset of marked parts. Thus, it avoids in particular the risk that the extraction program considers a wrong identifier as the identifier of a new brand.
• a digital file according to the invention may further comprise one or more of the following features:
• the digital file comprises at least one part not containing a mark, said non-marked part, the marked parts being randomly arranged with respect to the non-marked parts;
• each identifier is defined by a numerical value expressed in Gray code numbering bits, and comprises a parity bit;
• each mark comprises at least one sub-mark, each sub-mark being contained by the same part and comprising the identifier associated with the mark and at least one set of data;
• the digital file is a video file, each part of this file being an image, an area of an image or a set of images;
• each mark of an image comprises three sub-marks, respectively integrated into the red, green and blue components of the image;
• the digital file is marked by at least two distinct suites of brands whose concatenation forms a message, the messages corresponding to the separate sequences together forming a sequence of messages whose useful contents complement each other so as to form a single general useful content, each message of the message sequence further comprising information regarding the number of marked portions of another sequence of marks whose concatenation forms another message of the message sequence.
• the message formed by the concatenated marks comprises at least one information chosen from information concerning the number of marked parts of the message, information concerning the number of marked parts of another message contained in the digital file and completing the message, information concerning the number of marked parts of another message contained in the digital file, information concerning a purpose of the message, information concerning the presence of other information in the message, information concerning the length of the message, in bits, information concerning the useful content of the message, message authentication information, and cyclic redundancy check information.
• a message formatted to include the information defined above can be adapted to any application (fight against the illegal copy of the digital file marked, description of the digital file, use for a follow-up hearing, or more than one application at a time).
• such a message can also be adapted to any transmission mode of the digital file, the number of parties marked by sub-suites of marked parts depending in particular on the quality of the transmission mode, this number being all greater than the quality of the transmission mode is low.
• the invention can be applied to any digital file that can be transmitted in the form of packets, the format of the message being independent of the digital file.
• the invention also relates to a method of extracting a mark from a digital file marked as defined above, each bit of the mark corresponding to a variation of a magnitude associated with the bit, characterized in that it comprises:
• the extraction method further comprises a step during which any residual error of the mark is corrected by means of an error correction code.
• FIG. 1 represents a digital file marked according to the invention
• FIG. 2 represents the structure of a mark of a marked portion of the digital file of FIG. 1;
• FIG. 3 represents the structure of a message obtained by concatenation of the marks of the marked parts of the digital file of FIG. 1.
• FIG. 1 shows a digital file according to an exemplary embodiment of the invention. This digital file is designated by the general reference 10.
• the digital file 10 comprises several parts, some of which, labeled portions 12, are each marked by a mark 14 of a series of marks whose concatenation forms a message. These marked portions 12 then form a sequence of marked parts.
• the digital file also includes unmarked portions 16 arranged among the marked portions 12.
• the portions of the file 10 for receiving a mark 14 of the sequence of marks are randomly selected.
• the marked portions 12 are arranged randomly with respect to the non-marked portions 16.
• the digital file 10 is a video file.
• each part 12, 16 of this video file is then an image of the video.
• each portion 12, 16 could be an area of an image of the video, such as a pixel or set of pixels, or a set of images of the video.
• the digital file 10 could be a text file, each part of this text file then being a page of the text, or, more generally, the digital file 10 could be any digital file divisible into several parts.
• the digital file 10 comprises two series of marks in which each mark 14 is inserted in a respective marked image 12.
• FIG. 2 shows in greater detail a mark 14 of a marked portion 12 of the digital file 10.
• each mark 14 of the digital file 10 for example coded on 276 bits, has a structure identical to that of the other marks 14. Only the content of each mark 14 differs from one mark to another. In the example described, each mark 14 comprises three 14R sub-marks,
• Each mark 14 contains an identifier I, defined by a numerical value varying from one mark 14 to the other depending on the order of the marks 14 in the series of marks.
• This identifier I makes it possible, in particular, to inform a classic trademark retrieval program on the presence of a mark in the marked part and on the rank of this mark in the series of marks.
• the identifier I of the first mark 14 of a sequence of marks is defined by a predetermined numerical value, called the initial value. Generally, this starting value is zero.
• the identifier I of each other mark 14 is defined by a numerical value greater than that defining the identifiers I of the marks 14 which precede it in the series of marks.
• each sub-mark 14R, 14V and 14B contains the identifier I of the mark 14.
• the identifier I understood by a sub-mark contains an error, it is generally possible to deduce from the other two sub-marks. marks what is the original non-erroneous identifier.
• each identifier I is defined by a numerical value expressed in Gray code numbering bits. Indeed, it is known that the use of a Gray code in the numbering of the elements of a suite favors the detection possible errors in this numbering.
• Each identifier I further comprises a parity bit, which also makes it possible to detect possible errors in a manner known per se.
• Each 14R, 14V, 14B sub-mark contains three sets of data, designated respectively by the references D1R, D2R and D3R, D1V, D2V and D3V and D1B, D2B and D3B.
• the concatenation of these data sets forms the payload of the mark 14, ie the data useful for reforming the message.
• FIG. 1 denotes, by the references 10, 11, 12, 13, 14, 15, respectively OJ, J1, J2, the identifiers of the marks 14 of the first, respectively of the second, following marks inserted in the file. rubiO. It should be noted that the identifiers designated by the references IO and OJ are the identifiers of the first marks 14 of each series of marks.
• sequences of marked games 12 comprise sub-sequences of marked parts 12, such that all the parts 12 of the same sub-series are marked by the same mark 14
• the parts 12 marked with the same mark 14 therefore contain the same identifier, as can be seen in FIG.
• each subset of marked portions has the same number of parts 12.
• each subset of the parts marked by a mark 14 of the first, respectively second, sequence of marks comprises five, respectively three , parts 12.
• each mark 14 being repeated at least three times, it is generally possible to correct any errors contained by these marks 14.
• each of the same bits of identical marks 14 corresponds to a variation of the same associated magnitude. It is then possible to accumulate all the variations corresponding to the same bits of all the identical marks 14, so as to obtain, for each set of same bits, an overall variation of the quantity associated with this bit.
• each overall variation is obtained by accumulating several variations that are supposed to be identical, it is less likely to be erroneous than a single variation corresponding to a bit of a single mark. It is therefore possible to deduce from each global variation thus obtained the corresponding bit of the original mark, the risks of this bit being erroneous being reduced.
• the extraction program is able to determine the number of parts in each subsequence.
• the extraction program can correct this error, and thus avoid the risk of considering an incorrect identifier I as the identifier I of another brand.
• This method comprises a step of calculating global variations, during which, for each same bit of the marks of the same sub-sequence, a positive or negative variation of the quantity corresponding to this bit is carried out according to whether this bit is equal to respectively, 1 or 0. These variations accumulate with each other so as to form, for each same bit, an overall variation.
• the method then comprises a step of determining the extracted mark, during which each corresponding global variation is associated with a corresponding bit, equal to 1 if the overall variation is positive, and 0 if the overall variation is negative. All these bits form the mark extracted, the possible errors contained by the original mark being mostly corrected.
• the extraction method further comprises a step during which any residual error of the mark is corrected by means of an error correction code, in a manner known per se.
• the extraction process according to the invention therefore improves the reconstitution of marks after transmission. Note that since the marked portions 12 are randomly arranged with respect to the unlabeled portions 16, two digital files of similar contents generally do not have marks in the same subparts.
• a collusion attack consists in averaging the magnitudes corresponding to the bits of the marks of identical parts marked with at least two files of similar contents, in order to obtain a similar content file in which the marks are modified, made illegible or deleted.
• an extraction program can not reconstruct the message. We thus obtain an unmarked file, thus containing no message informing who is the author, the owner and / or the recipient of the file.
• a collusion attack is still possible using a large number of files with similar contents, since having a large number of such files increases the probability that two identical marked parts of two files among those available contain a similar mark. However, in this case, the collusion will generate noise which will significantly reduce the quality of the unlabeled file obtained by the collusion attack.
• FIG. 3 shows a message M obtained by concatenating the marks of a sequence of marks contained in the digital file 10 according to the invention.
• Such a message M generally includes the following information.
• a first piece of information concerns the purpose of the message. This information, generally written on 8 bits, indicates for example that the message M is intended for the identification of the author or the owner of the digital file, the description of the digital file 10, or a follow-up audience.
• a second piece of information 22, generally coded on 20 bits, indicates what is the number of parts marked with a mark 14 of the series of marks whose concatenation forms the message M. This information makes it possible, in particular, to verify that the digital file 10 includes all these parts marked 12.
• a third piece of information 24 generally coded on 20 bits, indicates the number of parts marked by a mark 10 of a series of marks whose concatenation forms another message.
• the extraction program is notified of the number of marked parts of the other message, in order to detect possible errors.
• a fifth piece of information 26, generally coded on 10 bits, indicates the length, in number of bits, of the useful content of the message.
• This useful content of the message is a sixth piece of information 28. It usually depends on the purpose of the message. Note that, in the case where this useful content is too long to be contained by the single message M, it is necessary to distribute it over several messages, forming a series of messages together.
• each message in the message sequence includes seventh information 30, generally 20-bit coded, indicating the number of marked portions of the next message in the message sequence.
• An eighth piece of information 32 includes an electronic signature for the authentication of the message.
• Ninth information 34 generally coded on 6 bits, provides information on the presence or absence of the other information contained in the message.
• a last piece of information 36 generally coded on 32 bits, relates to a conventional type of redundancy check code, making it possible to reject messages with too many errors.

Landscapes

• Engineering & Computer Science (AREA)
• Theoretical Computer Science (AREA)
• General Physics & Mathematics (AREA)
• Physics & Mathematics (AREA)
• Software Systems (AREA)
• Technology Law (AREA)
• Multimedia (AREA)
• Computer Hardware Design (AREA)
• Computer Security & Cryptography (AREA)
• General Engineering & Computer Science (AREA)
• Editing Of Facsimile Originals (AREA)
• Compression, Expansion, Code Conversion, And Decoders (AREA)
• Image Processing (AREA)
• Document Processing Apparatus (AREA)

Applications Claiming Priority (2)

Publications (1)

Family

ID=36680247

Family Applications (1)

Country Status (6)

Families Citing this family (3)

Family Cites Families (12)

• 2006
  • 2006-02-13 FR FR0601250A patent/FR2897487B1/fr not_active Expired - Fee Related
• 2007
  • 2007-02-12 US US12/223,082 patent/US20090204878A1/en not_active Abandoned
  • 2007-02-12 WO PCT/FR2007/050776 patent/WO2007093728A2/fr not_active Ceased
  • 2007-02-12 EP EP07731601A patent/EP1984891A2/de not_active Withdrawn
  • 2007-02-12 JP JP2008553807A patent/JP2009527139A/ja active Pending
  • 2007-02-12 CN CNA200780005263XA patent/CN101405762A/zh active Pending

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events