# US 10,873,764 B2 · Method for encoding an input video comprising a luma component and two chroma components, the method comprising reshaping of said input video based on reshaping functions > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 10,873,764 B2 - Document ID: US10873764B2 - Status: Granted - Kind: B2 - Application number: 16/301,007 - Filed: 2017-05-05 - Published: 2020-06-11 - Granted: 2020-12-22 - Earliest claimed: 2016-05-13 - Assignees: InterDigital Madison Patent Holdings, SAS - Applicants: Interdigital Madison Patent Holdings, SAS - Inventors: Franck Hiron; Edouard Francois; Christophe Chevance; Pierre Andrivon - Web page: https://patentgrep.com/patent/US10873764B2 ## CPC - H04N 19/70: characterised by syntax aspects related to video coding, e.g. related to compression standards - H04N 19/186: the unit being a colour or a chrominance component - H04N 19/85: using pre-processing or post-processing specially adapted for video compression - H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION ## Abstract The present principles relates to a method and device for encoding an input video comprising a luma component and two chroma components. The method comprises: —reshaping of said input video by applying (610) piece-wise linear functions to the luma and chroma components; —encoding (620) the reshaped video into a bitstream; and —encoding (630) parameters representative of said piece-wise linear functions as side information; and the method is characterized in that reshaping of said input video further depends on a targeted range of a decoded reshaped video and the range of a reconstructed video after an inverse-reshaping is applied on the decoded reshaped video. ## Claims ### Claim 1 A method comprising: encoding an input video comprising a luma component and two chroma components represented by code words, wherein the encoding mcthod comprises: reshaping of the input video by applying at least one piece-wise linear function to extend a range of the code words of the luma and chroma components to a full range; encoding the reshaped input video into a bitstream; and encoding parameters representative of the at least one piece-wise linear function as side information; wherein reshaping of the input video depends on a targeted range of a decoded reshaped video and a range of code words representing a reconstructed video after an inverse-reshaping is applied on the decoded reshaped video. ### Claim 2 (depends on 1) The method of claim 1, wherein the method further comprises encoding a first information data that determines the targeted range of a decoded reshaped video and a second information data that determines the range of a reconstructed video as the side information. ### Claim 3 A method comprising: decoding a reconstructed video from a bitstream, wherein the decoding comprises: obtaining a decoded reshaped video by decoding the bitstream; and obtaining the reconstructed video by inverse-reshaping the decoded reshaped video; wherein the inverse-reshaping of the decoded reshaped video depends on a targeted range of the decoded reshaped video and a range of a reconstructed video after the inverse-reshaping is applied on the decoded reshaped video, wherein the inverse-reshaping increases a range of codewords representing at least one component of the decoded reshaped video. ### Claim 4 (depends on 3) The method of claim 3, wherein the method further comprises obtaining a first information data that determines the targeted range of a decoded reshaped video and a second information data that determines the range of a reconstructed video from side information. ### Claim 5 (depends on 1) The method of claim 1, wherein the method further comprises representing the at least one piece-wise linear function by a 1D Look-Up-Table. ### Claim 6 (depends on 2) The method of claim 2, wherein the method further comprises checking a status of the first information data and a status of the second information data to determine if an expected status is reached; then, if a first expected status is reached, the at least one piece-wise linear function is multiplied by a scaling factor lower than 1 and a non-null offset value is added to the at least one piece-wise linear function; then, if a second expected status is reached, the at least one piece-wise linear function is multiplied by a scaling factor lower than 1; then, if a third expected status is reached, the at least one piece-wise linear function is multiplied by a scaling factor equal to 1. ### Claim 7 (depends on 1) The method of claim 1, wherein the side information is carried on using a Color Remapping Information Supplemental Enhancement Information message as specified by HEVC standard edition 2. ### Claim 8 A device for encoding an input video comprising a luma component and two chroma components represented by code words, the device comprising a processor configured to: reshape the input video by applying a piece-wise linear function to the luma component and two other piece-wise linear functions to the chroma components to extend a range of the code words to a full range; encode the reshaped video into a bitstream; and encode parameters representative of the piece-wise linear functions as side information; wherein reshaping of the input video depends on a targeted range of a decoded reshaped video and a range of code words representing a reconstructed video after an inverse-reshaping is applied on the decoded reshaped video. ### Claim 9 A device for decoding a reconstructed video from a bitstream, comprising a processor configured to obtain a decoded reshaped video by decoding the bitstream and to obtain the reconstructed video by inverse-reshaping the decoded reshaped video, wherein the inverse-reshaping of the decoded reshaped video depends on a targeted range of the decoded reshaped video a range of a reconstructed video after the inverse-reshaping is applied on the decoded reshaped video, wherein the inverse-reshaping increases a range of codewords representing at least one component of the decoded reshaped video. ### Claim 10 (depends on 1) A non-transitory storage medium carrying instructions of program code for executing steps of the method according to claim 1, when the program is executed on a computing device. ### Claim 11 (depends on 3) A non-transitory storage medium carrying instructions of program code for executing steps of the method according to claim 3, when the program is executed on a computing device. ### Claim 12 (depends on 9) The device of claim 9, wherein the processor is further configured to obtain a first information data that determines the targeted range of a decoded reshaped video and a second information data that determines the range of a reconstructed video from side information. ### Claim 13 (depends on 9) The device of claim 9, wherein the processor is further configured to represent at least one piece-wise linear function by a 1D Look-Up-Table. ### Claim 14 (depends on 12) The device of claim 12, wherein the processor is further configure to check a status of the first information data and a status of the second information data in order to determine if an expected status is reached; then, if a first expected status is reached, the piece-wise linear functions are multiplied by a scaling factor lower than 1 and a non-null offset value is added to the piece-wise linear function; then, if a second expected status is reached, the piece-wise linear functions are multiplied by a scaling factor lower than 1; then, if a third expected status is reached, the piece-wise linear functions are multiplied by a scaling factor equal to 1. ### Claim 15 (depends on 12) The device of claim 12, wherein the side information is carried on using a Color Remapping Information Supplemental Enhancement Information message as specified by HEVC standard edition 2. ### Claim 16 (depends on 3) The method of claim 3, wherein the method further comprises representing each piece-wise linear function by a 1D Look-Up-Table. ### Claim 17 (depends on 4) The method of claim 4, wherein the method further comprises checking a status of the first information data and a status of the second information data in order to determine if an expected status is reached; then, if a first expected status is reached, the piece-wise linear functions are multiplied by a scaling factor lower than 1 and a non-null offset value is added to the piece-wise linear function; then, if a second expected status is reached, the piece-wise linear functions are multiplied by a scaling factor lower than 1; then, if a third expected status is reached, the piece-wise linear functions are multiplied by a scaling factor equals to 1.