A METHOD AND APPARATUS FOR INVERSE-TONE MAPPING A PICTURE

Abstract

The present disclosure generally relates to a method and device for inverse-tone mapping a picture. The method comprising: —obtaining (20) a first component (Y) comprising: —obtaining a luminance component (L) from said color picture; —obtaining a resulting component by applying (20), a non-linear function on said luminance component (L) in order that the dynamic of the resulting component is increased compared to the dynamic of the luminance component (L)—obtaining (50) a modulation value (Ba) from the luminance of said color picture; —obtaining the first component (Y) by multiplying said resulting component by said modulation value (Ba); —obtaining two chrominance components (C1, C2) from said color picture; —obtaining (40) a first factor (r(L(i))) that depends on the value (L(i)) of a pixel (i) of said luminance component (L); —obtaining (30) at least one color component (Ec) from said first component (Y), said two chrominance components (C1, C2) and said first factor (r(L(i))); and—forming the inverse-tone mapped color picture by combining together said at least one color component (Ec).

Claims

1-22. (canceled)

23. A method for inverse-tone mapping colors of a color picture, comprising, for each of said colors: obtaining a first component (Y) of said color comprising: obtaining a luminance component (L) from said color and a modulation value (Ba) representative of the brightness of said color picture; applying a non-linear function on said luminance component (L) resulting in a resulting component in order that the dynamic of the resulting component is increased compared to the dynamic of the luminance component (L) multiplying said resulting component by said modulation value (Ba), resulting in said first component (Y); then: obtaining two chrominance components (C1, C2) from said color; dividing each chrominance component (C1, C2) by a value equal to the square root of a first factor (r(L(i))), resulting in two intermediate chrominance components (C′1, C′2), wherein said first factor (r(L)) depends on a value (L(i)) of said luminance component (L); obtaining three color components (Ec) comprising: combining together the two intermediate chrominance components (C′1, C′2) and the first component (Y), resulting in a second component (S); linearly combining together the two intermediate chrominance components (C′1, C′2) and said second component (S), resulting in at least one intermediate color component (Dc); and taking the square of each intermediate color components (Dc), resulting in said three color components (Ec) and forming an inverse-tone mapped color by combining together said three color components (Ec).

24. The method of claim 23, wherein the non-linear function is the inverse of either a gamma curve or a Slog curve according to value of said luminance component (Y).

25. The method of claim 23, wherein the method further comprises obtaining at least one of the following values from either a local or remote memory and/or from a bitstream: the modulation value (Ba); parameters of the non-linear function; an information data (Inf) that indicates whether either the non-linear function is a gamma correction or a Slog correction.

