US20130051472A1 - Quality Scalable Video Data Stream - Google Patents

Quality Scalable Video Data Stream Download PDF

Info

Publication number
US20130051472A1
US20130051472A1 US12/523,308 US52330807A US2013051472A1 US 20130051472 A1 US20130051472 A1 US 20130051472A1 US 52330807 A US52330807 A US 52330807A US 2013051472 A1 US2013051472 A1 US 2013051472A1
Authority
US
United States
Prior art keywords
sub
transform
quality
transformation coefficient
scan
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US12/523,308
Other languages
English (en)
Inventor
Thomas Wiegand
Heiner Kirchhoffer
Heiko Schwarz
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Fraunhofer Gesellschaft zur Forderung der Angewandten Forschung eV
Original Assignee
Fraunhofer Gesellschaft zur Forderung der Angewandten Forschung eV
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Fraunhofer Gesellschaft zur Forderung der Angewandten Forschung eV filed Critical Fraunhofer Gesellschaft zur Forderung der Angewandten Forschung eV
Priority to US12/523,308 priority Critical patent/US20130051472A1/en
Assigned to FRAUNHOFER-GESELLSCHAFT ZUR FOERDERUNG DER ANGEWANDTEN FORSCHUNG E.V. reassignment FRAUNHOFER-GESELLSCHAFT ZUR FOERDERUNG DER ANGEWANDTEN FORSCHUNG E.V. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: KIRCHHOFFER, HEINER, SCHWARZ, HEIKO, WIEGAND, THOMAS
Publication of US20130051472A1 publication Critical patent/US20130051472A1/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/129—Scanning of coding units, e.g. zig-zag scan of transform coefficients or flexible macroblock ordering [FMO]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/30—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using hierarchical techniques, e.g. scalability
    • H04N19/34—Scalability techniques involving progressive bit-plane based encoding of the enhancement layer, e.g. fine granular scalability [FGS]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/154—Measured or subjectively estimated visual quality after decoding, e.g. measurement of distortion
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
    • H04N19/61—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding in combination with predictive coding

