EP2025143A1 - Verfahren zur verschlüsselung eines digitalfarbbildes mit markierungsinformationen - Google Patents

Verfahren zur verschlüsselung eines digitalfarbbildes mit markierungsinformationen

Info

Publication number
EP2025143A1
EP2025143A1 EP07765287A EP07765287A EP2025143A1 EP 2025143 A1 EP2025143 A1 EP 2025143A1 EP 07765287 A EP07765287 A EP 07765287A EP 07765287 A EP07765287 A EP 07765287A EP 2025143 A1 EP2025143 A1 EP 2025143A1
Authority
EP
European Patent Office
Prior art keywords
critical
image
coded
components
bits
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP07765287A
Other languages
English (en)
French (fr)
Inventor
Eric Filliatre
Patrice Capircio
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Thales SA
Original Assignee
Thales SA
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Thales SA filed Critical Thales SA
Publication of EP2025143A1 publication Critical patent/EP2025143A1/de
Withdrawn legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/46Colour picture communication systems
    • H04N1/64Systems for the transmission or the storage of the colour picture signal; Details therefor, e.g. coding or decoding means therefor
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/184Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being bits, e.g. of the compressed video stream
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/46Embedding additional information in the video signal during the compression process
    • H04N19/467Embedding additional information in the video signal during the compression process characterised by the embedded information being invisible, e.g. watermarking

Definitions

  • the field of the invention is that of the operational safety of the visualization systems.
  • the field of application is more particularly that of cockpit systems on aircraft. This type of system is intended to display critical information for the piloting of the aircraft. As such, the incorrect display of certain parameters can lead to a catastrophic situation in terms of operating safety.
  • the basic integrity of the chain of view is not sufficient to guarantee these safety requirements, it is necessary to implement monitoring mechanisms to detect such errors.
  • the problem of verifying and monitoring the quality of an image essentially consists of identifying characteristic elements of this image and then analyzing whether these elements remain correctly positioned along the visualization chain. This problem has been solved in two different ways in the current solutions:
  • the solution consists in verifying the result of the computations applied on the characteristic points of the image by the graphical generation chain, but without propagating the information of marking of these points until the image memory;
  • the solution is to have the image computed by two dissimilar paths and then to compare the graphical result during the simultaneous replay of the two image memories.
  • the technique used in the first case consists of identifying the characteristic points of the image during its specification by associating them with a marker. These characteristic points thus retain their marker throughout the image calculation chain, which allows the graphic generation to be able to provide the result of the calculations. applied on these points to an external verification module. Once these calculation results are available, it is then possible to check whether they are in conformity with the expected results.
  • This solution has several disadvantages: • It only applies to specific graphic generation solutions that are:
  • the technique used in the second case consists in carrying out verification of the content of an image by pixel-to-pixel comparison of the image coming from two dissimilar and independent paths. The verification is then done on the basis of the comparison of the colors. It requires the management of an adapted tolerance threshold which makes it possible not to impose on each of the graphic generation channels to have a strictly identical result.
  • This technique has several variants, so that one channel generates the complete image and the other channel generates only the elements of the image whose integrity must be verified.
  • This solution has several disadvantages. Indeed, it imposes to implement two dissimilar chains of graphic generation, with significant impacts in terms of performance and development cost.
  • it is necessary to demonstrate that the tolerance threshold used for the colorimetric comparison of the images makes it possible in all cases to guarantee the integrity of the image. The determination of this "right" threshold is difficult to obtain.
  • the object of the invention is to provide, at the output of the graphic generation chain, markers in the image which will make it possible to guarantee the display integrity of the on-board visualization system. These marks are in particular associated with the critical symbols of the image and make it possible to check the integrity of these symbols.
  • the invention consists in elaborating the sequence of graphical operations which leads to the insertion of markers in the form of bits set to "1" at the location of the bits not used in the so-called RGB color components, an acronym for Rouge-Vert. -Blue.
  • the subject of the invention is a method for coding the pixels of a color digital image comprising critical symbols represented by critical pixels, each color pixel being coded on three digital components each comprising the same number of bits, characterized in that that the components of the critical pixels comprise on the one hand a color information and on the other hand a marker also called "tag" encoded on at least one bit, said marker being intended to be exploited by generation and prediction functions critical symbols.
  • the components are coded on eight bits, two of the components comprising five-bit color information and one of the components comprising six-bit color information.
  • the color information is coded on the bits of low weight or LSB (Least Significant Bit).
  • the method is carried out in a device for generating digital images comprising a GPU type computing unit comprising at least one image memory, a memory dedicated to "masks” also called “stencils” comprising at least one plane memory and a graphics processor, and said method comprises at least four steps:
  • a first step of generating non-critical symbols in the image memory A second step of generating critical symbols in the image memory and generating markers associated with said critical symbols in a memory plane of the memory dedicated to "masks";
  • the invention also relates to an electronic device for generating digital images comprising a computing unit of GPU type (Graphie Processing Unit) characterized in that it comprises a coding method according to one of the preceding claims.
  • GPU type Graphie Processing Unit
  • FIG. 1 represents the general block diagram of an electronic device for digital image generation according to the invention
  • FIG. 2 represents the main steps of the method according to the invention
  • FIG. 3 represents the general block diagram of an electronic device for securing digital images comprising an electronic device for generating digital images according to the invention.
  • the basic principle of the invention consists of:
  • OpenGL an acronym for Open Graphics library, is a multi-platform programming interface for designing applications that generate two- or three-dimensional images. This interface groups different functions that can be used to display complex three-dimensional scenes from simple primitives;
  • the graphic generation chain provides the image in a digital video format in which the colors are represented by their three RGB components (Red, Green and Blue);
  • the graphic generation chain has a memory resource dedicated to mask management. As an illustration, in the OpenGL standard, this resource is called “stencils”. This memory resource is used for marker management.
  • LSB is conventionally called the least significant bits, LSB being the acronym for Least Significant Bit and MSB, the most significant bits, MSB being the acronym for Most Significant Bit.
  • LSB being the acronym for Least Significant Bit
  • MSB the most significant bits
  • coding of the color pixels of a symbology does not require a range of color as important as that of a real image. Generally, a few dozen colors are enough to encode all the characters and symbols. As a result, useful colors can be encoded using only a limited number of bits of each component. For example, a typical configuration can be:
  • the coding of the marker requires only a limited number of bits, generally one bit is sufficient. Thus, it is possible to code on the same component both the color information and the marking information.
  • the various steps of the method consist in elaborating the sequence of graphic operations which leads to inserting for each pixel the marker stored in the memory of the masks at the location of the bits not used in the RGB color components, taking into account the constraints and special rules related to the use of graphic processors.
  • FIGS. 1 and 2 when implemented in a GPU, the entire process comprises four steps denoted 1, 2, 3 and 4 which are detailed below. These different steps are illustrated in FIGS. 1 and 2.
  • FIG. 1 the path of the non-critical symbols S N c is represented by dotted arrows and the path of the critical symbols Sc is represented by continuous arrows:
  • Step 1 Any non-critical symbol S NC is conventionally generated in the image memory 10 of the GPU 1 in RGB format, each pixel being coded on five bits on the LSBs of the Red, six bits on the LSB of the Green and five bits on the LSB of the Blue;
  • Step 2 Any critical symbol Sc is generated simultaneously in the image memory 10 in RGB format and in a memory plane 12 dedicated to the masks which has a depth bit.
  • any pixel written in the image memory is assigned a corresponding pixel and set to "1" in the mask plane.
  • the RGB color image is available in the process image and the pixel markers are available in the mask plane.
  • Each pixel is coded on five bits on the LSBs of the Red, six bits on the LSBs of the Green and five bits on the LSBs of the Blue;
  • Step 3 This step consists in inserting, by means of the calculation unit 1 1 of the GPU 1, a marker in the image memory for each pixel which has a correspondent positioned at "1" in the mask plane.
  • the technique used is to draw a surface or a set of surfaces: o Which cover the area of the image in which the markers are to be inserted. For example, depending on the importance of the symbology generated, a single surface may cover the entire image or one or more surfaces may cover a subset of the image; o Which are assigned a color whose active bits correspond to the markers that are inserted into the process image. These active bits must be positioned on the unused bits of the process image; o Which will be subject to a color mixing law such as, if a pixel of the mask plane is set to
  • Step 4 This step corresponds to the replay of the image memory by the graphical generation chain which then provides per pixel on the digital video output the combination of RGB color information and pixel marking information.
  • I M this image with markers.
  • FIG. 3 A portion of secure graphical generation chain implementing the method according to the invention is described in FIG. 3. It essentially comprises:
  • the operating principle is as follows: the prediction calculation unit calculates the position of the critical symbols in the image. These calculations are compared by means of the extraction and comparison unit at the positions of the critical symbols identified by their markers. So we know if the graphical generation chain is working properly.
  • the method takes into account the superposition management or symbol priority functions, functions called in OpenGL functions "clipping",
  • the solution provided is extensible to a number N of mask planes.
  • N In the case of non-overlapping critical symbols, it is thus possible to manage 2N markers or tags.
  • superimposed critical symbols it is then possible to manage N different tags.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Image Processing (AREA)
  • Image Generation (AREA)
EP07765287A 2006-06-06 2007-05-29 Verfahren zur verschlüsselung eines digitalfarbbildes mit markierungsinformationen Withdrawn EP2025143A1 (de)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
FR0605002A FR2901946B1 (fr) 2006-06-06 2006-06-06 Procede de codage d'une image numerique couleur comportant une information de marquage
PCT/EP2007/055201 WO2007141162A1 (fr) 2006-06-06 2007-05-29 Procede de codage d'une image numerique couleur comportant une information de marquage

Publications (1)

Publication Number Publication Date
EP2025143A1 true EP2025143A1 (de) 2009-02-18

Family

ID=37564089

Family Applications (1)

