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/30—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using hierarchical techniques, e.g. scalability
• • 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/36—Scalability techniques involving formatting the layers as a function of picture distortion after decoding, e.g. signal-to-noise [SNR] scalability
• • 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/31—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using hierarchical techniques, e.g. scalability in the temporal domain
• • 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/42—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation
• • 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
• • 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/70—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by syntax aspects related to video coding, e.g. related to compression standards

Definitions

• TECHNICAL FIELD o This application relates to a hypothetical reference decoder for Scalable Video Coding in compressed video systems.
• a hypothetical reference decoder is valuable in compressed video systems because it
• H.264/AVC a coding standard
• H.264/AVC there are numerous interoperability points due to the Scalable Video Coding features of the standard.
• the H.264/AVC standard has rules (also referred to as requirements, constraints, or operational specifications) defining an HRD.
• the HRD behavior is normative. Any AVC bitstream has to be compliant to the
• SVC scalable video coding
• An SVC bitstream typically has multiple interoperability points (also referred to as operation points), due at least in part to the fact that the bitstream is scalable.
• Such a bitstream may be scalable spatially, temporally, and in SNR, for example.
• Sub-bitstreams, corresponding to the scalable aspects, may be extracted
• This disclosure describes at least one implementation that provides a hypothetical to reference decoder (HRD) for SVC.
• HRD hypothetical to reference decoder
• One such implementation proposes to modify the H.264/AVC HRD for use with SVC. That implementation defines HRD constraints for each interoperability point of SVC.
• One implementation in particular is described, but other implementations are possible and are contemplated by this disclosure.
• the first part of the disclosure discusses changes for spatial, temporal, and SNR scalability, respectively.
• the second part of the disclosure discusses changes to the related HRD parameters followed by the specification text.
• the H.264/AVC standard has rules (also referred to as requirements, constraints, or operational specifications) defining an HRD.
• the HRD behavior is normative. Any AVC bitstream has to be compliant to the HRD built according to the rules.
• SVC scalable video coding
• Annex G an extension to the AVC standard.
• This disclosure describes one or more implementations that provide rules for an HRD for SVC. At least one implementation proposes the SVC-HRD rules as modifications to the AVC-HRD rules. A user may use the proposed SVC-HRD rules to build an SVC-HRD and test a bitstream for SVC compliance.
• Figure 1 shows the sequence parameter set of AVC sequences.
• Figure 2 shows the buffer period SEI message of AVC.
• Figure 3 shows the proposed HRD parameters.
• Figure 4 shows the proposed VUI parameters.
• Figure 5 shows the proposed buffer_period SEI message.
• Figure 6 shows the proposed picture timing SEI message.
• An SVC bitstream typically has multiple interoperability points (also referred to as operation points), due at least in part to the fact that the bitstream is scalable.
• Such a bitstream may be scalable spatially, temporally, and in SNR, for example.
• Sub- bitstreams, corresponding to the scalable aspects, may be extracted from the bitstream.
• each interoperability point is checked by the HRD to ensure SVC compliance.
• An HRD may define HRD constraints for each checking point separately. Or several checking points may obey one HRD constraint. In at least one implementation described in this disclosure, separate HRD constraints are proposed for each checking point. The use of separate HRD constraints may ease the operation, and also may provide some similarities to the approach of H.263+.
• VUI message is included in the SPS (see vui_parameters() in Table 1 ). For each spatial SVC layer, since the picture size is different from other layers, its corresponding SPS is different from other layers'. So the HRD of VUI in AVC, without modification, can be directly applied to HRD of VUI for spatial SVC. For each checking point, we can get the correct VUI message through the HRD rules for AVC, as shown in Table 1 .
• Buffer period SEI message seq_parameter_set_id is in the buffer period SEI message.
• the buffer period for each spatial SVC layer can be obtained. So, for spatial SVC, the buffer period SEI message of HRD in AVC can be directly applied for spatial SVC. For each checking point, we can get correct buffer period SEI message without modifying the current HRD, as shown in Table 2.
• cpb_removal_delay and dpb_output_delay could be the same for different layers in the same access unit (see Table 6). So no change is needed for spatial scalability.
• the quality layer can be indicated by dependency_id or qualityjevel. Different quality layers/levels can share the same SPS, so the VUI message in AVC should be modified (see Table 3) to include HRD information for all quality layers/levels.
• Buffer period SEI message For SNR SVC, different quality layers/levels can share the same SPS, so it has no one-to-one mapping with seq_parameter_set_id existing in the buffer period SEI message.
• the buffer period SEI message should be modified (see Table 5) to include HRD information for all quality layers/levels.
• cpb_removal_delay and dpb_output_delay could be the same for different quality layers/levels in the same access unit. So no change is needed for spatial scalability.
• VUI message For temporal SVC, different temporal layers can share the same SPS, so the VUI message in AVC should be modified (see Table 3) to include HRD information for all temporal layers.
• buffer period SEI message For temporal SVC, different temporal layers can share the same SPS, so it has no one-to-one mapping with seq_parameter_set_id existing in the buffer period SEI message.
• the buffer period SEI message should be modified (see Table 5) to include HRD information for all temporal layers.
• Picture timing SEI message For temporal SVC, frame rate is different for each temporal layer. Since a lower temporal layer can serve as dependent layer for the higher temporal layer, which means one NAL unit with given temporaljevel may work for several frame rates.
• the picture timing SEI message should be modified (see Table 6) to include HRD information for all temporal layers.
• 3.4In the VUI message when timing_info_present_flag is true, we should consider to modify num_units_in_tick, time_scale and fixed_frame_rate_flag to reflect correct frame rate information (see Table 4).
• Tables 3-6 are taken from the AVC standard, and relate to the AVC-HRD. The additions to the AVC standard Tables are shown using italics. There are no deletions from the AVC standard Tables, although other implementations may have deletions. The bolded terms are the syntax that are actually sent in the bitstreams. As can be seen, each of Tables 3-6 shows that the AVC standard has been modified by introducing an "if-then" loop that tests the variable "profile_idc".
• Table 3 defines bit rate and cpb (coded picture buffer) size for each checking point/layer.
• Table 4 defines frame rate for each temporal layer.
• Table 5 defines initial cpb delay and initial dpb delay for each checking point /layer.
• Table 6 defines cpb remove delay and dpb (decoded picture buffer) output delay for each checking point/layer.
• HRD rules the same as is done for AVC, to test if the bitstream is compliant.
• numjayer_minus1 plus 1 indicates the number of scalable layers or presentation points supported by the bitstream referring to the same seq_parameter_set_id in the SPS which contains this hrd_parameters().
• dependency_id [ i ] indicates the dependency (CGS) layer of scalable layer i. It is equal to the dependency_id of the NAL units in the scalable layer i.
• temporal_level[ i ] indicates the temporal layer of scalable layer i. It is equal to the temporaljevel of the NAL units in the scalable layer i.
• quality_level[ i ] indicates the quality layer of scalable layer i. It is equal to the qualityjevel of the NAL units in the scalable layer i.
• cpb_cnt_minus1[i] bit_rate_scale [i]
• cpb_size_scale [i] bit_rate_value_minus1[i][ SchedSelldx]
• bit_rate_value_minus1[i][ SchedSelldx] bit_rate_value_minus1[i][ SchedSelldx]
• cbr_flag[i][ SchedSelldx ] initiaLcpb_removaLdelay_length_minus1[i]
• time_offset_length[i] are equal to their corresponding value for the scalable layer i, respectively.
• num_temporaljayer_minus1 plus 1 indicates the number of temporal layers supported by the bitstream. It is equal to the maximal temporaljevel of the NAL units in the bitstream. timing_info_present_flag[i], num_units_in_tick[i], time_scale[i], fixed_frame_rate_flag[i] are equal to their corresponding value for the temporal layer i, respectively.
• num_layer_minus1 plus 1 indicates the number of scalable layers or presentation points supported by the bitstream referring to the same seq_parameter_set_id in the buffer_period SEI message.
• dependency_id[ i ] indicates the dependency (CGS) layer of scalable layer i. It is equal to the dependency_id of the NAL units in the scalable layer i.
• temporaljevel[ i ] indicates the temporal layer of scalable layer i. It is equal to the temporaljevel of the NAL units in the scalable layer i.
• quality_level[ i ] indicates the quality layer of scalable layer i. It is equal to the qualityjevel of the NAL units in the scalable layer i.
• initial_cpb_removal_delay[i][ SchedSelldx ] initial_cpb_removal_delay_offset[i][ SchedSelldx ] are equal to their corresponding value for the scalable layer i, respectively.
• num_temporal_layer_minus1 plus 1 indicates the number of temporal layers which depends on the NAL unit whose access unit associated with this picture timing SEI message.
• temporal_layer[ i ] indicates the temporal level of temporal layer i.
• cpb_removal_delay[i] are equal to their corresponding value for the temporal layer i, respectively.
• bit rate includes the bits for scalable layer i and its dependent layers.
• implementations may be in the form of a method, an apparatus, or a program of instructions, for example, and may be implemented using hardware, software, or a combination, for example.

