Method and apparatus for embedding key information in an image

By embedding key information within the predetermined value range of the image and dynamically adjusting the retention range according to the video compression level and image characteristics, the complexity and bit rate problems of key information embedding in image encoding and decoding are solved, and robustness and efficiency are achieved. Improvement.

CN114697676BActive Publication Date: 2024-12-03INTERDIGITAL VC HOLDINGS INC
View PDF 7 Cites 0 Cited by

Patent Information

Application Number
CN202210363030.3
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Priority Date
2016-12-21
Filing Date
2017-12-11
Publication Date
2024-12-03
Estimated Expiration
2037-12-11

AI Technical Summary

Technical Problem

During the image encoding and decoding process, it is difficult for the prior art to effectively embed and optimize key information, resulting in outliers and misunderstanding related information on the decoding side, while increasing the final bit rate and encoding complexity.

Method used

By retaining a range of DMZ values ​​within a predetermined range of 2N values ​​of the image, it is used to store key information associated with at least one coordinate in the image, dynamically update the size of the reservation range according to the video compression level and image characteristics, ensuring the key The robustness and compactness of information.

Benefits of technology

A method of compactly embedding key information in the image is realized, the decoding process is optimized, encoding artifacts are reduced, the final bit rate is reduced, and image transmission efficiency is improved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114697676B_ABST
    Figure CN114697676B_ABST
Patent Text Reader

Abstract

The present disclosure relates to a method for embedding key information in an image, the method comprising: storing a 2 N A range of DMZ values ​​is reserved within a predetermined range of values, and the reserved range is used to store key information associated with at least one coordinate in the image, where N>0 and DMZ<<2 N .
Need to check novelty before this filing date? Find Prior Art

Description

[0001] This application is a divisional application of the Chinese patent application "Method and device for embedding key information in an image" with an application date of December 11, 2017 and application number 201780079880.8. Technical Field

[0002] The field of the present disclosure is that of image and video processing.

[0003] More specifically, the present disclosure relates to a method for embedding critical information in an image in order to optimize the decoding of the image. Background Art

[0004] This section is intended to introduce the reader to various aspects of the technology that may be related to various aspects of the present disclosure described below and / or claimed. It is believed that this discussion is helpful in providing the reader with background information to facilitate a better understanding of various aspects of the present invention. Therefore, it should be understood that these statements should be interpreted in this manner and not as an admission of prior art.

[0005] In the field of image encoding and decoding, the decoding side needs to know / understand some information to optimize the decoding of the image. For example, when certain areas in the image (e.g., color map or distance map, such as Figure 1a ) contains undefined values ​​that should not be decoded, there is a risk of generating abnormal values, for example.

[0006] Known solutions for "informing" the decoder then consist mainly in sending the information whether a value should be decoded, as an additional binary map, the "key map" (e.g. Figure 1b As shown in Figure 1a The color map and distance map of the decoder) which, for example, only contain defined values ​​and will therefore disambiguate the task on the decoding side. However, sending such additional maps may make the global framework more complex by adding an additional stream, which may also increase the final bitrate very significantly.

[0007] It is also known to reserve values ​​in the image in order to embed critical information needed at the decoding side. However, the disadvantage of this solution is that this specific reserved value may be modified by the video encoding step and misinterpret the relevant information at the decoding side.

[0008] Therefore, a new method is needed for embedding key information in images while optimizing the complexity of encoding and decoding and the final bit rate for image transmission. Summary of the invention

[0009] References in the specification to "one embodiment," "an embodiment," "an example embodiment," or "a specific embodiment" indicate that the described embodiment may include a particular feature, structure, or characteristic, but every embodiment may not necessarily include the particular feature, structure, or characteristic. Furthermore, such phrases do not necessarily refer to the same embodiment. Furthermore, when a particular feature, structure, or characteristic is described in conjunction with an embodiment, it should be considered that it is within the knowledge of those skilled in the art to implement such feature, structure, or characteristic in conjunction with other embodiments (whether or not explicitly described).

