Patents by Inventor Simon OUDIN
Simon OUDIN has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20240146954Abstract: A coding efficiency increase is achieved by using a common signalization within the bitstream with regard to activation of merging and activation of the skip mode. One possible state of one or more syntax elements within the bitstream may signalize for a current sample set of a picture that the sample set is to be merged and has no prediction residual encoded and inserted into the bitstream. A common flag may signalize whether the coding parameters associated with a current sample set are to be set according to a merge candidate or to be retrieved from the bitstream, and whether the current sample set of the picture is to be reconstructed based on a prediction signal depending on the coding parameters associated with the current sample set, without any residual data, or to be reconstructed by refining the prediction signal depending on the coding parameters associated with the current sample set by means of residual data within the bitstream.Type: ApplicationFiled: August 1, 2023Publication date: May 2, 2024Inventors: Heiko SCHWARZ, Heiner KIRCHHOFFER, Philipp HELLE, Simon OUDIN, Jan STEGEMANN, Benjamin BROSS, Detlev MARPE, Thomas WIEGAND
-
Publication number: 20240089468Abstract: A further coding efficiency increase may be achieved if for a current block of a picture, for which the bit stream signals one of supported partitioning patterns, a reversal of the partitioning by block merging is avoided. In particular, if the signaled one of the supported partitioning patterns specifies a subdivision of the block into two or more further blocks, a removal of certain coding parameter candidates for all further blocks, except a first further block of the further blocks in a coding order, is performed. Particularly, those coding parameter candidates are removed from the set of coding parameter candidates for the respective further block, the coding parameters of which are the same as coding parameters associated with any of the further blocks which, when being merged with the respective further block, would result in one of the supported partitioning pattern. This avoids redundancy between partitioning coding and merging coding.Type: ApplicationFiled: September 1, 2023Publication date: March 14, 2024Inventors: Philipp HELLE, Heiko SCHWARZ, Detlev MARPE, Thomas WIEGAND, Simon OUDIN, Benjamin BROSS
-
Patent number: 11910030Abstract: A better compromise between encoding complexity and achievable rate distortion ratio, and/or to achieve a better rate distortion ratio is achieved by using multitree sub-divisioning not only in order to subdivide a continuous area, namely the sample array, into leaf regions, but using the intermediate regions also to share coding parameters among the corresponding collocated leaf blocks. By this measure, coding procedures performed in tiles—leaf regions—locally, may be associated with coding parameters individually without having to, however, explicitly transmit the whole coding parameters for each leaf region separately. Rather, similarities may effectively exploited by using the multitree subdivision.Type: GrantFiled: August 6, 2023Date of Patent: February 20, 2024Assignee: GE Video Compression, LLCInventors: Philipp Helle, Detlev Marpe, Simon Oudin, Thomas Wiegand
-
Patent number: 11900415Abstract: A favorable merging or grouping of simply connected regions into which the array of information samples is sub-divided, is coded with a reduced amount of data. To this end, a predetermined relative locational relationship is defined enabling an identifying, for a predetermined simply connected region, of simply connected regions within the plurality of simply connected regions which have the predetermined relative locational relationship to the predetermined simply connected region. Namely, if the number is zero, a merge indicator for the predetermined simply connected region may be absent within the data stream. In other embodiments, spatial sub-division is performed depending on a first subset of syntax elements, followed by combining spatially neighboring simply connected regions depending on a second subset of syntax elements, to obtain an intermediate sub-division.Type: GrantFiled: September 14, 2020Date of Patent: February 13, 2024Assignee: GE Video Compression, LLCInventors: Philipp Helle, Simon Oudin, Martin Winken, Detlev Marpe, Thomas Wiegand
-
Patent number: 11871044Abstract: A better compromise between encoding complexity and achievable rate distortion ratio, and/or to achieve a better rate distortion ratio is achieved by using multitree sub-divisioning not only in order to subdivide a continuous area, namely the sample array, into leaf regions, but using the intermediate regions also to share coding parameters among the corresponding collocated leaf blocks. By this measure, coding procedures performed in tiles—leaf regions—locally, may be associated with coding parameters individually without having to, however, explicitly transmit the whole coding parameters for each leaf region separately. Rather, similarities may effectively exploited by using the multitree subdivision.Type: GrantFiled: August 6, 2023Date of Patent: January 9, 2024Assignee: GE Video Compression, LLCInventors: Philipp Helle, Detlev Marpe, Simon Oudin, Thomas Wiegand
-
Publication number: 20230412850Abstract: A better compromise between encoding complexity and achievable rate distortion ratio, and/or to achieve a better rate distortion ratio is achieved by using multitree sub-divisioning not only in order to subdivide a continuous area, namely the sample array, into leaf regions, but using the intermediate regions also to share coding parameters among the corresponding collocated leaf blocks. By this measure, coding procedures performed in tiles—leaf regions—locally, may be associated with coding parameters individually without having to, however, explicitly transmit the whole coding parameters for each leaf region separately. Rather, similarities may effectively exploited by using the multitree subdivision.Type: ApplicationFiled: August 6, 2023Publication date: December 21, 2023Inventors: Philipp HELLE, Detlev MARPE, Simon OUDIN, Thomas WIEGAND
-
Publication number: 20230388558Abstract: A better compromise between encoding complexity and achievable rate distortion ratio, and/or to achieve a better rate distortion ratio is achieved by using multitree sub-divisioning not only in order to subdivide a continuous area, namely the sample array, into leaf regions, but using the intermediate regions also to share coding parameters among the corresponding collocated leaf blocks. By this measure, coding procedures performed in tiles—leaf regions—locally, may be associated with coding parameters individually without having to, however, explicitly transmit the whole coding parameters for each leaf region separately. Rather, similarities may effectively exploited by using the multitree subdivision.Type: ApplicationFiled: August 14, 2023Publication date: November 30, 2023Inventors: Philipp HELLE, Detlev MARPE, Simon OUDIN, Thomas WIEGAND
-
Patent number: 11810019Abstract: A favorable merging or grouping of simply connected regions into which the array of information samples is sub-divided, is coded with a reduced amount of data. To this end, a predetermined relative locational relationship is defined enabling an identifying, for a predetermined simply connected region, of simply connected regions within the plurality of simply connected regions which have the predetermined relative locational relationship to the predetermined simply connected region. Namely, if the number is zero, a merge indicator for the predetermined simply connected region may be absent within the data stream. In other embodiments, spatial sub-division is performed depending on a first subset of syntax elements, followed by combining spatially neighboring simply connected regions depending on a second subset of syntax elements, to obtain an intermediate sub-division.Type: GrantFiled: November 3, 2022Date of Patent: November 7, 2023Assignee: GE Video Compression, LLCInventors: Philipp Helle, Simon Oudin, Martin Winken, Detlev Marpe, Thomas Wiegand
-
Patent number: 11785246Abstract: A coding efficiency increase is achieved by using a common signalization within the bitstream with regard to activation of merging and activation of the skip mode. One possible state of one or more syntax elements within the bitstream may signalize for a current sample set of a picture that the sample set is to be merged and has no prediction residual encoded and inserted into the bitstream. A common flag may signalize whether the coding parameters associated with a current sample set are to be set according to a merge candidate or to be retrieved from the bitstream, and whether the current sample set of the picture is to be reconstructed based on a prediction signal depending on the coding parameters associated with the current sample set, without any residual data, or to be reconstructed by refining the prediction signal depending on the coding parameters associated with the current sample set by means of residual data within the bitstream.Type: GrantFiled: September 21, 2020Date of Patent: October 10, 2023Assignee: GE Video Compression, LLCInventors: Heiko Schwarz, Heiner Kirchhoffer, Philipp Helle, Simon Oudin, Jan Stegemann, Benjamin Bross, Detlev Marpe, Thomas Wiegand
-
Patent number: 11785229Abstract: A further coding efficiency increase may be achieved if for a current block of a picture, for which the bit stream signals one of supported partitioning patterns, a reversal of the partitioning by block merging is avoided. In particular, if the signaled one of the supported partitioning patterns specifies a subdivision of the block into two or more further blocks, a removal of certain coding parameter candidates for all further blocks, except a first further block of the further blocks in a coding order, is performed. Particularly, those coding parameter candidates are removed from the set of coding parameter candidates for the respective further block, the coding parameters of which are the same as coding parameters associated with any of the further blocks which, when being merged with the respective further block, would result in one of the supported partitioning pattern. This avoids redundancy between partitioning coding and merging coding.Type: GrantFiled: May 25, 2021Date of Patent: October 10, 2023Assignee: GE Video Compression, LLCInventors: Philipp Helle, Heiko Schwarz, Detlev Marpe, Thomas Wiegand, Simon Oudin, Benjamin Bross
-
Patent number: 11785264Abstract: A better compromise between encoding complexity and achievable rate distortion ratio, and/or to achieve a better rate distortion ratio is achieved by using multitree sub-divisioning not only in order to subdivide a continuous area, namely the sample array, into leaf regions, but using the intermediate regions also to share coding parameters among the corresponding collocated leaf blocks. By this measure, coding procedures performed in tiles—leaf regions—locally, may be associated with coding parameters individually without having to, however, explicitly transmit the whole coding parameters for each leaf region separately. Rather, similarities may effectively exploited by using the multitree subdivision.Type: GrantFiled: March 29, 2018Date of Patent: October 10, 2023Assignee: GE Video Compression, LLCInventors: Philipp Helle, Detlev Marpe, Simon Oudin, Thomas Wiegand
-
Patent number: 11734714Abstract: A favorable merging or grouping of simply connected regions into which the array of information samples is sub-divided, is coded with a reduced amount of data. To this end, a predetermined relative locational relationship is defined enabling an identifying, for a predetermined simply connected region, of simply connected regions within the plurality of simply connected regions which have the predetermined relative locational relationship to the predetermined simply connected region. Namely, if the number is zero, a merge indicator for the predetermined simply connected region may be absent within the data stream. In other embodiments, spatial sub-division is performed depending on a first subset of syntax elements, followed by combining spatially neighboring simply connected regions depending on a second subset of syntax elements, to obtain an intermediate sub-division.Type: GrantFiled: June 14, 2021Date of Patent: August 22, 2023Assignee: GE Video Compression, LLCInventors: Philipp Helle, Simon Oudin, Martin Winken, Detlev Marpe, Thomas Wiegand
-
Patent number: 11694226Abstract: A favorable merging or grouping of simply connected regions into which the array of information samples is sub-divided, is coded with a reduced amount of data. To this end, a predetermined relative locational relationship is defined enabling an identifying, for a predetermined simply connected region, of simply connected regions within the plurality of simply connected regions which have the predetermined relative locational relationship to the predetermined simply connected region. Namely, if the number is zero, a merge indicator for the predetermined simply connected region may be absent within the data stream. In other embodiments, spatial sub-division is performed depending on a first subset of syntax elements, followed by combining spatially neighboring simply connected regions depending on a second subset of syntax elements, to obtain an intermediate sub-division.Type: GrantFiled: November 3, 2022Date of Patent: July 4, 2023Assignee: GE Video Compression, LLCInventors: Philipp Helle, Simon Oudin, Martin Winken, Detlev Marpe, Thomas Wiegand
-
Patent number: 11694224Abstract: A favorable merging or grouping of simply connected regions into which the array of information samples is sub-divided, is coded with a reduced amount of data. To this end, a predetermined relative locational relationship is defined enabling an identifying, for a predetermined simply connected region, of simply connected regions within the plurality of simply connected regions which have the predetermined relative locational relationship to the predetermined simply connected region. Namely, if the number is zero, a merge indicator for the predetermined simply connected region may be absent within the data stream. In other embodiments, spatial sub-division is performed depending on a first subset of syntax elements, followed by combining spatially neighboring simply connected regions depending on a second subset of syntax elements, to obtain an intermediate sub-division.Type: GrantFiled: June 14, 2021Date of Patent: July 4, 2023Assignee: GE Video Compression, LLCInventors: Philipp Helle, Simon Oudin, Martin Winken, Detlev Marpe, Thomas Wiegand
-
Patent number: 11625750Abstract: A favorable merging or grouping of simply connected regions into which the array of information samples is sub-divided, is coded with a reduced amount of data. To this end, a predetermined relative locational relationship is defined enabling an identifying, for a predetermined simply connected region, of simply connected regions within the plurality of simply connected regions which have the predetermined relative locational relationship to the predetermined simply connected region. Namely, if the number is zero, a merge indicator for the predetermined simply connected region may be absent within the data stream. In other embodiments, spatial sub-division is performed depending on a first subset of syntax elements, followed by combining spatially neighboring simply connected regions depending on a second subset of syntax elements, to obtain an intermediate sub-division.Type: GrantFiled: September 14, 2020Date of Patent: April 11, 2023Assignee: GE Video Compression, LLCInventors: Philipp Helle, Simon Oudin, Martin Winken, Detlev Marpe, Thomas Wiegand
-
Publication number: 20230098693Abstract: A favorable merging or grouping of simply connected regions into which the array of information samples is sub-divided, is coded with a reduced amount of data. To this end, a predetermined relative locational relationship is defined enabling an identifying, for a predetermined simply connected region, of simply connected regions within the plurality of simply connected regions which have the predetermined relative locational relationship to the predetermined simply connected region. Namely, if the number is zero, a merge indicator for the predetermined simply connected region may be absent within the data stream.Type: ApplicationFiled: November 3, 2022Publication date: March 30, 2023Inventors: Philipp HELLE, Simon OUDIN, Martin WINKEN, Detlev MARPE, Thomas WIEGAND
-
Publication number: 20230099885Abstract: A favorable merging or grouping of simply connected regions into which the array of information samples is sub-divided, is coded with a reduced amount of data. To this end, a predetermined relative locational relationship is defined enabling an identifying, for a predetermined simply connected region, of simply connected regions within the plurality of simply connected regions which have the predetermined relative locational relationship to the predetermined simply connected region. Namely, if the number is zero, a merge indicator for the predetermined simply connected region may be absent within the data stream. In other embodiments, spatial sub-division is preformed depending on a first subset of syntax elements, followed by combining spatially neighboring simply connected regions depending on a second subset of syntax elements, to obtain an intermediate sub-division.Type: ApplicationFiled: November 3, 2022Publication date: March 30, 2023Inventors: Philipp HELLE, Simon OUDIN, Martin WINKEN, Detlev MARPE, Thomas WIEGAND
-
Patent number: 11553212Abstract: A better compromise between encoding complexity and achievable rate distortion ratio, and/or to achieve a better rate distortion ratio is achieved by using multitree sub-divisioning not only in order to subdivide a continuous area, namely the sample array, into leaf regions, but using the intermediate regions also to share coding parameters among the corresponding collocated leaf blocks. By this measure, coding procedures performed in tiles—leaf regions—locally, may be associated with coding parameters individually without having to, however, explicitly transmit the whole coding parameters for each leaf region separately. Rather, similarities may effectively exploited by using the multitree subdivision.Type: GrantFiled: January 21, 2020Date of Patent: January 10, 2023Assignee: GE Video Compression, LLCInventors: Philipp Helle, Detlev Marpe, Simon Oudin, Thomas Wiegand
-
Patent number: 11546641Abstract: A better compromise between encoding complexity and achievable rate distortion ratio, and/or to achieve a better rate distortion ratio is achieved by using multitree sub-divisioning not only in order to subdivide a continuous area, namely the sample array, into leaf regions, but using the intermediate regions also to share coding parameters among the corresponding collocated leaf blocks. By this measure, coding procedures performed in tiles—leaf regions—locally, may be associated with coding parameters individually without having to, however, explicitly transmit the whole coding parameters for each leaf region separately. Rather, similarities may effectively exploited by using the multitree subdivision.Type: GrantFiled: June 29, 2016Date of Patent: January 3, 2023Assignee: GE Video Compression, LLCInventors: Philipp Helle, Detlev Marpe, Simon Oudin, Thomas Wiegand
-
Publication number: 20220217419Abstract: A better compromise between encoding complexity and achievable rate distortion ratio, and/or to achieve a better rate distortion ratio is achieved by using multitree sub-divisioning not only in order to subdivide a continuous area, namely the sample array, into leaf regions, but using the intermediate regions also to share coding parameters among the corresponding collocated leaf blocks. By this measure, coding procedures performed in tiles—leaf regions—locally, may be associated with coding parameters individually without having to, however, explicitly transmit the whole coding parameters for each leaf region separately. Rather, similarities may effectively exploited by using the multitree subdivision.Type: ApplicationFiled: January 14, 2022Publication date: July 7, 2022Inventors: Philipp HELLE, Detlev MARPE, Simon OUDIN, Thomas WIEGAND