Improved slice address signaling in video encoding and decoding

By using index values ​​to replace slice address signaling and mapping techniques in video encoding, the problem of high computational complexity in the splicing process in existing technologies is solved. This enables efficient splicing and repositioning of slices without modifying the bitstream slice group layer, and is suitable for 360-degree video resource optimization of head-mounted display devices.

CN118945342APending Publication Date: 2024-11-12TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410963966.9
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Priority Date
2018-12-20
Filing Date
2019-12-13
Publication Date
2024-11-12

AI Technical Summary

Technical Problem

Existing video encoding and decoding solutions require modification of the slice group layer data of the bitstream during the splicing process, resulting in high computational complexity and an inability to extract, splice, and/or relocate slices in the bitstream without modifying the slice group layer.

Method used

By replacing the current slice address signaling with an index value in the slice group header, and by mapping the index value to the slice address, only the parameter set is modified during the splicing process, reducing computational complexity.

Benefits of technology

It reduces the computational complexity of the stitching process, allowing for the extraction, stitching, and repositioning of slices without modifying the bitstream slice group layer, making it suitable for 360-degree video and resource optimization in head-mounted display devices.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118945342A_ABST
    Figure CN118945342A_ABST
Patent Text Reader

Abstract

A method is provided for decoding an image from a bitstream, the image being partitioned into a plurality of segment groups. The method includes decoding a first portion of the bitstream to form an address map that maps segment group index values to segment group addresses; and decoding a second portion of the bitstream. The second portion of the bitstream includes codewords representing a plurality of segment groups. Decoding the second portion of the bitstream includes decoding the first segment group. Decoding the first segment group includes: 1) decoding a first segment group index value of the first segment group; 2) determining a first segment group address of the first segment group based on the first segment group index value and the address mapping; 3) determining a first spatial position of the first segment group based on the first segment group address, wherein the first spatial position represents the position of the first segment group in the image; and 4) decoding at least one sample value of the first segment group and assigning the at least one sample value to a position given by the first spatial position in the decoded image.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] Disclosed are embodiments related to video encoding and decoding. Background Art

[0002] High Efficiency Video Coding (HEVC) is a block-based video codec standardized by ITU-T and MPEG that utilizes both temporal and spatial prediction. In the encoder, the difference between the original pixel data and the predicted pixel data (called the residual) is transformed into the frequency domain, quantized, and then entropy-coded, and then transmitted together with the necessary prediction parameters (such as prediction mode and motion vector) (these prediction parameters are also entropy-coded). By quantizing the transformed residual, the trade-off between bit rate and video quality can be controlled. The decoder performs entropy decoding, inverse quantization, and inverse transformation to obtain the residual; and then adds the residual to intra-frame or inter-frame prediction to reconstruct the image.

[0003] MPEG and ITU-T are working on a successor to HEVC within the Joint Video Exploration Team (JVET). The name of this video codec under development is Versatile Video Coding (VVC).

[0004] The draft VVC video coding standard uses a block structure called a quadtree plus binary tree plus ternary tree block structure (QTBT+TT), in which each image is first partitioned into square blocks called coding tree units (CTUs). All CTUs are of equal size, and the partitioning is done without any syntax controlling it. Each CTU is further partitioned into coding units (CUs) that can have a square or rectangular shape. The CTU is first partitioned by a quadtree structure; then, it can be further partitioned with equal-sized partitions (either vertically or horizontally) in a binary structure to form CUs. Thus, blocks may have a square or rectangular shape. The depth of the quadtree and binary tree can be set by the encoder in the bitstream. Figure 1 An example of using QTBT to partition a CTU is illustrated in . The ternary tree (TT) portion of the structure increases the possibility of partitioning a CU into three partitions instead of two equal-sized partitions; this increases the possibility of using a block structure that better suits the content structure in the picture.

[0005] The VVC video coding standard draft includes a tool called "tiles" that divide images into rectangular spatially independent regions. The slices in the VVC coding standard draft are very similar to the slices used in HEVC. Using slices, images in VVC can be partitioned into rows and columns of samples, where a slice is the intersection of a row and a column. Figure 2 An example of tile partitioning using 4 tile rows and 5 tile columns is shown, resulting in an image with a total of 20 tiles.

[0006] The slice structure is signaled in the picture parameter set (PPS) by specifying the thickness of the rows and the width of the columns. The individual rows and columns can have different sizes, but the partitions always span the entire image, from left to right and from top to bottom, respectively.

[0007] Table 1 lists the PPS syntax used in the VVC draft standard to specify the slice structure. First, there is a flag single_tile_in_pic_flag that indicates whether slices are used. If the flag is set to 0, the number of slice columns and rows is specified. Uniform_tile_spacing_flag is a flag that specifies whether the column width and row height are explicitly signaled or whether a predefined method should be used to evenly space the slice boundaries. If explicit signaling is indicated, the column width is signaled in sequence, followed by the row height. Finally, loop_filter_cross_tiles_enabled_flag specifies whether the in-loop filter across slice boundaries is turned on or off for all slice boundaries in the image. The slice syntax also includes a raw byte sequence payload (RBSP) trailing bit.

[0008] Table 1 - Slice syntax in the VVC draft standard There are no decoding dependencies between slices of the same picture. This includes intra prediction, context selection for entropy coding, and motion vector prediction. An exception is that in-loop filtering dependencies are usually allowed between slices.

[0009] The bits of a coded image in VVC are partitioned into tile_group_layer_rbsp() data chunks, where each such chunk is encapsulated into its own group network abstraction layer (NAL) unit. The data chunk consists of a slice group header and slice group data, where the slice group data consists of an integer number of coded complete slices. Table 2 shows the relevant VVC specification standard draft syntax. The tile_group_header() and tile_group() data syntax are further described below.

[0010] Table 2 - Slice group layer in the VVC draft standard The slice group header starts with the tile_group_pic_parameter_set_id syntax element. This element specifies the picture parameter set (PPS) that should be activated and used for decoding the slice group (see Table 1). The slice group address codeword specifies the slice address of the first slice in the slice group. The address is expressed as a number between 0 and n-1, where n is the number of slices in the picture. Use Figure 2 As an example, the number of tiles present is equal to 20, so the valid tile group address values ​​for this image are between 0 and 19. The tile addresses specify tiles in raster scan order and are shown in Figure 2 The decoder decodes this address value, and by using the slice structure information decoded from the active PPS, the decoder can derive the spatial coordinates of the first slice in the picture. For example, if we assume Figure 2 If all the slices in the slice group have the same size of 256×256 luma samples, then slice address 8 means that the y coordinate of the first slice in the slice group is int(8 / 5)*256=1*256=256, and the x coordinate is (8%5)*256=3*256=768 luma samples.

[0011] The next codeword num_tiles_in_tile_group_minus1 in the slice group header specifies the number of slices present in the slice group. If there is more than one slice in the slice group, the entry points of the slices other than the first are signaled. First, there is the codeword offset_len_minus1, which specifies the number of bits used to signal each offset in the offset. Then, there is a list of entry point offset codewords entry_point_offset_minus1. These specify byte offsets in the bitstream that can be used by the decoder to find the starting point of each slice in order to decode them in parallel. Without these offsets, the decoder would have to parse the slice data in order to find out where each slice starts in the bitstream. The first slice in the slice group follows the slice group header immediately, so there is no byte offset sent for that slice. This means that the number of offsets is one less than the number of slices in the slice group.

[0012] Table 3 - Slice Group Header in the VVC Draft Standard The slice group data contains all the CTUs in the slice group. First, there is a for loop over all slices in the slice group. Inside this loop, there is a for loop over all CTUs in the slice group. Note that the number of CTUs in different slices may be different, because the slice row height and slice column width are not necessarily equal. For entropy coding reasons, there is a bit set to 1 at the end of each slice. Each slice ends in byte alignment, which means that the data for each slice in the slice group starts at an even byte address in the bitstream. This is necessary to specify the entry point in terms of byte number. Note that the slice group header also ends in byte alignment.

[0013] Table 4 - Slice group data in the VVC standard draft The header overhead of a slice consists of signaling, address, number of slices in a slice group, byte alignment, and entry point offset for each slice. In the VVC draft standard, it is mandatory to include the entry point offset in the slice group header when slices are enabled.

[0014] The entry point offset also simplifies the extraction and stitching of slice groups or slices to reconstruct them into an output stream. This requires some encoder side constraints to make the slice groups or slices temporally independent. One of the encoder constraints is the need to constrain the motion vectors so that motion compensation for the slice group or slice uses only samples included in the spatially co-located region of the previous picture. Another constraint is to constrain the temporal motion vector prediction (TMVP) so that the process is temporally independent of non-co-located regions. For complete independence, it is also required to disable in-loop filtering between slice groups or slices.

[0015] Slices are sometimes used to extract and stitch 360-degree videos that are intended for consumption using a head-mounted display (HMD) device. When using today's HMD devices, the field of view is limited to about 20% of the entire sphere, which means that the user consumes only 20% of the entire 360-degree video. Typically, the entire 360-degree video sphere is made available to the HMD device, and the device then crops out the portion that is rendered to the user. That portion, the portion of the sphere that the user sees, is called the viewport. Well-known resource optimization is to make the HMD device video system aware of head movement and the direction the user is looking in, so that fewer resources are spent on processing video samples that are not presented to the user. The resources here can be the bandwidth from the server to the client, or the decoding capacity of the device. For future HMD devices with a field of view greater than the current state of the art, non-uniform resource allocation will still be beneficial because the human visual system requires higher image quality in the central visual area (approximately 18° horizontal view), while it places lower requirements on image quality in the peripheral area (approximately 120° or more for a comfortable horizontal view).

