US2021168380A1PendingUtilityA1

Effective prediction using partition coding

Assignee: GE VIDEO COMPRESSION LLCPriority: Nov 11, 2011Filed: Feb 10, 2021Published: Jun 3, 2021
Est. expiryNov 11, 2031(~5.3 yrs left)· nominal 20-yr term from priority
H04N 19/176H04N 19/124H04N 19/105H04N 19/14H04N 19/593H04N 19/157H04N 19/82H04N 19/96H04N 19/70H04N 19/119H04N 19/126H04N 19/196H04N 19/46H04N 19/61H04N 19/597H04N 19/132
71
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

The way of predicting a current block by assigning constant partition values to the partitions of a bi-partitioning of a block is quite effective, especially in case of coding sample arrays such as depth/disparity maps where the content of these sample arrays is mostly composed of plateaus or simple connected regions of similar value separated from each other by steep edges. The transmission of such constant partition values would, however, still need a considerable amount of side information which should be avoided. This side information rate may be further reduced if mean values of values of neighboring samples associated or adjoining the respective partitions are used as predictors for the constant partition values.

Claims

exact text as granted — not AI-modified
1 - 20 . (canceled) 
     
     
         21 . A decoder for reconstructing a depth map of a video signal using encoded information from a data stream, the decoder comprising a processor configured for:
 deriving a bipartition of a block of the depth map into first and second portions;   associating each of neighboring samples of the depth map with a respective one of the first and second portions, the neighboring samples adjoining the block of the depth map;   predicting the block of the depth map by determining a first predicted value for the first portion based on values of a first set of the neighboring samples, or determining a second predicted value for the second portion based on values of a second set of the neighboring samples; and   refining the prediction of the block by applying one or more refinement values to the first or second predicted value.   
     
     
         22 . The decoder according to  claim 21 , wherein the first predicted value includes an average of values of the first set of neighboring samples and the second predicted value includes an average of values of the second set of neighboring samples. 
     
     
         23 . The decoder according to  claim 21 , wherein the processor is configured for, in applying the one or more refinement values, scaling the one or more refinement values using a quantization step size depending on a reference quantization step size at which a predetermined spatially sampled component associated with the depth map is transmitted within the data stream. 
     
     
         24 . The decoder according to  claim 23 , wherein the processor is configured for using the reference quantization step size to reconstruct a texture sample array corresponding to the depth map. 
     
     
         25 . The decoder according to  claim 21 , wherein the processor is configured for, in deriving the bipartition of the block of the depth map,
 predicting a position of a wedgelet separation line within the block of the depth map based on a wedgelet separation line of a neighboring block such that the wedgelet separation line at the predicted position forms an extension of the wedgelet separation line of the neighboring block into the block of the depth map, and   refining the predicted position of the wedgelet separation line using line refinement information obtained from the data stream, the wedgelet separation line dividing the block of the depth map into the first and second portions.   
     
     
         26 . The decoder according to  claim 21 , wherein the processor is configured for using the block of the depth map as a reference in a prediction loop of the decoder. 
     
     
         27 . The decoder according to  claim 21 , wherein the one or more refinement values include an absolute value and a sign value of a first refinement value applied to the first predicted value, or an absolute value and a sign value of a second refinement value applied to the second predicted value. 
     
     
         28 . The decoder according to  claim 21 , wherein the processor is configured for, in applying the one or more refinement values, linearly combining the one or more refinement values with the first or second predicted value. 
     
     
         29 . An encoder for encoding into a data stream a depth map of a video signal, the encoder comprising a processor configured for:
 deriving a bipartition of a block of the depth map into first and second portions;   associating each of neighboring samples of the depth map with a respective one of the first and second portions, the neighboring samples adjoining the block of the depth map;   predicting the block of the depth map by determining a first predicted value for the first portion based on values of a first set of the neighboring samples, or determining a second predicted value for the second portion based on values of a second set of the neighboring samples;   determining one or more refining values for refining the prediction of the block of the depth map; and   encoding, into the data stream, the one or more refinement values.   
     
     
         30 . The encoder according to  claim 29 , wherein the first predicted value includes an average of values of the first set of neighboring samples and the second predicted value includes an average of values of the second set of neighboring samples. 
     
     
         31 . The encoder according to  claim 29 , wherein, to refine the prediction of the block of the depth map, the one or more refinement values are linearly combined with the first or second predicted value. 
     
     
         32 . The encoder according to  claim 29 , wherein the processor is configured for quantizing the one or more refinement values using a quantization step size depending on a reference quantization step size at which a predetermined spatially sampled component associated with the depth map is transmitted within the data stream. 
     
     
         33 . The encoder according to  claim 32 , wherein the processor is configured for using the reference quantization step size to encode a texture sample array corresponding to the depth map. 
     
     
         34 . The encoder according to  claim 29 , wherein the processor is configured for, in deriving the bipartition of the block of the depth map,
 predicting a position of a wedgelet separation line within the block of the depth map based on a wedgelet separation line of a neighboring block such that the wedgelet separation line at the predicted position forms an extension of the wedgelet separation line of the neighboring block into the block of the depth map,   refining the predicted position of the wedgelet separation line using line refinement information, the wedgelet separation line dividing the block of the depth map into the first and second portions, and   encoding the line refinement information into the data stream.   
     
     
         35 . The encoder according to  claim 29 , wherein the processor is configured for using the block of the depth map as a reference in a prediction loop of the encoder. 
     
     
         36 . The encoder according to  claim 29 , wherein the one or more refinement values include an absolute value and a sign value of a first refinement value applied to the first predicted value, or an absolute value and a sign value of a second refinement value applied to the second predicted value. 
     
     
         37 . A non-transitory computer-readable medium for storing data associated with a video, comprising:
 a data stream stored in the non-transitory computer-readable medium, the data stream comprising one or more refinement values associated with a first or second portion of a block of a depth map associated with the video, wherein the one or more refinement values are encoded using a plurality of operations including:   deriving a bipartition of a block of the depth map into the first and second portions;   associating each of neighboring samples of the depth map with a respective one of the first and second portions, the neighboring samples adjoining the block of the depth map;   predicting the block of the depth map by determining a first predicted value for the first portion based on values of a first set of the neighboring samples, or determining a second predicted value for the second portion based on values of a second set of the neighboring samples;   determining the one or more refining values for refining the prediction of the block of the depth map, and   encoding, into the data stream, the one or more refinement values.   
     
     
         38 . The computer-readable medium according to  claim 37 , wherein the first predicted value includes an average of values of the first set of neighboring samples and the second predicted value includes an average of values of the second set of neighboring samples. 
     
     
         39 . The computer-readable medium according to  claim 37 , wherein the one or more refinement values include an absolute value and a sign value of a first refinement value applied to the first predicted value, or an absolute value and a sign value of a second refinement value applied to the second predicted value. 
     
     
         40 . The computer-readable medium according to  claim 37 , wherein, to refine the prediction of the block of the depth map, the one or more refinement values are linearly combined with the first or second predicted value.

Join the waitlist — get patent alerts

Track US2021168380A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.