26. The method of claim 23, wherein said first factor (r(L(i)) is a ratio of the value (L(i)) of the pixel (i) of said luminance component over the luminance value (Y(i)) of the co-located pixel (i) in said first component (Y).

27. The method of claim 23, wherein said first factor (r(I(i))) is obtained from either a local or remote memory or from a bitstream.

28. A method for inverse-tone mapping colors of a color picture, comprising, for each of said colors: obtaining an input luminance component (L″) and two input chrominance components (C″1, C″2) from said color; obtaining a modulation value (Ba) from the value of each pixel (i) of said luminance component (L); determining a second factor (β(Ba,L(i))) from said modulation value (Ba); obtaining a luminance component (L) by linearly combining together said input luminance component (L″) and said two input chrominance components (C″1, C″2) and said two chrominance components (C1, C2) by multiplying each of said two input chrominance components (C″1, C″2) by said second factor (β(Ba,L(i))) as follows: $\{\begin{array}{c}L=L^{″}+{\mathrm{mC}}_1^{″}+{\mathrm{nC}}_2^{″}\\ C_1=\beta \left(\mathrm{Ba},L\left(i\right)\right)*C_1^{″}\\ C_2=\beta \left(\mathrm{Ba},L\left(i\right)\right)*C_2^{″}\end{array}\hspace{1em}$ where L″ is the input luminance component, C.sub.1″ and C.sub.2″ are the two input chrominance components, L is the luminance component, C.sub.1 and C.sub.2 are the two chrominance components, Ba is the modulation value, m and n are coefficients, β(Ba,L(i)) is said second factor.

29. The method of claim 28, wherein the values of the luminance component (L) is given by:
L=L″+max(0,mC.sub.1′+nC.sub.2′)

30. The method of claim 29, wherein the second factor (β(Ba,L(i))) is obtained by minimizing a gamut distorsion calculated between a targeted gamut (G1) and the gamut (G2) of the picture to be inverse tone-mapped.

31. A device for inverse-tone mapping a picture, comprising a processor configured to: applying, on a luminance component (L) obtained from the picture, a non-linear function that depends on an obtained modulation value (Ba), resulting in a resulting component in order that the dynamic of the first component is increased compared to the dynamic of the luminance component, multiplying said resulting component by said modulation value (Ba), resulting in a first (expanded luminance) component (Y), obtaining two chrominance components (C1, C2) from said color; dividing each chrominance component (C1, C2) by a value equal to the square root of a first (scaling) factor (r(L(i))), resulting in two intermediate chrominance components (C′1, C′2), wherein said first (scaling) factor (r(L)) depends on a value (L(i)) of said luminance component (L); obtaining three color components (Ec) comprising: combining together the two intermediate chrominance components (C′1, C′2) and the first luminance component (Y), resulting in a second component (S); linearly combining together the two intermediate chrominance components (C′1, C′2) and said second component (S), resulting in at least one intermediate color component (Dc); and taking the square of each intermediate color components (Dc), resulting in said three color components (Ec), and forming an inverse-tone mapped color by combining together said three color components (Ec).

32. A computer program product comprising program code instructions to execute the steps of the method according to claim 23 when this program is executed on a computer.

Description

4. BRIEF DESCRIPTION OF DRAWINGS

[0053] In the drawings, an embodiment of the present disclosure is illustrated. It shows:

[0054] FIG. 1 shows schematically a diagram of the steps of a method of inverse-tone mapping a picture in accordance with an embodiment of the disclosure;

[0055] FIG. 2 shows schematically a diagram of the steps of a method of inverse-tone mapping a picture in accordance with an embodiment of the disclosure;

[0056] FIG. 3 shows schematically a diagram of the steps of a method of inverse-tone mapping a picture in accordance with an embodiment of the disclosure;

[0057] FIG. 4 shows schematically a diagram of the steps of a method of inverse-tone mapping a picture in accordance with an embodiment of the disclosure;

[0058] FIG. 5a shows schematically a diagram of the sub-steps of the step 30 in accordance with an embodiment of the disclosure;

[0059] FIG. 5b shows schematically a diagram of the sub-steps of the step 30 in accordance with an embodiment of the disclosure;

[0060] FIG. 6 shows schematically a diagram of the sub-steps of the step 10 in accordance with an embodiment of the disclosure;

[0061] FIG. 7 shows schematically a diagram of the sub-steps of the step 10 in accordance with an embodiment of the disclosure;

[0062] FIG. 8 shows schematically a diagram of the sub-steps of the step 231 in accordance with an embodiment of the disclosure; and

[0063] FIG. 9 shows an example of an architecture of a device in accordance with an embodiment of the disclosure.

[0064] Similar or same elements are referenced with the same reference numbers.

6. DESCRIPTION OF EMBODIMENTS

[0065] The present disclosure will be described more fully hereinafter with reference to the accompanying figures, in which embodiments of the disclosure are shown. This disclosure may, however, be embodied in many alternate forms and should not be construed as limited to the embodiments set forth herein. Accordingly, while the disclosure is susceptible to various modifications and alternative forms, specific embodiments thereof are shown by way of example in the drawings and will herein be described in detail. It should be understood, however, that there is no intent to limit the disclosure to the particular forms disclosed, but on the contrary, the disclosure is to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the disclosure as defined by the claims.

[0066] The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises”, “comprising,” “includes” and/or “including” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. Moreover, when an element is referred to as being “responsive” or “connected” to another element, it can be directly responsive or connected to the other element, or intervening elements may be present. In contrast, when an element is referred to as being “directly responsive” or “directly connected” to other element, there are no intervening elements present. As used herein the term “and/or” includes any and all combinations of one or more of the associated listed items and may be abbreviated as“/”.

[0067] It will be understood that, although the terms first, second, etc. may be used herein to describe various elements, these elements should not be limited by these terms. These terms are only used to distinguish one element from another. For example, a first element could be termed a second element, and, similarly, a second element could be termed a first element without departing from the teachings of the disclosure.

[0068] Although some of the diagrams include arrows on communication paths to show a primary direction of communication, it is to be understood that communication may occur in the opposite direction to the depicted arrows.

[0069] Some embodiments are described with regard to block diagrams and operational flowcharts in which each block represents a circuit element, module, or portion of code which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that in other implementations, the function(s) noted in the blocks may occur out of the order noted. For example, two blocks shown in succession may, in fact, be executed substantially concurrently or the blocks may sometimes be executed in the reverse order, depending on the functionality involved.

[0070] Reference herein to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one implementation of the disclosure. The appearances of the phrase “in one embodiment” or “according to an embodiment” in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments necessarily mutually exclusive of other embodiments.

[0071] Reference numerals appearing in the claims are by way of illustration only and shall have no limiting effect on the scope of the claims.

[0072] While not explicitly described, the present embodiments and variants may be employed in any combination or sub-combination.

[0073] In an embodiment, a factor depends on a modulation value Ba. A modulation (or backlight) value is usually associated with an HDR picture and is representative of the brightness of the HDR picture. A modulation value Ba may be an average, median, min or max value of the pixel values of the luminance of an HDR picture. These operations may be performed in the linear HDR luminance domain Yin or in a non-linear domain like In(Y) or Y.sup.γ with γ<1.

[0074] Here, the term (modulation) backlight is used by analogy with TV sets made of a color panel, like a LCD panel for instance, and a rear illumination apparatus, like a LED array for instance. The rear apparatus, usually generating white light, is used to illuminate the color panel to provide more brightness to the TV. As a consequence, the luminance of the TV is the product of the luminance of rear illuminator and of the luminance of the color panel. This rear illuminator is often called “modulation” or “backlight” and its intensity is somewhat representative of the brightness of the overall scene.

[0075] The disclosure is described for inverse-tone mapping a color picture but extends to the inverse-tone mapping of a sequence of pictures (video) because each color picture of the sequence is sequentially inverse-tone mapped as described below.

[0076] In the following, a picture I is considered as having a luminance component and, potentially, two chrominance components or equivalently, three color components.

[0077] The present disclosure is not limited to any color space in which the colors of the picture I are represented but extends to any color space such as RGB, CIELUV, XYZ, CIELab, etc.

[0078] FIG. 1 shows schematically a diagram of the steps of a method of inverse-tone mapping a picture I in accordance with an embodiment of the disclosure.

[0079] In step 20, a module IFM obtains a first component Y by applying, on a luminance component L obtained from the picture I, a non-linear function f.sup.−1 that depends on a modulation value Ba which is obtained (step 50) from the luminance component L.

[0080] The module IFM obtains the first component Y in order that the dynamic of the first component Y is increased compared to the dynamic of the luminance component L:

Y=f.sup.−1(Ba,L)  (1)

According to an embodiment, the luminance component L is multiplied by the modulation value Ba after having applied the non-linear function f.sup.−1:

Y=Ba*f.sup.−1(L)  (2)

[0081] According to an embodiment, the non-linear function f.sup.−1 is the inverse of a gamma function.

[0082] The component Y is then given by:

[00001]$Y_1=\frac{L^{1/\gamma }}{B}$

[0083] where Y.sub.1 equals Y or Y/Ba according to the embodiments of eq. (1) or (2), B is a constant value, γ is a parameter (real value strictly below 1).

[0084] According to an embodiment, the non-linear function f.sup.−1 is the inverse of a S-Log function. The component Y.sub.1 is then given by:

[00002]$Y_1={\exp }^{\left(\frac{L-C}{a}\right)}-b$

where a, b and c are parameters (real values) of a S Log curve determined such that f(0) and f(1) are invariant, and the derivative of the S Log curve is continuous in 1 when prolonged by a gamma curve below 1. Thus, a, b and c are functions of the parameter γ.

[0085] Typical values are shown in Table 1.

TABLE-US-00001 TABLE 1 γ a b c 1/2.0 0.6275 0.2550 0.8575 1/2.4 0.4742 0.1382 0.9386 1/2.8 0.3861 0.0811 0.9699

[0086] In an advantageous embodiment, a value of γ close to 1/2.5 is efficient in terms of HDR compression performance as well as good viewability of the obtained SDR luma. Thus, the 3 parameters may advantageously take the following values: a=0.44955114, b=0.12123691, c=0.94855684.

[0087] According to an embodiment, the value Ba and/or the parameters of the non-linear function f.sup.−1 (such as a, b, c or γ) is (are) obtained from a local or remote memory (for example a Look-Up-Table) and/or from a bitstream.

[0088] According to an embodiment, the non-linear function f is the inverse of either a gamma correction or a S Log correction according to the pixel values of the first component Y.

[0089] Applying an inverse gamma correction on the luminance component L, pulls up the dark regions but does not lower enough high lights to avoid burning of bright pixels.

[0090] Then, according to an embodiment, the module IFM applies either the inverse gamma correction or the inverse S Log correction according to the pixel values of the luminance component L.

[0091] For example, when the pixel value of the luminance component L is below a threshold (equal to 1), then the inverse gamma correction is applied and otherwise the inverse S Log correction is applied.

[0092] FIG. 2 shows schematically a diagram of the steps of a method of inverse-tone mapping a picture in accordance with an embodiment of the disclosure.

[0093] In step 30, a module ILC obtains at least one color component Ec of the color picture to be inverse-tone mapped from the first component Y and two chrominance C1, C2 components obtained from the picture I.

[0094] The inverse-tone mapped picture is then formed by combining together said at least one color component Ec.

[0095] According to a variant of the embodiment in FIG. 2, illustrated in FIGS. 3 and 4, the module ILC obtains at least one color component Ec from the first component Y, the two chrominance component C1, C2, and from a factor r(L) that depends on the luminance component L.

[0096] The factor r(L) may be obtained either from a local or remote memory (such a Look-Up-Table) or from a bitstream.

[0097] According to this variant of the embodiment in FIG. 2, the first component Y and the two chrominance components C1, C2 are related to intermediate components Dc by the following model:

[00003]$\begin{array}{cc}Y=A_1\left[\begin{array}{c}{E}_1\\ E_2\\ E_3\end{array}\right]=A_1\left[\begin{array}{c}\mathrm{EOTF}\left(D_1\right)\\ \mathrm{EOTF}\left(D_2\right)\\ \mathrm{EOTF}\left(D_3\right)\end{array}\right]& \left(3\right)\\ \mathrm{and}& \\ \left[\begin{array}{c}{C}_1\\ C_2\end{array}\right]=\left[\begin{array}{c}{A}_2\\ A_3\end{array}\right]\left[\begin{array}{c}{D}_1\\ D_2\\ D_3\end{array}\right]& \left(4\right)\end{array}$

[0098] where EOTF is an Electro-Optical Transfer Function (inverse of an OETF), A1, A2 and A3 are columns of a 3×3 matrix A that determines the transform of the picture I to be encoded from the color space (E1, E2, E3), in which the pixel values of the picture to be encoded are represented, to the color space (Y, C1, C2).

[0099] Equation (4) provides

[00004]$\begin{array}{cc}\{\begin{array}{c}{D}_2={\vartheta }_2.Math.D_1+L_2\left(C_1,C_2\right)\\ D_3={\vartheta }_3.Math.D_1+L_3\left(C_1,C_2\right)\end{array}& \left(5\right)\end{array}$

where OETF(E.sub.c)=D.sub.c, θ.sub.i are constants depending on the matrix A and L.sub.i are linear functions also depending on the matrix A. Then, equation (3) becomes:

Y=A.sub.11EOTF(D.sub.1)+A.sub.12EOTF(D.sub.2)+A.sub.13EOTF(D.sub.3)  (6)

and then

Y=A.sub.11EOTF(D.sub.1)+A.sub.12EOTF(θ.sub.2D.sub.1+L.sub.2(C.sub.1,C.sub.2))+A.sub.13EOTF(θ.sub.3D.sub.1+L.sub.3(C.sub.1,C.sub.2)  (7)

[0100] Equation (7) is an implicit equation on D.sub.1 only. Depending on the expression of the EOTF, equation (7) can be more or less solved simply. Once solved, D.sub.1 is obtained, D.sub.2, D.sub.3 are deduced from D.sub.1 by equation (5). Then the color components Ec are obtained by applying the EOTF on the three obtained intermediate components Dc, i.e. Ec=EOTF(Dc).

[0101] In this general case, i.e. when a general EOTF is applied on each intermediate component Dc, there exist no analytic solution to equation (7). For instance when the EOTF is the ITU-R BT.709/2020 EOTF, and the equation (7) may be solved numerically by using the so-called Newton's method or any other numerical method to find the root of a regular function. However, this leads to highly complex decoders.

[0102] In this general case, according to a first embodiment of the step 30, illustrated in FIG. 5a, in step 231, a module ILEC obtains three intermediate color component E′c from the first component Y, the two chrominance component C1, C2 and the factor r(L). In step 232, the three color components Ec are obtained by scaling each intermediate color component E′c by the factor r(L).

Ec(i)=E′c(i)/r(L(i))

[0103] where r(L(i)) is the factor given by step 40 that depends on the value L(i) of a pixel i of the luminance component L, E.sub.c′(i) is the value of the pixel i of an intermediate color component E′c, and E.sub.c (i) is the value of the pixel i of the color component Ec.

[0104] Scaling by a factor means multiplying by said factor or dividing by the inverse of said factor.

[0105] Scaling each color component E′c by the factor r(L) that depends on the luminance component L preserves the hue of the colors of the color picture I.

[0106] According to an embodiment of the step 40, the factor r(L) is the ratio of the luminance component L over the component Y:

[00005]$r\left(L\left(i\right)\right)=\frac{L\left(i\right)}{Y\left(i\right)}$

[0107] with Y(i) being the value of a pixel i of the first component Y. Actually, the value Y(i) of a pixel of the first component Y depends non-ambiguously on the value L(i) such that the ratio can be written as a function of L(i) only.

[0108] This embodiment is advantageous because scaling each color component Ec by the factor r(L) that further depends on the first component Y preserves the hue of the colors of the picture I and thus improves the visual quality of the inverse-tone mapped picture.

[0109] According to an embodiment of the step 232, the factor r(L) is given by:

[00006]$r\left(L\left(i\right)\right)=\frac{\max .Math.\left\{5,L\left(i\right)\right\}}{2048.Math.\max .Math.\left\{0.01,Y\left(i\right)\right\}}$

[0110] This last embodiment is advantageous because it prevents the factor from going to zero for very dark pixels, i.e. allows the ratio to be invertible regardless of the pixel value.

[0111] According to a variant of this first embodiment of the step 30, the EOTF is then a square function.

[0112] According to another variant of this first embodiment, the EOTF is then a cubic function.

[0113] When the OETF, inverse of the EOTF used, fulfills the commutation condition, namely

OETF(x*y)=OETF(x)*OETF(y),

[0114] the component Y and the color components Ec are related by:

[00007]$\begin{array}{cc}Y=A_1\left[\begin{array}{c}{E}_1\\ E_2\\ E_3\end{array}\right]=A_1\left[\begin{array}{c}\mathrm{EOTF}\left(F_1\right)\\ \mathrm{EOTF}\left(F_2\right)\\ \mathrm{EOTF}\left(F_3\right)\end{array}\right]& \left(8\right)\end{array}$

where Fc are components equal to OETF(Ec) and

[00008]$\left[\begin{array}{c}{C}_1^{\prime }\\ C_2^{\prime }\end{array}\right]=\left[\begin{array}{c}{C}_1\\ C_2\end{array}\right]/\mathrm{OETF}\left(r\left(L\right)\right)=\left[\begin{array}{c}{A}_2\\ A_3\end{array}\right]\left[\begin{array}{c}{D}_1\\ D_2\\ D_3\end{array}\right]/\mathrm{OETF}\left(r\left(L\right)\right)=\left[\begin{array}{c}{A}_2\\ A_3\end{array}\right]\left[\begin{array}{c}\mathrm{OETF}\left(E_1^{\prime }\right)\\ \mathrm{OETF}\left(E_2^{\prime }\right)\\ \mathrm{OETF}\left(E_3^{\prime }\right)\end{array}\right]/\mathrm{OETF}\left(r\left(L\right)\right),$

such that the commutation condition provides

[00009]$\begin{array}{cc}\left[\begin{array}{c}{C}_1^{\prime }\\ C_{\mathrm{\prime 2}}\end{array}\right]=\left[\begin{array}{c}{A}_2\\ A_3\end{array}\right]\left[\begin{array}{c}\mathrm{OETF}\left(E_1^{\prime }/r\left(L\right)\right)\\ \mathrm{OETF}\left(E_2^{\prime }/r\left(L\right)\right)\\ \mathrm{OETF}\left(E_3^{\prime }/r\left(L\right)\right)\end{array}\right]=\left[\begin{array}{c}{A}_2\\ A_3\end{array}\right]\left[\begin{array}{c}\mathrm{OETF}\left(E_1\right)\\ \mathrm{OETF}\left(E_2\right)\\ \mathrm{OETF}\left(E_3\right)\end{array}\right]=\left[\begin{array}{c}{A}_2\\ A_3\end{array}\right]\left[\begin{array}{c}{F}_1\\ F_2\\ F_3\end{array}\right]& \left(9\right)\end{array}$

[0115] Equation (9) provides

[00010]$\{\begin{array}{c}{F}_2={\vartheta }_2.Math.F_1+L_2\left(C_1^{\prime },C_2^{\prime }\right)\\ F_3={\vartheta }_3.Math.F_1+L_3\left(C_1^{\prime },C_2^{\prime }\right)\end{array}\hspace{1em}$

where θ.sub.i are constants depending on the matrix A and L.sub.i are linear functions also depending on the matrix A.

[0116] Then, equation (8) becomes:

Y=A.sub.11EOTF(F.sub.1)+A.sub.12EOTF(F.sub.2)+A.sub.13EOTF(F.sub.3)  (10)

and then

Y=A.sub.11EOTF(F.sub.1)+A.sub.12EOTF(θ.sub.2F.sub.1+L.sub.2(C′.sub.1,C′.sub.2))+A.sub.13EOTF(θ.sub.3F.sub.1+L.sub.3(C′.sub.1,C′.sub.2)  (11)

[0117] When the OETF fulfills the commutation conditions, according to a second embodiment of the step 30, illustrated in FIG. 5b, in step 232, two intermediate components C′1 and C′2 are obtained by scaling the two chrominance components C1 and C2 by the factor OEFT(r(L(i))) where OETF is the inverse of EOTF:

[00011]$C^{\prime }.Math.1.Math.\left(i\right)=\frac{C.Math..Math.1.Math.\left(i\right)}{\mathrm{OETF}\left(r\left(L\left(i\right)\right)\right)}$$C^{\prime }.Math.2.Math.\left(i\right)=\frac{C.Math..Math.2.Math.\left(i\right)}{\mathrm{OETF}\left(r\left(L\left(i\right)\right)\right)}$

[0118] where r(L(i)) is the factor given by step 40 that depends on the value L(i) of a pixel i of the luminance component L, C.sub.1′(i),C.sub.2′(i) is respectively the value of the pixel i of the component C′1 and C′2, C.sub.1 (i), C.sub.2 (i) is respectively the value of the pixel i of the component C1 and C2.

[0119] In step 231, the module ILEC obtains the three color components Ec from the first component Y and the two intermediate chrominance components C′1, C′2 as explained above.

[0120] According to a variant of this second embodiment of the step 30, the EOTF is then a square function. Then, in step 232 in FIG. 5b, the two intermediate components C′1 and C′2 are obtained by scaling the two chrominance components C1 and C2 by the factor √{square root over (r(L(i)))}:

[00012]$C^{\prime }.Math.1.Math.\left(i\right)=\frac{C.Math..Math.1.Math.\left(i\right)}{\mathrm{OETF}\left(r\left(L\left(i\right)\right)\right)}=\frac{C.Math..Math.1.Math.\left(i\right)}{\sqrt{r\left(L\left(i\right)\right)}}$$C^{\prime }.Math.2.Math.\left(i\right)=\frac{C.Math..Math.2.Math.\left(i\right)}{\mathrm{OETF}\left(r\left(L\left(i\right)\right)\right)}=\frac{C.Math..Math.2.Math.\left(i\right)}{\sqrt{r\left(L\left(i\right)\right)}}$

[0121] Equation(8) becomes:

[00013]$\begin{array}{cc}.Math.Y=A_1\left[\begin{array}{c}{E}_1\\ E_2\\ E_3\end{array}\right]=A_1\left[\begin{array}{c}{F}_1^2\\ F_2^2\\ F_3^2\end{array}\right]& \left(10\right)\\ .Math.\mathrm{and}& \\ \left[\begin{array}{c}{C}_1^{\prime }\\ C_2^{\prime }\end{array}\right]=\left[\begin{array}{c}{C}_1\\ C_2\end{array}\right]/\sqrt{r\left(L\right)}=\left[\begin{array}{c}{A}_2\\ A_3\end{array}\right]\left[\begin{array}{c}{D}_1\\ D_2\\ D_3\end{array}\right]/\sqrt{r\left(L\right)}=\left[\begin{array}{c}{A}_2\\ A_3\end{array}\right]\left[\begin{array}{c}\sqrt{E_1^{\prime }}\\ \sqrt{E_2^{\prime }}\\ \sqrt{E_3^{\prime }}\end{array}\right]/\sqrt{r\left(L\right)}& \end{array}$

such that the commutation provides

[00014]$\begin{array}{cc}\left[\begin{array}{c}{C}_1^{\prime }\\ C_{\mathrm{\prime 2}}\end{array}\right]=\left[\begin{array}{c}{A}_2\\ A_3\end{array}\right]\left[\begin{array}{c}\sqrt{E_1^{\prime }/r\left(L\right)}\\ \sqrt{E_2^{\prime }/r\left(L\right)}\\ \sqrt{E_2^{\prime }/r\left(L\right)}\end{array}\right]=\left[\begin{array}{c}{A}_2\\ A_3\end{array}\right]\left[\begin{array}{c}\sqrt{E_1}\\ \sqrt{E_2}\\ \sqrt{E_3}\end{array}\right]=\left[\begin{array}{c}{A}_2\\ A_3\end{array}\right]\left[\begin{array}{c}{F}_1\\ F_2\\ F_3\end{array}\right]& \left(11\right)\end{array}$

[0122] Equation (11) becomes:

Y=A.sub.11F.sub.1.sup.2+A.sub.12F.sub.2.sup.2+A.sub.13F.sub.3.sup.2  (12)

And then

Y=A.sub.11F.sub.1.sup.2+A.sub.12(θ.sub.2F.sub.1+L.sub.2(C′.sub.1,C′.sub.2)).sup.2+A.sub.13(θ.sub.3F.sub.1+L.sub.3(C′.sub.1,C′.sub.2)).sup.2   (13)

[0123] Equation (13) is a second order equation that may be solved analytically. This analytic solution leads to a specific embodiment of the step 231 as illustrated in FIG. 8. This embodiment is advantageous because it allows an analytic expression of the EOTF (inverse of the OETF) and thus of the inverse-tone mapped components of the picture. Moreover, the EOTF is then the square function that is a low complexity process. In step 2310, a module SM obtains a second component S by combining together the two intermediate chrominance components C′1, C′2 and the first component Y:

S=√{square root over (Y+k.sub.0C′.sub.1.sup.2+k.sub.1C′.sub.2.sup.2+k.sub.2C′.sub.1C′.sub.2)}

[0124] where k.sub.0, k.sub.1 and k.sub.2 parameters values and C′.sub.2.sup.2 means the square of a component C′.sub.c (c=1 or 2).

[0125] In step 2311, a module LC2 obtains the three solver components Fc by linearly combining together the intermediate chrominance component C′1, C′2 and a second component S:

[00015]$\left[\begin{array}{c}{F}_1\\ F_2\\ F_3\end{array}\right]=C\left[\begin{array}{c}S\\ C_1^{\prime }\\ C_2^{\prime }\end{array}\right]$

[0126] where C is a 3×3 matrix defined as the inverse of the matrix A.

[0127] In step 2312, the three color components Ec are obtained by taking the square of each intermediate color components (Dc):

[00016]$\left[\begin{array}{c}{E}_1\\ E_2\\ E_3\end{array}\right]=\left[\begin{array}{c}\mathrm{EOTF}\left(F_1\right)\\ \mathrm{EOTF}\left(F_2\right)\\ \mathrm{EOTF}\left(F_3\right)\end{array}\right]=\left[\begin{array}{c}{\left(F_1\right)}^2\\ {\left(F_2\right)}^2\\ {\left(F_3\right)}^2\end{array}\right]$

[0128] The matrix A determines the transform of the picture I to be encoded from the color space (E1, E2, E3), in which the pixel values of the picture to be encoded are represented, to the color space (Y, C1, C2).

[0129] Such a matrix depends on the gamut of the color picture to be inverse-tone mapped.

[0130] For example, when the picture to be inverse-tone mapped is represented in the BT709 gamut as defined by ITU-R Rec. 709, the matrix A is given by:

[00017]$A=\left[\begin{array}{ccc}0.2126& 0.7152& 0.0722\\ -0.1146& -0.3854& 0.5\\ 0.5& -0.4541& 0.0459\end{array}\right]$

[0131] and the matrix C is given by:

[00018]$C=\left[\begin{array}{ccc}1& 0& 1.5748\\ 0& -0.1874& -0.4681\\ 1& 1.8556& 0\end{array}\right]$

[0132] According to a variant of this second embodiment, the OEFT is a cube root function and the EOTF is then a cubic function. Then, in step 232 in FIG. 5b, the two intermediate components C′1 and C′2 may then be obtained by scaling the two chrominance components C1 and C2 by the factor

[00019]$\sqrt[3]{r(L\left(i\right)}.Math.\text{:}$

[00020]$C^{\prime }.Math.1.Math.\left(i\right)=\frac{C.Math..Math.1.Math.\left(i\right)}{\sqrt[3]{r(L\left(i\right)}}$$C^{\prime }.Math.2.Math.\left(i\right)=\frac{C.Math..Math.2.Math.\left(i\right)}{\sqrt[3]{r(L\left(i\right)}.Math.\text{:}}$

[0133] The EOTF is then a cubic function thus leading to an equation (A14) on F.sub.1 being a more complex third order equation which can be solved analytically by the so-called Cardano's method.

[0134] Very complex analytic solutions also exist for the fourth order equation (Ferrari's method), but not anymore for an order higher or equal to five as stated by the Abel-Ruffini theorem.

[0135] FIG. 4 shows schematically a diagram of the steps of a method of inverse-tone mapping a picture in accordance with an embodiment of the disclosure.

[0136] In step 10, the luminance component L is obtained from the picture by linearly combining together an input luminance component L″ obtained from the picture I and two input chrominance components C″1, C″2 obtained from the picture I.

[0137] According to an embodiment of the step 10, illustrated in FIG. 6, the two final chrominance components C1, C2 equals to the two input chrominance components C″1, C″2, and a module ILCC obtains (step 100) the luminance component L by linearly combining together the input luminance component L″ and the two input chrominance components C″1, C″2:

[00021]$\begin{array}{cc}\{\begin{array}{c}L=L^{″}+{\mathrm{mC}}_1^{″}+{\mathrm{nC}}_2^{″}\\ C_1=C_1^{″}\\ C_2=C_2^{″}\end{array}& \left(\mathrm{J1}\right)\end{array}$

where m and n are real values (coefficients) that depend on the gamut of the picture I (for instance BT.709 or BT.2020 gamut). Typical values for m and n are m≈n in the interval [0.1,0.5].

[0138] According to an embodiment, the real values m and n are obtained from a remote or local memory such a Look-Up-Table, or from a bitstream.

[0139] According to an embodiment of the step 10, illustrated in FIG. 7, the two chrominance components C1, C2 are obtained by scaling (step 101) each of the two input chrominance components C″1, C″2 by a factor β (Ba,L(i)) that depends on both a modulation value Ba and the value L(i) of each pixel i of the luminance component L, and the module ILCC obtains (step 102) the luminance component L by linearly combining together the input luminance component L″ and the two input chrominance components C″1, C″2:

[00022]$\begin{array}{cc}\{\begin{array}{c}L=L^{″}+{\mathrm{mC}}_1^{″}+{\mathrm{nC}}_2^{″}\\ C_1=\beta \left(\mathrm{Ba},L\left(i\right)\right)*C_1^{″}\\ C_2=\beta \left(\mathrm{Ba},L\left(i\right)\right)*C_2^{″}\end{array}& \left(\mathrm{J2}\right)\end{array}$

[0140] where m and n are real values (coefficients) as explained above, and β(Ba,L(i)) is a factor that depends on the modulation value Ba and the value of a pixel I of the luminance component L.

[0141] According to an embodiment, the factor β.sup.−1(Ba,L(i)) is obtained from a bitstream or a Look-Up-Table (LUT) for a specific modulation value Ba and a specific luminance value L(i). Thus, for multiple luminance peak values such as for example, 1000, 1500 and 4000 nits, a specific factor β.sup.−1(Ba,L(i)) is stored in a LUT for each specific modulation value Ba.

[0142] According to a variant, the factor β.sup.−1(Ba,L(i)) for a specific modulation value Ba is obtained for a value of a pixel of the luminance component L by interpolating the luminance peaks between the multiple luminance peaks for which LUT are stored.

According to an embodiment, the factor β(Ba,L(i)) is obtained from the modulation value Ba and the value of a pixel i of the luminance component L as follows.

[0143] The factor β.sup.−1(Ba,L(i),m,n) is considered as depending also on the coefficients m and n which are given as explained in the previous embodiment.

[0144] The factor β.sup.−1 is obtained such that a gamut distortion calculated between a targeted gamut G1, such a gamut of the components Ec of an expected HDR picture, and the gamut G2 obtained from the input components L″C″1C″2 is minimized. In other words, the factor β.sup.−1 is the optimal factor under the condition of gamut preservation.

[0145] Mathematically speaking, the factor β.sup.−1 is obtained by:

β.sup.−1(Ba.sub.0,L.sub.0,m,n)=argmin.sub.β.sub.test.sub.−1GD(β.sub.test.sup.−1),

[0146] where Y.sub.0 is a given luminance value from which is deduced a luminance value L.sub.0, Ba.sub.0 is a given modulation and the gamut distorsion GD(β.sub.test.sup.−1) is given by:

[00023]$\mathrm{GD}\left({\beta }_{\mathrm{test}}^{-1}\right)=\underset{j}{\overset{}{.Math.}}.Math.{\left(x_j-x_j^{\prime }\right)}^2+{\left(y_j-y_j^{\prime }\right)}^2$

[0147] in which the gamut distorsion is defined by the sum of the square error between an element (xj,yj) of the gamut G1 and its associated element (x′j,y′j) of the gamut G2. Practically, from each element (xj,yj) of the gamut G1, associated values Lj, C1j, C2j are deduced by the module IGM (step 10) from the test factor β.sub.test.sup.−1 and the coefficients m and n, such that the value Lj is L0. Then, the modulation value Ba.sub.0 being given, the associated value Yj is obtained by the module IFM (step 20). The associated values Ecj are obtained by the module ILC (step 30) from the values C1j, C2j and Yj. Finally, the associated element (x′j,y′j) is obtained from the values Ecj.

[0148] According to a variant of the module ILCC, the values of the final luminance component L are always higher than the values of the luminance component L″:

L=L″+max(0,mC.sub.1′+nC.sub.2′)

[0149] This variant is advantageous because it ensures that the luminance component L does not exceed a potential clipping value that is usually used by the decoder to define a luminance peak. When a luminance peak is required by a decoder and when the luminance component L is given by equation (J1) or (J2), the luminance component L is clipped introducing some artefacts.

[0150] On FIG. 1-8, the modules are functional units, which may or not be in relation with distinguishable physical units. For example, these modules or some of them may be brought together in a unique component or circuit, or contribute to functionalities of a software. A contrario, some modules may potentially be composed of separate physical entities. The apparatus which are compatible with the disclosure are implemented using either pure hardware, for example using dedicated hardware such ASIC or FPGA or VLSI, respectively Application Specific Integrated Circuit, Field-Programmable Gate Array, Very Large Scale Integration, or from several integrated electronic components embedded in a device or from a blend of hardware and software components.

[0151] FIG. 9 represents an exemplary architecture of a device 900 which may be configured to implement a method described in relation with FIG. 1-8. Device 900 comprises following elements that are linked together by a data and address bus 901: [0152] a microprocessor 902 (or CPU), which is, for example, a DSP (or Digital Signal Processor); [0153] a ROM (or Read Only Memory) 903; [0154] a RAM (or Random Access Memory) 904; [0155] an I/O interface 905 for transmission and/or reception of data, from an application; and [0156] a battery 906.

[0157] According to a variant, the battery 906 is external to the device. Each of these elements of FIG. 9 are well-known by those skilled in the art and won't be disclosed further. In each of mentioned memory, the word <<register>> used in the specification can correspond to area of small capacity (some bits) or to very large area (e.g. a whole program or large amount of received or decoded data). ROM 903 comprises at least a program and parameters. Algorithm of the methods according to the disclosure is stored in the ROM 903. When switched on, the CPU 902 uploads the program in the RAM and executes the corresponding instructions.

[0158] RAM 904 comprises, in a register, the program executed by the CPU 902 and uploaded after switch on of the device 900, input data in a register, intermediate data in different states of the method in a register, and other variables used for the execution of the method in a register.

[0159] The implementations described herein may be implemented in, for example, a method or a process, an apparatus, a software program, a data stream, or a signal. Even if only discussed in the context of a single form of implementation (for example, discussed only as a method or a device), the implementation of features discussed may also be implemented in other forms (for example a program). An apparatus may be implemented in, for example, appropriate hardware, software, and firmware. The methods may be implemented in, for example, an apparatus such as, for example, a processor, which refers to processing devices in general, including, for example, a computer, a microprocessor, an integrated circuit, or a programmable logic device. Processors also include communication devices, such as, for example, computers, cell phones, portable/personal digital assistants (“PDAs”), and other devices that facilitate communication of information between end-users.

[0160] According to a specific embodiment of inverse-tone mapping or inverse-tone mapper, the picture I is obtained from a source. For example, the source belongs to a set comprising: [0161] a local memory (903 or 904), e.g. a video memory or a RAM (or Random Access Memory), a flash memory, a ROM (or Read Only Memory), a hard disk; [0162] a storage interface, e.g. an interface with a mass storage, a RAM, a flash memory, a ROM, an optical disc or a magnetic support; [0163] a communication interface (905), e.g. a wireline interface (for example a bus interface, a wide area network interface, a local area network interface) or a wireless interface (such as a IEEE 802.11 interface or a Bluetooth® interface); and [0164] a picture capturing circuit (e.g. a sensor such as, for example, a CCD (or Charge-Coupled Device) or CMOS (or Complementary Metal-Oxide-Semiconductor)).

[0165] According to different embodiments of the inverse-tone mapping or inverse-tone mapper, the invers-tone mapped picture (or its color components Ec) is sent to a destination; specifically, the destination belongs to a set comprising: [0166] a local memory (903 or 904), e.g. a video memory or a RAM (or Random Access Memory), a flash memory, a ROM (or Read Only Memory), a hard disk; [0167] a storage interface, e.g. an interface with a mass storage, a RAM, a flash memory, a ROM, an optical disc or a magnetic support; [0168] a communication interface (905), e.g. a wireline interface (for example a bus interface, a wide area network interface, a local area network interface) or a wireless interface (such as a IEEE 802.11 interface or a Bluetooth® interface); and [0169] a display.

[0170] According to different embodiments, device 900 being configured to implement a method described in relation with FIG. 1-8, belongs to a set comprising: [0171] a mobile device; [0172] a communication device; [0173] a game device; [0174] a tablet (or tablet computer); [0175] a laptop; [0176] a still picture camera; [0177] a video camera; [0178] an encoding chip; [0179] a still picture server; and [0180] a video server (e.g. a broadcast server, a video-on-demand server or a web server).

[0181] Implementations of the various processes and features described herein may be embodied in a variety of different equipment or applications. Examples of such equipment include an encoder, a decoder, a post-processor processing output from a decoder, a pre-processor providing input to an encoder, a video coder, a video decoder, a video codec, a web server, a set-top box, a laptop, a personal computer, a cell phone, a PDA, and any other device for processing a picture or a video or other communication devices. As should be clear, the equipment may be mobile and even installed in a mobile vehicle.

[0182] Additionally, the methods may be implemented by instructions being performed by a processor, and such instructions (and/or data values produced by an implementation) may be stored on a computer readable storage medium. A computer readable storage medium can take the form of a computer readable program product embodied in one or more computer readable medium(s) and having computer readable program code embodied thereon that is executable by a computer. A computer readable storage medium as used herein is considered a non-transitory storage medium given the inherent capability to store the information therein as well as the inherent capability to provide retrieval of the information therefrom. A computer readable storage medium can be, for example, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. It is to be appreciated that the following, while providing more specific examples of computer readable storage mediums to which the present principles can be applied, is merely an illustrative and not exhaustive listing as is readily appreciated by one of ordinary skill in the art: a portable computer diskette; a hard disk; a read-only memory (ROM); an erasable programmable read-only memory (EPROM or Flash memory); a portable compact disc read-only memory (CD-ROM); an optical storage device; a magnetic storage device; or any suitable combination of the foregoing.

[0183] The instructions may form an application program tangibly embodied on a processor-readable medium.

[0184] Instructions may be, for example, in hardware, firmware, software, or a combination. Instructions may be found in, for example, an operating system, a separate application, or a combination of the two. A processor may be characterized, therefore, as, for example, both a device configured to carry out a process and a device that includes a processor-readable medium (such as a storage device) having instructions for carrying out a process. Further, a processor-readable medium may store, in addition to or in lieu of instructions, data values produced by an implementation.

[0185] As will be evident to one of skill in the art, implementations may produce a variety of signals formatted to carry information that may be, for example, stored or transmitted. The information may include, for example, instructions for performing a method, or data produced by one of the described implementations. For example, a signal may be formatted to carry as data the rules for writing or reading the syntax of a described embodiment, or to carry as data the actual syntax-values written by a described embodiment. Such a signal may be formatted, for example, as an electromagnetic wave (for example, using a radio frequency portion of spectrum) or as a baseband signal. The formatting may include, for example, encoding a data stream and modulating a carrier with the encoded data stream. The information that the signal carries may be, for example, analog or digital information. The signal may be transmitted over a variety of different wired or wireless links, as is known. The signal may be stored on a processor-readable medium.

[0186] A number of implementations have been described. Nevertheless, it will be understood that various modifications may be made. For example, elements of different implementations may be combined, supplemented, modified, or removed to produce other implementations. Additionally, one of ordinary skill will understand that other structures and processes may be substituted for those disclosed and the resulting implementations will perform at least substantially the same function(s), in at least substantially the same way(s), to achieve at least substantially the same result(s) as the implementations disclosed. Accordingly, these and other implementations are contemplated by this application.