Definitions

  • the current Joint Video Team “JVT” of the ITU-T Video Coding Experts Group in the ISO/IEC Moving Pictures Expert Group (MPEG) is currently specifying a scalable extension of the H.264/MPEG4-AVC video coding standard.
  • the key feature of the scalable video coding (SVC) in comparison to conventional single layer encoding is that various representations of a video source with different resolutions, frame rates and/or bit-rates are provided inside a single bit stream.
  • a video representation with a specific spatio-temporal resolution and bit-rate can be extracted from a global SVC bit-stream by simple stream manipulations as packet dropping.
  • most components of H.264/MPG4-AVC are used as specified in the standard.
  • the temporal prediction structures of the SNR layers should be temporally aligned for an efficient use of the inter-layer prediction. It should be noted that all NAL units for a time instant form an excess unit and thus have to follow each other inside an SVC bit-stream. The following three inter-layer predication techniques are included in the SVC design.
  • the first one is called inter-layer motion prediction.
  • an additional macroblock mode has been introduced into SNR enhancement layers.
  • the macroblock partitioning is obtained by copying the partitioning of the co-located macroblock in the base layer.
  • the reference picture indices as well as the associated motion vectors are copied from the co-located base layer blocks.
  • a motion vector of the base layer can be used as a motion vector predictor for the conventional macroblock modes.
  • both modes are signaled via a single syntax element base_mode_flag on a macroblock level.
  • base_mode_flag When this flag is equal to 1, inter-layer intraprediction is chosen when the base layer macroblock is intra-coded. Otherwise, the macroblock mode as well as the reference indices and motion vectors are copied from the base layer macroblock.
  • an apparatus for generating a quality-scalable video data stream may have: a coder for coding a video signal using block-wise transformation to acquire transform blocks of two-dimensionally arranged transformation coefficient values for a picture of the video signal, wherein a predetermined scan order with possible scan positions orders the transformation coefficient values into a linear sequence of transformation coefficient values; and a generator for forming, for each of a plurality of quality layers, a video sub-data stream having scan range information indicating a sub-set of the possible scan positions, such that the sub-set of each of the plurality of quality layers has at least one possible scan position not included by the sub-set of any other of the plurality of quality layers and one of the possible scan positions is included by more than one of the sub-sets of the quality layers, and transform coefficient information on transformation coefficient values belonging to the sub-set of possible scan positions of the respective quality layer, having a contribution value per possible scan position of the sub-set of possible scan positions of the respective quality layer, such that the transform coefficient value of the one possible scan position is
  • an apparatus for reconstructing a video signal from a quality-scalable video data stream having, for each of a plurality of quality layers, a video sub-data stream may have: a parser for parsing the video sub-data streams of the plurality of quality layers, to acquire, for each quality layer, a scan range information and transform coefficient information on two-dimensionally arranged transformation coefficient values of different transform blocks, wherein a predetermined scan order with possible scan positions orders the transformation coefficient values into a linear sequence of transformation coefficient values, and the scan range information indicates a sub-set of the possible scan positions; a constructor for, using the scan range information, for each quality layer, constructing the transform blocks by associating the transformation coefficient values of the respective transform blocks from the transform coefficient information to the sub-set of the possible scan positions; and a reconstructor for reconstructing a picture of the video signal by a back-transformation of the transform blocks, wherein the parser is configured such that the transform coefficient information of more than one of the quality layers may have a contribution value relating to
  • a method for generating a quality-scalable video data stream may have the steps of: coding a video signal using block-wise transformation to acquire transform blocks of two-dimensionally arranged transformation coefficient values for a picture of the video signal, wherein a predetermined scan order with possible scan positions orders the transformation coefficient values into a linear sequence of transformation coefficient values; and forming, for each of a plurality of quality layers, a video sub-data stream having scan range information indicating a sub-set of the possible scan positions, such that the sub-set of each of the plurality of quality layers has at least one possible scan position not included by the sub-set of any other of the plurality of quality layers and one of the possible scan positions is included by more than one of the sub-sets of the quality layers, and transform coefficient information on transformation coefficient values belonging to the sub-set of possible scan positions of the respective quality layer, having a contribution value per possible scan position of the sub-set of possible scan positions of the respective quality layer such that the transform coefficient value of the one possible scan position is derivable based on
  • a method for reconstructing a video signal from a quality-scalable video data stream having, for each of a plurality of quality layers, a video sub-data stream may have the steps of: parsing the video sub-data streams of the plurality of quality layers, to acquire, for each quality layer, a scan range information and transform coefficient information on two-dimensionally arranged transformation coefficient values of different transform blocks, wherein a predetermined scan order with possible scan positions orders the transformation coefficient values into a linear sequence of transformation coefficient values, and the scan range information indicates a sub-set of the possible scan positions; using the scan range information, for each quality layer, constructing the transform blocks by associating the transformation coefficient values of the respective transform blocks from the transform coefficient information to the sub-set of the possible scan positions; and reconstructing a picture of the video signal by a back-transformation of the transform blocks, wherein the parsing the video sub-data streams is performed such that the transform coefficient information of more than one of the quality layers may have a contribution value relating to one transformation coefficient value, and the
  • a computer-program may have a program code for performing, when running on a computer, a method for generating a quality-scalable video data stream, the method having the steps of: coding a video signal using block-wise transformation to acquire transform blocks of two-dimensionally arranged transformation coefficient values for a picture of the video signal, wherein a predetermined scan order with possible scan positions orders the transformation coefficient values into a linear sequence of transformation coefficient values; and forming, for each of a plurality of quality layers, a video sub-data stream having scan range information indicating a sub-set of the possible scan positions, such that the sub-set of each of the plurality of quality layers has at least one possible scan position not included by the sub-set of any other of the plurality of quality layers and one of the possible scan positions is included by more than one of the sub-sets of the quality layers, and transform coefficient information on transformation coefficient values belonging to the sub-set of possible scan positions of the respective quality layer, having a contribution value per possible scan position of the sub-set of possible scan positions of
  • a computer-program may have a program code for performing, when running on a computer, a method for reconstructing a video signal from a quality-scalable video data stream having, for each of a plurality of quality layers, a video sub-data stream, the method having the steps of: parsing the video sub-data streams of the plurality of quality layers, to acquire, for each quality layer, a scan range information and transform coefficient information on two-dimensionally arranged transformation coefficient values of different transform blocks, wherein a predetermined scan order with possible scan positions orders the transformation coefficient values into a linear sequence of transformation coefficient values, and the scan range information indicates a sub-set of the possible scan positions; using the scan range information, for each quality layer, constructing the transform blocks by associating the transformation coefficient values of the respective transform blocks from the transform coefficient information to the sub-set of the possible scan positions; and reconstructing a picture of the video signal by a back-transformation of the transform blocks, wherein the parsing the video sub-data streams is performed such that the transform coefficient information of
  • an apparatus for reconstructing a video signal from a quality-scalable video data stream comprising, for each of a plurality of quality layers, a video sub-data stream, comprises means for parsing the video sub-data streams of the plurality of quality layers, to obtain, for each quality layer, a scan range information and transform coefficient information on transformation coefficient values of different transform blocks, a predetermined scan order with possible scan positions being defined among the transformation coefficient values within the transform blocks so that in each transform block, for each possible scan position, at least one of the transformation coefficient values within the respective transform block belongs to the respective possible scan position, and the scan range information indicating a sub-set of the possible scan positions; means for, using the scan range information, for each quality layer, constructing the transform blocks by associating the transformation coefficient values of the respective transform blocks from the transform coefficient information to the sub-set of the possible scan positions; and means for reconstructing a picture of the video signal by a back-transformation of the transform blocks.
  • FIG. 1 shows a block diagram of an encoder generating a quality-scalable video data stream according to an embodiment
  • FIG. 2 shows a block diagram of a higher-layer hybrid coder of FIG. 1 according to an embodiment
  • FIG. 3 shows a block diagram of a base-layer hybrid coder of FIG. 1 according to an embodiment
  • FIG. 4 shows a block diagram of a layer coding unit of the higher quality layer of FIG. 1 according to an embodiment
  • FIG. 5 shows a schematic diagram illustrating the structure of a picture as well as its bock-wise transformation according to an embodiment
  • FIGS. 6 a - 6 g show schematic diagrams of a scanned portion of a transform block and its partitioning into sub-layers according to several embodiments
  • FIG. 7 shows a schematic diagram illustrating the construction of sub-data streams according to an embodiment
  • FIG. 8 shows a pseudo-code illustrating the coding of the transform coefficient levels belonging to a specific sub-data stream according to an embodiment
  • FIG. 9 shows a pseudo-code illustrating another example for coding the transform coefficient levels belonging to a specific sub-data stream
  • FIG. 10 a block diagram of a decoder according to another embodiment.
  • FIG. 11 a block diagram of an embodiment for the decoding unit of FIG. 10 .
  • FIG. 1 shows an encoder for generating a quality-scalable bit-stream.
  • the encoder 10 of FIG. 1 is dedicated for generating a scalable bit-stream supporting two different spatial layers and N+1 SNR layers.
  • the encoder 10 is structured into a base layer part 12 and a spatial enhancement layer part 14 .
  • a quality reduction unit 16 of encoder 10 receives the original or higher quality video 18 representing a sequence of pictures and reduces its quality—in the sense of spatial resolution in the example of FIG. 1 —to obtain a lower quality version 22 of the original video 18 consisting of a sequence of pictures 24 , the lower quality version 22 being input into the base layer part 12 .
  • the quality reduction unit 16 performs, for example, a sub-sampling of the pictures by a sub-sampling factor of 2, for example.
  • a sub-sampling factor of 2 for example.
  • FIG. 1 shows an example supporting two spatial layers 12 , 14
  • the embodiment of FIG. 1 may readily be applied to applications where the quality reduction performed between the original video 18 and the lower quality video 22 does not comprise a sub-sampling, but for example, a reduction in the bit-depth of the representation of the pixel values, or the quality reduction unit simply copies the input signal to the output signal.
  • the base layer part 12 receives the lower quality video 22
  • the original video 18 is input into the higher quality part 14 , with both parts 12 , 14 performing a hybrid coding on the video respectively input.
  • the base layer part 12 receives the lower quality video 22 and generates a base layer bit-stream 26 .
  • the higher quality layer part 14 receives at its input the original video 18 and generates, besides a spatial enhancement layer bit-stream 28 , N SNR refinement layer bit-streams 30 .
  • the generation and the interrelationship between bit-streams 28 and 26 will be described in more detail below.
  • the base layer part 12 could also accompany the base layer bit-stream 26 by several SNR refinement layers 32 .
  • All bit-streams 26 to 32 are input into a multiplexer 34 which generates a scalable bit-stream 36 from the data streams at its input, eventually arranged in packets, as will be described in more detail below.
  • base layer part 12 comprises a hybrid coder 38 and a layer coding unit 40 connected in series, in the order mentioned, between the input to which the low quality video 24 is applied, on the one hand and the multiplexer 34 , on the other hand.
  • the higher quality layer part 14 comprises a hybrid coder 42 and a layer coding unit 44 connected between the input to which the original video 18 is applied and the multiplexer 44 .
  • Each hybrid coder 42 and 38 respectively, codes its video input signal by hybrid coding, i.e. motion compensated prediction is used along with block-wise transformation of the prediction residual.
  • each hybrid coder 38 and 42 respectively, outputs motion information data 46 and 48 , respectively, as well as residual data 50 and 52 , respectively, into the input of the subsequent layer coding unit 40 and 44 , respectively.
  • hybrid coder 42 can choose between several interlayer prediction options. For example, the hybrid coder 42 can decide to use or adopt the base layer motion data 46 as the motion data 48 for the higher quality layer. Alternatively, the hybrid coder 42 may decide to use the base layer motion data 46 as predictor for the motion data 48 . As a further alternative, the hybrid coder 42 may code the motion data 48 completely anew, i.e. independent from the base layer motion data.
  • the hybrid coder 42 may code the residual data for the higher quality layer predictively as the prediction residual relative to the base layer residual data 50 as a predictor.
  • the hybrid coder 42 may also use a reconstruction of the picture content of the base layer as a predictor for the picture content of the original video data so that in this case motion data and/or residual data 48 and 52 , respectively, merely code the residual relative to the reconstructed base layer data.
  • the reconstructed base layer picture information may be received by the base layer hybrid coder 38 or a dedicated reconstruction unit 54 coupled between the base-layer coding unit 40 and a higher quality layer hybrid coder 42 .
  • layer coding unit 40 in the following it is assumed that same merely generates base layer data-stream 26 .
  • layer coding unit 40 in the following it is assumed that same merely generates base layer data-stream 26 .
  • SNR refinement layer data-streams 32 is readily derivable from the following description with respect to the layer coding unit 44 .
  • the base layer hybrid coder 38 comprises an input 56 for receiving the lower quality video signals 24 , an output 58 for the motion data 46 , an output 60 for the residual data 50 , an output 62 for coupling the motion data 58 to hybrid coder 42 , an output 64 for coupling reconstructed base layer picture data to hybrid coder 42 , and an output 66 for coupling residual data 50 to hybrid coder 42 .
  • hybrid coder 38 comprises a transformation unit 68 , a back-transformation unit 70 , a subtractor 72 , an adder 74 , and a motion prediction unit 76 .
  • the subtractor 72 and the transformation unit 68 are coupled, in the order mentioned, between the input 56 and the output 60 .
  • the subtractor 72 subtracts from the input video signal motion-predicted video content received from the motion prediction unit 76 and forwards the difference signal to transformation unit 68 .
  • the transformation unit 68 performs a block-wise transformation on the difference/residual signal along with, optionally, a quantization of the transform coefficients.
  • the transformation result is output by the transformation unit 68 to output 60 as well as an input of back-transformation unit 70 .
  • the back-transformation unit 70 performs an inverse transformation on the transform blocks of transformation coefficients with, eventually, a preceding dequantization.
  • the result is a reconstructed residual signal which is, by adder 74 , additively combined with the motion-predicted video content output by motion prediction unit 76 .
  • the result of the addition performed by adder 74 is a reconstructed video in base quality.
  • the output of adder 74 is coupled to an input of motion prediction unit 76 as well as output 64 .
  • the motion prediction unit 76 performs a motion-compensated prediction based on the reconstructed pictures in order to predict other pictures of the video input to input 56 .
  • the motion prediction unit 76 produces, while performing motion-prediction, motion data including, for example, motion vectors and motion picture reference indices and outputs this mode motion data to output 62 as well as output 58 .
  • the output of the transformation unit 68 is also coupled to the output 66 in order to forward the transform residual data to the hybrid coder 42 of the higher quality layer.
  • the functionality of both hybrid coders 38 and 42 of FIG. 1 is similar to each other.
  • the hybrid coder 42 of the higher quality layer also uses inter layer prediction.
  • the structure of the hybrid coder 42 shown in FIG. 2 is similar to the structure of hybrid coder 38 shown in FIG. 3 .
  • hybrid coder 42 comprises an input 86 for the original video signal 18 , an output 88 for the motion data 48 , an output 90 for the residual data 52 , and three inputs 92 , 94 and 96 for being coupled with the respective outputs 62 , 64 and 66 of base layer hybrid coder 38 .
  • hybrid coder 42 comprises two switches or selectors 98 and 100 for connecting one of two paths 102 and 104 between input 86 and output 90 .
  • path 104 comprises a subtractor 106 , a transformation unit 108 and a residual predictive coder 110 being connected, in the order mentioned, between input 86 and output 90 via switches 98 and 100 .
  • Subractor 106 and transformation unit 108 form, along with a back-transformation unit 112 , an adder 114 and a motion prediction unit 116 , a prediction loop such as that formed by elements 68 to 76 in hybrid coder 38 of FIG. 3 . Accordingly, at the output of the transformation unit 108 a transformed version of the motion-predicted residual results which is input into residual predictive coder 110 .
  • the residual predictive coder 110 is also connected to the input 96 in order to receive the base layer residual data. By use of this base layer residual data as a predictor, the residual predictive coder 110 codes a part of the residual data output by transformation unit 108 as a prediction residual relative to the residual data at input 96 .
  • the residual predictive coder 110 up-samples the base layer residual data and subtracts the upsampled residual data from the residual data output by transformation unit 108 .
  • the residual predictor coder 110 may perform the prediction only for a part of the residual data output by transformation unit 108 .
  • Other paths pass residual predictive coder 110 unchanged.
  • the granularity of these parts may be macro blocks.
  • the decision as to whether the residual data at input 96 may be used as a predictor or not may be conducted on a macroblock basis and the result of the decision may be indicated by a respective syntax element residual_prediction_flag.
  • the hybrid coder 42 comprises a motion parameter predictive coder 118 in order to receive the motion data at input 92 from the base layer as well as the motion information obtained from motion prediction unit 116 and switches, on a macroblock basis, between passing the motion data from motion prediction unit 116 unchanged to output 88 , or predictively coding the motion data by use of the motion information from the base layer at input 92 as a predictor.
  • motion parameter predictive coder 118 may code motion vectors from motion prediction unit 116 as offset vectors relative to motion vectors contained in the base layer motion data at input 92 .
  • motion parameter predictive coder 118 passes the base layer information from input 92 to motion prediction unit 116 to be used for the motion prediction in the higher quality layer.
  • the motion parameter predictive coder 118 ignores the existence of the motion data at input 92 and codes the motion data from the motion prediction unit 116 directly to output 88 . The decision among these possibilities is coded into the resulting quality scalability bit-stream.
  • the predictive coder 120 is provided in path 102 and coupled with input 94 .
  • Predictive coder 120 predicts portions of the higher quality layer based on respective portions of the reconstructed base layer video signal so that at the output of predictive coder 120 merely the respective residual or difference is forwarded.
  • Predictive coder 120 does also operate on a macroblock-wise basis in cooperation with switches 98 and 100 .
  • the layer coding unit 44 of the higher quality layer comprises an input 122 for receiving the transform coefficients of residual data from output 90 and an input 124 for receiving the motion data from output 88 .
  • a distributing unit 126 receives the transformation coefficients and distributes them to several enhancement layers. The transformation coefficients thus distributed are output to a formation unit 128 .
  • the formation unit 128 receives the motion data from input 124 .
  • the formation unit 128 combines both data and forms, based on these data inputs, the zero-order enhancement layer data stream 28 as well as refinement-layer data streams 30 .
  • FIG. 5 represents a picture 140 .
  • Picture 140 is, for example, part of the high quality video data 18 ( FIG. 1 ).
  • the pixels are, for example, arranged in lines and columns.
  • the picture 140 is, for example, partitioned into macroblocks 142 , which may also be arranged regularly in lines and columns.
  • Each macroblock 142 may, for example, spatially cover a rectangular picture area in order to comprise, for example, 16 ⁇ 16 samples of, for example, the luma component of the picture.
  • the macroblocks 142 may be organized in pairs of macroblocks.
  • the vertically adjacent pair of macroblocks 142 may form such a pair of macroblocks and may assume, spatially, a macroblock pair region 144 of picture 140 .
  • hybrid coder 42 FIG. 1
  • hybrid coder 42 FIG. 1
  • the video 18 is assumed to contain two interleaved fields, a top and a bottom field, where the top field contains the even numbered rows of pixels, and the bottom field contains the odd numbered rows starting with the second line of the picture 140 .
  • the top macroblock of region 144 relates to the pixel values of the top field lines within region 144 whereas the bottom macroblock of region 144 relates to the content of the remaining lines.
  • both macroblocks spatially assume substantially the whole area of region 144 with a reduced vertically resolution.
  • the top macroblock is defined to spatially encompass the upper half of the rows within region 144 whereas the bottom macroblock comprises the remaining picture samples in region 144 .
  • the transformation unit 108 performs a block-wise transformation of the residual signal output by subtractor 106 .
  • the block basis for the transformation within transformation unit 108 may differ from the macroblock size of the macroblocks 142 .
  • each of the macroblocks 142 may be partitioned into four, i.e. 2 ⁇ 2, transform blocks 146 or 16, i.e. 4 ⁇ 4, transform blocks 148 .
  • the transformation unit 108 would transform the macroblocks 142 of picture 140 block-wise in blocks of size of 4 ⁇ 4 pixel samples or 8 ⁇ 8 pixel samples.
  • the transformation unit 108 outputs, for a certain macroblock 142 , several transform blocks 146 and 148 respectively, namely 16 4 ⁇ 4 transform coefficient blocks or 4 8 ⁇ 8 transform coefficient blocks 146 .
  • each transform coefficient is assigned to and represented by a scan position number, these numbers ranging from 0 to 63.
  • the respective transformation coefficients are associated with a different spatial frequency component.
  • the frequency associated with a respective one of the transform coefficients increases in magnitude from an upper left corner to the bottom right hand corner of the transform block 150 .
  • the scan order defined by the scan positions among the transform coefficients of transform block 150 scans the transform coefficients from the upper left hand corner in a zig-zag manner to the lower right-hand corner, this zig-zag scan being illustrated by arrows 154 .
  • the scan among the transform coefficients may be differently defined among the transform coefficients of a transform block of a field-coded macroblock.
  • the transform coefficient scan 158 scans the transform coefficients from the upper left-hand corner to the lower right-hand corner in a zig-zag manner with a reciprocating or zig-zag direction which is steeper than the 45° zig-zag direction used in case of the frame-coded macroblock at 150 .
  • a coefficient scan 158 scans the transform coefficients in column direction twice as fast than in line direction in order to take into account the fact that field-coded macroblocks encompass picture samples having a column pitch twice the horizontal or line pitch.
  • coefficient scan 158 scans the transform coefficients in a way so that the frequency increases as the position scan number increases.
  • the picture 140 may be subdivisioned, on a macroblock basis, into several slices 168 .
  • One such slice 168 is exemplarily shown in FIG. 5 .
  • a slice 168 is a sequence of macroblocks 142 .
  • the picture 140 may be split into one or several slices 168 .
  • the functionality of the distributing unit 126 and the formation unit 128 is described in the following in more detail.
  • the scan order defined among the transform coefficients enables the two-dimensionally arranged transform coefficients to be ordered into a linear sequence of transform coefficients with monotonously increasing frequency contents to which they refer.
  • the distributing unit 126 operates to distribute the transform coefficient of several macroblocks 142 to different quality layers, i.e. any of the zero order layer associated with a data stream 28 and the refinement layers 30 .
  • the distributing layer 126 tries to distribute the transform coefficients to the data streams 28 and 30 in such a way, that with increasing number of contributing layers from the zero or the layer 28 to the highest quality refinement layer 30 , the SNR quality of the video reconstructable from the respective data streams increases. In general, this will lead to a distribution where the lower frequency transform coefficients corresponding to lower scan positions are distributed to lower quality layers whereas higher frequency transform coefficients are distributed to higher quality layers.
  • distributing unit 126 will tend to distribute transform coefficients with higher transform coefficient values to lower quality layers and transform coefficients with lower transform coefficient values or energies to higher quality layers.
  • the distribution formed by distributing unit 126 may be performed in such a way that each of the transform coefficients is distributed to one single layer.
  • the formation unit 128 uses the distribution resulting from distributing unit 126 in order to form respective sub-data streams 28 and 30 .
  • sub-data stream forms the lowest quality layer refinement sub-data stream and contains, for example, the motion data input at input 124 .
  • This zero-order sub-data stream 128 may also be provided with a first distributed portion of the transform coefficient values.
  • sub-data stream 28 allows for a refinement of the base-quality layer data stream 26 to a higher quality—in the instance of FIG. 1 to a higher spatial quality—but a further SNR quality enhancement may be obtained by accompanying the sub-data stream 28 with any of the further higher quality refinement sub-data streams 30 .
  • the number of these refinement quality sub-data streams 30 is N, where N may be one or more than one.
  • the transform coefficients are thereby—for example, in the order of increasing importance for the SNR quality—“distributed” to these sub-data streams 28 and 30 .
  • FIG. 6 a shows an example for a distribution of the first 26 transform coefficient values of an 8 ⁇ 8 transform block.
  • FIG. 6 a shows a table where the first line of the table lists the respective scan positions according to the scan order 154 and 158 , respectively ( FIG. 5 ). It can be seen that the scan positions shown extend, exemplarily from 0 to 25.
  • the following three lines show the corresponding contribution values incorporated into the respective sub-data streams 28 and 30 , respectively, for the individual transform coefficient values.
  • the second line corresponds to, for example, the zero order sub-data stream 28 whereas the penultimate line belongs to the next higher refinement layer 30 and the last line refers to the even next quality layer refinement data-stream.
  • the last line refers to the even next quality layer refinement data-stream.
  • a “ 122 ” is coded into the sub-data streams 128 for the DC component, i.e. transform coefficient value belonging to scan position 0.
  • the contribution values for this transform coefficient having scan position 0 within the following two sub-data streams 30 are set to zero as indicated by the hashing of the respective table entries.
  • the zero order enhancement layer sub-data stream 28 comprises a distribution value for each of the transform coefficient values.
  • the transform coefficient values of scan positions 0 to 6, 8 and 9 belong to the zero order quality layers. Further transform coefficient values are set to zero.
  • the transform coefficient values belonging to the zero order quality layer may belong to other scan positions.
  • the transform coefficient values of scan positions 7, 10 to 12, 15 to 18 and 21 belong to the next higher quality layer.
  • the remaining transform coefficient values are set to zero.
  • the remaining coefficient values of the remaining scan positions are included in the next higher quality layer sub-data stream.
  • a certain transform coefficient value is actually zero. In the example of FIG. 6 a , this is the case for scanning position 23.
  • the corresponding contribution values within the preceding quality layers are set to zero and the transform coefficient value for the scan position 23 in the last quality layer (last line) for scan position 23 is zero itself.
  • the contribution values included in the various quality layers sub-bit streams 28 and 30 sum up to the actual transform coefficient value so that, at decoder side, the actual transform block may be reconstructed by summing up the contribution values for the individual scan positions of the different quality layers.
  • each of the sub-data streams 28 and 30 comprises a contribution value for all the transform coefficients and for all the scan positions, respectively.
  • this is not necessarily the case.
  • the zero order sub-data stream 28 contains any transform coefficient or contribution value. So in the latter case, the last three lines of the table of FIG. 6 a could be seen as belonging to the first refinement layer sub-data streams 30 with the zero order sub-data stream 28 merely comprising the motion information from input 124 .
  • FIG. 6 a contribution values having been set to zero and actual transform coefficient values actually being zero have been distinguished by use of hashed table entries merely for sake of an easier understanding of the functionality of information unit 128 .
  • the sub-data streams 28 and 30 may be construed such that the just-mentioned distinction between contribution values having been set to zero and contribution values naturally being zero is transparent for the decoder.
  • some of the respective contribution values for respective scan positions i.e. the numbers from the second to the fourth line below a respective scan position in the first line of FIG. 6 a reveals the transform coefficient value independent from individual contribution values in the sum being set to zero or naturally being zero.
  • the formation unit 128 coded into a respective one of the sub-data stream 28 and 30 respectively, a contribution value for each of the scan positions. This is not necessary.
  • the consecutive quality layer sub-data streams comprise merely those transform coefficient values belonging to the respective quality layer.
  • the order, in which the contribution values and transform coefficient values are coded into the sub-data streams 28 and 30 respectively, may vary in the embodiments of FIG. 6 a and FIG. 6 b , respectively.
  • the sub-data streams 28 and 30 may be packetized data streams where each packet corresponds to one slice 168 .
  • the transform coefficient values may be coded into the respective packets macroblock-wise. That is, a scan order may be defined among the macroblocks 142 within a slice 168 with the transform coefficient values for a predetermined macroblock 142 being completely coded into the respective packet before the first transform coefficient value of a macroblock following a macroblock scan order.
  • a scan order may be defined among the respective transform blocks 146 and 148 , respectively, within the respective macroblock.
  • the transform coefficient values may be coded into a respective one of the sub-data streams 28 and 30 , respectively by formation unit 128 such that the transform coefficient values of a respective one of the transform blocks are all coded into the respective sub-data stream before the first transform coefficient value of a next transform block is coded into the same.
  • a coding of the transform coefficient values and contribution values, respectively may be conducted in a way explained in the following with respect to FIG. 8 or 9 .
  • the set of scan positions belonging to this layer may be different.
  • the distributing unit 126 distributes the transform coefficient values of the different transform blocks within a slice 168 such that for all transform blocks, the transform coefficient values of the same set of scan positions belongs to the same quality layer. For example, in FIG. 6 c the transform coefficient values of the scan positions from 0 to 11 belong to the zero order sub-data stream 28 with this being true for all transform blocks within slice 168 .
  • the transform coefficient values belonging to a specific one of the quality layers extend over a continuous sequence of consecutive scan positions. This, however, needs not to be the case.
  • transform coefficient values belonging to a scan position between the first and the last scan position belonging to a specific quality layer may belong to one of the other quality layers such as shown in FIG. 6 b .
  • FIG. 6 d shows an embodiment where the distributing unit 126 has distributed the transform co-efficients over the quality layers as it was shown with respect to FIG. 6 a .
  • This distribution differs from transform block to transform block.
  • each of the quality layers is assigned a specific portion of the scan positions in common for all transform blocks.
  • the lowest quality layer is assigned the full set of scan positions from scan position 0 to scan position 63.
  • the lowest quality layer comprises 64 contribution values.
  • the next higher quality layer sub-data stream comprises contribution or transform coefficient values for all transform blocks in a specific scan position range which extends from scan position 6 to 63.
  • the scan position range of the next quality layer extends from scan position 13 to 63.
  • the decoder does not need to know as to whether a specific one of the contribution values is a contribution value that has been set to 0 (hashed entry) or is actually indicating a 0 transform coefficient value or insignificant transform coefficient value.
  • the syntax element scan_idx_start that indicates for the respective slice 168 from which scan position on the transform coefficient or contribution values contained in the respective sub-data stream are to be used for. To be more precise, in the embodiment of FIG.
  • the sub-data stream corresponding to the penultimate line comprises, for an individual transform block 58 , transform coefficient or contribution values.
  • the first one in case of the transform block of FIG. 6 d , is 0, while the second one is 22.
  • the syntax element scan_idx_start at a decoder side, it is known that the first transform coefficient value of the respective quality layer corresponds to scan position 6, while the remaining transform coefficient values of this quality layer refer to the following scan positions.
  • FIG. 6 e shows an embodiment where a syntax element scan_idx_end indicates for the individual sub-data streams the last scan position up to which the respective quality layer sub-data stream comprises sub-coefficients or contribution values.
  • FIG. 6 f A combination of the embodiments of FIGS. 6 d and 6 e is shown in FIG. 6 f .
  • the respective set of scan positions belonging to a specific one of the quality layers extends from a first scan position indicated by a syntax element scan_idx_start to a last scan position indicated by the syntax element last_idx_end.
  • the respective set of scan position extends from scan position 6 to scan position 21.
  • the embodiment of FIG. 6 g shows that the use of the syntax element scan_idx_start and/or scan_idx_end may be combined with the focus of the embodiment of FIG.
  • the formation unit 28 is designed such that the individual sub-data streams 28 and 30 , respectively, are packetized, i.e. they comprise one or more packets.
  • the formation unit 128 may be designed to generate a packet for each slice 168 within a picture 140 within each sub-bit stream 28 and 30 , respectively.
  • a packet may comprise a slice header 170 on the one hand and residual data 172 on the other hand, except sub-bit stream 28 which optionally comprises merely the slice header within each one of the packets.
  • residual data 172 i.e. residual data # 1 , residual data residual data #N
  • FIGS. 6 a to 6 g where for example, the second to fourth lines in these tables correspond to residual data # 1 , residual data # 2 and residual data # 3 , for example.
  • residual data 172 indicated in FIG. 7 includes the transform coefficient values discussed in FIGS. 6 a to 6 g , the distribution of which among the respective sub-data streams 28 and 30 is not again described here.
  • FIG. 7 shows further syntax elements contained in the slice header 170 and the residual data 172 which stem from hybrid coder 42 .
  • the hybrid coder 42 switches, on a macroblock basis between several inter-layer prediction modes so as to rely on the motion information from the base layer, or generate new motion information for a respective motion block of the higher refinement layer with predictively coding the motion information as a residual to the motion information from the base layer, or with coding this motion information anew.
  • the residual data 172 may comprise, for each macroblock, syntax elements indicating motion parameters, macroblock modes such as field or frame coded, or an inferring mode indicating the reuse of the motion parameters of the base layer with the respective macroblock. This is especially true for the zero or the sub-data stream 28 .
  • the formation unit 128 is designed to leave these macroblock-wise syntax elements concerning macroblock modes, motion parameters and inferring mode indication in the residual data of these sub-data streams 30 1 to 30 N away or to set the syntax elements in these sub-data streams 30 1 to 30 N to be either equal to the macroblock modes and motion parameters for the respective macroblock contained in sub-data stream 28 or indicate the inferring mode for the respective macroblock in order to indicate that the same settings are to be used in the respective refinement layer.
  • the slice header data 170 may comprise merely one of scan_idx_start and scan_idx_end.
  • scan_idx_start and/or scan_idx_end may be provided once per transform block size category, i.e. 4 ⁇ 4 and 8 ⁇ 8, or just once for each slice/picture/sub-data stream commonly for all transform block size categories, with respective measures being taken to transfer scan_idx_start and scan_idx_end to other block sizes as will be described in the following.
  • the slice header data may comprise a syntax element indicating the quality level.
  • the formation unit 128 may be designed such that the syntax element or quality indicator merely distinguishes between the zero order quality level 28 on the one hand and the refinement layers 30 1 to 30 N on the other hand.
  • the quality indicator may distinguish all quality layers among the refinement layers 28 and 30 1 to 30 N .
  • the quality indicator would enable the omission of any macroblock-wise defined macroblock modes, motion parameters and/or inferring modes within the packets of the sub-data streams 30 1 to 30 N since in this case, at the decoder side, it is known that these refinement layers sub-data streams 30 1 to 30 N merely refine the transform coefficients with using the macroblock modes, motion parameters and inferring modes from the zero mode sub-data stream 28 .
  • the formation unit 28 may be designed to entropy code the packets within the sub-data streams 28 and 30 1 to 30 N .
  • FIGS. 8 and 9 show possible examples for coding the transform coefficients within the residual data pertaining to one transform block according to two embodiments.
  • FIG. 8 shows a pseudo code of a first example for a possible coding of the transform coefficients within a transform block in any of the residual data 172 .
  • the following example applies:
  • total_coeff(coeff_token) is 5 (transform coefficient numbers 0,1,2,4 and 7) and trailing_ones(coeff_token) is 2 (transform coefficient number 4 and 7).
  • the positions of the significant transform coefficients have been determined to the extent that no more than total_coeff(coeff_token) non-zero transform coefficients exist.
  • the non-transform coefficients are stepped through in a reverse scan order 244 .
  • the reverse scan order is not yet obvious from just viewing the counting parameter incrementation i++ in the for-loop 244 but will become clear from the following evaluation.
  • stepping through these non-transform coefficients in reverse scan order for the first of these non-zero transform coefficients, just their transform coefficient sign is provided 248 . This is done for the first number of trailing_ones(coeff_token) of the non-zero transform coefficients when stepping through them in a reverse scan order, since for these transform coefficients it is already known that the absolute value of these transform coefficients is one (compare with the above definition of trailing_ones(coeff_token)).
  • the coefficient signs thus provided are used to temporarily store in auxiliary vector coefficients level[i] for the transform coefficient level of the non-zero transform coefficient levels having absolute value of 1 wherein i is a numbering of the non-zero transform coefficients when scanned in reverse scan order ( 250 ).
  • the coefficient levels coeff_level for the remaining non-zero transform coefficients are provided ( 252 ) in reverse scan order and temporarily stored in the auxiliary vector coefficients level [i] ( 254 ).
  • a parameter run_before is provided ( 64 ) indicating the length of the run of zero-level transform coefficients arranged directly in front of the respective non-zero transform coefficient when seen in scan order.
  • the last non-zero transform coefficient with respect to the scan order is the non-zero transform coefficient in question.
  • this is transform coefficient having the number 7 and having the level 1.
  • the run of zeros in front of this transform coefficient has a length of 2, i.e. transform coefficients 5 and 6.
  • the first run_before-parameter is 2.
  • This parameter is temporarily stored in auxiliary vector coefficient run[ 0 ] ( 266 ). This is repeated in reverse scan order for run[i], with i being the count of the non-zero transform coefficients when scanned in reverse scan order.
  • auxiliary parameter zerosLeft By decreasing the auxiliary parameter zerosLeft by the parameter run_before in each round of the for-loop ( 261 ) it is determined for each round as to how many zero-level transform coefficients are left. If zerosLeft is zero, no run_before-parameter is provided anymore ( 270 ) and the remaining coefficients of the vector run are set to zero ( 272 ).
  • no run_before-parameter is provided for the last non-zero transform coefficient when stepped through in reverse scan order, i.e. non run_before-parameter for the first non-zero transform coefficient with respect to the scan order.
  • This parameter is deduced from the number of zero-level transform coefficients left, as indicated by the auxiliary parameter zerosLeft ( 274 ).
  • the values of the transform coefficient levels as stored in auxiliary vector level are assigned to their positions by copying the values of the coefficients of vector level to the respective position in the one-dimensional array coeffLevel.
  • This is repeated for the next auxiliary vector coefficients level [ 3 ] to level [ 0 ]. Since the remaining positions of the array coeffLevel have been initialised to the value of zero ( 280 ) all transform coefficients have been coded.
  • the bold written syntax elements in FIG. 8 may be coded into the respective sub-data stream by means of variable length coding, for example.
  • FIG. 9 shows another example for coding a transform block.
  • the scanning order manifests itself in “i++” within the while-loop 310 indicating that counting parameters i is incremented per while-loop iteration.
  • numCoeff is i+1 ( 320 ) and the levels of the subsequent transform coefficients can be deduced to be zero ( 322 ).
  • the syntax elements last_significant_coeff_flag and significant_coeff_flag may be seen as a significance map.
  • the absolute value of the level minus 1, i.e. coeff_abs_level_minus 1 , and its sign, i.e. coeff_sign_flag is provided ( 324 ), thereby indicating the transform coefficient level of this last significant transform coefficient ( 326 ).
  • the parsing of the syntax elements coeff_abs_level_minus 1 begins with deriving a binarization for the possible values of the syntax element.
  • the binarization scheme may be a UEG 0 , i.e. a concatenated unary/zero-th order Exp-Golomb binarization process.
  • the respective syntax element may be binary arithmetically coded bin by bin.
  • a context adaptive binary arithmetic coding scheme may be used for a prefix part of the binarization of coeff_abs_level_minus 1 while using a decode bypass process having no adaptation for a suffix part.
  • the number of distinguishable scan positions within the 8 ⁇ 8 transform blocks is 64 whereas the number of distinguishable scan positions within the 4 ⁇ 4 transform blocks is merely 16.
  • the abovementioned syntax element scan_idx_start and scan_idx_end may either be defined in an accuracy enabling a distinction between all 64 scan positions, or merely a distinction between 16 scan positions.
  • the syntax elements may be applied to each quadruple of consecutive transform coefficients within the 8 ⁇ 8 transform blocks.
  • 8 ⁇ 8 transform blocks may be coded by use of
  • residual_block being either residual_block_cavlc or residual_block_cabac
  • LumaLevel4 ⁇ 4 and LumaLevel8 ⁇ 8 indicating an array of luma samples of the respective 4 ⁇ 4 and 8 ⁇ 8 transform block, respectively.
  • scan_idx_start and scan_idx_end are defined to discriminate between 16 scan positions so that they indicate the range of positions in 4 ⁇ 4 blocks exactly. However, in 8 ⁇ 8 blocks, the accuracy of these syntax elements is not sufficient so that in these blocks the range is adjusted quadruple wise.
  • 8 ⁇ 8 blocks of transform coefficients can also be encoded by partitioning the 64 coefficients of an 8 ⁇ 8 block into 4 sets of 16 coefficients, for example by placing every fourth coefficient into the n-th set starting with coefficient n with n in the range of 0 to 3, inclusive, and coding each set of 16 coefficients using the residual block syntax for 4 ⁇ 4 blocks.
  • these 4 sets of 16 coefficients are re-combined to form a set of 64 coefficients representing an 8 ⁇ 8 block.
  • FIG. 10 shows the general construction of a decoder 400 .
  • the decoder 400 comprises a demultiplexer 402 having an input 404 for receiving the scalable bit-stream 36 .
  • the demultiplexer 402 demulitplexes the input signal 36 into the data streams 26 to 32 .
  • the demultiplexer may—perform a decoding and/or parsing function.
  • the demultiplexer 402 may decode the transform block codings of FIGS. 8 and 9 . Further, recall FIG. 6 a - 6 g .
  • demultiplexer 402 may use information of preceding sub-data streams in order to, in parsing a current sub-data stream, know how many transform coefficient values or contribution values are to be expected for a specific transform block.
  • the data-streams thus retrieved are received by a decoding unit 406 which, based on these data-streams, reconstructs the video 18 and outputs the respective reconstructed video 408 at a respective output 410 .
  • the decoding unit 406 comprises a base layer motion data input 412 , a base layer residual data input 414 , a zero order refinement layer motion data input 416 , an optional transform coefficient zero order refinement transform coefficient data input 418 and an input 420 for the sub-data streams 30 .
  • inputs 412 and 414 are for receiving data-stream 26
  • inputs 416 and 418 cooperate to receive data-stream 28 .
  • the decoding unit 406 comprises a lower quality reconstruction video signal output 422 , a higher quality interlayer coded reconstruction video signal output 424 , and an internally coded reconstruction video signal output 426 , the latter ones providing the information for a higher quality video signal.
  • the combiner may use the knowledge of the transform coefficient values within the individual transform blocks received so far from lower quality or SNR layers.
  • the transform blocks output by combiner 428 are received by a residual predictive decoder 430 and an adder 432 .
  • an back or inverse transformation unit 432 is connected in order to forward inversely transformed residual data to the residual predictive decoder 430 .
  • the latter uses the inversely transformed residual data in order to obtain a predictor to be added to the transform coefficients of the transform blocks output by combiner 428 , eventually after performing an up-sampling or another quality adaptation.
  • a motion prediction unit 434 is connected between the input 412 and an input of an adder 436 .
  • Another input of the adder 436 is connected to the output of a back-transformation unit 432 .
  • the motion prediction unit 434 uses the motion data on input 412 to generate a prediction signal for the inversely transformed residual signal output by the back-transformation unit 432 .
  • a result of adder 436 at the output of adder 436 is a reconstructed base layer video signal.
  • the output of adder 436 is connected to the output 432 as well as in input of predictive decoder 432 .
  • the predictive decoder 432 uses the reconstructed base layer signal as a prediction for the intra layer coded portions of the video content output by combiner 428 , eventually by use of an up-sampling.
  • the output of adder 436 is also connected to an input of motion prediction units 434 in order to enable that the motion prediction unit 434 uses the motion data at input 412 to generate a prediction signal to the second input of adder 436 based on the reconstructed signals from the base layer data stream.
  • the predictively decoded transform coefficient values output by residual predictive decoder 430 are back-transfomed by back-transformation unit 438 .
  • back-transformation unit 438 At the output of back-transformation unit 438 , a higher quality residual video signal data results. This higher quality residual data video signal is added by an adder 440 with a motion predicted video signal output by a motion prediction unit 442 .
  • the reconstructed high quality video signal results which reaches output 424 as well as a further input of motion prediction unit 442 .
  • the motion prediction unit 442 performs the motion prediction based on the reconstructed video signal output by adder 440 as well as the motion information output by a motion parameter prediction decoder 444 which is connected between input 416 and a respective input of motion prediction unit 442 .
  • the motion parameter predictive decoder 444 uses, on a macroblock selective basis, motion data from the base layer motion data input 412 as a predictor, and dependent on this data, outputs the motion data to the motion prediction unit 442 with using, for example, the motion vectors at input 416 as offset vectors to motion vectors at input 412 .
  • the above described embodiments enable an increase in the granularity of SNR scalable coding on a picture/slice level in comparison to CGS/MGS coding as described in the introductory portion, but without the significant increase in complexity that is present in FGS coding. Furthermore, since it is believed that the feature of FGS that packets can be truncated will not widely be used, the bit-stream adaptation is possible by simple packet dropping.
  • the above described embodiments have the basic idea in common, to partition the transform coefficient levels of a traditional CGS/MGS packet as it is currently specified in the SVC draft into subsets, which are transmitted in different packets and different SNR refinement layers.
  • the above described embodiments concerned the CGS/MGS coding with one base and one enhancement layer.
  • the enhancement layer including, for each picture, macroblock modes, intra prediction modes, motion vectors, reference picture indices, other control parameters as well as transforms coefficient levels for all macroblocks, in order to increase the granularity of the SNR scalable coding, these data were distributed over different slices, different packets, and different enhancement layers.
  • the macroblock modes, motion parameter, other control parameters as well as, optionally, a first subset of transform coefficient levels are transmitted.
  • the same macroblock modes and motion vectors are used, but a second subset of transform coefficient levels are encoded. All transform coefficients that have already been transmitted in the first enhancement layer may be set to zero in the second and all following enhancement layers.
  • the macroblock modes and motion parameters of the first enhancement layer are again used, but further subsets of transform coefficient levels are encoded.
  • a flag is encoded at the slice level, which signals whether all macroblock modes and motion parameters are inferred from the base layer.
  • this flag should usually set to 0, since for this enhancement it should be possible to transmit motion vectors that are different from the base layer in order to improve the coding efficiency. But in all further enhancement layers, this flag is set equal to 1, since these enhancement layers only represent a refinement of transform coefficient levels of scan positions that haven't been encoded in the previous SNR enhancement layers. And by setting this flag equal to 1, the coding efficiency can be improved for this case, since no transmission of non-required syntax elements is necessary and thus associated bit-rate is saved.
  • the first scanning position x for the transform coefficient levels in the various transform blocks may be transmitted at a slice level, with no syntax elements being transmitted at a macroblock level for transform coefficients with a scanning position that is smaller than x.
  • the first scanning position is transmitted only for a specific transform size and the first scanning position for other transform sizes is inferred based on the transmitted value, it would be possible to transmit a first scanning position for all supported transform sizes.
  • the last scanning position y for the transform coefficient levels in the various transform blocks may be transmitted at a slice level, with no syntax elements being transmitted at a macroblock level for transform coefficients with a scanning position that is greater than y.
  • the first scanning position for each transform block in an SNR enhancement layer may alternatively be inferred based on the transform coefficients that have been transmitted in a previous enhancement layer.
  • This inference rule may independently applied to all transform blocks, and in each block a different first transform coefficient can be derived by, for example, combiner 428 .
  • first scanning position may basically inferred based on already transmitted transform coefficient levels in previous SNR enhancement layers, but for this the additional knowledge is used that the first scanning position cannot be smaller than a value x, which is transmitted in the slice header.
  • first scanning index in each transform block, which can be chosen in order to maximize the coding efficiency.
  • the signaling of the first scan position, the inference of the first scan position, or the combination of them may be combined with the signaling of the last scanning position.
  • slice header syntax elements which specify that macroblock modes and motion parameters are inferred for all macroblock types and/or that transform coefficients for several scanning positions are not present at a transform block level.
  • a slice level syntax element may be used that signals that the macroblock modes and motion parameters for all macroblock are inferred from the co-located base layer macroblocks. Specifically, the same macroblock modes and motion parameters may be used, and the corresponding syntax elements may not be transmitted at a slice level.
  • the first scanning position x for all transform blocks may be signaled by slice header syntax elements.
  • no syntax elements are transmitted for transform coefficient values of scanning positions smaller than x.
  • the first scanning position for a transform block may be inferred based on the transmitted transform coefficient levels of the base layer. A combination of the latter alternatives is also possible.
  • the last scanning position y for all transform blocks may be signaled by slice header syntax elements, wherein, at the macroblock level, no syntax elements are transmitted for transform coefficient values of scanning positions greater than y.
  • FIG. 1-11 may be varied in various ways.
  • the above embodiments were exemplified with respect to a two spatial layer environment, the above embodiments are readily transferable to an embodiment with only one quality layer or with more than one quality layer but with the N+1 SNR scalable refinement layers. Imagine, for example, that part 12 in FIG. 1 is missing.
  • hybrid coder 42 acts as a coding means for coding the video signal 18 using block-wise transformation to obtain transform blocks 146 , 148 of transformation coefficient values for a picture 140 of the video signal while unit 44 acts as a means for forming, for each of a plurality of quality layers, a video sub-data stream 30 or 28 plus 30 containing scan range information indicating a sub-set of the possible scan positions, and transform coefficient information on transformation coefficient values belonging to the sub-set of possible scan positions. No inter layer prediction would be involved. Moreover, coder 42 may be simplified to perform no motion prediction but merely block-wise transformation.
  • demultiplexer 402 would act as a parsing means for parsing the video sub-data streams of the plurality of quality layers, to obtain, for each quality layer, the scan range information and the transform coefficient information
  • the combiner 428 would act as a means for, using the scan range information, for each quality layer, constructing the transform blocks by associating the transformation coefficient values of the respective transform blocks from the transform coefficient information to the sub-set of the possible scan positions, with the back-transformation unit 438 reconstructing the picture of the video signal by a back-transformation of the transform blocks.
  • the embodiment in FIG. 1 may be varied in a way that the base layer coder 12 operates with the same spatial resolution and the same bit depth as the enhancement layer coder 14 .
  • the embodiment represents SNR scalable coding with a standard base layer and various enhancement layers 28 , 30 that contain partitions of the transform coefficients.
  • the inventive scheme can be implemented in hardware or in software. Therefore, the present invention also relates to a computer program, which can be stored on a computer-readable medium such as a CD, a disk or any other data carrier.
  • the present invention is, therefore, also a computer program having a program code which, when executed on a computer, performs the inventive method in connection with the above figures.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
  • Television Systems (AREA)
  • Picture Signal Circuits (AREA)
  • Testing, Inspecting, Measuring Of Stereoscopic Televisions And Televisions (AREA)
  • Closed-Circuit Television Systems (AREA)
  • Control Of Indicators Other Than Cathode Ray Tubes (AREA)
  • Image Processing (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
US12/523,308 2007-01-18 2007-04-18 Quality Scalable Video Data Stream Abandoned US20130051472A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US12/523,308 US20130051472A1 (en) 2007-01-18 2007-04-18 Quality Scalable Video Data Stream

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US88553407P 2007-01-18 2007-01-18
EPPCT/EP2007/003411 2007-04-18
US12/523,308 US20130051472A1 (en) 2007-01-18 2007-04-18 Quality Scalable Video Data Stream
PCT/EP2007/003411 WO2008086828A1 (en) 2007-01-18 2007-04-18 Quality scalable video data stream

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2007/003411 A-371-Of-International WO2008086828A1 (en) 2007-01-18 2007-04-18 Quality scalable video data stream

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US12/511,875 Division US9113167B2 (en) 2007-01-18 2009-07-29 Coding a video signal based on a transform coefficient for each scan position determined by summing contribution values across quality layers

Publications (1)

Publication Number Publication Date
US20130051472A1 true US20130051472A1 (en) 2013-02-28

Family

ID=38698325

Family Applications (2)

Application Number Title Priority Date Filing Date
US12/523,308 Abandoned US20130051472A1 (en) 2007-01-18 2007-04-18 Quality Scalable Video Data Stream
US12/511,875 Active 2030-01-11 US9113167B2 (en) 2007-01-18 2009-07-29 Coding a video signal based on a transform coefficient for each scan position determined by summing contribution values across quality layers

Family Applications After (1)

Application Number Title Priority Date Filing Date
US12/511,875 Active 2030-01-11 US9113167B2 (en) 2007-01-18 2009-07-29 Coding a video signal based on a transform coefficient for each scan position determined by summing contribution values across quality layers

Country Status (18)

Country Link
US (2) US20130051472A1 (de)
EP (1) EP2123052B1 (de)
JP (1) JP5014438B2 (de)
KR (4) KR101190227B1 (de)
CN (2) CN101606391B (de)
AT (1) ATE489808T1 (de)
BR (1) BRPI0720806B1 (de)
CA (1) CA2675891C (de)
CY (1) CY1111418T1 (de)
DE (1) DE602007010835D1 (de)
DK (1) DK2123052T3 (de)
ES (1) ES2355850T3 (de)
HK (1) HK1135827A1 (de)
PL (1) PL2123052T3 (de)
PT (1) PT2123052E (de)
SI (1) SI2123052T1 (de)
TW (1) TWI445412B (de)
WO (1) WO2008086828A1 (de)

Cited By (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110202637A1 (en) * 2008-10-28 2011-08-18 Nxp B.V. Method for buffering streaming data and a terminal device
US20110293003A1 (en) * 2009-02-11 2011-12-01 Thomson Licensing A Corporation Methods and apparatus for bit depth scalable video encoding and decoding utilizing tone mapping and inverse tone mapping
US20120099656A1 (en) * 2010-10-26 2012-04-26 Ohya Yasuo Transmitting system, receiving device, and a video transmission method
US20120163472A1 (en) * 2010-12-22 2012-06-28 Qualcomm Incorporated Efficiently coding scanning order information for a video block in video coding
US20120163469A1 (en) * 2009-06-07 2012-06-28 Lg Electronics Inc. Method and apparatus for decoding a video signal
US20130003833A1 (en) * 2011-06-30 2013-01-03 Vidyo Inc. Scalable Video Coding Techniques
US20130195169A1 (en) * 2012-02-01 2013-08-01 Vidyo, Inc. Techniques for multiview video coding
US20130329807A1 (en) * 2011-03-03 2013-12-12 Electronics And Telecommunications Research Institute Method for scanning transform coefficient and device therefor
US20130343455A1 (en) * 2011-03-10 2013-12-26 Sharp Kabushiki Kaisha Image decoding device, image encoding device, and data structure of encoded data
US8976861B2 (en) 2010-12-03 2015-03-10 Qualcomm Incorporated Separately coding the position of a last significant coefficient of a video block in video coding
US20150139332A1 (en) * 2011-06-28 2015-05-21 Samsung Electronics Co., Ltd. Method and apparatus for coding video and method and apparatus for decoding video accompanied with arithmetic coding
US9042440B2 (en) 2010-12-03 2015-05-26 Qualcomm Incorporated Coding the position of a last significant coefficient within a video block based on a scanning order for the block in video coding
US9106913B2 (en) 2011-03-08 2015-08-11 Qualcomm Incorporated Coding of transform coefficients for video coding
US9167253B2 (en) 2011-06-28 2015-10-20 Qualcomm Incorporated Derivation of the position in scan order of the last significant transform coefficient in video coding
US9197890B2 (en) 2011-03-08 2015-11-24 Qualcomm Incorporated Harmonized scan order for coding transform coefficients in video coding
JP2016524877A (ja) * 2013-06-11 2016-08-18 クゥアルコム・インコーポレイテッドＱｕａｌｃｏｍｍ Ｉｎｃｏｒｐｏｒａｔｅｄ マルチレイヤビデオコーディングにおけるレイヤ間予測タイプに関するビットストリーム制約を処理すること
US9635368B2 (en) 2009-06-07 2017-04-25 Lg Electronics Inc. Method and apparatus for decoding a video signal
US9756613B2 (en) 2012-12-06 2017-09-05 Qualcomm Incorporated Transmission and reception timing for device-to-device communication system embedded in a cellular system
US10075708B2 (en) 2012-04-09 2018-09-11 Sun Patent Trust Image encoding method and image decoding method
TWI635740B (zh) * 2017-06-12 2018-09-11 元智大學 平行化階層式無失真壓縮方法及其架構
US10194158B2 (en) 2012-09-04 2019-01-29 Qualcomm Incorporated Transform basis adjustment in scalable video coding
US10595036B2 (en) 2012-06-29 2020-03-17 Velos Media, Llc Decoding device and decoding method
US11330272B2 (en) 2010-12-22 2022-05-10 Qualcomm Incorporated Using a most probable scanning order to efficiently code scanning order information for a video block in video coding
US11812038B2 (en) * 2011-03-03 2023-11-07 Electronics And Telecommunications Research Institute Method for scanning transform coefficient and device therefor

Families Citing this family (60)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
MX2009009489A (es) * 2007-03-13 2009-11-05 Nokia Corp Sistema y método para codificación y decodificación de video.
US8599921B2 (en) * 2009-03-27 2013-12-03 Vixs Systems, Inc Adaptive partition subset selection module and method for use therewith
RU2546325C2 (ru) * 2009-05-29 2015-04-10 Мицубиси Электрик Корпорейшн Устройство кодирования изображений, устройство декодирования изображений, способ кодирования изображений и способ декодирования изображений
ES2784509T3 (es) * 2010-04-13 2020-09-28 Ge Video Compression Llc Codificación de mapas de significado y bloques de coeficiente de transformada
US9106933B1 (en) 2010-05-18 2015-08-11 Google Inc. Apparatus and method for encoding video using different second-stage transform
US9215470B2 (en) 2010-07-09 2015-12-15 Qualcomm Incorporated Signaling selected directional transform for video coding
CA2903530C (en) * 2010-07-20 2018-08-28 Ntt Docomo, Inc. Video prediction encoding and decoding for partitioned regions while determining whether or not to use motion information from neighboring regions
KR101373814B1 (ko) * 2010-07-31 2014-03-18 엠앤케이홀딩스 주식회사 예측 블록 생성 장치
KR101483179B1 (ko) * 2010-10-06 2015-01-19 에스케이 텔레콤주식회사 주파수 마스크 테이블을 이용한 주파수변환 블록 부호화 방법 및 장치와 그를 이용한 영상 부호화/복호화 방법 및 장치
US9288496B2 (en) 2010-12-03 2016-03-15 Qualcomm Incorporated Video coding using function-based scan order for transform coefficients
US10992958B2 (en) 2010-12-29 2021-04-27 Qualcomm Incorporated Video coding using mapped transforms and scanning modes
US9490839B2 (en) 2011-01-03 2016-11-08 Qualcomm Incorporated Variable length coding of video block coefficients
US20130343454A1 (en) * 2011-01-07 2013-12-26 Agency For Science, Technology And Research Method and an apparatus for coding an image
US9210442B2 (en) 2011-01-12 2015-12-08 Google Technology Holdings LLC Efficient transform unit representation
US9380319B2 (en) 2011-02-04 2016-06-28 Google Technology Holdings LLC Implicit transform unit representation
US10142637B2 (en) 2011-03-08 2018-11-27 Texas Instruments Incorporated Method and apparatus for parallelizing context selection in video processing
CN102685503B (zh) * 2011-03-10 2014-06-25 华为技术有限公司 变换系数的编码方法、变换系数的解码方法，和装置
EP3057326A1 (de) * 2011-06-10 2016-08-17 MediaTek, Inc Verfahren und vorrichtung zur skalierbaren videocodierung
US9516316B2 (en) 2011-06-29 2016-12-06 Qualcomm Incorporated VLC coefficient coding for large chroma block
US9338456B2 (en) 2011-07-11 2016-05-10 Qualcomm Incorporated Coding syntax elements using VLC codewords
WO2013063800A1 (en) * 2011-11-04 2013-05-10 Mediatek Inc. Methods and apparatuses of solving mdcs parsing issue
FR2982447A1 (fr) 2011-11-07 2013-05-10 France Telecom Procede de codage et decodage d'images, dispositif de codage et decodage et programmes d'ordinateur correspondants
FR2982446A1 (fr) 2011-11-07 2013-05-10 France Telecom Procede de codage et decodage d'images, dispositif de codage et decodage et programmes d'ordinateur correspondants
WO2013069991A1 (ko) * 2011-11-08 2013-05-16 삼성전자 주식회사 비디오의 산술 부호화 방법 및 그 장치, 비디오의 산술 복호화 방법 및 그 장치
KR20130107861A (ko) * 2012-03-23 2013-10-02 한국전자통신연구원 인터 레이어 인트라 예측 방법 및 장치
CN107257462B (zh) * 2012-03-26 2020-04-28 Jvc 建伍株式会社 图像解码装置、图像解码方法、接收装置
US10129540B2 (en) * 2012-04-10 2018-11-13 Texas Instruments Incorporated Reduced complexity coefficient transmission for adaptive loop filtering (ALF) in video coding
US9219913B2 (en) 2012-06-13 2015-12-22 Qualcomm Incorporated Inferred base layer block for TEXTURE—BL mode in HEVC based single loop scalable video coding
US9955154B2 (en) * 2012-06-29 2018-04-24 Intel Corporation Systems, methods, and computer program products for scalable video coding based on coefficient sampling
US20140003504A1 (en) * 2012-07-02 2014-01-02 Nokia Corporation Apparatus, a Method and a Computer Program for Video Coding and Decoding
BR112015000480B1 (pt) * 2012-07-09 2023-02-07 Vid Scale, Inc Arquitetura de codec para codificação de vídeo de camada múltipla, método e sistema
GB2496015B (en) * 2012-09-05 2013-09-11 Imagination Tech Ltd Pixel buffering
US20140086328A1 (en) * 2012-09-25 2014-03-27 Qualcomm Incorporated Scalable video coding in hevc
CN104813663B (zh) * 2012-09-28 2018-05-22 索尼公司 编码设备、编码方法、解码设备和解码方法
EP2904803A1 (de) 2012-10-01 2015-08-12 GE Video Compression, LLC Skalierbare videocodierung mittels ableitung von subblockunterteilung zur vorhersage von der basisschicht
EP2923488B1 (de) * 2012-11-21 2021-05-26 Dolby International AB Signalisierung von skalierbarkeitsinformationen in einem parametersatz
US10097825B2 (en) * 2012-11-21 2018-10-09 Qualcomm Incorporated Restricting inter-layer prediction based on a maximum number of motion-compensated layers in high efficiency video coding (HEVC) extensions
US10178400B2 (en) 2012-11-21 2019-01-08 Dolby International Ab Signaling scalability information in a parameter set
CN103916670B (zh) * 2013-01-07 2017-08-04 华为技术有限公司 一种图像的编码、解码方法及装置
US9219915B1 (en) 2013-01-17 2015-12-22 Google Inc. Selection of transform size in video coding
US9967559B1 (en) 2013-02-11 2018-05-08 Google Llc Motion vector dependent spatial transformation in video coding
US9544597B1 (en) 2013-02-11 2017-01-10 Google Inc. Hybrid transform in video encoding and decoding
US9681155B2 (en) * 2013-03-15 2017-06-13 Sony Interactive Entertainment America Llc Recovery from packet loss during transmission of compressed video streams
US9674530B1 (en) 2013-04-30 2017-06-06 Google Inc. Hybrid transforms in video coding
US10516898B2 (en) 2013-10-10 2019-12-24 Intel Corporation Systems, methods, and computer program products for scalable video coding based on coefficient sampling
KR102490706B1 (ko) * 2014-09-30 2023-01-19 마이크로소프트 테크놀로지 라이센싱, 엘엘씨 비디오 코딩을 위한 해시 기반 인코더 결정
US9565451B1 (en) 2014-10-31 2017-02-07 Google Inc. Prediction dependent transform coding
US10306229B2 (en) 2015-01-26 2019-05-28 Qualcomm Incorporated Enhanced multiple transforms for prediction residual
US9769499B2 (en) 2015-08-11 2017-09-19 Google Inc. Super-transform video coding
US10277905B2 (en) 2015-09-14 2019-04-30 Google Llc Transform selection for non-baseband signal coding
US9807423B1 (en) 2015-11-24 2017-10-31 Google Inc. Hybrid transform scheme for video coding
KR102546142B1 (ko) * 2016-03-18 2023-06-21 로즈데일 다이나믹스 엘엘씨 비디오 코딩 시스템에서 블록 구조 도출 방법 및 장치
US10623774B2 (en) 2016-03-22 2020-04-14 Qualcomm Incorporated Constrained block-level optimization and signaling for video coding tools
CN114222138A (zh) * 2016-05-28 2022-03-22 世宗大学校产学协力团 视频信号的解码装置
US10791340B2 (en) * 2016-11-15 2020-09-29 Sony Corporation Method and system to refine coding of P-phase data
US11606569B2 (en) * 2018-09-25 2023-03-14 Apple Inc. Extending supported components for encoding image data
US11323748B2 (en) 2018-12-19 2022-05-03 Qualcomm Incorporated Tree-based transform unit (TU) partition for video coding
US11122297B2 (en) 2019-05-03 2021-09-14 Google Llc Using border-aligned block functions for image compression
CN113473139A (zh) * 2020-03-31 2021-10-01 华为技术有限公司 一种图像处理方法和图像处理装置
CN116800968A (zh) * 2022-03-17 2023-09-22 中兴通讯股份有限公司 编码方法及装置、解码方法及装置、存储介质、电子装置

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030118243A1 (en) * 2001-09-18 2003-06-26 Ugur Sezer Largest magnitude indices selection for (run, level) encoding of a block coded picture
US20050030205A1 (en) * 2002-03-19 2005-02-10 Fujitsu Limited Hierarchical encoding and decoding devices
US20060008002A1 (en) * 2002-09-27 2006-01-12 Koninklijke Philips Electronics N.V. Scalable video encoding
US20060230162A1 (en) * 2005-03-10 2006-10-12 Peisong Chen Scalable video coding with two layer encoding and single layer decoding
US20060233255A1 (en) * 2005-04-13 2006-10-19 Nokia Corporation Fine granularity scalability (FGS) coding efficiency enhancements
US20070160133A1 (en) * 2006-01-11 2007-07-12 Yiliang Bao Video coding with fine granularity spatial scalability
US20070223580A1 (en) * 2006-03-27 2007-09-27 Yan Ye Methods and systems for refinement coefficient coding in video compression
US20070230564A1 (en) * 2006-03-29 2007-10-04 Qualcomm Incorporated Video processing with scalability
US20070237239A1 (en) * 2006-03-24 2007-10-11 Byeong-Moon Jeon Methods and apparatuses for encoding and decoding a video data stream
US20090219988A1 (en) * 2006-01-06 2009-09-03 France Telecom Methods of encoding and decoding an image or a sequence of images, corresponding devices, computer program and signal

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5253055A (en) * 1992-07-02 1993-10-12 At&T Bell Laboratories Efficient frequency scalable video encoding with coefficient selection
US5953506A (en) * 1996-12-17 1999-09-14 Adaptive Media Technologies Method and apparatus that provides a scalable media delivery system
JPH1141600A (ja) * 1997-07-24 1999-02-12 Nippon Telegr & Teleph Corp <Ntt> 画像階層符号化・復号方法および装置並びに記録媒体
JP4593720B2 (ja) * 2000-03-10 2010-12-08 パナソニック株式会社 剰余数係数の動的表示方法および装置
US20030118097A1 (en) * 2001-12-21 2003-06-26 Koninklijke Philips Electronics N.V. System for realization of complexity scalability in a layered video coding framework
WO2003075579A2 (en) * 2002-03-05 2003-09-12 Koninklijke Philips Electronics N.V. Method and system for layered video encoding
PT1467491E (pt) * 2002-05-02 2007-03-30 Fraunhofer Ges Forschung Codificação aritmética de coeficientes de transformação
US6795584B2 (en) * 2002-10-03 2004-09-21 Nokia Corporation Context-based adaptive variable length coding for adaptive block transforms

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030118243A1 (en) * 2001-09-18 2003-06-26 Ugur Sezer Largest magnitude indices selection for (run, level) encoding of a block coded picture
US20050030205A1 (en) * 2002-03-19 2005-02-10 Fujitsu Limited Hierarchical encoding and decoding devices
US20060008002A1 (en) * 2002-09-27 2006-01-12 Koninklijke Philips Electronics N.V. Scalable video encoding
US20060230162A1 (en) * 2005-03-10 2006-10-12 Peisong Chen Scalable video coding with two layer encoding and single layer decoding
US20060233255A1 (en) * 2005-04-13 2006-10-19 Nokia Corporation Fine granularity scalability (FGS) coding efficiency enhancements
US20090219988A1 (en) * 2006-01-06 2009-09-03 France Telecom Methods of encoding and decoding an image or a sequence of images, corresponding devices, computer program and signal
US20070160133A1 (en) * 2006-01-11 2007-07-12 Yiliang Bao Video coding with fine granularity spatial scalability
US20070237239A1 (en) * 2006-03-24 2007-10-11 Byeong-Moon Jeon Methods and apparatuses for encoding and decoding a video data stream
US20070223580A1 (en) * 2006-03-27 2007-09-27 Yan Ye Methods and systems for refinement coefficient coding in video compression
US20070230564A1 (en) * 2006-03-29 2007-10-04 Qualcomm Incorporated Video processing with scalability

Cited By (49)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110202637A1 (en) * 2008-10-28 2011-08-18 Nxp B.V. Method for buffering streaming data and a terminal device
US8612552B2 (en) * 2008-10-28 2013-12-17 Nxp B.V. Method for buffering streaming data and a terminal device
US20110293003A1 (en) * 2009-02-11 2011-12-01 Thomson Licensing A Corporation Methods and apparatus for bit depth scalable video encoding and decoding utilizing tone mapping and inverse tone mapping
US8867616B2 (en) * 2009-02-11 2014-10-21 Thomson Licensing Methods and apparatus for bit depth scalable video encoding and decoding utilizing tone mapping and inverse tone mapping
US20120163469A1 (en) * 2009-06-07 2012-06-28 Lg Electronics Inc. Method and apparatus for decoding a video signal
US10986372B2 (en) 2009-06-07 2021-04-20 Lg Electronics Inc. Method and apparatus for decoding a video signal
US10405001B2 (en) 2009-06-07 2019-09-03 Lg Electronics Inc. Method and apparatus for decoding a video signal
US10015519B2 (en) 2009-06-07 2018-07-03 Lg Electronics Inc. Method and apparatus for decoding a video signal
US9635368B2 (en) 2009-06-07 2017-04-25 Lg Electronics Inc. Method and apparatus for decoding a video signal
US9100648B2 (en) * 2009-06-07 2015-08-04 Lg Electronics Inc. Method and apparatus for decoding a video signal
US9154812B2 (en) * 2010-10-26 2015-10-06 Kabushiki Kaisha Toshiba Transmitting system, receiving device, and a video transmission method
US20120099656A1 (en) * 2010-10-26 2012-04-26 Ohya Yasuo Transmitting system, receiving device, and a video transmission method
US8976861B2 (en) 2010-12-03 2015-03-10 Qualcomm Incorporated Separately coding the position of a last significant coefficient of a video block in video coding
US9042440B2 (en) 2010-12-03 2015-05-26 Qualcomm Incorporated Coding the position of a last significant coefficient within a video block based on a scanning order for the block in video coding
US9055290B2 (en) 2010-12-03 2015-06-09 Qualcomm Incorporated Coding the position of a last significant coefficient within a video block based on a scanning order for the block in video coding
US11330272B2 (en) 2010-12-22 2022-05-10 Qualcomm Incorporated Using a most probable scanning order to efficiently code scanning order information for a video block in video coding
US20120163472A1 (en) * 2010-12-22 2012-06-28 Qualcomm Incorporated Efficiently coding scanning order information for a video block in video coding
US11606567B2 (en) * 2011-03-03 2023-03-14 Electronics And Telecommunications Research Institute Method for scanning transform coefficient and device therefor
US20240031584A1 (en) * 2011-03-03 2024-01-25 Electronics And Telecommunications Research Institute Method for scanning transform coefficient and device therefor
US20210344935A1 (en) * 2011-03-03 2021-11-04 Electronics And Telecommunications Research Institute Method for scanning transform coefficient and device therefor
US20130329807A1 (en) * 2011-03-03 2013-12-12 Electronics And Telecommunications Research Institute Method for scanning transform coefficient and device therefor
US11102494B2 (en) * 2011-03-03 2021-08-24 Electronics And Telecommunication Research Institute Method for scanning transform coefficient and device therefor
US11812038B2 (en) * 2011-03-03 2023-11-07 Electronics And Telecommunications Research Institute Method for scanning transform coefficient and device therefor
US10397577B2 (en) 2011-03-08 2019-08-27 Velos Media, Llc Inverse scan order for significance map coding of transform coefficients in video coding
US9197890B2 (en) 2011-03-08 2015-11-24 Qualcomm Incorporated Harmonized scan order for coding transform coefficients in video coding
US11006114B2 (en) 2011-03-08 2021-05-11 Velos Media, Llc Coding of transform coefficients for video coding
US9338449B2 (en) 2011-03-08 2016-05-10 Qualcomm Incorporated Harmonized scan order for coding transform coefficients in video coding
US10499059B2 (en) 2011-03-08 2019-12-03 Velos Media, Llc Coding of transform coefficients for video coding
US9106913B2 (en) 2011-03-08 2015-08-11 Qualcomm Incorporated Coding of transform coefficients for video coding
US11405616B2 (en) 2011-03-08 2022-08-02 Qualcomm Incorporated Coding of transform coefficients for video coding
US10148974B2 (en) * 2011-03-10 2018-12-04 Sharp Kabushiki Kaisha Image decoding device, image encoding device, and data structure of encoded data
US20130343455A1 (en) * 2011-03-10 2013-12-26 Sharp Kabushiki Kaisha Image decoding device, image encoding device, and data structure of encoded data
US9247270B2 (en) * 2011-06-28 2016-01-26 Samsung Electronics Co., Ltd. Method and apparatus for coding video and method and apparatus for decoding video accompanied with arithmetic coding
US20150139332A1 (en) * 2011-06-28 2015-05-21 Samsung Electronics Co., Ltd. Method and apparatus for coding video and method and apparatus for decoding video accompanied with arithmetic coding
US9258571B2 (en) * 2011-06-28 2016-02-09 Samsung Electronics Co., Ltd. Method and apparatus for coding video and method and apparatus for decoding video accompanied with arithmetic coding
US20150139299A1 (en) * 2011-06-28 2015-05-21 Samsung Electronics Co., Ltd. Method and apparatus for coding video and method and apparatus for decoding video accompanied with arithmetic coding
US9167253B2 (en) 2011-06-28 2015-10-20 Qualcomm Incorporated Derivation of the position in scan order of the last significant transform coefficient in video coding
US9491469B2 (en) 2011-06-28 2016-11-08 Qualcomm Incorporated Coding of last significant transform coefficient
US20130003833A1 (en) * 2011-06-30 2013-01-03 Vidyo Inc. Scalable Video Coding Techniques
US20130195169A1 (en) * 2012-02-01 2013-08-01 Vidyo, Inc. Techniques for multiview video coding
US10075708B2 (en) 2012-04-09 2018-09-11 Sun Patent Trust Image encoding method and image decoding method
US10595036B2 (en) 2012-06-29 2020-03-17 Velos Media, Llc Decoding device and decoding method
US10958930B2 (en) 2012-06-29 2021-03-23 Velos Media, Llc Encoding device and encoding method with setting and encoding of reference information
US10623765B2 (en) 2012-06-29 2020-04-14 Velos Media, Llc Encoding device and encoding method with setting and encoding of reference information
US11399197B2 (en) 2012-06-29 2022-07-26 Velos Media, Llc Encoding device and encoding method with setting and encoding of reference information
US10194158B2 (en) 2012-09-04 2019-01-29 Qualcomm Incorporated Transform basis adjustment in scalable video coding
US9756613B2 (en) 2012-12-06 2017-09-05 Qualcomm Incorporated Transmission and reception timing for device-to-device communication system embedded in a cellular system
JP2016524877A (ja) * 2013-06-11 2016-08-18 クゥアルコム・インコーポレイテッドＱｕａｌｃｏｍｍ Ｉｎｃｏｒｐｏｒａｔｅｄ マルチレイヤビデオコーディングにおけるレイヤ間予測タイプに関するビットストリーム制約を処理すること
TWI635740B (zh) * 2017-06-12 2018-09-11 元智大學 平行化階層式無失真壓縮方法及其架構

Also Published As

Publication number Publication date
BRPI0720806A8 (pt) 2019-01-15
PL2123052T3 (pl) 2011-05-31
JP5014438B2 (ja) 2012-08-29
EP2123052B1 (de) 2010-11-24
CN102547277B (zh) 2014-12-03
KR101341111B1 (ko) 2013-12-13
WO2008086828A1 (en) 2008-07-24
CN101606391B (zh) 2012-02-08
BRPI0720806B1 (pt) 2023-03-28
EP2123052A1 (de) 2009-11-25
HK1135827A1 (en) 2010-06-11
ATE489808T1 (de) 2010-12-15
CA2675891A1 (en) 2008-07-24
PT2123052E (pt) 2011-03-02
CN101606391A (zh) 2009-12-16
BRPI0720806A2 (pt) 2013-02-13
US9113167B2 (en) 2015-08-18
JP2010517343A (ja) 2010-05-20
ES2355850T3 (es) 2011-03-31
KR20110034701A (ko) 2011-04-05
KR101168294B1 (ko) 2012-07-24
KR101190227B1 (ko) 2012-10-12
DE602007010835D1 (de) 2011-01-05
KR20110032013A (ko) 2011-03-29
KR20110034702A (ko) 2011-04-05
CA2675891C (en) 2013-04-16
CN102547277A (zh) 2012-07-04
SI2123052T1 (sl) 2011-04-29
KR101175593B1 (ko) 2012-08-22
TW200904200A (en) 2009-01-16
TWI445412B (zh) 2014-07-11
KR20090108036A (ko) 2009-10-14
DK2123052T3 (da) 2011-02-28
US20100020867A1 (en) 2010-01-28
CY1111418T1 (el) 2015-08-05

Similar Documents

Publication Publication Date Title
US9113167B2 (en) Coding a video signal based on a transform coefficient for each scan position determined by summing contribution values across quality layers
US10659776B2 (en) Quality scalable coding with mapping different ranges of bit depths
US8428143B2 (en) Coding scheme enabling precision-scalability
JP5151984B2 (ja) 動画像符号化装置
ES2527932T3 (es) Escalabilidad de profundidad de bits
RU2411689C2 (ru) Способ и устройство для адаптивного к макроблоку межслойного предсказания внутренней текстуры
US7099515B2 (en) Bitplane coding and decoding for AC prediction status information
US8532176B2 (en) Methods and systems for combining layers in a multi-layer bitstream
WO2007079782A1 (en) Quality scalable picture coding with particular transform coefficient scan path
US20120219060A1 (en) System and method for scalable encoding and decoding of multimedia data using multiple layers
US20070237240A1 (en) Video coding method and apparatus supporting independent parsing
US20080008247A1 (en) Methods and Systems for Residual Layer Scaling
US20140044180A1 (en) Device and method for coding video information using base layer motion vector candidate
MXPA06002079A (es) Codificacion bi-direccional predictiva avanzada de video entrelazado.
US20070177664A1 (en) Entropy encoding/decoding method and apparatus
KR20060122684A (ko) 영상 신호의 인코딩 및 디코딩 방법
US20090219988A1 (en) Methods of encoding and decoding an image or a sequence of images, corresponding devices, computer program and signal
US20070230811A1 (en) Method of enhancing entropy-coding efficiency, video encoder and video decoder thereof
Limnell et al. Quality scalability in H. 264/AVC video coding

Legal Events

Date Code Title Description
AS Assignment

Owner name: FRAUNHOFER-GESELLSCHAFT ZUR FOERDERUNG DER ANGEWAN

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:WIEGAND, THOMAS;KIRCHHOFFER, HEINER;SCHWARZ, HEIKO;REEL/FRAME:024265/0930

Effective date: 20090727

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION