Method and apparatus for encoding video in consideration of scanning order of coding units having hierarchical structure, and method and apparatus for decoding video in consideration of scanning order of coding units having hierarchical structure

• US 8,532,185 B2
• Filed: 08/13/2010
• Issued: 09/10/2013
• Est. Priority Date: 08/14/2009
• Status: Active Grant

• Current Assignee: Samsung Electronics Co. Ltd.
• Original Assignee: Samsung Electronics Co. Ltd.
• Inventors: Jung, Hae-kyung, Cheon, Min-su, Min, Jung-hye, Kim, Il-koo
• Primary Examiner(s): Perungavoor, Sath V
• Assistant Examiner(s): PARIKH, DAKSHESH D
• Application Number:
  US12/856,028
• Publication Number:
  US 20110038412A1
• Time in Patent Office: 1,124 Days
• Field of Search: None
• US Class Current: 375/240.12
• CPC Class Codes: H04N 19/107 between spatial and temporal predictive coding, e.g. picture refresh
• CPC Class Codes: H04N 19/119 Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks
• CPC Class Codes: H04N 19/122 Selection of transform size, e.g. 8x8 or 2x4x8 DCT; Selection of sub-band transforms of varying structure or type
• CPC Class Codes: H04N 19/129 Scanning of coding units, e.g. zig-zag scan of transform coefficients or flexible macroblock ordering [FMO]
• CPC Class Codes: H04N 19/132 Sampling, masking or truncation of coding units, e.g. adaptive resampling, frame skipping, frame interpolation or high-frequency transform coefficient masking
• CPC Class Codes: H04N 19/146 Data rate or code amount at the encoder output
• CPC Class Codes: H04N 19/147 according to rate distortion criteria rate-distortion as a criterion for motion estimation H04N19/567
• CPC Class Codes: H04N 19/157 Assigned coding mode, i.e. the coding mode being predefined or preselected to be further used for selection of another element or parameter
• CPC Class Codes: H04N 19/167 Position within a video image, e.g. region of interest [ROI]
• CPC Class Codes: H04N 19/176 the region being a block, e.g. a macroblock
• CPC Class Codes: H04N 19/187 the unit being a scalable video layer
• CPC Class Codes: H04N 19/198 including smoothing of a sequence of encoding parameters, e.g. by averaging, by choice of the maximum, minimum or median value
• CPC Class Codes: H04N 19/23 with coding of regions that are present throughout a whole video segment, e.g. sprites, background or mosaic
• CPC Class Codes: H04N 19/30 using hierarchical techniques, e.g. scalability H04N19/63 takes precedence
• CPC Class Codes: H04N 19/50 using predictive coding H04N19/61 takes precedence
• CPC Class Codes: H04N 19/52 by predictive encoding
• CPC Class Codes: H04N 19/593 involving spatial prediction techniques
• CPC Class Codes: H04N 19/61 in combination with predictive coding
• CPC Class Codes: H04N 19/70 characterised by syntax aspects related to video coding, e.g. related to compression standards
• CPC Class Codes: H04N 19/88 involving rearrangement of data among different coding units, e.g. shuffling, interleaving, scrambling or permutation of pixel data or permutation of transform coefficient data among different blocks
• CPC Class Codes: H04N 19/96 : Tree coding, e.g. quad-tree coding

Abstract

A method and apparatus for decoding a video and a method and apparatus for encoding a video are provided. The method for decoding the video includes: receiving and parsing a bitstream of an encoded video; extracting, from the bitstream, encoded image data of a current picture of the encoded video assigned to a maximum coding unit, and information about a coded depth and an encoding mode according to the maximum coding unit; and decoding the encoded image data for the maximum coding unit based on the information about the coded depth and the encoding mode for the maximum coding unit, in consideration of a raster scanning order for the maximum coding unit and a zigzag scanning order for coding units of the maximum coding unit according to depths.

Claims

1. A method of decoding a video, the method comprising:

receiving and parsing a bitstream of an encoded video;