[0010] The present disclosure relates to a method for embedding key information in an image, the method comprising: storing a 2 N A range of DMZ values ​​is reserved within a predetermined range of values, and the reserved range is used to store key information associated with at least one coordinate in the image, where N>0 and DMZ<<2 N .

[0011] Therefore, the present disclosure proposes a novel and inventive solution for embedding critical information in an image in a robust and compact way in order to optimize the decoding of the image.

[0012] For this purpose, it is proposed to store the key information in a value range reserved within a predetermined value range for storing useful data in the image. Thus, the predetermined value range for useful data is shortened in order to store the key information.

[0013] This solution firstly prevents sending an additional image for embedding the critical information, as in the known solution.In addition, this solution also prevents simply keeping a predetermined value for the critical information, which may be modified by the encoding step and may therefore be misinterpreted on the decoding side.

[0014] For example, the solution may utilize an extremely large predetermined value range for useful data to be stored.

[0015] According to particular characteristics, the method also comprises encoding the image and updating the size of the reserved zone DMZ according to the level of video compression applied in the encoding.

[0016] Therefore, according to this embodiment, the size of the reserved range can be updated according to the level of video compression to be used for encoding the image. Therefore, this adaptive size allows taking into account coding artifacts (coding errors) and minimizing the impact of embedding key information on the dynamics that allow storage of useful data.

[0017] According to specific features, the size of the reserved zone DMZ is updated according to at least one characteristic of the image.

[0018] Therefore, according to this embodiment, the size of the retention range can also be updated based on the image itself, for example based on the real dynamics required to store useful data (e.g., images with close objects and distant objects, or only close objects, or only distant objects).

[0019] According to specific features, the method further comprises: for at least one coordinate in the image,

[0020] If no useful data is associated with the coordinates, store critical information in a reserved area,

[0021] If useful data is associated with coordinates:

[0022] o applying a corrected quantization to the useful data to provide corrected useful data, the corrected quantization taking into account the reserved range, and

[0023] o Storing the corrected useful data within a predetermined value range excluding the reserved range.

[0024] Therefore, according to this embodiment, if no useful data is associated with a position / coordinate in the image (for example, for an unused point in the corresponding point cloud), the critical information is stored in the reserved range, while the corrected useful data (by correcting quantization) is stored in the remainder of the predetermined range (except the reserved range).

[0025] Therefore, on the decoding side, if the received value belongs to the reserved range, the corresponding point is discarded and regarded as unused.

[0026] For example, the image corresponds to a distance map obtained after projection on a parametric surface of a point cloud representing at least a portion of an object in the multimedia content; for at least one point in the point cloud corresponding to a coordinate in the image, the useful data corresponds to information representing the distance between at least a portion of the object and the parametric surface; the key information represents an unused point, and the reserved range corresponds to 2 N The first DMZ value in a predetermined range of values, the size DMZ is adaptive.

[0027] Thus, according to this embodiment, the method is applied to a distance map corresponding to an image (or an object or part of an object in an image) of multimedia content (e.g. video content), wherein useful data corresponding to a distance value for each position in the image is stored.

[0028] Indeed, in such a context, it seems that at certain positions / coordinates in the distance map there are no useful values ​​(e.g. if no projection occurs), resulting in "unused" points that do not have to be decoded. These unused points should be known on the decoding side in order to be discarded. For this purpose, the value range reserved at the beginning of the distance value range is used to embed key information corresponding to such unused points.

[0029] According to this embodiment, the method makes use of the fact that the range of distance map values ​​is usually (i.e., in most cases of multimedia content) too large relative to the distance values ​​to be stored. Therefore, it is not harmful to reserve a part of this predetermined value range for critical information. Moreover, since the distance values ​​are usually expressed as a clipped inverse function of the distance to provide more dynamics and to favor close distances, it is still not so harmful to reserve the beginning of the range of values, since the front values ​​are used for very far objects.

[0030] Finally, the size of the reserved range is adaptive in order to exploit, for example, the peculiarities of the image to be encoded.

[0031] According to a specific embodiment, the key information is set to the value V k =0, and the corrected useful data corresponds to:

[0032] V u =U DMZ (z) = floor((2 N -DMZ)Z(z)+DMZ), where z is the distance value and where z min and z max Define the limit range, Z(z min )=1 and Z(z max )=0.