[0016] Optimizing resources for regions of interest (ROI) is another use case for slices. ROIs can be specified in the content or extracted through methods such as eye tracking.

[0017] A state-of-the-art approach to using head movement to reduce the amount of resources required is to use slices. This can be done by first encoding the video sequence multiple times, where the slice partition structure is the same in all encodings. The encoding is done with different video qualities, which results in at least one high-quality encoding and one low-quality encoding. This means that for each slice position at a certain point in time, there is at least one high-quality slice representation and at least one low-quality slice representation. The difference between a high-quality slice and a low-quality slice can be that the high-quality slice is encoded at a higher bit rate than the low-quality slice, or that the high-quality slice has a higher resolution than the low-quality slice.

[0018] Figure 3 An example of encoding a video into one stream 302 with high-quality slices and another stream 304 with low-quality slices is shown. Here we assume that each slice is placed in its own slice group. The slices are numbered in the VVC draft in raster scan order, which is shown here in white text. These slice numbers are used as slice group addresses. Depending on where the user is looking, the client requests slices of different qualities, so that the slices corresponding to where the user is looking are received at high quality, while the slices where the user is not looking are received at low quality. The client then splices the slices together in the bitstream domain and feeds the output bitstream to the video decoder. For example, Figure 3 The output stream 306 after stitching is shown, where slice columns 310 and 316 (the two outer columns) consist of slices from the low-quality stream 304; and where slice columns 3123 and 316 (the two inner columns) consist of slices from the high-quality stream 302. Note that the width of the output image is smaller than the input. The reason is that we are assuming here that no slices are requested at all for the area behind where the user is looking. Summary of the invention

[0019] It is important to do the splicing so that the output bitstream conforms to a bitstream specification (such as the VVC specification to be published in the future) so that the output stream can be decoded using any standard-compliant decoder without any modifications. Figure 3 The splicing example shown in complies with the VVC draft specification, and the tile group address (tile_group_address codeword in the tile group header) needs to be updated by the splicer. For example, the tile group address of the bottom right tile in the output image must be set equal to 15, while the tile group address of the tile in the input low-quality stream and high-quality stream is equal to 19.

[0020] Embodiments are provided for improving encoding and decoding of video (e.g., improving stitching of slices together). The present disclosure also introduces the terms segment group, segment, and unit. As used herein, the term segment is a more general term than slice (used in the VVC draft), and it is noted that the embodiments are applicable to different kinds of image partitioning schemes, and not just slice partitioning known from the HEVC and VVC drafts. As used herein, a "slice" from these drafts is an example of a segment, but there may be other examples of segments.

[0021] like Figure 4 As shown in FIG. 4 , a single image 402 of a video stream is partitioned in various ways. For example, the image 402 is partitioned into cells 410, segments 412, and segment groups 414. As shown in the figure, the image 402 includes 64 cells 410 ( Figure 4 ), 16 segments 412 ( Figure 4 ) and 8 segment groups 414 ( Figure 4 402). As shown, a partition structure 413 (shown by dashed lines) of image 402 defines segments 412. Each segment 412 includes a plurality of cells 410. Segments 412 may include an integer number of complete cells or a combination of complete and partial cells. Multiple segments 412 form segment groups 414. Segment groups may include segments in raster scan order. Alternatively, segment groups may include any group of segments that together form a rectangle. Alternatively, segment groups may consist of any subset of segments.

[0022] like Figure 5 As shown in , image 402 can be partitioned into multiple segments by a partition structure (shown in dashed lines); here, four segments are shown, including segments 502 and 504. Figure 5 Also shown are three cells 510, 512, and 514; two of these cells (512 and 514) belong to the current segment 504, while one of the cells (510) belongs to a different adjacent segment 502. The segments are independent of the other segments, which means that when decoding the cells, the segment boundaries are treated similarly to picture boundaries. This affects the derivation process of elements during decoding, such as, for example, the derivation of intra prediction modes and the derivation of quantization parameter values.

[0023] Intra prediction modes are well known in the art and are signaled and used only for cells that use predictions from previously decoded samples of the current image for sample prediction. It is common that the derivation of the intra prediction mode in the current cell 512 depends on previously derived intra prediction modes in other neighboring cells 514. In the case where the segments are independent, the derivation of the intra prediction mode in the current cell 512 may only depend on previously derived intra prediction modes in cells 514 belonging to the current segment 504, and may not depend on any intra prediction mode in any cell 510 belonging to a different segment 502.

[0024] This means Figure 5 The partition structure in 504 makes the intra prediction mode in the unit 510 in the different segment 502 unavailable for deriving the intra prediction mode of the unit 512 in the current segment 504. Therefore, the effect of the segment boundary on the derivation of the intra prediction mode for the unit 512 in the current segment 504 may be the same as that of the picture boundary. Note that the modes in some units 510 in the different segments 502 may have been used to derive the intra prediction mode in the unit 512 in the current segment 504 if those units originally belonged to the same segment.

[0025] As used herein, a segment may (in some cases) be equivalent to a slice or a slice, and thus these terms may be used interchangeably. Likewise, a segment group may (in some cases) be equivalent to a slice group, and a unit may (in some cases) be equivalent to a CTU.

[0026] As explained above, a process may expect one or more bitstreams as input and produce an output bitstream by selecting slices from the one or more input bitstreams; such a process may be referred to as a splicing process. One problem with existing video encoding and decoding solutions is that it may be required to modify the slice group layer data through the splicing process in order to produce an output bitstream that complies with a bitstream specification (such as the VVC specification to be published in the future). This makes splicing computationally very complex because the number of packets that must be rewritten per second may become very high. For example, consider a frame rate of 60 frames per second (fps), where each image includes 16 slice groups. If each slice is placed in its own packet, then 960 (=60*16) packets may need to be rewritten per second.

[0027] Another problem with existing video encoding and decoding solutions is that it is not possible to extract, splice and / or reposition slices in a bitstream without modifying the slice group layer portion of the bitstream.

[0028] Embodiments overcome these and other problems by replacing the current slice address signaling with an index value in a slice group header and by conveying a mapping between such index values ​​and slice addresses. For example, such a mapping may be conveyed in a parameter set such as a PPS. If the index value is set during encoding with splicing in mind, the index value can remain intact during splicing (e.g., when encoding versions of different qualities, the encoder may enforce the condition that the index value is unique across different versions). Then, a change in the slice group address can be accomplished by modifying only the mapping of the index value to the slice address in the parameter set.

[0029] To facilitate extraction, splicing and / or repositioning of slices in a bitstream without modifying the slice group layer portion of the bitstream, embodiments provide a mapping between the number of slices in a slice group and an index value in a parameter set, where the index is sent in a slice group header.

[0030] Advantages of embodiments include allowing splicing to be performed by rewriting only the parameter sets, while the slice group header remains intact. If we take the 60fps example above, and assume that the parameter sets are sent as packets in the bitstream once per second, then embodiments would require at most 1 packet to be rewritten per second, rather than 961 packets per second. Thus, the computational complexity of splicing is significantly reduced.

[0031] According to a first aspect, a method for decoding an image from a bitstream is provided, the image being partitioned into a plurality of segment groups. The method comprises: decoding a first portion of the bitstream to form an address map mapping segment group index values ​​to segment group addresses; and decoding a second portion of the bitstream. The second portion of the bitstream comprises codewords representing a plurality of segment groups. Decoding the second portion of the bitstream comprises decoding a first segment group. Decoding the first segment group comprises: 1) decoding a first segment group index value for the first segment group; 2) determining a first segment group address for the first segment group based on the first segment group index value and the address map; 3) determining a first spatial position of the first segment group based on the first segment group address, the first spatial position representing a position of the first segment group within the image; and 4) decoding at least one sample value of the first segment group and assigning the at least one sample value to a position in the decoded image given by the first spatial position.

[0032] In some embodiments, the address map includes one or more of an array and / or a list, a parallel set of arrays and / or lists, a hash map, and an associative array. In an embodiment, decoding a first portion of the bitstream to form the address map includes: decoding a first value indicating a number of list values ​​from the bitstream; and forming the list by decoding a plurality of list values ​​from the bitstream, the number of list values ​​being equal to the first value. In an embodiment, determining a first segment group address for a first segment group based on the first segment group index value and the address map includes performing a lookup operation using the first segment group index value.

[0033] In some embodiments, decoding a first portion of a bitstream to form an address map comprises: decoding a first value indicating a number of list values ​​from the bitstream; and forming a first list (KEY) and a second list (VALUE) by decoding a plurality of values ​​representing key-value pairs k and v from the bitstream, the number of key-value pairs being equal to the first value. The first list comprises a key k, and the second list comprises a value v of the key-value pair, and the first list and the second list are ordered such that for a given key-value pair, an index of a given key k in the first list corresponds to an index of a given value v in the second list. In an embodiment, decoding a first portion of a bitstream to form an address map comprises: decoding a first value indicating a number of hash values ​​from the bitstream; and forming a hash map by decoding a plurality of values ​​representing key-value pairs k and v from the bitstream, the number of key-value pairs being equal to the first value, wherein for a given key-value pair, an index of a given key k is mapped by the hash map to a given value v.