extracting, from the bitstream, encoded image data of a current picture of the encoded video assigned to a maximum coding unit of the current picture, and information about a coded depth and an encoding mode according to the maximum coding unit, wherein the maximum coding unit is a coding unit of the current picture having a maximum size; and

decoding the encoded image data for the maximum coding unit based on the information about the coded depth and the encoding mode for the maximum coding unit, in consideration of a raster scanning order for the maximum coding unit and a zigzag scanning order for coding units of the maximum coding unit according to depths,

wherein the maximum coding unit is spatially split into at least one coding unit according to at least one depth, and as a depth deepens from an uppermost depth, the maximum coding unit is hierarchically split from the maximum coding unit corresponding to the uppermost depth to at least one minimum coding unit corresponding to a lowermost depth of the at least one depth, wherein the at least one coding unit is a deeper coding unit.

2. The method of claim 1, wherein the decoding the encoded image data comprises analyzing a hierarchical structure of at least one deeper coding unit for the maximum coding unit by using the information about the coded depth and the encoding mode for the maximum coding unit.

3. The method of claim 1, wherein the decoding the encoded image data comprises searching for a location of the maximum coding unit, based on an address of the maximum coding unit according to the raster scanning order.

4. The method of claim 1, wherein the decoding the encoded image data comprises searching for a location of a minimum unit, of the at least one minimum unit, based on an index of the minimum unit according to a zigzag scanning order for the maximum coding unit.

5. The method of claim 1, wherein the decoding the encoded image data comprises searching for a location of a minimum unit, of the at least one minimum unit, based on an index of the minimum unit according to a raster scanning order for the maximum coding unit.

6. The method of claim 1, wherein the decoding the encoded image data comprises mutually transforming an index of the at least one minimum unit according to a zigzag scanning order and an index of the at least one minimum unit according to a raster scanning order to each other, for the maximum coding unit.

7. The method of claim 1, wherein a location of the maximum coding unit is expressed as a location of a pixel located on a left upper end of the maximum coding unit that is relative to a location of a sample located on a left upper end of the current picture.

8. The method of claim 1, wherein a location of a minimum unit, of the at least one minimum unit, is expressed as a location of a pixel located on a left upper end of the minimum unit that is relative to a location of a sample located on a left upper end of the maximum coding unit.

9. The method of claim 1, wherein the decoding the encoded image data comprises referring to neighborhood information by checking usability of the neighborhood information, in consideration of a scanning order of the maximum coding unit, a prediction unit, a partition, and a minimum unit of the at least one minimum unit.

10. The method of claim 1, wherein the decoding the encoded image data comprises checking usability of the maximum coding unit.

11. The method of claim 10, wherein in a case other than a case where the maximum coding unit is not included in the current picture, a case where the maximum coding unit is not included in a current slice, and a case where an address of the maximum coding unit is later than an address of a current maximum coding unit in terms of a scanning order, data corresponding to the maximum coding unit is useable.

12. The method of claim 1, wherein the decoding the encoded image data further comprises checking usability of a deeper coding unit of the maximum coding unit.

13. The method of claim 12, wherein in a case other than a case where the maximum coding unit is not included in the current picture, a case where the maximum coding unit is not included in a current slice, a case where an address of the maximum coding unit is later than an address of a current maximum coding unit in terms of a scanning order, and a case where an index of a minimum unit on a left upper side of a deeper coding unit according to a zigzag scanning order is later in terms of a scanning order than an index of a current minimum unit according to a zigzag scanning order, data corresponding to the deeper coding unit is useable.

14. The method of claim 1, wherein the decoding the encoded image data comprises checking at least one maximum coding unit adjacent to the maximum coding unit and usability of the at least one adjacent maximum coding unit.

15. The method of claim 14, wherein the at least one maximum coding unit adjacent to the maximum coding unit comprises at least one of a maximum coding unit on a left side of the maximum coding unit, a maximum coding unit on an upper side of the maximum coding unit, a maximum coding unit on a right upper side of the maximum coding unit, and a maximum coding unit on a left upper side of the maximum coding unit.