Application Number Title Priority Date Filing Date
EP07765287A Withdrawn EP2025143A1 (de) 2006-06-06 2007-05-29 Verfahren zur verschlüsselung eines digitalfarbbildes mit markierungsinformationen

Country Status (4)

Country Link
US (1) US20090243893A1 (de)
EP (1) EP2025143A1 (de)
FR (1) FR2901946B1 (de)
WO (1) WO2007141162A1 (de)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2963690B1 (fr) 2010-08-06 2012-08-03 Thales Sa Systeme informatique "client-serveur" securise pour applications interactives
US10471617B2 (en) 2015-01-26 2019-11-12 Crayola Llc Pixel art crayon and marker photo array assembly and kit
US10118436B2 (en) 2015-01-26 2018-11-06 Crayola, Llc Pixel art crayon and marker photo array assembly and kit
WO2017026932A1 (en) * 2015-08-12 2017-02-16 Saab Ab Method and system for monitoring output data of graphics processing unit
FR3120721B1 (fr) * 2021-03-10 2023-02-10 Airbus Helicopters Procédé de test d’un dispositif électroportatif
FR3133259B1 (fr) * 2022-03-04 2024-04-19 Safran Electronics & Defense Système d’affichage d’informations critiques et non-critiques

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4682215A (en) * 1984-05-28 1987-07-21 Ricoh Company, Ltd. Coding system for image processing apparatus
FR2723797B1 (fr) * 1994-08-19 1996-09-20 Sextant Avionique Procede de codage de memoire image
US6025818A (en) * 1994-12-27 2000-02-15 Pioneer Electronic Corporation Method for correcting pixel data in a self-luminous display panel driving system
US5914725A (en) * 1996-03-07 1999-06-22 Powertv, Inc. Interpolation of pixel values and alpha values in a computer graphics display device
US5982937A (en) * 1996-12-24 1999-11-09 Electronics For Imaging, Inc. Apparatus and method for hybrid compression of raster data
EP0978816B1 (de) * 1998-08-07 2002-02-13 Deutsche Thomson-Brandt Gmbh Verfahren und Vorrichtung zur Videobildbearbeitung, insbesondere zur Kompensation des Falschkontureffekts
AU7783900A (en) * 1999-09-29 2001-04-30 Thomson Licensing S.A. Data processing method and apparatus for a display device
FR2900527B1 (fr) * 2006-04-26 2008-09-26 Thales Sa Procede de codage d'une image numerique couleur comportant une information de ponderation

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO2007141162A1 *

Also Published As

Publication number Publication date
US20090243893A1 (en) 2009-10-01
WO2007141162A1 (fr) 2007-12-13
FR2901946A1 (fr) 2007-12-07
FR2901946B1 (fr) 2008-11-21

Similar Documents

Publication Publication Date Title
Bianchi et al. Image forgery localization via block-grained analysis of JPEG artifacts
US20200082554A1 (en) Method and apparatus for processing three-dimensional data, device and storage medium
EP2025143A1 (de) Verfahren zur verschlüsselung eines digitalfarbbildes mit markierungsinformationen
EP3756130B1 (de) Detektor für in einem bild verborgene informationen
CN1763786A (zh) 用于3d中硬件加速的抗图形失真方法
CN109766793A (zh) 数据处理方法和装置
US8025235B2 (en) Progressively degrading synthetic markers
CN110572369A (zh) 图片验证方法、装置、计算机设备及存储介质
US10542176B2 (en) Enhancing graph visualization with supplemental data
EP2791778A1 (de) Verfahren zur echtzeit-verarbeitung einer videosequenz auf mobilen endgeräten
US8818092B1 (en) Multi-threaded text rendering
RU2331085C2 (ru) Двухкомпонентное встраивание сообщений в изображение
US6724392B1 (en) System and method for placing labels on a computer-generated map
US9536281B2 (en) Image scaling for images including low resolution text
CN102385760A (zh) 用于保护模型数据的方法及系统
CN110427891B (zh) 用于识别合同的方法、装置、系统及介质
CN111950356B (zh) 印章文本定位方法、装置及电子设备
RU2329522C2 (ru) Адаптивное встраивание водяных знаков по нескольким каналам
CN111626244A (zh) 图像识别方法、装置、电子设备和介质
WO2007122202A1 (fr) Procede de codage d'une image numerique couleur comportant une information de ponderation
FR2989804A1 (fr) Procede de reconstruction de donnees a partir d'une image en couleur a laquelle est associee de la donnee.
CN110378829A (zh) 信息提供和水印提取的方法、装置及设备
CN113139163B (zh) 一种应用程序界面上水印信息生成的方法及设备
US20220351323A1 (en) Steganographic techniques for tracking video access events
Li et al. Blind detection of digital forgery image based on the local entropy of the gradient

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20081208

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC MT NL PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL BA HR MK RS

RIN1 Information on inventor provided before grant (corrected)

Inventor name: CAPIRCIO, PATRICE

Inventor name: FILLIATRE, ERIC

RBV Designated contracting states (corrected)

Designated state(s): BE DE FR GB NL

DAX Request for extension of the european patent (deleted)
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20121201