[0034] In some embodiments, determining a first segment group address of a first segment group based on a first segment group index value and an address mapping includes: determining an index (i) so that a value (KEY[i]) corresponding to the index in a first list matches the first segment group index value; and determining the first segment group address as a value (VALUE[i]) corresponding to the index in a second list.

[0035] In some embodiments, determining a first segment group address of a first segment group based on the first segment group index value and the address mapping includes performing a hash lookup operation using the first segment group index value. In some embodiments, the decoded value representing the key-value pair k and v includes an increment value representing a key k, such that for a first key-value pair, the key k is determined by the increment value, and for other key-value pairs, the key k is determined by adding the increment value to a previously determined key value to generate a current key k.

[0036] In some embodiments, a segment group corresponds to a slice group, a sub-image, and / or a slice. In some embodiments, a segment group includes one or more segments, and in some embodiments, a segment group includes only one segment.

[0037] In an embodiment, the segment group corresponds to a slice group. In some embodiments, the first portion of the bitstream is included in a parameter set, and the method further comprises decoding additional segment groups, wherein the address map is used to decode the additional segment groups. In some embodiments, the first portion of the bitstream is included in a parameter set, and the method further comprises decoding additional images, wherein the address map is used to decode the additional images.

[0038] According to a second aspect, a method for decoding an image from a bitstream is provided, the image being partitioned into a plurality of segment groups. The method comprises: decoding a first portion of the bitstream to form a size map that maps segment group index values ​​to a number of segments to be decoded for a first segment group; and decoding a second portion of the bitstream. The second portion of the bitstream comprises codewords representing a plurality of segment groups. Decoding the second portion of the bitstream comprises decoding a first segment group. Decoding the first segment group comprises: 1) decoding a first segment group index value for the first segment group; 2) determining a first size for the first segment group based on the first segment group index value and the size map; and 3) decoding a plurality of segments to form a decoded image, the number of segments being equal to the first size.

[0039] In some embodiments, the size map comprises one or more of an array and / or a list, a parallel set of arrays and / or lists, a hash map, and an associative array. In an embodiment, decoding a first portion of the bitstream to form the size map comprises: decoding a first value indicating a number of list values ​​from the bitstream; and forming the list by decoding a plurality of list values ​​from the bitstream, the number of list values ​​being equal to the first value. In an embodiment, determining a first size of the first segment group based on the first segment group index value and the size map comprises performing a lookup operation using the first segment group index value.

[0040] In some embodiments, a segment group corresponds to a slice group, a sub-image, and / or a slice. In some embodiments, a segment group includes one or more segments, and in some embodiments, a segment group includes only one segment.

[0041] According to a third aspect, a method for encoding an image into a bitstream is provided, the image being partitioned into a plurality of segment groups. The method comprises determining, for a plurality of segment groups, an address mapping that maps segment group index values ​​to segment group addresses; encoding a first portion of the bitstream; and encoding a second portion of the bitstream. Encoding the first portion of the bitstream comprises generating codewords forming an address mapping, the address mapping mapping segment group index values ​​to segment group addresses. Encoding the second portion of the bitstream comprises generating codewords representing a plurality of segment groups. Encoding the second portion of the bitstream comprises encoding a first segment group. Encoding the first segment group comprises: 1) determining a first segment group index value from a first segment group address of the first segment group, wherein the address mapping maps the first segment group index value to the first segment group address; 2) encoding the first segment group index value of the first segment group; and 3) encoding sample values ​​of the first segment group.

[0042] According to a fourth aspect, there is provided a method for encoding an image into a bitstream, the image being partitioned into a plurality of segment groups. The method comprises: determining a size map that maps a segment group index value to a number of segments to be encoded for a first segment group; encoding a first portion of the bitstream; and encoding a second portion of the bitstream. Encoding the first portion of the bitstream comprises generating codewords forming a size map that maps a segment group index value to a number of segments to be encoded for the first segment group. Encoding the second portion of the bitstream comprises generating codewords representing a plurality of segment groups. Encoding the second portion of the bitstream comprises encoding a first segment group. Encoding the first segment group comprises: 1) determining a first segment group index value for the first segment group, wherein the size map maps the first segment group index value for the first segment group to a first size, the first size being the number of segments to be encoded for the first segment group; 2) encoding the first segment group index value for the first segment group; and 3) encoding a plurality of segments of the first segment group, the number of segments being equal to the first size.

[0043] In some embodiments, encoding the first segment group index value includes generating one or more codewords representing the first segment group index value.

[0044] According to a fifth aspect, a decoder is adapted to perform any one of the embodiments of the first or second aspect.

[0045] According to a sixth aspect, the encoder is adapted to perform any one of the embodiments of the third or fourth aspect.

[0046] In some embodiments, the encoder and decoder may be co-located in the same node, or they may be separate from each other. In an embodiment, the encoder and / or decoder is part of a network node; in an embodiment, the encoder and / or decoder is part of a user equipment.

[0047] According to a seventh aspect, there is provided a decoder for decoding an image from a bitstream, the image being partitioned into a plurality of segment groups. The decoder comprises a decoding unit and a determining unit. The decoding unit is configured to decode a first portion of the bitstream to form an address mapping mapping segment group index values ​​to segment group addresses; and is further configured to decode a second portion of the bitstream. The second portion of the bitstream comprises codewords representing a plurality of segment groups. Decoding the second portion of the bitstream comprises decoding a first segment group. Decoding the first segment group comprises: 1) decoding a first segment group index value of the first segment group (by the decoding unit); 2) determining a first segment group address of the first segment group based on the first segment group index value and the address mapping (by the determining unit); 3) determining a first spatial position of the first segment group based on the first segment group address (by the determining unit), the first spatial position representing a position of the first segment group within the image; and 4) decoding at least one sample value of the first segment group (by the decoding unit) and assigning the at least one sample value to a position in the decoded image given by the first spatial position.

[0048] According to an eighth aspect, there is provided a decoder for decoding an image from a bitstream, the image being partitioned into a plurality of segment groups. The decoder comprises a decoding unit and a determining unit. The decoding unit is configured to decode a first portion of the bitstream to form a size map that maps a segment group index value to a number of segments to be decoded for a first segment group; and is further configured to decode a second portion of the bitstream. The second portion of the bitstream comprises codewords representing a plurality of segment groups. Decoding the second portion of the bitstream comprises decoding a first segment group. Decoding the first segment group comprises: 1) decoding a first segment group index value for the first segment group (by the decoding unit); 2) determining (by the determining unit) a first size for the first segment group based on the first segment group index value and the size map; and 3) decoding a plurality of segments (by the decoding unit) to form a decoded image, the number of segments being equal to the first size.

[0049] According to a ninth aspect, there is provided an encoder for encoding an image from a bitstream, the image being partitioned into a plurality of segment groups. The encoder comprises an encoding unit and a determining unit. The determining unit is configured to determine, for a plurality of segment groups, an address mapping that maps segment group index values ​​to segment group addresses. The encoding unit is configured to encode a first portion of the bitstream; and is further configured to encode a second portion of the bitstream. Encoding the first portion of the bitstream comprises generating codewords forming an address mapping, the address mapping mapping segment group index values ​​to segment group addresses. Encoding the second portion of the bitstream comprises generating codewords representing a plurality of segment groups. Encoding the second portion of the bitstream comprises encoding a first segment group. Encoding the first segment group comprises: 1) determining a first segment group index value from a first segment group address of the first segment group (by the determining unit), wherein the address mapping maps the first segment group index value to the first segment group address; 2) encoding the first segment group index value of the first segment group (by the encoding unit); and 3) encoding sample values ​​of the first segment group (by the encoding unit).

[0050] According to a tenth aspect, there is provided an encoder for encoding an image into a bitstream, the image being partitioned into a plurality of segment groups. The encoder comprises an encoding unit and a determining unit. The determining unit is configured to determine a size map that maps a segment group index value to the number of segments to be encoded for a first segment group. The encoding unit is configured to encode a first portion of the bitstream; and is further configured to encode a second portion of the bitstream. Encoding the first portion of the bitstream comprises generating codewords forming a size map, the size map mapping the segment group index value to the number of segments to be encoded for the first segment group. Encoding the second portion of the bitstream comprises generating codewords representing a plurality of segment groups. Encoding the second portion of the bitstream comprises encoding a first segment group. Encoding the first segment group comprises: 1) determining a first segment group index value for the first segment group, wherein the size map maps the first segment group index value for the first segment group to a first size, the first size being the number of segments to be encoded for the first segment group; 2) encoding the first segment group index value for the first segment group; and 3) encoding a plurality of segments for the first segment group, the number of segments being equal to the first size.

[0051] According to an eleventh aspect, there is provided a computer program comprising instructions which, when executed by a processing circuit of a node, cause the node to perform the method of any one of the first, second, third and fourth aspects.

[0052] According to a twelfth aspect, there is provided a carrier comprising the computer program of any one of the embodiments of the eleventh aspect, wherein the carrier is one of an electronic signal, an optical signal, a radio signal and a computer-readable storage medium. BRIEF DESCRIPTION OF THE DRAWINGS

[0053] The accompanying drawings, which are incorporated herein and form a part of the specification, illustrate various embodiments.

[0054] Figure 1 A quadtree plus binary tree plus ternary tree block structure according to the related art is illustrated.

[0055] Figure 2 An example of tile partitioning using 4 tile rows and 5 tile columns labeled in raster scan order according to the related art is illustrated.

[0056] Figure 3 An example of splicing a high-quality stream and a low-quality stream into a single output stream is illustrated.