Landscapes

• Engineering & Computer Science (AREA)
• Multimedia (AREA)
• Signal Processing (AREA)
• Compression Or Coding Systems Of Tv Signals (AREA)

Priority Applications (9)

Applications Claiming Priority (2)

Publications (2)

Family

ID=39537702

Family Applications (1)

Country Status (13)

Cited By (13)

Families Citing this family (35)

Citations (1)

Family Cites Families (14)

• 2007
  • 2007-12-21 MY MYPI20092800A patent/MY162367A/en unknown
  • 2007-12-21 RU RU2009129945/07A patent/RU2518904C2/ru active
  • 2007-12-21 CN CN200780048697.8A patent/CN101578867B/zh active Active
  • 2007-12-21 AU AU2007342468A patent/AU2007342468B2/en active Active
  • 2007-12-21 BR BRPI0720702 patent/BRPI0720702A2/pt not_active Application Discontinuation
  • 2007-12-21 US US12/448,510 patent/US9179157B2/en active Active
  • 2007-12-21 EP EP07853463A patent/EP2116065A2/en not_active Ceased
  • 2007-12-21 ZA ZA200904019A patent/ZA200904019B/xx unknown
  • 2007-12-21 WO PCT/US2007/026240 patent/WO2008085433A2/en not_active Ceased
  • 2007-12-21 JP JP2009544848A patent/JP5535646B2/ja active Active
  • 2007-12-21 KR KR1020097013979A patent/KR101464011B1/ko active Active
  • 2007-12-21 MX MX2009007272A patent/MX2009007272A/es active IP Right Grant
• 2008
  • 2008-01-04 TW TW97100478A patent/TWI428021B/zh active
• 2014
  • 2014-01-06 JP JP2014000543A patent/JP5658381B2/ja active Active
  • 2014-11-27 JP JP2014239710A patent/JP5908055B2/ja active Active

Patent Citations (1)

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events