[0033] The present disclosure also relates to a method for decoding an image corresponding to a representation of at least a portion of an object of multimedia content, the method comprising: for a value W read for at least one coordinate in the image,

[0034] If W belongs to the reserved range provided by the previously disclosed method for embedding critical information, then the read value W is discarded;

[0035] If W does not belong to the reserved range provided by the previously disclosed method for embedding key information, the useful data corresponding to the read value W is recovered by applying an inverse corrective quantization to the read value W, the inverse corrective quantization taking into account the reserved range.

[0036] Therefore, according to this embodiment, at the decoding side, if the received value belongs to the reserved range, the corresponding point is discarded and regarded as unused. On the contrary, if the received value is outside the reserved range (i.e., larger), the corresponding point is regarded as valid, and the relevant distance value is restored by correcting the received value, so as to apply the inverse quantization applied at the encoding side.

[0037] The present disclosure also relates to a stream carrying an image with embedded critical information, wherein the image is used to store useful data in the image. N The key information is stored in a range of DMZ values ​​reserved within a predetermined range of values, the key information being associated with at least one coordinate of the image, wherein N>0 and DMZ<<2 N .

[0038] The present disclosure also relates to an apparatus configured to embed key information in an image, the apparatus comprising a memory associated with at least one processor, the at least one processor being configured to store useful data in the image. N A range of DMZ values ​​is reserved within a predetermined range of values, and the reserved range is used to store key information associated with at least one coordinate in the image, where N>0 and DMZ<<2 N .

[0039] The present disclosure also relates to an apparatus configured to decode an image corresponding to a representation of at least a portion of an object of multimedia content, the apparatus comprising a memory associated with at least one processor, the at least one processor being configured to: for a value W read for at least one coordinate in the image,

[0040] If W belongs to a reserved range provided by the apparatus configured to embed critical information disclosed above, then the read value W is discarded;

[0041] If W does not belong to the reserved range provided by the previously disclosed apparatus configured to embed critical information, recovering useful data corresponding to the read value W by applying an inverse corrective quantization to the read value W, the inverse corrective quantization taking into account the reserved range.

[0042] The present disclosure also relates to a computer program product, which comprises program code instructions for executing the steps of the method for embedding key information in an image as disclosed above when the program is executed on a computer or a processor.

[0043] The present disclosure also relates to a non-transitory computer-readable carrier medium having instructions stored therein, and when the program is executed on a computer, the instructions are used to cause a processor to perform at least the above-mentioned method for embedding key information in an image. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] Other features and advantages of the embodiments will be apparent from the following description given by way of illustrative and non-exhaustive examples and from the accompanying drawings, in which:

[0045] Figure 1a and Figure 1b Examples of images with undefined values ​​and keymaps according to the prior art are shown respectively;

[0046] Figure 2a and Figure 2b are respectively a flow chart of an embodiment of the disclosed method and an example of a reserved value range according to an embodiment of the disclosed method; Figure 2c shows curves corresponding to known quantization of useful data and modified quantization applied to the useful data, respectively, according to an embodiment of the disclosed method;

[0047] Figure 3 can be used to implement the Figure 2a to Figure 2c A schematic diagram of a structural block of an exemplary apparatus of the disclosed method of the disclosed embodiment. DETAILED DESCRIPTION

[0048] Throughout the drawings of this document, the same reference numerals denote similar elements and steps.

[0049] The subject matter is now described with reference to the accompanying drawings, wherein like reference numerals are used to represent like elements throughout. In the following description, for the purpose of explanation, many specific details are set forth to provide a thorough understanding of the subject matter. However, it is apparent that the subject embodiment may be implemented without these specific details.

[0050] This specification illustrates the principles of the present disclosure. It will thus be appreciated that those skilled in the art will be able to devise various arrangements that, although not explicitly described or shown herein, embody the principles of the present disclosure.

[0051] The present principles will be described with reference to a specific embodiment of a method for embedding key information in an image in order to optimize the decoding of the image, such as Figure 2a and Figure 2b as shown in .

[0052] The general principle of the disclosed method is based on the use of 2 N A smaller range of values ​​(size DMZ<<2) is reserved for storing critical information within a predetermined range of values. N ). For example, the key information is associated with at least one coordinate in the image and needs to be identified as a value to be discarded rather than useful data at the decoding side.

[0053] Since no specific values ​​are predetermined for embedding the key information, but rather a range of values ​​is reserved and used, the disclosed method is robust to encoding artifacts. Indeed, even if the encoding modifies the key information, it should not change outside the reserved range of values, so that on the decoding side, the key information can be identified as a value to be discarded and not decoded.

[0054] To this end, the size of the reserved range DMZ can be adaptively refined (to be sufficiently robust to coding artifacts) according to the compression level used to encode the image. Indeed, a value of DMZ that is too high (i.e., the reserved value range of key information is too large) may waste a part of the dynamics allowed for the useful data of the image, while a value that is too low (i.e., the reserved value range of key information is too small) may result in excessive coding artifacts (poor transmission of key information).

[0055] The size of the reserved zone DMZ can also be adaptively refined according to the image itself, ie according to the actual dynamics required to store useful data in the image.

[0056] Therefore, a multi-pass strategy can be considered in order to set the best value of DMZ for a given image and a given compression level. For each pass, candidate values ​​are tested on the encoding side as well as on the decoding side, starting from a minimum initialization and increasing stepwise if too many encoding artifacts are observed. In any case, the DMZ value should be known at decoding time to properly decode the image information.

[0057] For example, a multi-pass strategy may be implemented to resize the DMZ per GOP (Group of Pictures).

[0058] According to a specific embodiment of the disclosed method, the image in which the key information as well as the useful data are embedded corresponds to a distance map, such as obtained from a previous step of encoding the source image. Thus, in this case, for each coordinate in the image corresponding to a useful distance value, 2 N The predetermined range of values ​​corresponds to the dynamic value range used to store the distance values.

[0059] However, since the distance map / image may present certain areas containing undefined values ​​that should not be decoded (for example, in cases where no projection is present), a reserved range of size DMZ corresponds to a dynamic part of the distance map, which will be used to store critical information for each coordinate in the image that has no associated distance value.

[0060] A distance map / image may be obtained after projection on a parametric surface of a 3D point cloud representing at least a portion of an object in the multimedia content. Such a distance map / image contains information about the distance z between the projected point and the original 3D point. Information about the distance z (if any) is needed on the decoding side to properly restore the point cloud, and is usually expressed as a clipped inverse function Z(z) of the distance in order to give more dynamics and facilitate close distances. For example, the clipped inverse function Z(z) may be expressed by the formula:

[0061]

[0062] Among them, z min and z max Define the limit range, Z(z min )=1 and Z(z max )=0.

[0063] This quantity Z(z) is then quantized and stored as an unsigned integer U(z) on N bits (usually 10 or 12) such as:

[0064] U(z)=floor(2 N Z(z)).

[0065] For example, for N = 12, z min =1 and z max =5, Figure 2c U(z) is shown by a solid line in FIG.

[0066] Therefore, when no useful data is associated with a coordinate in the image, the disclosed method proposes to use a portion of this dynamic given U(z) to store critical information.

[0067] For example, in Figure 2b In the first variant shown, a reserved range of DMZ values ​​is defined at the beginning of the permissible dynamic range, DMZ<<2 N .

[0068] Indeed, as mentioned above, retaining the beginning of the range values ​​is still not too harmful, since the front values ​​are used for distant objects (according to the inverse clipping function Z(z)).

[0069] In another variant, for example in the case where the image does not correspond to a distance map, it is better to use the end of the range of values ​​if the later values ​​are used to store less important information.

[0070] As already said, the size DMZ can be adjusted in order to anticipate the fact that the encoding step will change the values ​​stored in the distance map, for example within a maximum range of + / -(DMZ / 2). This maximum range of change is adaptively adjusted depending on the compression level. Figure 2bThis is shown above in connection with the first variant, wherein the dotted vertical line represents the value DMZ which can be varied to change 2 N The predetermined range of values ​​is divided into two ranges: the reserved range and the useful data range. Therefore, the useful data stored in the range image can be from (DMZ+1) to (2 N -1).

