System and Method for Depth Map Coding for Smooth Depth Map Area

Patent metadata

Field	Value
Publication number	US-2016105672-A1
Application number	US-201514882256-A
Country	US
Kind code	A1
Filing date	Oct 13, 2015
Priority date	Oct 13, 2014
Publication date	Apr 14, 2016
Grant date	—

Abstract

A method for coding a coding unit that is coded with a single sample value is provided. The method selects a coding pattern from at least two predetermined coding patterns, each of which includes a plurality of boundary neighboring samples of the coding unit that have been reconstructed, and decodes the coding unit according to a value of at least one of the plurality of boundary neighboring samples of the selected coding pattern that is available.

First claim

What is claimed is:

1 . A method for decoding a coding unit which is coded with a single sample value, comprising:
selecting, by a processing system, a coding pattern from at least two predetermined coding patterns, each of the at least two coding patterns comprising at least one of the positions of boundary neighboring samples that have been reconstructed, wherein a boundary neighboring sample is a boundary sample of a neighboring coding unit of the coding unit; and decoding, by the processing system, the coding unit, if at least one of the boundary neighboring samples indicated by the corresponding positions comprised in the selected coding pattern is available, according to a value of the at least one of the boundary neighboring samples indicated by the selected coding pattern.

2 . The method of claim 1 , further comprising determining availability of at least one of the boundary neighboring samples indicated by the selected coding pattern by the processing system.

3 . The method of claim 1 , further comprising decoding the coding unit according to a default value, when the plurality of boundary neighboring samples of the selected coding pattern are not available.

4 . The method of claim 3 , wherein the default value is predetermined or calculated.

5 . The method of claim 1 , wherein decoding the coding unit according to a value of the at least one of the boundary neighboring samples indicated by the selected coding pattern comprises:
using the value of the at least one of the boundary neighboring samples indicated by the selected coding pattern to fill the coding unit.

6 . The method of claim 1 , wherein each of the at least two coding patterns comprises a position of a first boundary neighboring sample selected from a first neighboring coding unit of the coding unit that has been reconstructed, and a position of a second boundary neighboring sample selected from a second neighboring coding unit of the coding unit that has been reconstructed.

7 . The method of claim 6 , wherein the first boundary neighboring sample comprises at least anyone of a first boundary sample, a middle boundary sample, or a last boundary sample of the first neighboring coding unit.

8 . The method of claim 6 , wherein the second boundary neighboring sample comprises at least anyone of a first boundary sample, a middle boundary sample, or a last boundary sample of the second neighboring coding unit.

9 . The method of claim 1 , wherein the boundary neighboring samples of each of the at least two coding patterns are ordered in a predetermined order.

10 . The method of claim 9 , wherein the boundary neighboring samples are ordered according to the priority of the positions of the plurality of boundary neighboring samples.

11 . The method of claim 1 , wherein one of the at least two predetermined coding patterns is a default coding pattern.

12 . The method of claim 1 , further comprising obtaining a signal indicating which of the at least two coding patterns is to be selected.

13 . An apparatus for decoding a coding unit that is coded with a single sample value, comprising:
a processor; and a non-transitory computer readable storage medium storing programming for execution by the processor, the programming comprising instructions to: select a coding pattern from at least two predetermined coding patterns, each of the at least two coding patterns comprising at least one of the positions of boundary neighboring samples that have been reconstructed, wherein a boundary neighboring sample is a boundary sample of a neighboring coding unit of the coding unit; and decode the coding unit, if at least one of the plurality of boundary neighboring samples indicated by the corresponding positions comprised in the selected coding pattern is available, according to a value of the at least one of the boundary neighboring samples indicated by the selected coding pattern.

14 . The apparatus of claim 13 , wherein the programming comprises further instructions to determine availability of at least one of the boundary neighboring samples indicated by the selected coding pattern.

15 . The apparatus of claim 13 , wherein the programming comprises further instructions to decode the coding unit according to a default value, when the plurality of boundary neighboring samples of the selected coding pattern are not available.

16 . The apparatus of claim 13 , wherein each of the at least two coding patterns comprises a position of a first boundary neighboring sample selected from a first neighboring coding unit of the coding unit that has been reconstructed, and a position of a second boundary neighboring sample selected from a second neighboring coding unit of the coding unit that has been reconstructed.

17 . The apparatus of claim 13 , wherein the boundary neighboring samples in each of the at least two coding patterns are ordered in a predetermined order.

18 . The apparatus of claim 17 , wherein the boundary neighboring samples are ordered according to the priority of the positions of the plurality of boundary neighboring samples.

19 . The apparatus of claim 13 , wherein one of the at least two predetermined coding patterns is a default coding pattern.

20 . The apparatus of claim 13 , wherein the programming comprises further instructions to obtain a signal indicating which of the at least two coding patterns is to be selected.

Assignees

• Futurewei Technologies Inc
• Santa Clara University

Inventors

• Zheng Jianhua
• Gu Zhouye
• Zhang Chen-Xiong
• Ling Nam

Classifications

• H04N19/176 Primary

  the region being a block, e.g. a macroblock · CPC title

• H04N19/11

  among a plurality of spatial predictive coding modes · CPC title

• H04N19/167

  Position within a video image, e.g. region of interest [ROI] · CPC title

• H04N19/597

  specially adapted for multi-view video sequence encoding · CPC title

• H04N19/44

  Decoders specially adapted therefor, e.g. video decoders which are asymmetric with respect to the encoder · CPC title