[0057] Figure 4 An example of partitioning an image according to an embodiment is illustrated.

[0058] Figure 5 An example of partitioning an image according to an embodiment is illustrated.

[0059] Figure 6 An example of decoding an encoded bit stream according to an embodiment is illustrated.

[0060] Figure 7 An example of splicing two input streams into a single output stream according to an embodiment is illustrated.

[0061] Figure 8 An example of an address mapping that maps segment group indexes to segment group addresses according to an embodiment is illustrated.

[0062] Fig. 9 is a flow chart illustrating a process according to an embodiment.

[0063] Fig.10 is a flow chart illustrating a process according to an embodiment.

[0064] Fig.11 is a flow chart illustrating a process according to an embodiment.

[0065] Fig.12 is a flow chart illustrating a process according to an embodiment.

[0066] Fig.13 is a diagram showing functional units of an encoder and a decoder according to an embodiment.

[0067] Fig.14 is a block diagram of an encoder and / or decoder according to an embodiment. DETAILED DESCRIPTION

[0068] Figure 6 A bitstream 602 and a corresponding decoded picture 402 resulting from decoding the bitstream 602 are shown. The bitstream 602 in this example includes a parameter set 604 and eight coded segment groups 606, each of which corresponds to a segment group 414 in the decoded picture 402. That is, when decoded, the coded segment groups 606 result in segment groups 414 in the decoded picture 402. A typical bitstream contains more than one picture, but for purposes of illustration, the figure shows only one picture.