[0071] Then, once the large and small DMZs are defined, dedicated encoding and decoding processes are implemented.

[0072] For example, at the encoding side, note that a value V is to be stored in the distance map / image for a given position / coordinate in the image. As described above, the value V can be useful data corresponding to the distance information associated with the coordinates or key information for undefined areas.

[0073] Thus, in a first variant, if no useful data is known for the current coordinates (for example, no projection occurs in this particular part of the image), a key information V equal to 0 is stored in the range image at the beginning of the dynamic range of the distance values. k , where 0 is a value that belongs to the reserved range of size DMZ.

[0074] Otherwise, if the distance value is known for the current coordinate (i.e., the projection occurs at this particular part of the image), it should be within the useful data range, i.e., within 2 N Useful data is stored in a predetermined range of values ​​except for the beginning reserved for critical information. Therefore, in order to obtain the value to be stored from the distance information, modified quantization is applied to Z(z), and the value V is stored. u ,For example:

[0075] V u =U DMZ (z) = floor((2 N -DMZ)Z(z)+DMZ).

[0076] For example, for N = 12, z min =1 and z max =5, Figure 2c The dashed line also shows U DMZ (z).

[0077] Therefore, according to the disclosed method, for each coordinate in the range image, a value V is stored depending on whether a projection occurs for the corresponding point. u or V k (Equal to 0 in the first variant) The coded image is then compressed using an image or video compression method.

[0078] On the decoding side, for the received and decompressed image, note that the read value W may be affected by compression artifacts. For the received image, the value DMZ is known to the decoder. The value DMZ may have been sent in the stream in association with the image. In a variant, a predefined value is set for DMZ. In another variant, the decoder implements a method for determining the value DMZ based on the received image.

[0079] According to the disclosed method, if the value W belongs to a reserved range of size DMZ (i.e., in a first variant, if W < DMZ), the current value W may correspond to an undefined / unused point, or may result from a coding error of a "true" point (i.e., useful data that was close to the reserved range before encoding but was modified by compression and therefore belongs to the reserved range when decompressed by the decoder). As a result, such points are discarded by the decoder and considered as unused. Indeed, even if "true" points are discarded due to compression artifacts, this is less harmful than "releasing" a small amount of useful data than interpreting undefined data as useful data, moreover, if they correspond to distant objects.

[0080] On the contrary, if the value W does not belong to the reserved range (ie, in the first variant, if W>DMZ), the current point is considered a "valid" point and the value U is calculated. DMZ -1 (W) (ie, as inverse quantization applied on the encoding side) to restore the associated distance value.

[0081] Thus, according to the disclosed method, for each coordinate in the received range image, the value W can be interpreted as useful data, or can be discarded if critical information is identified.

[0082] Thus, the disclosed method allows for compact storage of critical information in an image while providing robustness to coding artifacts in the content / image and a compression level adaptive approach.

[0083] To this end, the disclosed method can exploit the dynamic range of values ​​that may be considered oversized with respect to the values ​​to be stored and / or the image itself, and allow embedding critical information in the image without transmitting additional images, thereby optimizing the final bit rate of the image transmission.

[0084] Reference now Figure 3 According to the above Figure 2a to Figure 2c Any disclosed embodiment shows a structural block of an exemplary device that can be used to implement the method for embedding key information in an image.

[0085] In an embodiment, the apparatus 300 for implementing the disclosed method includes a non-volatile memory 303 (e.g., a read-only memory (ROM) or a hard disk), a volatile memory 301 (e.g., a random access memory or RAM), and a processor 302. The non-volatile memory 303 is a non-transitory computer-readable carrier medium. It stores executable program code instructions executed by the processor 302 to implement the methods described in various embodiments above.

[0086] Upon initialization, the aforementioned program code instructions are transferred from the non-volatile memory 303 to the volatile memory 301 for execution by the processor 302. Likewise, the volatile memory 301 includes registers for storing variables and parameters required for said execution.

[0087] Naturally, the present disclosure is not limited to the above-described embodiments.

