Method and device for encoding/decoding an image unit comprising image data represented by a luminance channel and at least one chrominance channel
The present principles relates to a method for encoding an image unit comprising image data represented by a luminance channel and at least one chrominance channel, the method comprising obtaining a luma coding-tree by splitting a luminance unit representative of the luminance channel of said image unit and obtaining a chroma coding-tree by splitting a chrominance unit representative of at least one chrominance channel of said image unit. The method is characterized in that obtaining said chroma coding-tree comprises: —determining whether said chroma coding-tree and said luma coding-tree are identical; and —signaling an information data indicating whether said chroma coding-tree and said luma coding-tree are identical.
1. A method comprising obtaining a luma coding-tree by splitting a luminance unit representative of a luminance channel of an image unit and obtaining a chroma coding-tree by splitting a chrominance unit representative of at least one chrominance channel of the image unit, wherein obtaining the chroma coding-tree comprises:
signaling an information data indicating that a sub-unit of the chroma coding-tree at a given decomposition level is not split when the sub-unit of the chroma coding tree is not split, and a sub-unit of the luma coding tree is split; and
skipping the signaling of the information data indicating that the sub-unit of the chroma coding-tree is not split when the sub-unit of the chroma coding-tree is not split and that the sub-unit of the luma coding-tree co-located with the sub-unit of the chroma coding tree is not split.
2. A method comprising obtaining a luma coding-tree by splitting a luminance unit representative of a luminance channel of an image unit and obtaining a chroma coding-tree by splitting a chrominance unit representative of at least one chrominance channel of the image unit, wherein obtaining the chroma coding-tree comprises:
parsing an information data indicating that a sub-unit of the chroma coding-tree at a given decomposition level is not split when the sub-unit of the chroma coding tree is not split and that a sub-unit of the luma coding tree is split; and
skipping the parsing of the information data indicating that the sub-unit of the chroma coding-tree is not split when the sub-unit of the chroma coding-tree is not split and that the sub-unit of the luma coding-tree co-located with the sub-unit of the chroma coding tree is not split.
3. A device comprising at least one processor and at least one memory having stored instructions operative, when executed by the at least one processor, to cause the device to:
obtain a luma coding-tree by splitting a luminance unit representative of a luminance channel of an image unit; and
obtain a chroma coding-tree by splitting a chrominance unit representative of at least one chrominance channel of the image unit, wherein obtaining the chroma coding-tree comprises:
signaling an information data indicating that a sub-unit of the chroma coding-tree at a given decomposition level is not split when the sub-unit of the chroma coding tree is not split and that a sub-unit of the luma coding tree is split; and
skipping the signaling of the information data indicating that the sub-unit of the chroma coding-tree is not split when the sub-unit of the chroma coding-tree is not split and that the sub-unit of the luma coding-tree co-located with the sub-unit of the chroma coding tree is not split.
4. A device comprising at least one processor and at least one memory having stored instructions operative, when executed by the at least one processor, to cause the device to:
obtain a luma coding-tree by splitting a luminance unit representative of a luminance channel of an image unit; and
obtain a chroma coding-tree by splitting a chrominance unit representative of at least one chrominance channel of image unit, wherein obtaining chroma coding-tree comprises:
parsing an information data indicating that a sub-unit of the chroma coding-tree at a given decomposition level is not split when the sub-unit of the chroma coding tree is not split and that a sub-unit of the luma coding tree is split; and
skipping the parsing of the information data indicating that the sub-unit of the chroma coding-tree is not split when the sub-unit of the chroma coding-tree is not split and that the sub-unit of the luma coding-tree co-located with the sub-unit of the chroma coding tree is not split.
5. The method of claim 1 , wherein the information data is a flag equal to a first value when the chroma coding-tree and the luma coding-tree are identical and equal to a second value otherwise.
6. The method of claim 1 , wherein, when the chroma coding-tree and the luma coding-tree are determined as being not identical:
when the size of at least one leaf of the chroma coding-tree is larger than a maximum size, the at least one leaf is recursively split until the sizes of the leaves of the chroma coding-tree reach the maximum size.
7. The method of claim 1 , wherein the chroma coding-tree and the luma coding-tree are identical until a given decomposition level and splitting of leaves of the chroma coding-tree for higher decomposition levels stops.
8. The method of claim 1 , wherein the information data is signaled for at least one decomposition level of the chroma coding-tree when the at least one decomposition level is split, the information data indicating whether the at least one decomposition level of the chroma coding-tree follows the splitting of the same level of the luma coding-tree.
9. A method for encoding an image comprising at least one image unit, wherein the at least one image unit is coded according to the method of claim 1 .
10. A method for decoding an image comprising at least one image unit, wherein the at least one image unit is decoded according to the method of claim 2 .
11. A computer-readable storage medium having stored instructions that, when executed by a processor, cause the processor to obtain a luma coding-tree by splitting a luminance unit representative of a luminance channel of an image unit and obtaining a chroma coding-tree by splitting a chrominance unit representative of at least one chrominance channel of the image unit, wherein obtaining the chroma coding-tree comprises:
signaling an information data indicating that a sub-unit of the chroma coding-tree at a given decomposition level is not split when the sub-unit of the chroma coding tree is not split, and a sub-unit of the luma coding tree is split; and
skipping the signaling of the information data indicating that the sub-unit of the chroma coding-tree is not split when the sub-unit of the chroma coding-tree is not split and that the sub-unit of the luma coding-tree co-located with the sub-unit of the chroma coding tree is not split.
12. A non-transitory computer-readable storage medium having stored instructions that, when executed by a processor, cause the processor to obtain a luma coding-tree by splitting a luminance unit representative of a luminance channel of an image unit and obtaining a chroma coding-tree by splitting a chrominance unit representative of at least one chrominance channel of the image unit, wherein obtaining the chroma coding-tree comprises:
parsing an information data indicating that a sub-unit of the chroma coding-tree at a given decomposition level is not split when the sub-unit of the chroma coding tree is not split and that a sub-unit of the luma coding tree is split; and
skipping the parsing of the information data indicating that the sub-unit of the chroma coding-tree is not split when the sub-unit of the chroma coding-tree is not split and that the sub-unit of the luma coding-tree co-located with the sub-unit of the chroma coding tree is not split.
13. The method of claim 2 , wherein the information data is a flag equal to a first value when the chroma coding-tree and the luma coding-tree are identical and equal to a second value otherwise.
14. The method of claim 2 , wherein, when the chroma coding-tree and the luma coding-tree are determined as being not identical:
when the size of at least one leaf of the chroma coding-tree is larger than a maximum size, the at least one leaf is recursively split until the sizes of the leaves of the chroma coding-tree reach the maximum size.
15. The method of claim 2 , wherein the chroma coding-tree and the luma coding-tree are identical until a given decomposition level and of leaves of the chroma coding-tree for higher decomposition levels stows.
16. The method of claim 2 , wherein the information data is parsed for at least one decomposition level of the chroma coding-tree when the at least one decomposition level is split, the information data indicating whether the at least one decomposition level of the chroma coding-tree follows the splitting of the same level of the luma coding-tree.
17. The device of claim 3 , wherein the information data is a flag equal to a first value when the chroma coding-tree and the luma coding-tree are identical and equal to a second value otherwise.
18. The device of claim 3 , wherein, when the chroma coding-tree and the luma coding-tree are determined as being not identical:
when the size of at least one leaf of the chroma coding-tree is larger than a maximum size, the at least one leaf is recursively split until the sizes of the leaves of the chroma coding-tree reach the maximum size.
19. The device of claim 3 , wherein the chroma coding-tree and the luma coding-tree are identical until a given decomposition level and splitting of leaves of the chroma coding-tree for higher decomposition levels stops.
20. The device of claim 3 , wherein the information data is signaled for at least one decomposition level of the chroma coding-tree when the at least one decomposition level is split, the information data indicating whether the at least one decomposition level of the chroma coding-tree follows the splitting of the same level of the luma coding-tree.
21. The device of claim 4 , wherein the information data is a flag equal to a first value when the chroma coding-tree and the luma coding-tree are identical and equal to a second value otherwise.
22. The device of claim 4 , wherein, when the chroma coding-tree and the luma coding-tree are determined as being not identical:
when the size of at least one leaf of the chroma coding-tree is larger than a maximum size, the at least one leaf is recursively split until the sizes of the leaves of the chroma coding-tree reach the maximum size.
23. The device of claim 4 , wherein the chroma coding-tree and the luma coding-tree are identical until a given decomposition level and splitting of leaves of the chroma coding-tree for higher decomposition levels stops.
24. The device of claim 4 , wherein the information data is parsed for at least one decomposition level of the chroma coding-tree when the at least one decomposition level is split, the information data indicating whether the at least one decomposition level of the chroma coding-tree follows the splitting of the same level of the luma coding-tree.