EP2066110B1 - Mapping method along anchored mapping trajectories with improved uniformity - Google Patents
Mapping method along anchored mapping trajectories with improved uniformity Download PDFInfo
- Publication number
- EP2066110B1 EP2066110B1 EP08169925.8A EP08169925A EP2066110B1 EP 2066110 B1 EP2066110 B1 EP 2066110B1 EP 08169925 A EP08169925 A EP 08169925A EP 2066110 B1 EP2066110 B1 EP 2066110B1
- Authority
- EP
- European Patent Office
- Prior art keywords
- mapping
- color
- gamut
- colors
- trajectories
- 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.)
- Active
Links
- 238000013507 mapping Methods 0.000 title claims description 232
- 238000000034 method Methods 0.000 title claims description 29
- 239000003086 colorant Substances 0.000 claims description 65
- 238000012360 testing method Methods 0.000 claims description 27
- 238000009795 derivation Methods 0.000 claims description 14
- 238000004321 preservation Methods 0.000 claims description 10
- 238000004422 calculation algorithm Methods 0.000 description 22
- 230000006870 function Effects 0.000 description 19
- 238000005192 partition Methods 0.000 description 9
- 230000006835 compression Effects 0.000 description 5
- 238000007906 compression Methods 0.000 description 5
- 230000000694 effects Effects 0.000 description 5
- 235000019557 luminance Nutrition 0.000 description 5
- 238000003384 imaging method Methods 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 230000007547 defect Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012886 linear function Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000009467 reduction Effects 0.000 description 2
- 229920006395 saturated elastomer Polymers 0.000 description 2
- 238000000638 solvent extraction Methods 0.000 description 2
- 241000274965 Cyrestis thyodamas Species 0.000 description 1
- 230000004456 color vision Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000005484 gravity Effects 0.000 description 1
- 238000007781 pre-processing Methods 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/46—Colour picture communication systems
- H04N1/56—Processing of colour picture signals
- H04N1/60—Colour correction or control
- H04N1/6058—Reduction of colour to a range of reproducible colours, e.g. to ink- reproducible colour gamut
Definitions
- the invention relates to a method of mapping a set of source colors of a source color device into a set of target colors of a target color device.
- Gamut mapping is used to reproduce an image rendered by a source color device on a target color device, since the source device and the target device typically have different gamut boundaries with respect to each other. In other words, the gamut of colors that can be reproduced by the source device is typically not the same as the gamut of colors that can be reproduced by the target device. Gamut mapping can be used to render the image from within the source device gamut boundary to within the target device gamut boundary, so as to more accurately reproduce the color image on the target device.
- color gamut or "gamut” is generally used to describe the complete range of colors an image contains or a color device is able to render. It is sometimes referred to as a color gamut or the gamut color space associated, for instance, with a printer or screen display device.
- Gamut mapping an image for instance onto a screen or printer generally requires adjusting the colors of the image to fit in the constrained color gamut of the screen or printer. In some cases, the image being displayed does not have a wide range of colors and therefore does not fill or utilize the wider range of colors in the printer gamut or even the screen gamut.
- New technologies in capturing and displaying wide gamut images and new standards for wide gamut color encoding raise the question of compatibility between today's (legacy) content distribution channels and upcoming wide gamut content creation, distribution and display.
- a color gamut may contain all colors that can be reproduced by a specific display or printing device or that can be transmitted or stored when using for instance a specific medium or standard.
- a color gamut can also be used to characterize all colors that occur in an image or in a video.
- Cameras, palm tops, cell phones, Internet terminals and digital picture frames generate images using specific color gamuts in YCC, Adobe RGB, bgRGB, scRGB, CIELAB, e-sRGB or ROMM digital representations.
- Gamut mapping of image data from a source color gamut to a target color gamut is typically performed using a gamut mapping algorithm ("GMA"), which is a particular method of mapping color data between gamuts.
- GMA gamut mapping algorithm
- a gamut mapping algorithm often makes use of data that defines the boundaries of the color gamut of the source and the target color devices, in order to obtain a reference between the two gamuts for appropriate gamut mapping of the image.
- Such data defining the gamut color boundary can be referred to as a gamut boundary description (“GBD"). See for instance US2007/081176 .
- Gamut mapping is generally performed in a device-independent color space.
- a very usual device-independent mapping color space is the CIE L*a*b* space.
- the gamut mapping may also be performed in the CIE L*C*h color space.
- the color may be represented by three attributes, namely the lightness representing the color lightness, the chroma representing the color brightness and the color hue representing the color type.
- Gamut mapping algorithms are generally build according to specific criterion, as, for instance, the preservation of the hue, or the preservation of the contrast, or the preservation of the saturation of colors, or the preservation of the colorimetric color reproduction. The gamut mapping procedure has generally to be optimized with respect to these criteria.
- the generally accepted practice is to perform gamut mapping in a two-dimensional plane of lightness L and chroma C, with the color hue h being kept constant.
- Such a gamut mapping method is then hue-preserving.
- the mapping of this source color is performed in a L*C* plane comprising all the colors having the same hue.
- other two-dimensional spaces can be used, for example xy color space as defined by the CIE.
- Gamut mapping algorithms that are very common map colors along mapping trajectories that are anchored to an anchor point, in the mapping color space. These mapping trajectories are generally straight lines.
- the anchor points generally belong to the achromatic axis (or "grey line") of the color space. These anchor points can be chosen according to the shape of the source and destination gamuts such as described, for instance, by Montag and Fairchild in their paper entitled “ Gamut mapping: Evaluation of chroma clipping techniques for three destination gamuts", published in 1998 at the IS&T/SID Sixth Color Imaging Conference in Scottsdale. The way how the color is moved along such mapping trajectories can be various. Simple mapping algorithms clip all colors that are outside the target gamut onto the target gamut surface along the mapping trajectories.
- mapping algorithms compress linearly all colors along the mapping trajectories by linear scaling such that they keep on the same mapping trajectories but are all inside the destination gamuts.
- Still more complex, non-linear parametric functions apply specific, sometimes piece-wise defined scaling operations to the colors to move them along the defined lines inside the target gamut.
- Braun and Fairchild suggest in their publication entitled " Image Lightness Rescaling Using Sigmoidal Contrast Enhancement Functions" published in 1999 in the Proceedings of SPIE Electronic Imaging Conference (El ⁇ 99) a non-linear, S-shaped function.
- mapping colors from a source gamut into a destination gamut the above cited papers use mapping straight lines, variable anchor points and mapping functions that define how far a color on a mapping straight line needs to be moved.
- the mapping trajectories, the anchor points and the mapping functions can be fixed or adapted to the source and target gamut boundaries in a given mapping color space.
- Gamut mapping using variable anchor points from Lee C-S et al.
- a gamut-mapping algorithm is proposed that can maintain device-independent color.
- this algorithm utilizes variable anchor points (a center of gravity on the lightness axis) to both reduce a sudden color change on the gamut boundary of the printer and to maintain a uniform color change dining the mapping process. Accordingly, the algorithm can reproduce high quality images with low-cost color devices.
- mapping color space being 3D as L*a*b* or L*C*h, or being 2D as L*C*, may also be partitioned into a plurality of color sub-spaces, each sub-space having its own gamut mapping algorithm to be apply to the source colors belonging to this color sub-space.
- the mapping color space may be divided into three regions, a first region of minimum lightness, a second region of maximum lightness and a third region of intermediate lightness; in the first region, source colors will be mapped according to straight lines that are all anchored to a same first anchor point; in the second region, source colors will be mapped according to straight lines that are all anchored to a same second anchor point; and in the third region, source colors will be mapped according to straight lines that are anchored to different and variable anchor points.
- the problem that rises when mapping using different gamut mapping algorithms according the partitions or regions of the mapping color space is the uniformity of the global mapping method, mainly across two partitions. Moreover, the method using variable anchor points does not have generally a smooth behavior in terms of uniformity. Such non-uniformities may create false contour defects.
- An object of the invention is to improve the uniformity of the gamut mapping in order, notably, to limit the false contour defects that may be associated with a lack of uniformity.
- the subject of the invention is a method of mapping, in a mapping color space, source colors of a source color device into target colors of a target color device, wherein :
- said at least one mapping plane is partitioned into several parts, at least one part with priority in contrast preservation, and at least another part with priority in saturation preservation. Thanks to the invention, colors are better preserved after mapping, even if there are different mapping methods in the different parts of a given mapping plane.
- each of said gradients of mapping trajectories at said intersections with the uniformity testing curve is defined as the value of the first derivation of the function describing, in its mapping plane, a mapping trajectory at the intersection of said mapping trajectory with said uniformity testing curve.
- Mapping trajectories can be straight lines, but other types of curves can be used. Other types include curves defined by rational non-linear functions, exponential functions, mathematical parametric closed functions in general, functions defined by numerical data, or any other type of curves. Other types of curves such as polygons and general non-linear curves are also possible as mapping trajectories. Since these curves have more degrees of freedom than a straight line, they can be optimized with respect to a set of criteria including human visual system and a specific target device. For example, the curves may be denser in regions where the human eye perceives more color differences or the target color device has better resolution in the mapping color space.
- the invention provides an advantageous alignment of the different mapping trajectories of the same mapping plane that is adapted to improve the uniformity of the mapping.
- the continuity of gradients of mapping trajectories, and the continuity of their first derivatives along a uniformity testing curve, are used as a criterion for this alignment, because this continuity of gradients and the continuity of their first derivatives along a uniformity testing curve indicate whether the mapping trajectories are homogeneous in a neighborhood in color space.
- This invention offers a solution for gamut mapping that
- mapping color space is the CIE L*C*h, already mentioned.
- Source colors of a source color device have to be mapped into target colors of a target color device.
- a source gamut is associated with the source color device, giving the entire range of colors that can be rendered or captured by this source color device.
- a target gamut is associated with the target color device, giving the entire range of colors that can be rendered or captured by this target color device : figure 2 represents such a target gamut.
- Each source color is mapped into its target color along a mapping trajectory that is anchored to an anchor point.
- the mapping trajectories are straight lines. All anchor points belongs to the achromatic axis. All source colors are mapped along mapping lines that belongs to a plane comprise this source color and the achromatic axis. It means that the mapping is not carried out in 3D L*C*h color space but in 2D L*C* color planes. The mapping method is then hue-preserving. All source colors lying on a mapping line are mapped along this mapping line.
- straight lines are used as mapping trajectories along which source colors are mapped to target colors.
- Any source color JCh to be mapped is defined by its values L,C in a given L*C* mapping color plane of constant hue h.
- the definition of the mapping of this source color requires the definition of different partitions in this L*C* mapping color plane, the definition of a mapping line, the definition of an anchor point, and the definition of a compression/extension algorithm along this mapping line.
- any source color can be mapped along its mapping line in a way that the corresponding target color is inside the target gamut.
- the partitioning of the L*C* mapping color plane is the pre-processing step for the calculation of mapping lines that belong to this plane.
- the idea is to simplify the mapping line calculation task and to more easily define a gamut mapping that conserves in general the maximum of contrast and that preserves saturation of dark and light colors.
- Figure 2 shows a solution for L*C* color plane partition.
- Three parts are defined in this plane : part 1, part 2 and part 3. They are separated by straight lines since straight lines are used as mapping trajectories. If mapping trajectories are of other type, the parts are separated by curves of the same type as used for mapping trajectories.
- Parts 1 and 3 contain colors of high and low luminance, respectively. In this part, saturation is to be preserved as much as possible. In parts 1 and 3, saturation is - even before mapping - naturally not very strong for two reasons. First, parts 1 and 3 are delimited by respectively the upper border of part 2 with a positive slope and the lower border of part 2 with a negative slope, already described. By this, colors of high saturation are in part 2 as shown in figure 1 . Second reason is the typical shape of color gamuts that are usually convex and do not contain highly saturated colors with very high or very low luminances (see figure 2 for an example of a gamut).
- L 0 and ⁇ L may also be derived from the shape of a gamut.
- ⁇ max may also be determined with respect to a gamut, for example as a function of ⁇ L.
- the anchor point is an important characteristic of the gamut mapping algorithm since it determines the overall mapping direction.
- Variable anchor points are used in part 2 in order to conserve in general the maximum of contrast.
- Fixed anchor points are in parts 1 and 3 in order to preserve saturation of dark and light colors.
- the anchor points are first defined in reference to figure 3 as follows:
- Part 1 contains bright colors having a high lightness and low to medium saturation or chroma. Choosing an anchor point at L 0 + ⁇ L has the effect that the direction of mapping will have a strong component in lightness direction and a smaller component in chroma direction. The visible effect of the mapping will then be a reduction of lightness but few changes in saturation or chroma.
- Part 3 contains dark colors having a low lightness and low to medium saturation or chroma.
- the visible effect of the mapping will be an increase of lightness but few changes in saturation or chroma.
- the overall impression of mapping of source colors in parts 1 and 3 is that the contrast is reduced but the saturation is preserved.
- Part 2 contains colors of medium luminance and low, medium and high saturation.
- the choice of anchor points on the anchor interval on the L* axis between L 0 - ⁇ L and L 0 + ⁇ L has the effect that the direction of mapping will have a small component in lightness direction and a larger component in chroma direction.
- the visible effect of the mapping will be a reduction of saturation or chroma but few changes in contrast.
- mapping lines and of anchor points in the different parts of the mapping plane L*C* (see fig.3 and 4):
- One aim of the gamut mapping method is to ensure the smoothness of gradients of mapping curves in the mapping color space and thus to preserve the colorimetric relation between neighbouring colors by mapping neighbored colors along similar mapping trajectories.
- the uniformity of the global mapping inside the L*C* mapping color plane of constant hue h can be first achieved by the following characteristics:
- the intersection of this mapping line with the lightness axis, i.e. the anchor point of this mapping line, and the gradient of the mapping line have to be determined.
- the mapping lines are then defined such that, along this uniformity testing curve, the gradients of the intersecting mapping lines and the first derivation of these gradients are continuous, such gradients and first derivation of these gradients being defined as follows :
- these gradients and the first derivation of these gradients along the uniformity testing curve fulfil the following conditions :
- mapping - Definition of a compression/extension algorithm along the mapping lines
- any source color is mapped along its mapping line in a way that the corresponding target color is inside the target gamut.
- each source color is mapped onto a target color in direction to the above defined anchor point.
- the mapping of a source color can be described as a modification of the distance D of this source color from the anchor point into a distance D' of the target color from the same anchor point. Any known algorithm can be used for this mapping.
- the three segment mapping is used in this embodiment, based on a one-dimensional function mapping of D to D' using three segments:
- D ′ ⁇ D 0 ⁇ D ⁇ D inf lection D output MAX ⁇ D inf lection D ⁇ D inf lection D clipping ⁇ D inf lection if D inf lection ⁇ D ⁇ D clipping D output MAX D clipping ⁇ D ⁇ D input MAX
- D is the distance between the source color to map and the anchor point along the mapping line
- D input MAX is the maximum distance of the source color values, for example determined by the limits of CIE L*a*b* space
- D output MAX is the distance between the anchor point and the target gamut boundary along the mapping line.
- This method has two parameters:
- mapping method is now entirely defined by the definition of the different partitions in a L*C* mapping plane, the definition of the anchor points and of the mapping lines in this mapping plane, and the definition of the one-dimensional compression/extension functions along these mapping lines.
- FIG. 5 summarizes the mapping method according to this embodiment of the invention that includes the following steps:
- the present invention improves upon the prior art by providing a uniform gamut mapping method. Continuity of gradients of mapping trajectories along the uniformity testing curve, and the continuity of their first derivatives along the uniformity testing curve, are used as a criterion for this uniformity, because the continuity of these gradients and the continuity of their first derivatives indicate whether the mapping trajectory is steep or flat at the source colors to be mapped.
- the invention is independent from the choice of the mapping color space. XYZ, Lab or JCh are examples of mapping color space.
- the invention is independent of the gamut boundary descriptors that are used to represent the source color gamut or the target color gamut.
- the invention is independent of the compression/extension algorithms that are used to map the source colors along their mapping trajectories.
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Facsimile Image Signal Circuits (AREA)
- Color Image Communication Systems (AREA)
- Image Generation (AREA)
Description
- The invention relates to a method of mapping a set of source colors of a source color device into a set of target colors of a target color device.
- Gamut mapping is used to reproduce an image rendered by a source color device on a target color device, since the source device and the target device typically have different gamut boundaries with respect to each other. In other words, the gamut of colors that can be reproduced by the source device is typically not the same as the gamut of colors that can be reproduced by the target device. Gamut mapping can be used to render the image from within the source device gamut boundary to within the target device gamut boundary, so as to more accurately reproduce the color image on the target device.
- The term "color gamut" or "gamut" is generally used to describe the complete range of colors an image contains or a color device is able to render. It is sometimes referred to as a color gamut or the gamut color space associated, for instance, with a printer or screen display device. Gamut mapping an image for instance onto a screen or printer generally requires adjusting the colors of the image to fit in the constrained color gamut of the screen or printer. In some cases, the image being displayed does not have a wide range of colors and therefore does not fill or utilize the wider range of colors in the printer gamut or even the screen gamut. New technologies in capturing and displaying wide gamut images and new standards for wide gamut color encoding raise the question of compatibility between today's (legacy) content distribution channels and upcoming wide gamut content creation, distribution and display.
- A color gamut may contain all colors that can be reproduced by a specific display or printing device or that can be transmitted or stored when using for instance a specific medium or standard. A color gamut can also be used to characterize all colors that occur in an image or in a video. Cameras, palm tops, cell phones, Internet terminals and digital picture frames generate images using specific color gamuts in YCC, Adobe RGB, bgRGB, scRGB, CIELAB, e-sRGB or ROMM digital representations.
- Gamut mapping of image data from a source color gamut to a target color gamut is typically performed using a gamut mapping algorithm ("GMA"), which is a particular method of mapping color data between gamuts. A gamut mapping algorithm often makes use of data that defines the boundaries of the color gamut of the source and the target color devices, in order to obtain a reference between the two gamuts for appropriate gamut mapping of the image. Such data defining the gamut color boundary can be referred to as a gamut boundary description ("GBD"). See for instance
US2007/081176 . - Gamut mapping is generally performed in a device-independent color space. A very usual device-independent mapping color space is the CIE L*a*b* space. For utmost perceptual comprehensibility, the gamut mapping may also be performed in the CIE L*C*h color space. Directly in connection with the color perception by the eyes, the color may be represented by three attributes, namely the lightness representing the color lightness, the chroma representing the color brightness and the color hue representing the color type. In relation with the previous L*a*b* color space, the chroma C* is calculated according to the formula
- Instead of performing the gamut mapping in the 3D L*C*h color space, the generally accepted practice is to perform gamut mapping in a two-dimensional plane of lightness L and chroma C, with the color hue h being kept constant. Such a gamut mapping method is then hue-preserving. For each source color having a given hue, the mapping of this source color is performed in a L*C* plane comprising all the colors having the same hue. Instead of using in L*C* space, other two-dimensional spaces can be used, for example xy color space as defined by the CIE.
- Gamut mapping algorithms that are very common map colors along mapping trajectories that are anchored to an anchor point, in the mapping color space. These mapping trajectories are generally straight lines. The anchor points generally belong to the achromatic axis (or "grey line") of the color space. These anchor points can be chosen according to the shape of the source and destination gamuts such as described, for instance, by Montag and Fairchild in their paper entitled "Gamut mapping: Evaluation of chroma clipping techniques for three destination gamuts", published in 1998 at the IS&T/SID Sixth Color Imaging Conference in Scottsdale. The way how the color is moved along such mapping trajectories can be various. Simple mapping algorithms clip all colors that are outside the target gamut onto the target gamut surface along the mapping trajectories. More complex mapping algorithms compress linearly all colors along the mapping trajectories by linear scaling such that they keep on the same mapping trajectories but are all inside the destination gamuts. Still more complex, non-linear parametric functions apply specific, sometimes piece-wise defined scaling operations to the colors to move them along the defined lines inside the target gamut. For example, Braun and Fairchild suggest in their publication entitled "Image Lightness Rescaling Using Sigmoidal Contrast Enhancement Functions" published in 1999 in the Proceedings of SPIE Electronic Imaging Conference (Elí99) a non-linear, S-shaped function. When mapping colors from a source gamut into a destination gamut, the above cited papers use mapping straight lines, variable anchor points and mapping functions that define how far a color on a mapping straight line needs to be moved. The mapping trajectories, the anchor points and the mapping functions can be fixed or adapted to the source and target gamut boundaries in a given mapping color space.
- In Gamut mapping using variable anchor points from Lee C-S et al., a gamut-mapping algorithm is proposed that can maintain device-independent color. Categorized as a parametric gamut-mapping algorithm, this algorithm utilizes variable anchor points (a center of gravity on the lightness axis) to both reduce a sudden color change on the gamut boundary of the printer and to maintain a uniform color change dining the mapping process. Accordingly, the algorithm can reproduce high quality images with low-cost color devices.
- The mapping color space, being 3D as L*a*b* or L*C*h, or being 2D as L*C*, may also be partitioned into a plurality of color sub-spaces, each sub-space having its own gamut mapping algorithm to be apply to the source colors belonging to this color sub-space. For example, when using gamut mapping algorithms based on compression or extension along mapping trajectories anchored to anchor points as mentioned above, the mapping color space may be divided into three regions, a first region of minimum lightness, a second region of maximum lightness and a third region of intermediate lightness; in the first region, source colors will be mapped according to straight lines that are all anchored to a same first anchor point; in the second region, source colors will be mapped according to straight lines that are all anchored to a same second anchor point; and in the third region, source colors will be mapped according to straight lines that are anchored to different and variable anchor points. The article entitled "Parametric gamut mapping algorithms using variable anchor points", published by Chae-Soo LEE, Chae-Hee LEE and Yeong-Ho HA, in Journal of Imaging Science and Technology, volume 44, ) gives an example of such a mapping method. Other mapping methods using different gamut mapping algorithms depending on the mapping color regions are disclosed in
US5933253 , in the article entitled "Gamut mapping in Munsell constant hue sections", published by Gabriel MARCU during the sixth "Color Imaging Conference : Color Science, Systems, and Applications" , pp. 159-162. - The problem that rises when mapping using different gamut mapping algorithms according the partitions or regions of the mapping color space is the uniformity of the global mapping method, mainly across two partitions. Moreover, the method using variable anchor points does not have generally a smooth behavior in terms of uniformity. Such non-uniformities may create false contour defects.
- In the article entitled "On the Continuity of Gamut Mapping Algorithm", Peter Zolliker, Markus Dätwyler and Klaus Simon proposes a method to evaluate the uniformity of a global mapping method : first, two direct neighbored colors (or RGB value triplets) are transformed by a color management chain including gamut mapping. The distance between the two mapped neighbored colors (triplets) statistically analyzed over a large set of color pairs is a first criterion of uniformity. Second, a color and a circumscribing - unit sphere is mapped in Lab space by gamut mapping. The volume, surface, maximum and minimum diameter of the mapped sphere statistically analyzed over a large set of colors is the second criterion of uniformity.
- An object of the invention is to improve the uniformity of the gamut mapping in order, notably, to limit the false contour defects that may be associated with a lack of uniformity.
- For this purpose, the subject of the invention is a method of mapping, in a mapping color space, source colors of a source color device into target colors of a target color device, wherein :
- each source color is mapped into its target color along a mapping trajectory that is anchored to an anchor point, wherein said mapping trajectory belongs to a mapping plane comprising said anchor points,
- there is at least one mapping plane comprising said anchor points, in which the different mapping trajectories do not intersect one with another except, possibly, at said anchor points, in which all source colors that lies on a mapping trajectory are mapped along said mapping trajectory, and in which a plurality of mapping trajectories can be found that are anchored to different "variable" anchor points,
- the function defined by the variation, along said uniformity testing curve, of the gradients of these mapping trajectories at said intersections is continuous,
- the first derivation of said function along this uniformity testing curve is also continuous.
- It has to be noted that, in figure 9 (a) of the above-quoted article entitled "Parametric gamut mapping algorithms using variable anchor points", if we define a testing curve as a vertical straight line with C* # 0, intersecting all mapping trajectories of the L*C* mapping plane, the function defined by the variation, along this vertical straight line, of the slopes, i.e. the gradients, of the mapping trajectories at said intersections is continuous, but the first derivation of this function along the vertical straight line is not continuous at the boundaries between the different partitions or mapping regions. In this document, according of the different regions, the mapping is performed using fixed anchor points (central region of medium Lightness) or is performed using mapping trajectories with constant slope (region of high or low Lightness).
- Preferably, said at least one mapping plane is partitioned into several parts, at least one part with priority in contrast preservation, and at least another part with priority in saturation preservation. Thank to the invention, colors are better preserved after mapping, even if there are different mapping methods in the different parts of a given mapping plane.
- Preferably, each of said gradients of mapping trajectories at said intersections with the uniformity testing curve is defined as the value of the first derivation of the function describing, in its mapping plane, a mapping trajectory at the intersection of said mapping trajectory with said uniformity testing curve.
- Mapping trajectories can be straight lines, but other types of curves can be used. Other types include curves defined by rational non-linear functions, exponential functions, mathematical parametric closed functions in general, functions defined by numerical data, or any other type of curves. Other types of curves such as polygons and general non-linear curves are also possible as mapping trajectories. Since these curves have more degrees of freedom than a straight line, they can be optimized with respect to a set of criteria including human visual system and a specific target device. For example, the curves may be denser in regions where the human eye perceives more color differences or the target color device has better resolution in the mapping color space.
- The invention provides an advantageous alignment of the different mapping trajectories of the same mapping plane that is adapted to improve the uniformity of the mapping. The continuity of gradients of mapping trajectories, and the continuity of their first derivatives along a uniformity testing curve, are used as a criterion for this alignment, because this continuity of gradients and the continuity of their first derivatives along a uniformity testing curve indicate whether the mapping trajectories are homogeneous in a neighborhood in color space.
- This invention offers a solution for gamut mapping that
- Uses variable anchor points in order to conserve in general the maximum of contrast;
- Excludes anchor points of extreme (low and high) lightness in order to preserve saturation of dark and light colors;
- Ensures smoothness of gradients of mapping curves and thus
- Preserves the colorimetric relation between neighboring colors by mapping neighbored colors along similar curves.
- The invention has at least three following advantages with respect to known gamut mapping methods:
- Overall contrast is better preserved;
- Saturation of dark and light colors is better preserved;
- Colorimetric relation of neighboring colors is better preserved.
- The invention will be more clearly understood on reading the description which follows, given by way of non-limiting example and with reference to the appended figures in which:
-
Figure 1 illustrates the mapping, within a given L*C* mapping plane, of a source color into a target color located inside the target gamut, along a mapping line anchored to anchor point, according to an embodiment of the invention; -
Figure 2 illustrates the partition of the L*C* mapping plane offigure 1 ; -
Figure 3 illustrates different mapping lines belonging to the L*C* mapping plane offigure 1 , that are differently anchored according to the partition offigure 2 ; -
Figure 4 illustrates the continuity of the gradient of their derivatives at the intersections of a uniformity testing curve with the different mapping lines offigure 3 ; -
Figure 5 summarizes the mapping method according to the embodiment of the invention which is illustrated byfigure 1 to 4 . - An non-limiting embodiment of a mapping method according to the invention will now be explained, in which the mapping color space is the CIE L*C*h, already mentioned. The achromatic axis of this color space corresponds to the lightness axis, i.e. the line C=0, h=0. Source colors of a source color device have to be mapped into target colors of a target color device. A source gamut is associated with the source color device, giving the entire range of colors that can be rendered or captured by this source color device. Similarly, a target gamut is associated with the target color device, giving the entire range of colors that can be rendered or captured by this target color device :
figure 2 represents such a target gamut. Each source color is mapped into its target color along a mapping trajectory that is anchored to an anchor point. The mapping trajectories are straight lines. All anchor points belongs to the achromatic axis. All source colors are mapped along mapping lines that belongs to a plane comprise this source color and the achromatic axis. It means that the mapping is not carried out in 3D L*C*h color space but in 2D L*C* color planes. The mapping method is then hue-preserving. All source colors lying on a mapping line are mapped along this mapping line. - In this exemplary embodiment of the invention, straight lines are used as mapping trajectories along which source colors are mapped to target colors. Any source color JCh to be mapped is defined by its values L,C in a given L*C* mapping color plane of constant hue h. The definition of the mapping of this source color requires the definition of different partitions in this L*C* mapping color plane, the definition of a mapping line, the definition of an anchor point, and the definition of a compression/extension algorithm along this mapping line. As shown in
figure 1 , any source color can be mapped along its mapping line in a way that the corresponding target color is inside the target gamut. - The partitioning of the L*C* mapping color plane is the pre-processing step for the calculation of mapping lines that belong to this plane. The idea is to simplify the mapping line calculation task and to more easily define a gamut mapping that conserves in general the maximum of contrast and that preserves saturation of dark and light colors.
-
Figure 2 shows a solution for L*C* color plane partition. Three parts are defined in this plane :part 1,part 2 andpart 3. They are separated by straight lines since straight lines are used as mapping trajectories. If mapping trajectories are of other type, the parts are separated by curves of the same type as used for mapping trajectories. -
Part 2 is the main part of the L*C* color plane. In this part, the maximum of contrast is to be preserved.Part 2 is defined by a so-called anchor interval on the lightness axis ofsize 2 ΔL centered around L0 as well as by an angle αmax between the upper border of this part and a line L= L0+ΔL that is parallel to the chroma axis.Part 2 is symmetric in lightness direction with respect to the line L= L0 parallel to the chroma axis.Part 2 is an open region for the high C* values. -
Parts parts parts part 2 with a positive slope and the lower border ofpart 2 with a negative slope, already described. By this, colors of high saturation are inpart 2 as shown infigure 1 . Second reason is the typical shape of color gamuts that are usually convex and do not contain highly saturated colors with very high or very low luminances (seefigure 2 for an example of a gamut). - Reasonable values for L0, ΔL and αmax are 50, 30 and 70 degres, respectively. L0 and ΔL may also be derived from the shape of a gamut. For example, L0 is chosen as luminance where the gamut has its largest chroma and ΔL is chosen with respect of the distance between L0 and the luminance limits, for example ΔL = max {L 0;100-L 0}. αmax may also be determined with respect to a gamut, for example as a function of ΔL.
- The anchor point is an important characteristic of the gamut mapping algorithm since it determines the overall mapping direction. Variable anchor points are used in
part 2 in order to conserve in general the maximum of contrast. Fixed anchor points are inparts - The anchor points are first defined in reference to
figure 3 as follows: - For source colors in
part 1, the anchor point is always at L0+ΔL; - For source colors in
part 2, the anchor point is variable and chosen between L0-ΔL and L0+ΔL; therefore, in the L*C* mapping plane, a plurality of mapping lines can be found that are anchored to different variable anchor points. - For source colors in
part 3, the anchor point is always at L0-ΔL. -
Part 1 contains bright colors having a high lightness and low to medium saturation or chroma. Choosing an anchor point at L0+ΔL has the effect that the direction of mapping will have a strong component in lightness direction and a smaller component in chroma direction. The visible effect of the mapping will then be a reduction of lightness but few changes in saturation or chroma. -
Part 3 contains dark colors having a low lightness and low to medium saturation or chroma. In a way comparable to the processing inpart 1, the visible effect of the mapping will be an increase of lightness but few changes in saturation or chroma. The overall impression of mapping of source colors inparts -
Part 2 contains colors of medium luminance and low, medium and high saturation. The choice of anchor points on the anchor interval on the L* axis between L0-ΔL and L0+ΔL has the effect that the direction of mapping will have a small component in lightness direction and a larger component in chroma direction. The visible effect of the mapping will be a reduction of saturation or chroma but few changes in contrast. - One aim of the gamut mapping method is to ensure the smoothness of gradients of mapping curves in the mapping color space and thus to preserve the colorimetric relation between neighbouring colors by mapping neighbored colors along similar mapping trajectories.
- The uniformity of the global mapping inside the L*C* mapping color plane of constant hue h can be first achieved by the following characteristics:
- inside the L*C* mapping color plane, mapping lines do not intersect with other mapping lines.
- All colors lying on a mapping curve are mapped along this curve.
- Each anchor point belonging to
part 2 has a single mapping line associated. This means that all source colors that lie on this mapping line are mapped along this mapping line. - To define the mapping line of a source color to be mapped, the intersection of this mapping line with the lightness axis, i.e. the anchor point of this mapping line, and the gradient of the mapping line have to be determined. For any color having L, C coordinates in the L*C* mapping color plane, the position Là of the anchor points on the lightness axis is defined as follows :
- the coefficient r is defined as follows:
- the coefficient k is defined as follows:
- the coefficient f max is defined in the
condition 3 below; - the sign +/- is positive for L>L0 and negative for L<L0.
- According to the invention, as shown on
figure 4 , a uniformity testing curve is found as a vertical straight line of constant chroma C=C0, that intersects all mapping trajectories of the L*C* mapping plane. The mapping lines are then defined such that, along this uniformity testing curve, the gradients of the intersecting mapping lines and the first derivation of these gradients are continuous, such gradients and first derivation of these gradients being defined as follows : - the value of such gradient at any intersection of a given mapping line with this uniformity testing curve is defined as equal to the tangent of the angle α between the normal to this uniformity testing curve at this intersection and the tangent of this given mapping line at the same intersection ; this gradient is then calculated as follows:
- the value of such first derivation of gradient at any intersection of a given mapping line with this uniformity testing curve is defined as the derivation of the gradient along said uniformity testing curve; here, as this uniformity testing curve is parallel to the L* axis, such a derivation is calculated according to the variable L.
- According to the invention, these gradients and the first derivation of these gradients along the uniformity testing curve fulfil the following conditions :
- 1- Smoothness at L=L0: tan α|L=L
ȧ =0; - 2- Smoothness at
- 3- Smoothness at border between
part 2 andpart 1, and betweenpart 2 andpart 3 of the mapping plane : - 4- Smoothness at border between
part 2 andpart 1, and betweenpart 2 andpart 3 of the mapping plane: - The coefficients r and k have been previously defined. By these coefficients, the conditions 1-4 are fulfilled and the gradients of the mapping curves along the test line C=Co are continuous up to the first derivation.
- In order to proof this, conditions 3 and 4 are verified in the following :
-
Condition 3 is verified as follows: - Condition 4 is verified as follows for L = Là + ΔL + fmax ;C = C 0 at the border between
part 1 andpart 2. First, the derivation is calculated: - As shown in
figure 1 , any source color is mapped along its mapping line in a way that the corresponding target color is inside the target gamut. - In this last step of the definition of the gamut mapping method, each source color is mapped onto a target color in direction to the above defined anchor point. The mapping of a source color can be described as a modification of the distance D of this source color from the anchor point into a distance D' of the target color from the same anchor point. Any known algorithm can be used for this mapping.
- In the already mentioned paper of Montag and Fairchild, four mapping techniques are described: scaling-clipping, knee-function mapping, Gentile's mapping, and three segment mapping.
- The three segment mapping is used in this embodiment, based on a one-dimensional function mapping of D to D' using three segments:
- a first segment having a slope of one,
- a last segment being a hard clipping, and
- a middle segment connecting the other two segments.
- The mathematic formula for this one-dimensional function is:
- This method has two parameters:
- D inf lection which is the distance where the first linear function (of slope one) stops and the middle segment begins,
- Dclipping is the cut off value for clipping.
- The mapping method according to this embodiment of the invention is now entirely defined by the definition of the different partitions in a L*C* mapping plane, the definition of the anchor points and of the mapping lines in this mapping plane, and the definition of the one-dimensional compression/extension functions along these mapping lines.
-
Figure 5 summarizes the mapping method according to this embodiment of the invention that includes the following steps: - Color space partitioning, which divides the color space into at least two parts, the first part with priority in contrast preservation and the second part with priority in saturation preservation.
- For each given source color belonging to a source gamut and being in one of the said parts of the color space, an anchor point is calculated such that said source color and its anchor point belong to a mapping line and such that other source colors belonging to said mapping curve use the same mapping curve;
- Aligning mapping lines of source colors in a way that the gradient of the lines and its first derivative are a smooth function of the source colors in the color space;
- Each said source color is mapped along its mapping line onto a destination color belonging to a target gamut;
- Determining the moved distance of said source color along its mapping curve according to an unidirectional mapping function that considers at least one of the source and the target gamuts.
- According to the invention, as the gradients along the uniformity testing curve and the first derivation of these gradients along the uniformity testing curve are continuous, a so-called "smooth behavior" is obtained. It can thus be appreciated that the present invention improves upon the prior art by providing a uniform gamut mapping method. Continuity of gradients of mapping trajectories along the uniformity testing curve, and the continuity of their first derivatives along the uniformity testing curve, are used as a criterion for this uniformity, because the continuity of these gradients and the continuity of their first derivatives indicate whether the mapping trajectory is steep or flat at the source colors to be mapped.
- The invention is independent from the choice of the mapping color space. XYZ, Lab or JCh are examples of mapping color space. The invention is independent of the gamut boundary descriptors that are used to represent the source color gamut or the target color gamut. The invention is independent of the compression/extension algorithms that are used to map the source colors along their mapping trajectories.
- It will be understood that the present invention has been described purely by way of example, and modifications of detail can be made without departing from the scope of the invention. While the present invention is described with respect to the above described embodiment, it is understood that the present invention is not limited to this embodiment. The present invention as claimed therefore includes variations from this embodiment described herein, as will be apparent to one of skill in the art. While some of the specific embodiments may be described and claimed separately, it is understood that the various features of embodiments described and claimed herein may be used in combination.
Claims (3)
- Method of mapping, in a mapping color space, source colors of a source color device into target colors of a target color device, comprising mapping each source color into its target color along a mapping trajectory that is anchored to an anchor point, wherein said mapping trajectory belongs to a mapping plane comprising said anchor points,
wherein there is at least one mapping plane comprising a plurality of different anchor points on which different mapping trajectories are anchored that do not intersect one with another except, possibly, at said anchor points, in which each of said source colors that lies on one of said mapping trajectories are mapped along said one mapping trajectory,
characterised in that, in said at least one mapping plane, a uniformity testing curve different from an achromatic axis can be found that intersects all said mapping trajectories of this mapping plane such that the gradients of these mapping trajectories at said intersections vary continuously along said uniformity testing curve,
wherein the first derivation of said gradients along this uniformity testing curve is also continuous. - Method of mapping according to claim 1 wherein said at least one mapping plane is partitioned into several parts, at least one part with priority in contrast preservation, and at least another part with priority in saturation preservation.
- method of mapping according to claim 1 wherein, each of said gradients of mapping trajectories at said intersections with the uniformity testing curve is defined as the value of the first derivation of the function describing, in its mapping plane, a mapping trajectory at the intersection of said mapping trajectory with said uniformity testing curve.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP08169925.8A EP2066110B1 (en) | 2007-11-27 | 2008-11-25 | Mapping method along anchored mapping trajectories with improved uniformity |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP07301595A EP2066112A1 (en) | 2007-11-27 | 2007-11-27 | Mapping method along anchored mapping trajectories with improved uniformity |
EP08169925.8A EP2066110B1 (en) | 2007-11-27 | 2008-11-25 | Mapping method along anchored mapping trajectories with improved uniformity |
Publications (3)
Publication Number | Publication Date |
---|---|
EP2066110A2 EP2066110A2 (en) | 2009-06-03 |
EP2066110A3 EP2066110A3 (en) | 2011-12-14 |
EP2066110B1 true EP2066110B1 (en) | 2017-10-04 |
Family
ID=39365619
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP07301595A Withdrawn EP2066112A1 (en) | 2007-11-27 | 2007-11-27 | Mapping method along anchored mapping trajectories with improved uniformity |
EP08169925.8A Active EP2066110B1 (en) | 2007-11-27 | 2008-11-25 | Mapping method along anchored mapping trajectories with improved uniformity |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP07301595A Withdrawn EP2066112A1 (en) | 2007-11-27 | 2007-11-27 | Mapping method along anchored mapping trajectories with improved uniformity |
Country Status (2)
Country | Link |
---|---|
US (1) | US8154559B2 (en) |
EP (2) | EP2066112A1 (en) |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR101157832B1 (en) * | 2007-07-16 | 2012-06-22 | 삼성전자주식회사 | Scanner color correction device and control method thereof |
EP3036890B1 (en) | 2013-08-22 | 2019-09-04 | Dolby Laboratories Licensing Corporation | Gamut mapping systems and methods |
EP3026883A1 (en) * | 2014-11-27 | 2016-06-01 | Thomson Licensing | Method of mapping source colors of an image into a target color gamut of a target color device in two mapping steps |
EP3110128A1 (en) * | 2015-06-25 | 2016-12-28 | Thomson Licensing | Color gamut mapping based on the mapping of cusp colors obtained through simplified cusp lines |
EP3367659A1 (en) * | 2017-02-28 | 2018-08-29 | Thomson Licensing | Hue changing color gamut mapping |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH0998298A (en) | 1995-09-29 | 1997-04-08 | Sony Corp | Color area compression method and device |
US8477395B2 (en) | 2005-10-07 | 2013-07-02 | Canon Kabushiki Kaisha | Computation of gamut boundary by sampling device-independent color space |
KR101204453B1 (en) * | 2006-02-17 | 2012-11-26 | 삼성전자주식회사 | Apparatus for gamut mapping and method for generating gamut boundary using the same |
KR100834762B1 (en) * | 2006-09-29 | 2008-06-05 | 삼성전자주식회사 | Method and apparatus for gamut mapping for cross medias |
-
2007
- 2007-11-27 EP EP07301595A patent/EP2066112A1/en not_active Withdrawn
-
2008
- 2008-11-20 US US12/313,489 patent/US8154559B2/en not_active Expired - Fee Related
- 2008-11-25 EP EP08169925.8A patent/EP2066110B1/en active Active
Also Published As
Publication number | Publication date |
---|---|
EP2066110A2 (en) | 2009-06-03 |
EP2066112A1 (en) | 2009-06-03 |
US20090141041A1 (en) | 2009-06-04 |
EP2066110A3 (en) | 2011-12-14 |
US8154559B2 (en) | 2012-04-10 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP2120449B1 (en) | Method of processing of a compressed image into a gamut mapped image using spatial frequency analysis | |
Liu et al. | CID: IQ–a new image quality database | |
US6360008B1 (en) | Method of and apparatus for converting color data | |
Montag et al. | Psychophysical evaluation of gamut mapping techniques using simple rendered images and artificial gamut boundaries | |
US6373595B1 (en) | Color data converting method | |
US8270712B2 (en) | Image processing device, image processing program, and image processing method | |
US7064864B2 (en) | Method and apparatus for compressing reproducible color gamut | |
US8331665B2 (en) | Method of electronic color image saturation processing | |
US8014027B1 (en) | Automatic selection of color conversion method using image state information | |
US20090060326A1 (en) | Image processing apparatus and method | |
US6778185B1 (en) | Method and apparatus for mapping colors into a color gamut | |
US8526719B2 (en) | Method of converting color image into grayscale image and recording medium storing program for performing the same | |
Morovic | Gamut mapping | |
EP2066110B1 (en) | Mapping method along anchored mapping trajectories with improved uniformity | |
EP2198601A1 (en) | Method of color mapping from non-convex source gamut into non-convex target gamut | |
Hung-Shing et al. | Three-dimensional gamut mapping method based on the concept of image-dependence | |
EP3590252B1 (en) | Hue changing color gamut mapping | |
US6873730B2 (en) | Color conversion method for preferred color tones | |
Laird et al. | Development and evaluation of gamut extension algorithms | |
EP2023601A1 (en) | Method of color mapping taking into account distribution of colors of interest | |
Marcu et al. | Gamut mapping for color simulation on CRT devices | |
Koschan et al. | Color spaces and color distances | |
Montag et al. | Simulated color gamut mapping using simple rendered images | |
Kim et al. | Image-dependent gamut mapping using a variable anchor point | |
EP2091226A1 (en) | Algebraic method for defining a color gamut mapping function |
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 |
|
AK | Designated contracting states |
Kind code of ref document: A2 Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MT NL NO PL PT RO SE SI SK TR |
|
AX | Request for extension of the european patent |
Extension state: AL BA MK RS |
|
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: THOMSON LICENSING |
|
PUAL | Search report despatched |
Free format text: ORIGINAL CODE: 0009013 |
|
AK | Designated contracting states |
Kind code of ref document: A3 Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MT NL NO PL PT RO SE SI SK TR |
|
AX | Request for extension of the european patent |
Extension state: AL BA MK RS |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: H04N 1/60 20060101AFI20111110BHEP |
|
17P | Request for examination filed |
Effective date: 20120606 |
|
AKX | Designation fees paid |
Designated state(s): DE FR GB |
|
17Q | First examination report despatched |
Effective date: 20140730 |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
INTG | Intention to grant announced |
Effective date: 20161021 |
|
GRAJ | Information related to disapproval of communication of intention to grant by the applicant or resumption of examination proceedings by the epo deleted |
Free format text: ORIGINAL CODE: EPIDOSDIGR1 |
|
INTG | Intention to grant announced |
Effective date: 20161021 |
|
GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
GRAF | Information related to payment of grant fee modified |
Free format text: ORIGINAL CODE: EPIDOSCIGR3 |
|
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: THOMSON LICENSING DTV |
|
GRAL | Information related to payment of fee for publishing/printing deleted |
Free format text: ORIGINAL CODE: EPIDOSDIGR3 |
|
GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
GRAL | Information related to payment of fee for publishing/printing deleted |
Free format text: ORIGINAL CODE: EPIDOSDIGR3 |
|
GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): DE FR GB |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R096 Ref document number: 602008052338 Country of ref document: DE |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 10 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R084 Ref document number: 602008052338 Country of ref document: DE |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R097 Ref document number: 602008052338 Country of ref document: DE |
|
PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
26N | No opposition filed |
Effective date: 20180705 |
|
GBPC | Gb: european patent ceased through non-payment of renewal fee |
Effective date: 20180104 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 11 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: GB Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20180104 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R081 Ref document number: 602008052338 Country of ref document: DE Owner name: INTERDIGITAL MADISON PATENT HOLDINGS, FR Free format text: FORMER OWNER: THOMSON LICENSING DTV, LSSY-LES-MOULINEAUX, FR |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: FR Payment date: 20221122 Year of fee payment: 15 Ref country code: DE Payment date: 20220527 Year of fee payment: 15 |
|
P01 | Opt-out of the competence of the unified patent court (upc) registered |
Effective date: 20230514 |