[0088] Specifically, the present disclosure is not limited to methods and devices for embedding key information in images, but also extends to methods for encoding / decoding packets including data representing objects of multimedia content and any device implementing the method, and in particular any device including at least one CPU and / or at least one GPU.

[0089] For example, the disclosed method can be applied to stereoscopic or immersive video.

[0090] The embodiments described herein may be implemented, for example, with a method or process, a device, a computer program product, a data stream or a signal. Although discussed only in the context of a single form of implementation (e.g., discussed only as a method or device), the implementation of the discussed features may also be implemented in other forms (e.g., programs). The device may be implemented, for example, with appropriate hardware, software, and firmware. The method may be implemented in a device such as a processor, which generally refers to a processing device, including, for example, a computer, a microprocessor, an integrated circuit, or a programmable logic device. The processor also includes a communication device, such as a smart phone, a tablet computer, a computer, a mobile phone, a portable / personal digital assistant ("PDA"), and other devices that facilitate information communication between end users.

[0091] The various processing and feature implementations described herein may be presented as a variety of different devices or applications, specifically, for example, devices or applications associated with data encoding, data decoding, view generation, texture processing, and other processing of images and related texture information and / or depth information. Examples of such devices include encoders, decoders, post-processors for processing outputs from decoders, pre-processors for providing inputs to encoders, video encoders, video decoders, video codecs, network servers, set-top boxes, laptop computers, personal computers, cellular phones, PDAs, and other communication devices. It should be clear that the device can be mobile and even installed in a mobile vehicle.

[0092] Furthermore, the method may be implemented by instructions executed by a processor, and these instructions (and / or data values ​​produced by the implementation) may be stored on a processor-readable medium, such as an integrated circuit, a software carrier, or other storage device, such as a hard disk, a compact disk ("CD"), an optical disk (such as a DVD, which is commonly referred to as a digital versatile disk or digital video disk), a random access memory ("RAM"), or a read-only memory ("ROM"). The instructions may form an application program tangibly implemented on a processor-readable medium. The instructions may be located, for example, in hardware, firmware, software, or a combination thereof. The instructions may be found, for example, in an operating system, a separate application, or a combination of the two. Thus, a processor may be characterized, for example, as a device configured to perform a process and a device (such as a storage device) including a processor-readable medium having instructions for performing a process. Furthermore, the processor-readable medium may store data values ​​produced by the implementation, in addition to or in lieu of the instructions.

[0093] It should be clear to those skilled in the art that embodiments may generate a variety of signals formatted to carry, for example, stored or transmitted information. Information may include, for example, instructions for executing a method, or data generated by one of the described embodiments. For example, a signal may be formatted to carry as data the rules for writing or reading the grammar of the embodiment, or to carry as data the actual grammar values ​​written by the embodiment. Such a signal may be formatted as, for example, an electromagnetic wave (e.g., using the radio frequency portion of the spectrum) or a baseband signal. Formatting may include, for example, encoding a data stream or modulating a carrier using an encoded data stream. The information carried by the signal may be, for example, analog or digital information. The signal may be transmitted via a variety of different known wired or wireless links. The signal may be stored on a processor-readable medium.

[0094] A number of implementations have been described. However, it should 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, it will be understood by those of ordinary skill in the art that other structures or processes may replace those disclosed, and that the resulting implementations will perform at least substantially the same functions in at least substantially the same manner to achieve substantially the same results as the disclosed implementations. Therefore, the present application also encompasses these and other implementations.

Claims

1. A method for encoding an image corresponding to a map obtained after projection of a point cloud representing at least a portion of an object of multimedia content on a parametric surface, the method comprising: retaining a first range of values ​​within a second range of values ​​predetermined for storing values ​​in pixels of the image, the first range for storing a key value indicating that the pixel is a non-useful pixel, and the second range of values ​​minus the first range of values ​​for storing useful values ​​for pixels of the image, wherein the useful values ​​correspond to information representing a distance between at least a portion of the object and the parameter surface; as well as The image and information representing the first range are encoded in a data stream. The method of claim 1 , wherein the first range is the beginning of the second range. The method of claim 1 , wherein the first range is an end of the second range.

