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: 20190238896Abstract: 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: April 5, 2019Publication date: August 1, 2019Inventors: Philipp HELLE, Detlev Marpe, Simon Oudin, Thomas Wiegand
-
Publication number: 20190197579Abstract: 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: ApplicationFiled: February 5, 2019Publication date: June 27, 2019Inventors: Philipp HELLE, Simon OUDIN, Martin WINKEN, Detlev MARPE, Thomas WIEGAND
-
Publication number: 20190174148Abstract: 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: February 8, 2019Publication date: June 6, 2019Inventors: Philipp HELLE, Detlev MARPE, Simon OUDIN, Thomas WIEGAND
-
Publication number: 20190164188Abstract: 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: ApplicationFiled: January 30, 2019Publication date: May 30, 2019Inventors: Philipp HELLE, Simon OUDIN, Martin WINKEN, Detlev MARPE, Thomas WIEGAND
-
Publication number: 20190158871Abstract: 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: January 18, 2019Publication date: May 23, 2019Inventors: Heiko SCHWARZ, Heiner KIRCHHOFFER, Philipp HELLE, Simon OUDIN, Jan STEGEMANN, Benjamin BROSS, Detlev MARPE, Thomas WIEGAND
-
Publication number: 20190158887Abstract: 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 28, 2019Publication date: May 23, 2019Inventors: Philipp HELLE, Detlev MARPE, Simon OUDIN, Thomas WIEGAND
-
Patent number: 10257545Abstract: 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: July 12, 2018Date of Patent: April 9, 2019Assignee: GE VIDEO COMPRESSION, LLCInventors: Philipp Helle, Detlev Marpe, Simon Oudin, Thomas Wiegand
-
Patent number: 10255617Abstract: 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: October 12, 2012Date of Patent: April 9, 2019Assignee: GE Video Compression, LLCInventors: Philipp Helle, Simon Oudin, Martin Winken, Detlev Marpe, Thomas Wiegand
-
Patent number: 10248966Abstract: 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: March 29, 2018Date of Patent: April 2, 2019Assignee: GE VIDEO COMPRESSION, LLCInventors: Philipp Helle, Simon Oudin, Martin Winken, Detlev Marpe, Thomas Wiegand
-
Publication number: 20190087857Abstract: 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: ApplicationFiled: November 20, 2018Publication date: March 21, 2019Inventors: Philipp HELLE, Simon OUDIN, Martin WINKEN, Detlev MARPE
-
Publication number: 20180324466Abstract: 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: July 12, 2018Publication date: November 8, 2018Inventors: Philipp HELLE, Detlev MARPE, Simon OUDIN, Thomas WIEGAND
-
Publication number: 20180310030Abstract: 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: June 25, 2018Publication date: October 25, 2018Inventors: Philipp HELLE, Detlev MARPE, Simon OUDIN, Thomas WEGAND
-
Publication number: 20180302642Abstract: 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: June 13, 2018Publication date: October 18, 2018Inventors: Heiko SCHWARZ, Heiner KIRCHHOFFER, Philipp HELLE, Simon OUDIN, Jan STEGEMANN, Benjamin BROSS, Detlev MARPE, Thomas WIEGAND
-
Publication number: 20180234705Abstract: 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: April 17, 2018Publication date: August 16, 2018Inventors: Philipp HELLE, Detlev MARPE, Simon OUDIN, Thomas WIEGAND
-
Patent number: 10051291Abstract: 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: August 14, 2018Assignee: GE VIDEO COMPRESSION, LLCInventors: Philipp Helle, Detlev Marpe, Simon Oudin, Thomas Wiegand
-
REGION MERGING AND CODING PARAMETER REUSE VIA MERGING INHERITANCE IN SAMPLE ARRAY MULTITREE DIVISION
Publication number: 20180218397Abstract: 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: ApplicationFiled: March 29, 2018Publication date: August 2, 2018Inventors: Philipp HELLE, Simon OUDIN, Martin WINKEN, Detlev MARPE, Thomas WIEGAND -
Publication number: 20180220164Abstract: 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: March 29, 2018Publication date: August 2, 2018Inventors: Philipp HELLE, Detlev MARPE, Simon OUDIN, Thomas WIEGAND
-
Patent number: 10038920Abstract: 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: October 11, 2012Date of Patent: July 31, 2018Assignee: GE VIDEO COMPRESSION, LLCInventors: Philipp Helle, Detlev Marpe, Simon Oudin, Thomas Wiegand
-
Patent number: 10027976Abstract: 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 5, 2017Date of Patent: July 17, 2018Assignee: GE VIDEO COMPRESSION, LLCInventors: Heiko Schwarz, Heiner Kirchhoffer, Philipp Helle, Simon Oudin, Jan Stegemann, Benjamin Bross, Detlev Marpe, Thomas Wiegand
-
Publication number: 20180184111Abstract: 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: February 6, 2018Publication date: June 28, 2018Inventors: Heiko SCHWARZ, Heiner KIRCHHOFFER, Philipp HELLE, Simon OUDIN, Jan STEGEMANN, Benjamin BROSS, Detlev MARPE, Thomas WIEGAND