[0069] The parameter set 604 includes a syntax element 616 that is decoded by the decoder as a list of segment group address values. The list may be implemented as an array of segment group address values. In this description, the terms array and list may be used interchangeably. The parameter set 604 also includes a syntax element 616 that is decoded by the decoder as a partition structure (e.g., Figure 4 402 is partitioned into segments (e.g., as shown in FIG. Figure 4 In some embodiments, the information (614 and 616) may be the same set of parameters (e.g. Figure 6 ), may be part of a different parameter set, or may be encoded in some other manner. For example, one of syntax elements 614 and 616 may be part of a sequence parameter set, while the other may be part of a picture parameter set. Syntax elements 614 and 616 may also be placed anywhere in the bitstream, even transported out-of-band. In an embodiment, it is important that neither of syntax elements 614 and 616 is placed in a coding segment group 606, for example so that the information may be modified without having to modify individual coding segment groups 606.

[0070] Each encoded segment group 606 includes a segment group header 608 and segment group data 608. The segment group data 608 includes coded bits that are decoded into sample values ​​of segments belonging to the segment group. In the embodiment described herein, the segment group header 608 includes one or more codewords 612, which are decoded by the decoder into an index value i. The index value i is used as an index into a list of segment group address values ​​to derive the segment group address for the segment group. The decoder uses the segment group address to determine the spatial position in the image for the first segment in the segment group.

[0071] By using a list of segment group address values ​​in the parameter set and an index into that list in the segment group header, the splicing of segment groups can be done without modifying the segment group header. This is because the segment group address values ​​become decoupled from the encoded segment group data through a layer of indirection. Figure 3 , Table 5 below shows how the mapping between indexes and segment group address values ​​may look like. The middle column in Table 5 shows an example mapping between indexes and segment group addresses when encoding the video as high quality and low quality. During the original encoding, the mapping is written to the parameter set 604 using the syntax element 616 that conveys the list of segment group address values. The rightmost column in Table 5 shows how the mapping between indexes and segment group address values ​​may look in the output bitstream after splicing. During encoding, the indexes written to the segment groups can remain as is, and splicing can be accomplished by writing a new parameter set 604 using the syntax element 616 that conveys the list of segment group address values, which includes the mapping shown in the rightmost column. The splicing of the coded segment groups 606 can then be accomplished by copying or forwarding the unmodified tile_group_layer_rbsp() chunk.

[0072] Table 5 – Example mapping between indices and segment group addresses As described herein, it is the segment groups that have addresses.In some embodiments, alternatively or additionally, addresses may be signaled per segment rather than just per segment group.

[0073] According to some embodiments, it is possible to concatenate segments from two or more pictures into one picture without rewriting the Video Coding Layer (VCL) NAL unit data. Figure 7 , where each segment group of the original images 702 and 704 has a unique index mapping to the segment group address value in the parameter set. When the segment groups are concatenated into a new image 706, the indexes in the segment groups are preserved but mapped to new segment group addresses in the parameter set.

[0074] Several examples are now described.

[0075] The first example is as follows. The first example involves using a single list for segment group addresses stored in a parameter set. In this embodiment, the segment group address values ​​are stored in the parameter set as a single list, which we call LIST here. In this case, the syntax element 616 is an encoded representation of the LIST and can be composed of code words that are decoded into a number N that specifies how many entries there are in the LIST (i.e., the length of the LIST). The syntax element 616 is additionally composed of one or more code words per entry, which are decoded into N digits that specify the segment group address value. For example, the LIST can be encoded in a bit stream as a sequential array of segment group address values.

[0076] The following pseudocode shows how a LIST can be decoded and constructed from a bitstream: n=decode_n_value_from_bitstream(); for(i=0;i <n;i++){ LIST[i]=decode_value_from_bitstream(); } The functions decode_n_value_from_bitstream() and decode_value_from_bitstream() read the next codeword or codewords from the bitstream and return a value. The codeword can be a fixed-length codeword, a variable-length codeword, an entropy-coded codeword, or any other type of codeword. A codeword can also be called a syntax element.

[0077] Then, after decoding the LIST of segment group address values ​​from the parameter set, the segment groups can be decoded. In each segment group header, there are one or more codewords 612 that are decoded by the decoder into an index value i. The index value i is used as an index into the LIST to derive the segment group address value for the segment group, such as the address becomes equal to LIST[i].

[0078] To implement the above example, where segment group address values ​​are stored in a list and the segment group header contains an index into the list, the encoder can encode the segment group address value as part of the encoded picture parameter set. For example, the list can be encoded by first encoding the size of the list and then sequentially encoding each of the address values ​​of the list. In addition, when encoding the segment group data, the encoder can encode the index into the list of address values ​​into the segment group header, where the address value represented by the index corresponds to the spatial position of the segment group within the picture. Encoding the list size and / or encoding the address value can include encoding one or more codewords into the bitstream; for example, the encoder can use fixed width encoding, variable width encoding, entropy-based encoding, etc. Similarly, decoding the list size and / or decoding the address value can include decoding one or more codewords from the bitstream.

[0079] When decoding a bitstream that has been encoded in the manner just described, the decoder can decode a list of segment group address values. For example, the decoder can decode the size of the list from the bitstream, and then decode each of the address values ​​representing the list. As part of decoding the list, the decoder can store the address values ​​in a list or (for example) array data structure, such as represented by LIST[e]=value, where e varies from 0 to less than 1 than the size of the list being decoded, and value is the corresponding address value being decoded. The address values ​​can be stored in the list so that the e-th decoded address value is stored as the e-th entry in the list (although other representations are possible based on how the list has been encoded). The decoder can then decode the segment group data for each segment group in the segment group in the picture. When decoding the current segment group, the decoder can decode the segment group header corresponding to the current segment group. Decoding the segment group header can include decoding an index value i from the bitstream (for example, from one or more codewords), where the index value i represents an index into the list of segment group address values. Once the index value i is decoded, the decoder can derive the address value of the current segment group by setting the address value of the segment group to the address value of the i-th entry in the list. For example, the decoder may perform a lookup operation to determine the value. The decoder may also use the address value to determine a spatial position in the image being decoded for the current segment group. This may include determining a spatial position in the image being decoded for the first segment in the current segment group. The decoder may then use the determined spatial position when decoding the segment data for the current segment group into decoded sample values. For example, the spatial position may be used by the decoder to store the decoded sample values ​​in the correct position in the decoded image.

[0080] Tables 6 and 7 below show example syntax for the above examples, followed by example semantics. The syntax and semantics are intended to be viewed as modifications to the current VVC draft specification. The current VVC draft specification is provided in the JVET-L 0686-v2-SpectExt.docx JVET input contribution. However, use of the VVC standard is not necessary to apply the above examples, and reference to it is for illustrative purposes.

[0081] Table 6 - Parameter set syntax and semantics for the first example num_tile_group_addresses_minus1 plus 1 specifies the number of tile group addresses associated with the PPS. The value of num_tile_group_addresses_minus1 should be in the range of 0 to maxNbrOfTileGroupAddresses (0 and maxNbrOfTileGroupAddresses inclusive). [Editor's note: For example, maxNbrOfTileGroupAddresses can be set to 2046 as an example number.] pps_tile_group_address[i] is used to specify the i-th tile group address associated with the PPS.

[0082] The length of pps_tile_group_address[i] is Ceil(Log2(NumTilesInPic)) bits, where Ceil is the ceiling operator. [Editor's note: NumTilesInPic is a variable representing the number of tiles in the picture. This number is derived from other codewords in the parameter set.] The value of pps_tile_group_address[i] shall be in the range of 0 to NumTilesInPic-1 (inclusive).

[0083] A bitstream conformance requirement is that for any value of j not equal to i, the value of pps_tile_group_address[i] shall be unequal to the value of pps_tile_group_address[j].

[0084] Table 7 - Slice Group Header Syntax and Semantics for the First Example tile_group_address_idc is used to specify the tile address of the first tile in a tile group.

[0085] The value of tile_group_address_idc shall be in the range of 0 to num_tile_group_addresses_minus1 (inclusive).

[0086] The variable TileGroupAddress is set equal to pps_tile_group_address[tile_group_address_idc].

[0087] The value of TileGroupAddress should be in the range of 0 to NumTilesInPic - 1 (0 and NumTilesInPic - 1 are inclusive).

[0088] The value of TileGroupAddress shall not be equal to the value of TileGroupAddress of any other coded slice group NAL unit of the same coded picture.

[0089] num_tiles_in_tile_group_minus1 plus 1 specifies the number of tiles in a tile group. The value of num_tiles_in_tile_group_minus1 should be in the range of 0 to NumTilesInPic-1 (0 and NumTilesInPic-1 are inclusive). [Editor's note: This description exists in the current VVC draft specification.] In an alternative version of the first example, the limit on the maximum value of pps_tile_group_address[i] is defined in a different way; for example, using a fixed maximum value, such as a multiple of NumTilesInPic, or signaled in the bitstream. In an alternative version, the pps_tile_group_address[i] codeword is signaled by a variable length codeword instead of a fixed length codeword. The variable length codeword may be a universal variable length code (UVLC) codeword.

[0090] Similarly, in alternative versions of the first example, the limit on the maximum value of num_tile_group_addresses_minus_1 is defined in a different way; for example, using a fixed maximum value, such as a multiple of NumTilesInPic, or signaled in the bitstream.

[0091] The second example is as follows. The second example involves using a dictionary for segment group addresses stored in a parameter set. In this embodiment, the segment group address values ​​are stored in the parameter set as a dictionary. The dictionary can be implemented by a suitable data structure (e.g., a hash map or an associative array).

[0092] In one version of this example, the dictionary can be encoded as a single list, where each entry in the single list consists of a pair of values, where the first element in the pair is the dictionary key value, and the second element in the pair is the dictionary value (also known as a key-value pair). In another version, two lists are used, the first list is a key list, and the second list is a value list. These two lists can be called parallel collections of lists because they are parallel in the sense that the i-th entry in one list is associated with the i-th entry in another list. The two lists can be implemented as two arrays or parallel collections of arrays. Other encodings and representations of dictionaries are possible. For illustrative purposes, a variation using two lists is described here. One advantage of this example over the example using a single list is that when multiple streams are spliced ​​together, this example can avoid having (potentially many) empty slots, i.e., list values ​​that are not used in the final output stream.

[0093] In this example, syntax element 616 is a coded representation of two lists (referred to here as KEY and VALUE). In some embodiments, the lists are of the same size, and therefore a single codeword representing the size is sufficient. Therefore, syntax element 616 can consist of the list size followed by the value of the KEY and VALUE lists. Each value can be encoded as one or more codewords using fixed length, variable length, entropy coding or other coding techniques. In an embodiment, the decoded codewords of the VALUE or KEY lists are placed in those lists in the order in which they are decoded, such as so that the second decoded value of the KEY is placed in the KEY as the second element. In some embodiments, the values ​​of the KEY lists are sequentially encoded before the sequentially encoded values ​​of the VALUE lists; in other embodiments, the order is reversed, and in other embodiments, the corresponding elements of the KEY and VALUE lists are encoded together.

[0094] An example of decoding a dictionary is provided below. Encoding the dictionary into a bitstream is similar, and is essentially the inverse operation of decoding. As with the first example above, encoding and decoding of segment group address value information may occur separately from (e.g., prior to) encoding and decoding of segment group data representing sample values ​​for segments comprising the segment group.

[0095] To implement this example, first the decoder can decode the address value information. Two variations are presented below.

[0096] For a variation where all values ​​placed in KEY are decoded before any values ​​placed in VALUE, the following pseudocode describes how the decoder may operate: n=decode_n_value_from_bitstream(); for(i=0;i <n;i++) KEY[i]=decode_key_value_from_bitstream(); for(i=0;i <n;i++) VALUE[i]=decode_value_from_bitstream(); In another variation, the values ​​placed into KEY and VALUE are alternating, as shown in the following pseudo code: n=decode_n_value_from_bitstream(); for(i=0;i <n;i++){ KEY[i]=decode_key_value_from_bitstream(); VALUE[i]=decode_value_from_bitstream(); } The functions decode_n_value_from_bitstream(), decode_key_value_from_bitstream(), and decode_value_from_bitstream() each read the next codeword or codewords from the bitstream and return a value. The codeword may be a fixed-length codeword, a variable-length codeword, an entropy-coded codeword, or any other type of codeword.

[0097] Once the address value information has been decoded, the decoder can then decode the segment group data for each of the segment groups in the image. When decoding a current segment group, the decoder can decode a segment group header corresponding to the current segment group. Decoding the segment group header can include decoding an index value i from a bitstream (e.g., from one or more codewords), where the index value i represents an index into a KEY list, which contains additional indexes into a VALUE list. Once the index value i is decoded, the decoder can derive the address value of the current segment group by determining the position pos in the list KEY where the list value KEY[pos] matches the index value i, and then determining that the segment group address value is VALUE[pos].

[0098] The operation of retrieving the value associated with the key value by providing the key value is referred to as a search operation using the key value. In this embodiment, the search operation (e.g., by using KEY[k] as the key value) can be implemented using any appropriate method (e.g., by adopting a hash function or other means).

[0099] Figure 8 , which illustrates the derivation of the segment group address from index i in this example. Figure 8 A parameter set is shown that includes a dictionary with KEY and VALUE lists. Figure 8 Also shown are two segment group headers, one with index i=4 and the other with index i=1. As shown, index i=4 is decoded from the first segment group header. The value 4 is found in the dictionary in the parameter set, with KEY[1] corresponding to VALUE[1]=3, which is used to determine the segment group address of the first segment group (which is 3 here). In the second segment group, index i=1 is decoded, where 1 is found in the dictionary for KEY[0]. The corresponding VALUE[0]=5 is therefore used to determine the segment group address of the second segment group (which is 5 here). This is shown in FIG. Figure 8 This is illustrated by an arrow from the segment group header to the corresponding KEY entry and then by an arrow from the corresponding KEY entry to the corresponding segment group address in the decoded image.

[0100] Alternatively, while the KEY and VALUE lists are being decoded, a hash map MAP may be populated such that for each key k in KEY having position pos in list KEY, MAP{k}=v, where v=VALUE[pos]. Using this hash map, determining the segment group address according to index i can be done by performing a hash map lookup operation such as MAP{i}. The advantage of this data structure is that it can avoid a linear search of the KEY list when determining the segment group address during decoding of the segment group data.

[0101] As in this first example, when decoding segment data into decoded samples, the decoder can use the segment group address to determine the spatial location.

[0102] Tables 8 and 9 show example syntax for this example, followed by example semantics. The syntax and semantics are intended to be viewed as modifications to the current VVC draft specification. The current VVC draft specification is provided in the JVET-L0686-v2-SpectExt.docx JVET input contribution. However, use of the VVC standard is not necessary to apply the above examples, and reference to it is for illustrative purposes.

[0103] Table 8 - Parameter set syntax and semantics for the second example num_tile_group_addresses_minus1 specifies the number of tile addresses associated with the PPS plus 1. The value of num_tile_group_addresses_minus1 shall be in the range of 0 to NumTilesInPic-1, inclusive.

[0104] pps_tile_group_idc[i] is used to specify the i-th tile group idc associated with the PPS.

[0105] pps_tile_group_idc should be less than or equal to 8*NumTilesInPic.

[0106] A bitstream conformance requirement is that for any value of j not equal to i, the value of pps_tile_group_idc[i] shall be unequal to the value of pps_tile_group_idc[j].

[0107] pps_tile_group_address[i] is used to specify the i-th tile group address associated with the PPS.

[0108] The length of pps_tile_group_address[i] is Ceil(Log2(NumTilesInPic)) bits.

[0109] The value of pps_tile_group_address[i] shall be in the range of 0 to NumTilesInPic-1 (inclusive).

[0110] A bitstream conformance requirement is that for any value of j not equal to i, the value of pps_tile_group_address[i] shall be unequal to the value of pps_tile_group_address[j].

[0111] Table 9 - Slice Group Header Syntax and Semantics for the Second Example tile_group_address_idc is used to specify the tile address of the first tile in a tile group.

[0112] The variable TileGroupAddress is set equal to pps_tile_group_address[i], where i is the value for which pps_tile_group_idc[i] is equal to tile_group_address_idc.

[0113] A requirement for bitstream conformance is that there is a value i in the range 0 to num_tile_group_addresses_minus1, inclusive, for which pps_tile_group_address[i] is equal to tile_group_address_idc.

[0114] A bitstream conformance requirement is that the value of TileGroupAddress shall not be equal to the value of TileGroupAddress of any other coded slice group NAL unit of the same coded picture.

[0115] num_tiles_in_tile_group_minus1 plus 1 specifies the number of tiles in a tile group. The value of num_tiles_in_tile_group_minus1 should be in the range of 0 to NumTilesInPic-1 (0 and NumTilesInPic-1 are inclusive). [Editor's note: This description exists in the current VVC draft specification.] In an alternative version of this example, the limit on the maximum value of pps_tile_group_adress[i] is defined in a different way; for example, using a fixed maximum value, such as a multiple of NumTilesInPic, or signaled in the bitstream. In an alternative version, the pps_tile_group_address[i] codeword is signaled by a variable length codeword instead of a fixed length codeword. The variable length codeword may be a UVLC codeword.

[0116] Similarly, in alternative versions of this example, the limit on the maximum value of num_tile_group_addresses_minus_1 is defined in a different way; for example, using a fixed maximum value, such as a multiple of NumTilesInPic, or signaled in the bitstream.

[0117] A third example is as follows: The third example is similar to the second example and involves using a dictionary for segment group addresses stored in a parameter set, where the dictionary is encoded and decoded using delta signaling.

[0118] In this example, dictionary keys are encoded and decoded as incremental values ​​into or from a bitstream. For example, the decoding of lists KEY and VALUE can be described by the following pseudo code: n=decode_n_value_from_bitstream(); for(i=0;i <n;i++){ delta_key=decode_key_value_from_bitstream(); if(i == 0) KEY[i] = delta_key; else KEY[i]=KEY[i-1]+delta_key+1; VALUE[i]=decode_value_from_bitstream(); } As in the second example above, the values ​​may be decoded in any order and may not be limited to the order described in the pseudo code above. In an embodiment, the number of values ​​to be decoded is 2*n (one value of KEY and a corresponding value of VALUE), and the order in which the values ​​are decoded is static, so that the encoder can correctly deliver the two lists KEY and VALUE without ambiguity.

[0119] One advantage of this example over the second example above is that it saves bits, since signaling an incremental value is generally less expensive in terms of bits than an absolute value. Another advantage is when the incremental value is constrained to be greater than or equal to 1; in this case, each dictionary key value will be uniquely specified by definition.

[0120] Tables 10 and 11 show example syntax for this embodiment, followed by example semantics.As previously mentioned, use of the VVC standard is not necessary to apply the above examples, and reference to it is for illustrative purposes.

[0121] Table 10 - Parameter set syntax and semantics for the third example num_tile_group_addresses_minus1 specifies the number of tile addresses associated with the PPS plus 1. The value of num_tile_group_addresses_minus1 shall be in the range of 0 to NumTilesInPic-1, inclusive.

[0122] pps_tile_group_idc_delta_minus1[i] plus 1 is used to specify the i-th tile group idc associated with the PPS.

[0123] The variable TileGroupAddressIdcPPS[i] is derived as follows: 1. TileGroupAddressIdcPPS[0] is set equal to pps_tile_group_idc_delta_minus1[0].

[0124] 2. For values ​​of i greater than 0, TileGroupAddressIdcPPS[i] is set equal to TileGroupAddressIdcPPS[i–1]+pps_tile_group_idc_delta_minus1[i]+1.

[0125] TileGroupAddressIdcPPS[num_tile_group_addresses_minus1] should be less than or equal to 8*NumTilesInPic.

[0126] pps_tile_group_address[i] is used to specify the i-th tile group address associated with the PPS.

[0127] The length of pps_tile_group_address[i] is Ceil(Log2(NumTilesInPic)) bits.

[0128] The value of pps_tile_group_address[i] shall be in the range of 0 to NumTilesInPic-1 (inclusive).

[0129] A bitstream conformance requirement is that for any value of j not equal to i, the value of pps_tile_group_address[i] shall be unequal to the value of pps_tile_group_address[j].

[0130] Table 11 - Slice Group Header Syntax and Semantics for the Third Example tile_group_address_idc is used to specify the tile address of the first tile in a tile group.

[0131] TileGroupAddress is set equal to pps_tile_address[i], where i is the value for which TileGroupAddressIdcPPS[i] is equal to tile_group_address_idc.

[0132] Alternatively, the variable TileGroupAddress is derived as follows: 1. If tile_group_address_idc is not present in the slice group header, the value of TileGroupAddress is set equal to 0.

[0133] 2. Otherwise, TileGroupAddress is set equal to pps_tile_address[i], where i is the value for which TileGroupAddressIdcPPS[i] is equal to tile_group_address_idc.

[0134] A requirement for bitstream conformance is that there is a value i in the range 0 to num_tile_group_addresses_minus1 (inclusive) for which TileGroupAddressIdcPPS[i] is equal to tile_group_address_idc.

[0135] A bitstream conformance requirement is that the value of TileGroupAddress shall not be equal to the value of TileGroupAddress of any other coded slice group NAL unit of the same coded picture.

[0136] num_tiles_in_tile_group_minus1 plus 1 specifies the number of tiles in a tile group. The value of num_tiles_in_tile_group_minus1 should be in the range of 0 to NumTilesInPic-1 (0 and NumTilesInPic-1 are inclusive). [Editor's note: This description exists in the current VVC draft specification.] In an alternative version of this example, the first slice group index is not set using the pps_tile_group_idc_delta_minus1[0] syntax element, but is explicitly specified in its own syntax element. Table 12 shows an example parameter set syntax followed by semantics for an alternative version.

[0137] Table 12 Parameter set syntax of the alternative version of the third example pps_first_tile_group_idc and pps_tile_group_idc_delta_minus1[i] plus 1 are used to specify the i-th tile group idc associated with the PPS.

[0138] The variable TileGroupAddressIdcPPS[i] is derived as follows: 1. TileGroupAddressIdcPPS[0] is set equal to pps_first_tile_group_idc.

[0139] 2. For values ​​of i greater than 0, TileGroupAddressIdcPPS[i] is set equal to TileGroupAddressIdcPPS[i-1]+pps_tile_group_idc_delta_minus1[i]+1.

[0140] TileGroupAddressIdcPPS[num_tile_group_addresses_minus1] should be less than or equal to 2046.

[0141] In other alternative versions of the current example, the limit on the maximum value of pps_tile_group_adress[i] is defined in different ways; for example, using a fixed maximum value, such as a multiple of NumTilesInPic, or signaled in the bitstream.

[0142] Similarly, in other alternative versions of the current embodiment, the limit on the maximum value of num_tile_group_addresses_minus_1 is defined in different ways; for example, using a fixed maximum value, such as a multiple of NumTilesInPic, or signaled in the bitstream.

[0143] In an alternative version, the pps_tile_group_address[i] codeword is signaled by a variable length codeword instead of a fixed length codeword. The variable length codeword may be a UVLC codeword.

[0144] A fourth example is as follows. The fourth example involves using a list or dictionary or other indirection layer to store values ​​other than segment group address values. For example, the previous example enables relocation of slice groups in a bitstream. To facilitate extraction, splicing, or relocation of slices in a bitstream without modifying the slice group layer portion of the bitstream, we now introduce a mapping between slice groups and the number of slices in a slice group (e.g., in a PPS).

[0145] For example, by using a list, a dictionary, or a dictionary with incremental signaling to encode and decode the mapping, the mapping can be accomplished similarly to Examples 1-3 above. For example, according to Example 1 above, the address value can be replaced by a value representing the number of slices in the slice group. For illustrative purposes, further details are provided below using a dictionary similar to Example 2.

[0146] In the current VVC draft specification, the num_tiles_in_tile_group_minus1 codeword is used to signal the number of tiles in a tile group. This example does not require the use of this particular codeword; any single or multiple codewords that cover the number of tiles present in a tile group will also work. One example of an alternative signaling using num_tiles_in_tile_group_minus1 is to use two codewords that signal the height and width of the tile group in units of tiles. The number of tiles in a tile group is then the product of the two values ​​derived from these two codewords.

[0147] Assuming num_tiles_in_tile_group_minus1 is used, the PPS dictionary can be decoded using the following pseudo code: n=decode_n_value_from_bitstream(); for(i=0;i <n;i++){ KEY[i]=decode_key_value_from_bitstream(); ADDRESS[i]=decode_address_value_from_bitstream(); SIZE[i]=decode_size_value_from_bitstream(); } The functions decode_n_value_from_bitstream(), decode_key_value_from_bitstream(), decode_address_value_from_bitstream(), and decode_size_value_from_bitstream() each read the next codeword or codewords from the bitstream and return a value. The codeword may be a fixed length codeword, a variable length codeword, an entropy coded codeword, or any other type of codeword.

[0148] Then, in each segment group header, there are one or more codewords that are decoded by the decoder into index value i 612. Then, the position k in the list KEY is determined, for which the list value KEY[k] is the same as the index value i. The address value is then set equal to ADDRESS[k], and the size value is set equal to SIZE[k].

[0149] Tables 13 and 14 show example syntax for this embodiment, followed by example semantics. The syntax and semantics are intended to be viewed as modifications to the current VVC draft specification. The current VVC draft specification is provided in the JVET-L0686-v2-SpectExt.docx JVET input contribution. However, use of the VVC standard is not necessary to apply the above examples, and reference to it is for illustrative purposes.

[0150] Table 13 - Parameter set syntax and semantics for the fourth example num_tile_group_addresses_minus1 specifies the number of tile addresses associated with the PPS plus 1. The value of num_tile_group_addresses_minus1 shall be in the range of 0 to NumTilesInPic-1, inclusive.

[0151] pps_tile_group_idc[i] is used to specify the i-th tile group idc associated with the PPS.

[0152] pps_tile_group_idc should be less than or equal to 8*NumTilesInPic.

[0153] A bitstream conformance requirement is that for any value of j not equal to i, the value of pps_tile_group_idc[i] shall be unequal to the value of pps_tile_group_idc[j].

[0154] pps_tile_group_address[i] is used to specify the i-th tile group address associated with the PPS.

[0155] The length of pps_tile_group_address[i] is Ceil(Log2(NumTilesInPic)) bits.

[0156] The value of pps_tile_group_address[i] shall be in the range of 0 to NumTilesInPic-1 (inclusive).

[0157] A bitstream conformance requirement is that for any value of j not equal to i, the value of pps_tile_group_address[i] shall be unequal to the value of pps_tile_group_address[j].

[0158] pps_tiles_in_tile_group_minus1[i] plus 1 specifies the number of i-th tiles associated with the PPS. The value of num_tiles_in_tile_group_minus1[i] shall be in the range of 0 to NumTilesInPic-1, inclusive.

[0159] Table 14 - Slice Group Header Syntax and Semantics for the Fourth Example tile_group_address_idc is used to specify the tile address of the first tile in the tile group and the number of tiles in the tile group.

[0160] The variable TileGroupAddress is set equal to pps_tile_group_address[i], where i is the value for which pps_tile_group_idc[i] is equal to tile_group_address_idc.

[0161] A bitstream conformance requirement is that there is a value i in the range 0 to num_tile_group_addresses_minus1, inclusive, for which pps_tile_group_address[i] is equal to tile_group_address_idc.

[0162] A bitstream conformance requirement is that the value of TileGroupAddress shall not be equal to the value of TileGroupAddress of any other coded slice group NAL unit of the same coded picture.

[0163] The variable NumTilesInTileGroup is set equal to the value of PPS_tiles_in_tile_group_minus1[i]+1, where i is the value for which pps_tile_group_idc[i] is equal to tile_group_address_idc.

[0164] Other potential values ​​to be signaled in the dictionary include the byte or bit count of each slice group, the byte or bit count of each slice in a slice group, the height and width of each slice in a slice group, etc.

[0165] Fig. 9is a flow chart illustrating a process according to an embodiment. Process 900 is a method for decoding an image from a bitstream, the image being partitioned into a plurality of segment groups. The method includes: decoding a first portion of the bitstream to form an address map that maps segment group index values ​​to segment group addresses (step 902); and decoding a second portion of the bitstream (step 904). The second portion of the bitstream includes codewords representing a plurality of segment groups. Decoding the second portion of the bitstream includes decoding a first segment group (step 906). Decoding the first segment group includes: 1) decoding a first segment group index value for the first segment group (step 908); 2) determining a first segment group address for the first segment group based on the first segment group index value and the address map (step 910); 3) determining a first spatial position of the first segment group based on the first segment group address, the first spatial position representing a position of the first segment group within the image (step 912); and 4) decoding at least one sample value of the first segment group and assigning the at least one sample value to a position in the decoded image given by the first spatial position (step 914).

[0166] In some embodiments, the address map comprises one or more of an array and / or a list, a parallel set of arrays and / or lists, a hash map, and an associative array. In an embodiment, decoding a first portion of a bitstream to form an address map comprises: decoding a first value indicating a number of list values ​​from the bitstream; and forming a list by decoding a plurality of list values ​​from the bitstream, the number of list values ​​being equal to the first value. In an embodiment, determining the first segment group address of the first segment group based on the first segment group index value and the address map comprises performing a lookup operation using the first segment group index value.

[0167] In some embodiments, decoding a first portion of a bitstream to form an address map comprises: decoding a first value from the bitstream indicating a number of list values; and forming a first list (KEY) and a second list (VALUE) by decoding a plurality of values ​​representing key-value pairs k and v from the bitstream, the number of key-value pairs being equal to the first value. The first list comprises a key k and the second list comprises a value v of the key-value pair, and the first list and the second list are ordered such that for a given key-value pair, an index of a given key k in the first list corresponds to an index of a given value v in the second list. In an embodiment, decoding a first portion of a bitstream to form an address map comprises: decoding a first value from the bitstream indicating a number of hash values; and forming a hash map by decoding a plurality of values ​​representing key-value pairs k and v from the bitstream, the number of key-value pairs being equal to the first value, wherein for a given key-value pair, an index of the given key k is mapped by the hash map to a given value v.

[0168] In some embodiments, determining a first segment group address for the first segment group based on the first segment group index value and the address mapping includes: determining an index (i) such that a value (KEY[i]) corresponding to the index in the first list matches the first segment group index value; and determining the first segment group address to be a value (VALUE[i]) corresponding to the index in the second list. In some embodiments, determining the first segment group address for the first segment group based on the first segment group index value and the address mapping includes performing a hash lookup operation using the first segment group index value. In some embodiments, the decoded value representing the key-value pair k and v includes an incremental value representing the key k such that for the first key-value pair, the key k is determined by the incremental value, and for other key-value pairs, the key k is determined by adding the incremental value to a previously determined key value to generate a current key k.

[0169] In some embodiments, a segment group corresponds to a slice group, a sub-image, and / or a slice. In some embodiments, a segment group includes one or more segments, and in some embodiments, a segment group includes only one segment.

[0170] In an embodiment, a segment group corresponds to a slice group. In some embodiments, a first portion of the bitstream is included in a parameter set, and the method further comprises decoding additional segment groups, wherein the address map is used to decode the additional segment groups. In an embodiment, the first portion of the bitstream is included in a parameter set, and the method further comprises decoding additional images, wherein the address map is used to decode the additional images. That is, an image may be encoded into multiple segment groups, and each segment group of an image may be decoded by using the same address map transmitted in the parameter set. Further, multiple images may be encoded as part of a stream, and each such image may also be decoded by using the same address map transmitted in the parameter set.

[0171] Fig.10 is a flow chart illustrating a process according to an embodiment. Process 1000 is a method for decoding an image from a bitstream, the image being partitioned into a plurality of segment groups. The method includes: decoding a first portion of the bitstream to form a size map that maps segment group index values ​​to a number of segments to be decoded for a first segment group (step 1002); and decoding a second portion of the bitstream (step 1004). The second portion of the bitstream includes codewords representing the plurality of segment groups. Decoding the second portion of the bitstream includes decoding a first segment group (step 1006). Decoding the first segment group includes: 1) decoding a first segment group index value for the first segment group (step 1008); 2) determining a first size for the first segment group based on the first segment group index value and the size map (step 1010); and 3) decoding a plurality of segments to form a decoded image, the number of segments being equal to the first size (step 1012).

