Back to results
US 10,375,411 B2Granted
Predictor for depth map intra coding
AssigneeQUALCOMM Incorporated
InventorsXin Zhao, Li Zhang, Ying Chen
Life of this patent
Estimating the term…
Abstract
In an example, a process for coding video data includes determining a partitioning pattern for a block of depth values comprising assigning one or more samples of the block to a first partition and assigning one or more other samples of the block to a second partition. The process also includes determining a predicted value for at least one of the first partition and the second partition based on the determined partition pattern. The process also includes coding the at least one of the first partition and the second partition based on the predicted value.
Claims36
A method of processing video data, the method comprising:
- determining a partitioning pattern for a block of depth values comprising assigning one or more samples of the block to a first partition and assigning one or more other samples of the block to a second partition;
- comparing a depth sample of a top row of the block to an N−1 depth sample of the top row of the block to determine whether a first partition boundary is included in the top row of the block, wherein the top row has N depth samples, and the depth sample of the top row is not adjacent to the N−1 depth sample of the top row;
- comparing a depth sample of a left column of the block to an N−1 depth sample of the left column of the block to determine whether a second partition boundary is included in the left column of the block, wherein the left column has N depth samples, and the depth sample of the left column is not adjacent to the N−1 depth sample of the left column;
- determining a first predicted value and a second predicted value based on whether the first partition boundary is included in the top row and whether the second partition boundary is included in the left column of the block, wherein determining the first predicted value and the second predicted value comprises selecting, to avoid partition boundaries, one or more reference samples that neighbor one or more of the first partition and the second partition;
- and
- coding the at least one of the first partition and the second partition based on one or more of the first predicted value and the second predicted value.
3 more elements
An apparatus for processing video data, the apparatus comprising:
- a memory configured to store a block of depth values;
- and
- one or more processors configured to:
- determine a partitioning pattern for the block of depth values comprising assigning one or more samples of the block to a first partition and assigning one or more other samples of the block to a second partition;
- compare a depth sample of a top row of the block to an N−1 depth sample of the top row of the block to determine whether a first partition boundary is included in the top row of the block, wherein the top row has N depth samples, and the depth sample of the top row is not adjacent to the N−1 depth sample of the top row;
- compare a depth sample of a left column of the block to an N−1 depth sample of the left column of the block to determine whether a second partition boundary is included in the left column of the block, wherein the left column has N depth samples, and the depth sample of the left column is not adjacent to the N−1 depth sample of the left column;
- and
- determine a first predicted value and a second predicted value based on whether the first partition boundary is included in the top row and whether the second partition boundary is included in the left column of the block, including selecting, to avoid partition boundaries, one or more reference samples that neighbor one or more of the first partition and the second partition;
- and
- code the at least one of the first partition and the second partition based on one or more of the first predicted value and the second predicted value.
7 more elements
An apparatus for processing video data, the apparatus comprising:
- means for determining a partitioning pattern for a block of depth values comprising assigning one or more samples of the block to a first partition and assigning one or more other samples of the block to a second partition;
- means for comparing a depth sample of a top row of the block to an N−1 depth sample of the top row of the block to determine whether a first partition boundary is included in the top row of the block, wherein the top row has N depth samples, and the depth sample of the top row is not adjacent to the N−1 depth sample of the top row;
- means for comparing a depth sample of a left column of the block to an N−1 depth sample of the left column of the block to determine whether a second partition boundary is included in the left column of the block, wherein the left column has N depth samples, and the depth sample of the left column is not adjacent to the N−1 depth sample of the left column;
- means for determining a first predicted value and a second predicted value based on whether the first partition boundary is included in the top row and whether the second partition boundary is included in the left column of the block, wherein determining the first predicted value and the second predicted value comprises selecting, to avoid partition boundaries, one or more reference samples that neighbor one or more of the first partition and the second partition;
- and
- means for coding the at least one of the first partition and the second partition based on one or more of the first predicted value and the second predicted value.
3 more elements
A non-transitory computer-readable medium comprising instructions stored thereon that, when executed, cause one or more processors to:
- determine a partitioning pattern for a block of depth values comprising assigning one or more samples of the block to a first partition and assigning one or more other samples of the block to a second partition;
- compare a depth sample of a top row of the block to an N−1 depth sample of the top row of the block to determine whether a first partition boundary is included in the top row of the block, wherein the top row has N depth samples, and the depth sample of the top row is not adjacent to the N−1 depth sample of the top row;
- compare a depth sample of a left column of the block to an N−1 depth sample of the left column of the block to determine whether a second partition boundary is included in the left column of the block, wherein the left column has N depth samples, and the depth sample of the left column is not adjacent to the N−1 depth sample of the left column;
- determine a first predicted value and a second predicted value based on whether the first partition boundary is included in the top row and whether the second partition boundary is included in the left column of the block, wherein determining the first predicted value and the second predicted value comprises selecting, to avoid partition boundaries, one or more reference samples that neighbor one or more of the first partition and the second partition;
- and
- code the at least one of the first partition and the second partition based on the predicted value.
3 more elements
Dependencies are inferred from the claim text.