16. The method of claim 1, wherein the decoding the encoded image data further comprises checking at least one minimum unit adjacent to a current prediction unit included in the maximum coding unit and usability of the at least one adjacent minimum unit.

17. The method of claim 16, wherein the at least one minimum unit adjacent to the current prediction unit comprises at least one of a minimum unit on a left side of the current prediction unit, a minimum unit on an upper side of the current prediction unit, a minimum unit on a right upper side of the current prediction unit, a minimum unit on a left upper side of the current prediction unit, and a minimum unit on a left lower side of the current prediction unit.

18. The method of claim 1, wherein the decoding the encoded image data further comprises checking a location and usability of at least one boundary adjacent to the maximum coding unit.

19. The method of claim 18, wherein the at least one boundary adjacent to the maximum coding unit comprises at least one of a maximum coding unit on a left side of the maximum coding unit, a maximum coding unit on an upper side of the maximum coding unit, a maximum coding unit on a right upper side of the maximum coding unit, and a maximum coding unit on a left upper side of the maximum coding unit.

20. The method of claim 1, wherein a minimum unit, of the at least one minimum unit, is assigned with encoding information comprising at least one of information about a corresponding deeper coding unit, information about splitting of the corresponding deeper coding unit into a prediction unit or a partition, and information about a prediction mode of the prediction unit or the partition.

21. The method of claim 20, wherein the decoding the encoded image data comprises checking usability of a deeper coding unit or a prediction unit that includes the minimum unit, based on the encoding information assigned to the minimum unit.

22. The method of claim 1, wherein:

the maximum coding unit comprises a plurality of coding units; and

when a first coding unit, of the plurality of coding units, which is adjacent to a second coding unit, of the plurality of coding units, is scanned later than the second coding unit according to a raster scanning order and the first coding unit is scanned earlier than the second coding unit according to a zigzag scanning order, the first coding unit is referenced to decode the second coding unit.

23. The method of claim 22, wherein when the first coding unit is on a left lower side of the second coding unit, the first coding unit is referenced to decode the second coding unit.

24. The method of claim 23, wherein when the first coding unit is on a left lower side of the second coding unit, a right boundary of the first coding unit is referenced to decode the second coding unit.

26. A non-transitory computer readable recording medium having recorded thereon a program for executing the method of claim 1.

25. An apparatus for decoding a video, the apparatus comprising:

a receiver which receives and parses a bitstream of an encoded video;

an image data and encoding information extractor which extracts, from the bitstream, encoded image data of a current picture of the encoded video assigned to a maximum coding unit of the current picture, and information about a coded depth and an encoding mode according to the maximum coding unit, wherein the maximum coding unit is a coding unit of the current picture having a maximum size; and

an image data decoder which decodes the encoded image data for the maximum coding unit based on the information about the coded depth and the encoding mode for the maximum coding unit, in consideration of a raster scanning order for the maximum coding unit and a zigzag scanning order for coding units of the maximum coding unit according to depths,

wherein the maximum coding unit is spatially split into at least one coding unit according to at least one depth, and as a depth deepens from an uppermost depth, the maximum coding unit is hierarchically split from the maximum coding unit corresponding to the uppermost depth to at least one minimum coding unit corresponding to a lowermost depth of the at least one depth.

27. A method of decoding a video, the method comprising:

extracting, from a bitstream, encoded image data of a current picture of the video assigned to a maximum coding unit of the current picture, and information about a coded depth according to the maximum coding unit, wherein the maximum coding unit is a coding unit of the current picture having a maximum size; and

decoding the encoded image data for the maximum coding unit based on the information about the coded depth, in consideration of a raster scanning order for the maximum coding unit and a zigzag scanning order for coding units of the maximum coding unit according to depths,

wherein the maximum coding unit is spatially split into at least one coding unit according to at least one depth, and as a depth deepens from an uppermost depth, the maximum coding unit is hierarchically split from the maximum coding unit corresponding to the uppermost depth to at least one minimum coding unit corresponding to a lowermost depth of the at least one depth, wherein the at least one coding unit is a deeper coding unit.

28. A non-transitory computer readable recording medium having recorded thereon a program for executing the method of claim 27.