[0172] In some embodiments, the size map comprises one or more of an array and / or a list, a parallel set of arrays and / or lists, a hash map, and an associative array. In an embodiment, decoding a first portion of a bitstream to form a size map comprises: decoding a first value indicating a number of list values ​​from the bitstream; and forming a list by decoding a plurality of list values ​​from the bitstream, the number of list values ​​being equal to the first value. In an embodiment, determining the first size of the first segment group based on the first segment group index value and the size map comprises performing a lookup operation using the first segment group index value.

[0173] In some embodiments, a segment group corresponds to a slice group, a sub-image, and / or a slice. In some embodiments, a segment group includes one or more segments, and in some embodiments, a segment group includes only one segment.

[0174] Fig.11 is a flow chart illustrating a process according to an embodiment. Process 1100 is a method for encoding an image into a bitstream, the image being partitioned into a plurality of segment groups. The method includes: determining an address mapping that maps segment group index values ​​to segment group addresses for a plurality of segment groups (step 1102); encoding a first portion of the bitstream (step 1104); and encoding a second portion of the bitstream (step 1106). Encoding the first portion of the bitstream includes generating codewords that form the address mapping, the address mapping mapping segment group index values ​​to segment group addresses. Encoding the second portion of the bitstream includes generating codewords that represent the plurality of segment groups. Encoding the second portion of the bitstream includes encoding a first segment group (step 1108). Encoding the first segment group includes: 1) determining a first segment group index value from a first segment group address of the first segment group, wherein the address mapping maps the first segment group index value to the first segment group address (step 1110); 2) encoding a first segment group index value of the first segment group (step 1112); and 3) encoding sample values ​​of the first segment group (step 1114).