4. The method according to claim 1, comprising: For at least one pixel in the image, storing a key value in the pixel when a non-useful value is associated with the pixel, the key value belonging to the first range, When a useful value is associated with the pixel: applying a modified quantization to the useful value to provide a modified useful value, the modified quantization being determined based on the number of values ​​in the first range, and The corrected value is stored in the pixel.

5. A method for decoding an image corresponding to a map obtained after projection of a point cloud representing at least a portion of an object of multimedia content on a parametric surface, the method comprising: decoding the image and information indicating a reserved range from a data stream, the reserved range being provided for storing key information indicating that a pixel is a non-useful pixel; as well as For a value W read for at least one pixel in the image: When the value W belongs to the reserved range, discarding the value W; When the value W does not belong to the reserved range, a useful value corresponding to the value W is restored by applying an inverse corrective quantization to the value W, wherein the inverse corrective quantization is determined based on the reserved range, wherein the useful value corresponds to information representing the distance between at least a portion of the object and the parameter surface.

6. An apparatus configured to encode an image, the image corresponding to a map obtained after projection of a point cloud representing at least a portion of an object of multimedia content on a parametric surface, the apparatus comprising at least one processor and at least one memory storing instructions, the instructions, when executed by the at least one processor, causing the apparatus to perform the following operations: retaining a first range of values ​​within a second range of values ​​for storing useful values ​​in the image, the first range for storing a key value indicating that a pixel is a non-useful pixel, and wherein the second range of values ​​removes the first range of values ​​for storing useful values ​​for pixels of the image, wherein the useful values ​​correspond to information representing a distance between at least a portion of the object and the parameter surface; and The image and information representing the first range are encoded in a data stream.

7. The apparatus of claim 6, wherein the instructions further cause the apparatus to: storing a key value in the pixel when a non-useful value is associated with the pixel, the key value belonging to the first range, When a useful value is associated with the pixel: applying a modified quantization to the useful value to provide a modified useful value, the modified quantization being determined based on the number of values ​​in the first range, and The corrected value is stored in the pixel. The apparatus of claim 6 , wherein the first range is a beginning of the second range.

9. The apparatus of claim 6, wherein the first range is an end of the second range.

10. An apparatus configured to decode an image, the image corresponding to a map obtained after projection of a point cloud representing at least a portion of an object of multimedia content on a parametric surface, the apparatus comprising at least one processor and at least one memory storing instructions, the instructions, when executed by the at least one processor, causing the apparatus to perform the following operations: decoding the image and information indicating a reserved range from a data stream, the reserved range being provided for storing key information indicating that a pixel is a non-useful pixel; as well as For a value W read for at least one pixel in the image: When the value W belongs to the reserved range, discarding the value W; When the value W does not belong to the reserved range, a useful value corresponding to the value W is restored by applying an inverse corrective quantization to the value W, wherein the inverse corrective quantization is determined based on the reserved range, wherein the useful value corresponds to information representing the distance between at least a portion of the object and the parameter surface.

11. A non-transitory computer-readable storage medium having instructions which, when executed by a processor, cause the processor to encode an image corresponding to a map obtained after projecting a point cloud representing at least a portion of an object of multimedia content onto a parametric surface, wherein the encoding comprises: retaining a first range of values ​​within a second range of values ​​predetermined for storing values ​​in pixels of the image, the first range for storing a key value indicating that the pixel is a non-useful pixel, and the second range of values ​​minus the first range of values ​​for storing useful values ​​for pixels of the image, wherein the useful values ​​correspond to information representing a distance between at least a portion of the object and the parameter surface; as well as The image and information representing the first range are encoded in a data stream.

Citation Information

Patent Citations

  • Generation of high dynamic range images from low dynamic range images

    CN102986214A

  • Method and apparatus for visualization of geo-located media contents in 3D rendering applications

    CN106133795A

  • Method and device for determining a set of modifiable elements in a group of pictures

    EP2960854A1

  • Embedding Media Content Within Image Files And Presenting Embedded Media In Conjunction With An Associated Image

    US20140072223A1

  • System and method for transferring non-video data over a video interface

    US20140092989A1