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: 20210281861
    Abstract: 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: Application
    Filed: May 25, 2021
    Publication date: September 9, 2021
    Inventors: Philipp HELLE, Heiko SCHWARZ, Detlev MARPE, Thomas WIEGAND, Simon OUDIN, Benjamin BROSS
  • Patent number: 11087355
    Abstract: 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: Grant
    Filed: August 7, 2020
    Date of Patent: August 10, 2021
    Assignee: GE Video Compression, LLC
    Inventors: Philipp Helle, Simon Oudin, Martin Winken, Detlev Marpe, Thomas Wiegand
  • Patent number: 11057630
    Abstract: 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: Grant
    Filed: September 30, 2020
    Date of Patent: July 6, 2021
    Assignee: GE Video Compression, LLC
    Inventors: Philipp Helle, Heiko Schwarz, Detlev Marpe, Thomas Wiegand, Simon Oudin, Benjamin Bross
  • Patent number: 11051047
    Abstract: 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: Grant
    Filed: October 9, 2020
    Date of Patent: June 29, 2021
    Assignee: GE Video Compression, LLC
    Inventors: Philipp Helle, Detlev Marpe, Simon Oudin, Thomas Wiegand
  • Patent number: 11037194
    Abstract: 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: Grant
    Filed: June 22, 2020
    Date of Patent: June 15, 2021
    Assignee: GE Video Compression, LLC
    Inventors: Philipp Helle, Simon Oudin, Martin Winken, Detlev Marpe, Thomas Wiegand
  • Publication number: 20210037265
    Abstract: 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: Application
    Filed: October 9, 2020
    Publication date: February 4, 2021
    Inventors: Philipp HELLE, Detlev MARPE, Simon OUDIN, Thomas WIEGAND
  • Publication number: 20210021842
    Abstract: 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: Application
    Filed: September 30, 2020
    Publication date: January 21, 2021
    Inventors: Philipp Helle, Heiko Schwarz, Detlev Marpe, Thomas Wiegand, Simon Oudin, Benjamin Bross
  • Publication number: 20210006821
    Abstract: 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: Application
    Filed: September 21, 2020
    Publication date: January 7, 2021
    Inventors: Heiko SCHWARZ, Heiner KIRCHHOFFER, Philipp HELLE, Simon OUDIN, Jan STEGEMANN, Benjamin BROSS, Detlev MARPE, Thomas WIEGAND
  • Publication number: 20200410532
    Abstract: 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: Application
    Filed: September 14, 2020
    Publication date: December 31, 2020
    Inventors: Philipp HELLE, Simon OUDIN, Martin WINKEN, Detlev MARPE, Thomas WIEGAND
  • Patent number: 10880580
    Abstract: 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: Grant
    Filed: October 25, 2019
    Date of Patent: December 29, 2020
    Assignee: GE VIDEO COMPRESSION, LLC
    Inventors: Philipp Helle, Detlev Marpe, Simon Oudin, Thomas Wiegand
  • Patent number: 10880581
    Abstract: 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: Grant
    Filed: February 27, 2020
    Date of Patent: December 29, 2020
    Assignee: GE VIDEO COMPRESSION, LLC
    Inventors: Philipp Helle, Detlev Marpe, Simon Oudin, Thomas Wiegand
  • Patent number: 10863208
    Abstract: 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: Grant
    Filed: June 22, 2020
    Date of Patent: December 8, 2020
    Assignee: GE VIDEO COMPRESSION, LLC
    Inventors: Philipp Helle, Detlev Marpe, Simon Oudin, Thomas Wiegand
  • Publication number: 20200372537
    Abstract: 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: Application
    Filed: August 7, 2020
    Publication date: November 26, 2020
    Inventors: Philipp HELLE, Simon OUDIN, Martin WINKEN, Detlev MARPE, Thomas WIEGAND
  • Patent number: 10841608
    Abstract: 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: Grant
    Filed: February 14, 2020
    Date of Patent: November 17, 2020
    Assignee: GE VIDEO COMPRESSION, LLC
    Inventors: Heiko Schwarz, Heiner Kirchhoffer, Philipp Helle, Simon Oudin, Jan Stegemann, Benjamin Bross, Detlev Marpe, Thomas Wiegand
  • Patent number: 10827187
    Abstract: 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: Grant
    Filed: April 13, 2020
    Date of Patent: November 3, 2020
    Assignee: GE VIDEO COMPRESSION, LLC
    Inventors: Philipp Helle, Heiko Schwarz, Detlev Marpe, Thomas Wiegand, Simon Oudin, Benjamin Bross
  • Publication number: 20200344495
    Abstract: 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: Application
    Filed: June 22, 2020
    Publication date: October 29, 2020
    Inventors: Philipp HELLE, Detlev MARPE, Simon OUDIN, Thomas WIEGAND
  • Patent number: 10812811
    Abstract: 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: Grant
    Filed: April 1, 2020
    Date of Patent: October 20, 2020
    Assignee: GE VIDEO COMPRESSION, LLC
    Inventors: Philipp Helle, Heiko Schwarz, Detlev Marpe, Thomas Wiegand, Simon Oudin, Benjamin Bross
  • Patent number: 10803485
    Abstract: 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: Grant
    Filed: November 7, 2019
    Date of Patent: October 13, 2020
    Assignee: GE VIDEO COMPRESSION, LLC
    Inventors: Philipp Helle, Simon Oudin, Martin Winken, Detlev Marpe, Thomas Wiegand
  • Patent number: 10803483
    Abstract: 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: Grant
    Filed: January 30, 2019
    Date of Patent: October 13, 2020
    Assignee: GE VIDEO COMPRESSION, LLC
    Inventors: Philipp Helle, Simon Oudin, Martin Winken, Detlev Marpe, Thomas Wiegand
  • Publication number: 20200320570
    Abstract: 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: Application
    Filed: June 22, 2020
    Publication date: October 8, 2020
    Inventors: Philipp HELLE, Simon OUDIN, Martin WINKEN, Detlev MARPE, Thomas WIEGAND