[0175] An address map can map an index value to an address value by, for example, taking the index value as input and returning the address value as output. For example, an array or list can map an index value i to a given address value by returning the i-th element of the array or list; similarly, a hash map can map an index value i to a given address by returning the value associated with key i. Other ways of mapping indices to values ​​are possible and are covered by the embodiments provided herein.

[0176] Fig.12is a flow chart illustrating a process according to an embodiment. Process 1200 is a method for encoding an image into a bitstream, the image being partitioned into a plurality of segment groups. The method includes: determining a size map that maps segment group index values ​​to the number of segments to be encoded for a first segment group (step 1202); encoding a first portion of the bitstream (step 1204); and encoding a second portion of the bitstream (step 1206). Encoding the first portion of the bitstream includes generating codewords forming the size map, the size map mapping segment group index values ​​to the number of segments to be encoded for the first segment group. Encoding the second portion of the bitstream includes generating codewords representing the plurality of segment groups. Encoding the second portion of the bitstream includes encoding the first segment group (step 1208). Encoding the first segment group includes: 1) determining a first segment group index value of the first segment group, wherein the size mapping maps the first segment group index value of the first segment group to a first size, and the first size is the number of segments to be encoded for the first segment group (step 1210); 2) encoding the first segment group index value of the first segment group (step 1212); and 3) encoding multiple segments of the first segment group, the number of segments being equal to the first size (step 1214).

[0177] In some embodiments, encoding the first segment group index value includes generating one or more codewords representing the first segment group index value.

[0178] Fig.13 13 is a diagram showing functional units of a decoder 1302 and an encoder 1304 according to an embodiment. The decoder 1302 includes a decoding unit 1310 and a determining unit 1312. The encoder 1304 includes an encoding unit 1314 and a determining unit 1316.

