Syntax structures indicating completion of coded regions
Syntax structures that indicate the completion of coded regions of pictures are described. For example, a syntax structure in an elementary bitstream indicates the completion of a coded region of a picture. The syntax structure can be a type of network abstraction layer unit, a type of supplemental enhancement information message or another syntax structure. For example, a media processing tool such as an encoder can detect completion of a coded region of a picture, then output, in a predefined order in an elementary bitstream, syntax structure(s) that contain the coded region as well as a different syntax structure that indicates the completion of the coded region. Another media processing tool such as a decoder can receive, in a predefined order in an elementary bitstream, syntax structure(s) that contain a coded region of a picture as well as a different syntax structure that indicates the completion of the coded region.
1. A computing system including:
a buffer configured to store, as part of an elementary bitstream, one or more syntax structures that contain a coded region for a region of an image or video, and, after the one or more syntax structures that contain the coded region, a different syntax structure that indicates completion of the coded region, the different syntax structure including a next slice segment address that indicates a slice segment address for a next slice segment header when the slice segment address for the next slice segment header is present in the elementary bitstream, wherein the next slice segment address is zero if the next slice segment header is for a first slice segment of a next picture or if no next slice segment header is present in the elementary bitstream; and
a media processing tool configured to detect the completion of the coded region using the different syntax structure.
2. The computing system of claim 1 , wherein the media processing tool is further configured to:
decode the coded region to reconstruct the region.
3. The computing system of claim 1 , wherein the different syntax structure has a type that designates the different syntax structure as an end-of-region indicator.
4. The computing system of claim 3 , wherein the different syntax structure is a supplemental enhancement information (“SEI”) message, and wherein the SEI message is a prefix SEI message.
5. The computing system of claim 1 , wherein:
if the next slice segment address is zero, the completion of the coded region is completion of encoded data for a final slice segment of a current picture; and
if the next slice segment address is greater than zero, the completion of the coded region is completion of encoded data for a non-final slice segment of the current picture.
6. The computing system of claim 1 , wherein the media processing tool is further configured to:
determine that the next slice segment address is zero; and
based on the next slice segment address, determine that the completion of the coded region is completion of encoded data for a final slice segment of a current picture.
7. The computing system of claim 1 , wherein the media processing tool is further configured to:
determine that the next slice segment address is greater than zero; and
based on the next slice segment address, determine that the completion of the coded region is completion of encoded data for a non-final slice segment of a current picture.
8. A computer-readable medium storing computer-executable instructions for causing a processor, when programmed thereby, to perform:
detecting completion of a coded region for a region of an image or video; and
outputting, in an elementary bitstream, one or more syntax structures that contain the coded region, and, after the one or more syntax structures that contain the coded region, a different syntax structure that indicates the completion of the coded region, the different syntax structure including a next slice segment address that indicates a slice segment address for a next slice segment header when the slice segment address for the next slice segment header is present in the elementary bitstream, wherein the next slice segment address is zero if the next slice segment header is for a first slice segment of a next picture or if no next slice segment header is present in the elementary bitstream.
9. The computer-readable medium of claim 8 , further comprising computer-executable instructions for causing the processor, when programmed thereby, to perform:
encoding the region to produce the coded region, wherein the encoding includes the detecting the completion of the coded region and, based on the detecting, adding the different syntax structure to the elementary bitstream.
10. The computer-readable medium of claim 8 , wherein the region is a picture, a tile, or a slice.
11. The computer-readable medium of claim 8 , wherein the different syntax structure has a type that designates the different syntax structure as an end-of-region indicator.
12. The computer-readable medium of claim 11 , wherein the different syntax structure is a supplemental enhancement information (“SEI”) message, and wherein the SEI message is a prefix SEI message.
13. The computer-readable medium of claim 8 , wherein:
if the next slice segment address is zero, the completion of the coded region is completion of encoded data for a final slice segment of a current picture; and
if the next slice segment address is greater than zero, the completion of the coded region is completion of encoded data for a non-final slice segment of the current picture.
14. The computer-readable medium of claim 8 , wherein a single access unit in the elementary bitstream contains the one or more syntax structures that contain the coded region and the different syntax structure that indicates the completion of the coded region.
15. The computer-readable medium of claim 8 , further storing computer-executable instructions for causing the processor, when programmed thereby, to perform:
determining that the completion of the coded region is completion of encoded data for a final slice segment of a current picture; and
setting the next slice segment address to be zero.
16. The computer-readable medium of claim 8 , further storing computer-executable instructions for causing the processor, when programmed thereby, to perform:
determining that the completion of the coded region is completion of encoded data for a non-final slice segment of a current picture; and
setting the next slice segment address to be the slice segment address for the next slice segment header, wherein the slice segment address for the next slice segment header is greater than zero.
17. In a computing system, a method comprising:
receiving, in an elementary bitstream, one or more syntax structures that contain a coded region for a region of an image or video, and, after the one or more syntax structures that contain the coded region, a different syntax structure, the different syntax structure including a next slice segment address that indicates a slice segment address for a next slice segment header when the slice segment address for the next slice segment header is present in the elementary bitstream, wherein the next slice segment address is zero if the next slice segment header is for a first slice segment of a next picture or if no next slice segment header is present in the elementary bitstream; and
detecting the completion of the coded region using the different syntax structure.
18. The method of claim 17 , further comprising:
decoding the coded region to reconstruct the region.
19. The method of claim 17 , wherein the different syntax structure is a prefix supplemental enhancement information (“SEI”) message having a payload type, and wherein the payload type designates the prefix SEI message as an end-of-region indicator.
20. The method of claim 17 , wherein:
if the next slice segment address is zero, the completion of the coded region is completion of encoded data for a final slice segment of a current picture; and
if the next slice segment address is greater than zero, the completion of the coded region is completion of encoded data for a non-final slice segment of the current picture.
21. The method of claim 17 , wherein the region is a picture, a tile, or a slice.
22. The method of claim 17 , further comprising:
determining that the next slice segment address is zero; and
based on the next slice segment address, determining that the completion of the coded region is completion of encoded data for a final slice segment of a current picture.
23. The method of claim 17 , further comprising:
determining that the next slice segment address is greater than zero; and
based on the next slice segment address, determining that the completion of the coded region is completion of encoded data for a non-final slice segment of a current picture.