[0179] In an embodiment, the decoding unit 1310 is configured to decode a first portion of a bitstream to form an address map that maps segment group index values ​​to segment group addresses; and is further configured to decode a second portion of the bitstream. The second portion of the bitstream includes codewords representing a plurality of segment groups. Decoding the second portion of the bitstream includes decoding a first segment group. Decoding the first segment group includes: 1) decoding a first segment group index value for the first segment group (by the decoding unit 1310); 2) determining a first segment group address for the first segment group based on the first segment group index value and the address map (by the determining unit 1312); 3) determining a first spatial position of the first segment group based on the first segment group address (by the determining unit 1312), the first spatial position representing a position of the first segment group within an image; and 4) decoding at least one sample value of the first segment group (by the decoding unit 1310) and assigning the at least one sample value to a position in the decoded image given by the first spatial position.

[0180] In an embodiment, the decoding unit 1310 is configured to decode a first portion of the bitstream to form a size map that maps a segment group index value to a number of segments to be decoded for a first segment group; and is further configured to decode a second portion of the bitstream. The second portion of the bitstream includes codewords representing a plurality of segment groups. Decoding the second portion of the bitstream includes decoding a first segment group. Decoding the first segment group includes: 1) decoding a first segment group index value for the first segment group (by the decoding unit 1310); 2) determining (by a determining unit 1312) a first size for the first segment group based on the first segment group index value and the size map; and 3) decoding a plurality of segments to form a decoded image (by the decoding unit 1310), the number of segments being equal to the first size.

[0181] In an embodiment, the determination unit 1316 is configured to determine, for the plurality of segment groups, an address mapping that maps segment group index values ​​to segment group addresses. The encoding unit 1314 is configured to encode a first portion of a bitstream; and is further configured to encode a second portion of the bitstream. The first portion of the bitstream includes codewords that form the address mapping, the address mapping mapping segment group index values ​​to segment group addresses. The second portion of the bitstream includes codewords representing a plurality of segment groups. Encoding the second portion of the bitstream includes encoding a first segment group. Encoding the first segment group includes: 1) determining a first segment group index value from a first segment group address of the first segment group (by the determination unit 1316), wherein the address mapping maps the first segment group index value to the first segment group address; 2) (by the encoding unit 1314) encoding a first segment group index value of the first segment group; and 3) (by the encoding unit 1314) encoding a sample value of the first segment group.

[0182] In an embodiment, the determining unit 1316 is configured to determine a size map that maps a segment group index value to the number of segments to be encoded for a first segment group. The encoding unit 1314 is configured to encode a first portion of a bitstream; and is further configured to encode a second portion of the bitstream. The first portion of the bitstream includes codewords forming the size map, the size map mapping the segment group index value to the number of segments to be encoded for the first segment group. The second portion of the bitstream includes codewords representing multiple segment groups. Encoding the second portion of the bitstream includes encoding the first segment group. Encoding the first segment group includes: 1) (by the determining unit 1316) determining a first segment group index value for the first segment group, wherein the size map maps the first segment group index value for the first segment group to a first size, the first size being the number of segments to be encoded for the first segment group; 2) (by the encoding unit 1314) encoding the first segment group index value for the first segment group; and 3) (by the encoding unit 1314) encoding multiple segments of the first segment group, the number of segments being equal to the first size.

[0183] Fig.14is a block diagram of a node (e.g., encoder 1302 and / or decoder 1304) according to some embodiments. Figure X As shown in , a node may include: a processing circuit (PC) 1402, which may include one or more processors (P) 1455 (e.g., a general-purpose microprocessor and / or one or more other processors, such as an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), etc.); a network interface 1448 including a transmitter (Tx) 1445 and a receiver (Rx) 1447 for enabling the node to transmit data to and receive data from other nodes connected to a network 1410 (e.g., an Internet Protocol (IP) network), to which the network interface 1448 is connected; and a local storage unit (also referred to as a "data storage system") 1408, which may include one or more non-volatile storage devices and / or one or more volatile storage devices. In embodiments where the PC 1402 includes a programmable processor, a computer program product (CPP) 1441 may be provided. The CPP 1441 includes a computer readable medium (CRM) 1442 storing a computer program (CP) 1443, which includes computer readable instructions (CRI) 1444. The CRM 1042 can be a non-transitory computer readable medium, such as a magnetic medium (e.g., a hard disk), an optical medium, a memory device (e.g., a random access memory, a flash memory), etc. In some embodiments, the CRI 1444 of the computer program 1443 is configured so that when executed by the PC 1402, the CRI causes the node to perform the steps described herein (e.g., the steps described herein with reference to the flowcharts). In other embodiments, the node can be configured to perform the steps described herein without the need for code. That is, for example, the PC 1402 can be composed of only one or more ASICs. Therefore, the features of the embodiments described herein can be implemented in hardware and / or software.

[0184] Although various embodiments of the present disclosure are described herein, it should be understood that they have been presented by way of example only and not limitation. Thus, the breadth and scope of the present disclosure should not be limited by any of the exemplary embodiments described above. Moreover, unless otherwise indicated herein or otherwise clearly contradictory to the context, any combination of the above elements in all possible variations thereof is encompassed by the present disclosure.

[0185] In addition, although the processes described above and illustrated in the accompanying drawings are shown as a series of steps, this is done for illustration only. Thus, it is contemplated that some steps may be added, some steps may be omitted, the order of the steps may be rearranged, and some steps may be performed in parallel.

Claims

1. A method for decoding an image from a bitstream, the image being partitioned into a plurality of slice groups, the method comprising: decoding a first portion of the bitstream including parameter set data to form an address map mapping slice group index values ​​to slice group addresses; as well as decoding a second portion of the bitstream comprising a group of coded slices, wherein decoding the second portion of the bitstream comprises decoding a first coded slice group corresponding to a first slice group, and wherein decoding the first coded slice group comprises: 1) decoding a first slice group index value of the first slice group from a slice group header in the first coded slice group; 2) determining a first slice group address of the first slice group based on the first slice group index value and the address mapping; 3) determining a first spatial position of the first slice group based on the first slice group address, the first spatial position representing a position of the first slice group within the image; and 4) Decoding at least one sample value of the first slice group and assigning the at least one sample value to a position in the decoded image given by the first spatial position.

2. The method of claim 1, wherein: The address map includes one or more of: an array and / or a list, a parallel collection of arrays and / or lists, a hash map, and an associative array.

3. The method according to any one of claims 1 to 2, wherein: Decoding the first portion of the bitstream to form the address map comprises: decoding from the bitstream a first value indicating a number of list values; and A list is formed by decoding a plurality of list values ​​from the bitstream, the number of list values ​​being equal to the first value.

4. The method according to any one of claims 1 to 2, wherein: Determining a first slice group address for the first slice group based on the first slice group index value and the address map includes performing a lookup operation using the first slice group index value.

5. The method according to any one of claims 1 to 2, wherein: Decoding the first portion of the bitstream to form the address map comprises: decoding from the bitstream a first value indicating a number of list values; A first list (KEY) and a second list (VALUE) are formed by decoding a plurality of values ​​representing key-value pairs k and v from the bitstream, the number of key-value pairs being equal to the first value, wherein the first list includes keys k and the second list includes values ​​v of the key-value pairs, and wherein the first list and the second list are ordered such that for a given key-value pair, an index of a given key k in the first list corresponds to an index of a given value v in the second list.

6. The method of claim 5, wherein: Determining a first slice group address of the first slice group based on the first slice group index value and the address mapping includes: Determining an index (i) such that a value (KEY[i]) corresponding to the index in the first list matches the first slice group index value; and The first slice group address is determined as the value (VALUE[i]) in the second list corresponding to the index.

7. The method of claim 5, wherein: The decoded value representing the key-value pair k and v includes an incremental value representing key k, so that for the first key-value pair, the key k is determined by the incremental value, and for other key-value pairs, the key k is determined by adding the incremental value to the previously determined key value to generate the current key k.

8. The method according to any one of claims 1 to 2, wherein: A slice group consists of only one slice.

9. The method of any of claims 1-2, further comprising decoding additional slice groups, wherein the address map is used to decode the additional slice groups.

10. The method of any one of claims 1-2, further comprising decoding additional images, wherein the address mapping is used to decode the additional images.

11. A method for encoding an image into a bit stream, the image being partitioned into a plurality of slice groups, the method comprising: For the plurality of slice groups, determining an address mapping that maps a slice group index value to a slice group address; encoding a first portion of the bitstream comprising parameter set data; as well as encoding a second portion of the bitstream comprising a coded slice group, wherein encoding the first portion of the bitstream comprises generating parameter set codewords forming the address map, the address map mapping a slice group index value to a slice group address to be encoded for a first slice group, wherein encoding the second portion of the bitstream comprises encoding a first slice group into a coded slice group, and wherein encoding the first slice group into the coded slice group comprises: 1) determining a first slice group index value from a first slice group address of the first slice group, wherein the address mapping maps the first slice group index value to the first slice group address; 2) encoding the first slice group index value of the first slice group into one or more slice group header code words representing the first slice group index value; and 3) Encoding the sample values ​​of the first slice group into coded slices.

12. The method of claim 11, wherein: Encoding the first slice group index value includes generating one or more codewords representing the first slice group index value.

13. A decoder configured to perform the method according to any one of claims 1-10.

14. An encoder configured to perform the method according to any one of claims 11-12.

15. A computer-readable storage medium having stored thereon a computer program comprising instructions which, when executed by a processing circuit of a node, cause the node to perform the method of any one of claims 1-12.