AU2015203386A1

AU2015203386A1 - Method and apparatus for encoding video and method and apparatus for decoding video by considering skip and split order

Info

Publication number: AU2015203386A1
Application number: AU2015203386A
Authority: AU
Inventors: Min-Su Cheon; Hae-Kyung Jung; Il-Koo Kim; Sun-Il Lee; Jung-Hye Min
Original assignee: Samsung Electronics Co Ltd
Current assignee: Samsung Electronics Co Ltd
Priority date: 2010-01-14
Filing date: 2015-06-19
Publication date: 2015-07-09
Anticipated expiration: 2031-01-13
Also published as: AU2015203385B2; AU2015203386B2; AU2015203387B2; AU2015203383A1; AU2015203383B2; AU2015203385A1; AU2015203387A1

Abstract

Abstract A method of encoding a video includes: determining coding units having a tree structure including coding units of coded depths and determining encoding modes for the coding units of the coded depths by performing encoding based on coding units according to depths, the coding units according to depths obtained by hierarchically splitting the maximum coding unit as a depth deepens; and outputting information indicating an order of split information and skip mode information which is selectively determined for the coding units according to depths, and information about the encoding modes for the coding units of the coded depths including the split information and the skip mode information which are arranged according to the order.

Description

1 Description Title of Invention: METHOD AND APPARATUS FOR ENCODING VIDEO AND METHOD AND APPARATUS FOR DECODING VIDEO BY CONSIDERING SKIP AND SPLIT ORDER [1] The present application is a divisional application from Australian Patent Application No. 2011205940, the entire disclosure of which is incorporated herein by reference. Technical Field [1a] Apparatuses and methods consistent with exemplary embodiments relate to encoding and decoding a video. Background Art [2] As hardware for reproducing and storing high resolution or high quality video content is being developed and supplied, a need for a video codec for effectively encoding or decoding the high resolution or high quality video content is increasing. In a related art video codec, a video is encoded according to a limited encoding method based on a macroblock having a predetermined size. Disclosure of Invention Technical Problem [3] Exemplary embodiments provide encoding and decoding of a video by considering a skip and split order of a coding unit according to characteristics of a data unit. Solution to Problem [4] According to an aspect of an exemplary embodiment, there is provided a method of encoding a video by considering a skip and split order, the method including: splitting a picture into a maximum coding unit including coding units being data units in which the picture is encoded; for the maximum coding unit, determining coding units having a tree structure including coding units of coded depths and determining encoding modes for the coding units of coded depths by performing encoding based on coding units according to depths, the coding units according to depths obtained by hierarchically splitting the maximum coding unit as a depth deepens and the depths being proportional to a number of times the maximum coding unit is split; and outputting information about a maximum coding unit size and, for the maximum coding unit, information indicating an order of split information and skip mode information which is selectively determined for the coding units according to depths, information about the encoding modes for the coding units of the coded depths including the split information and the skip mode information which are arranged according to the order, and encoded video data. Advantageous Effects of Invention [5] Coding units having the tree structure are formed by determining coding units having an optimum shape and an optimum size for each maximum coding unit, based on the size of the maximum coding unit and the maximum depth determined considering characteristics of the cunrent picture. Also, since encoding may be performed on each maximum coding unit by using any one of various prediction modes and trans formations, an optimum encoding mode may be detennined considering characteristics of the coding unit of various image sizes. [6] An order of skip mode information and split information are determined by con sidering a data unit, an encoding mode, or the like. Also, the order of the skip mode in formation and the split information may be determined by considering a total. bit number of the skip mode information and the split information, and a frequency of oc currence of a skip mode in encoding and decoding of video data. Since the order of the skip mode information and the split information of coding units according to depths may be set, encoded data transmisson efficiency may be further improved. Brief Description of Drawings 17] FIG. 1 is a block diagram of an apparatus for encoding a video, according to an exemplary embodiment; [8] FIG. 2 is a block diagram of an apparatus for decoding a video, according to an exemplary embodiment; [91 FIG. 3 is a diagram for describing a concept of coding units according to an exemplary embodiment: [101 FIG. 4 is a block diagram of an image encoder based on coding units according to an exemplary embodiment; [11] FIG. 5 is a block diagram of an image decoder based on coding units according to an exemplary embodiment; [12] FIG, 6 is a diagram illustrating deeper coding units according to depths, and a prediction unit according to an exemplary embodiment; [131 FIG. 7 is a diagram. for describing a relationship between a coding unit and trans formation units, according to an exemplary embodiment; [141 FIG. 8 is a diagram for describing encoding information of coding units corre sponding to a coded depth. according to an exemplary embodiment; [151 FIG. 9 is a diagram of deeper coding units according to depths, according to an exemplary embodiment: [16] FIGS. 10 through 12 are diagrams for describing a relationship between coding units, prediction units, and transformation units, according to an exemplary embodiment; [17] FIG. 13 is a diagram for describing a relationship between a coding unit, a prediction unit or a partition, and a transformation unit, according to encoding mode information 3 of Table 1; [18] FIG. 14 is a flowchart illustrating a method of encoding a video, according to an exemplary embodiment; [19] FIG. 15 is a flowchart illustrating a method of decoding a video, according to an exemplary embodiment; [20] FIG. 16 is a block diagram illustrating an apparatus for encoding a video by considering a skip and split order, according to an exemplary embodiment; [21] FIG. 17 is a block diagram illustrating an apparatus for decoding a video by considering a skip and split order, according to an exemplary embodiment; [22] FIG. 18 illustrates coding units according to coded depths in a maximum coding unit, according to an exemplary embodiment; [23] FIGS. 19 through 21 are flowcharts illustrating methods of encoding and decoding skip information and split information, according to various exemplary embodiments; [24] FIG. 22 is a flowchart illustrating a method of encoding a video by considering a skip and split order, according to an exemplary embodiment; and [25] FIG. 23 is a flowchart illustrating a method of decoding a video by considering a skip and split order, according to an exemplary embodiment. Best Mode for Carrying out the Invention [25a] According a first aspect, the present invention provides a method of decoding a video, the method comprising: receiving a bitstream of encoded video; extracting, from the bitstream, split information of a coding unit in a maximum coding unit of a picture; and when the split information indicates a split for a current depth, splitting a coding unit of the current depth, independently from neighboring coding units, into coding units of a lower depth, and when the split information indicates a non-split for the current depth, determining at least one partition from the coding unit of the current depth and decoding the coding unit of the current depth by performing a prediction based on the at least one partition, wherein, when skip information for the coding unit of the current depth indicates a skip mode, the coding unit of the current depth is decoded by performing a prediction in the skip mode based on a partition having a size equal to a size of the coding unit of the current depth; and when the skip information for the coding unit of the current depth does not indicate the skip mode, the coding unit of the current depth is decoded by performing a prediction in a prediction mode indicated by prediction mode information obtained from the bitstream, wherein the picture is split into a plurality of maximum coding units according to information about the maximum size of the coding unit obtained from the bitstream. [26] There may be provided a method of encoding a video by considering a skip and split order, the method including: splitting a picture into a maximum coding unit including coding units 4 being data units in which the picture is encoded; for the maximum coding unit, determining coding units having a tree structure including coding units of coded depths and determining encoding modes for the coding units of coded depths by performing encoding based on coding units according to depths, the coding units according to depths obtained by hierarchically splitting the maximum coding unit as a depth deepens and the depths being proportional to a number of times the maximum coding unit is split; and outputting information about a maximum coding unit size and, for the maximum coding unit, information indicating an order of split information and skip mode information which is selectively determined for the coding units according to depths, information about the encoding modes for the coding units of the coded depths including the split information and the skip mode information which are arranged according to the order, and encoded video data. [27] A coding unit may be characterized by a maximum size and a depth. The depth denotes the number of times a coding unit is hierarchically split, and as the depth deepens, deeper coding units according to depths may be split from a maximum coding unit to a minimum coding unit. A depth of the maximum coding unit may be an uppermost depth, and a depth of the minimum coding unit may be a lowermost depth. Since sizes of coding units according to depths decrease as the depth of the maximum 5 coding unit deepens, a coding unit of an upper depth may include a plurality of coding units of lower depths. [28] According to a maximum size of a coding unit, image data of a current picture may be split into maximum coding units,. and each of the maximum coding units may include coding units split according to depths. Since a maximum coding unit is split according to depths, image data of a. spatial domain included in the maximum coding unit may be hierarchically classified according to depths. [29] A maximum depth and a maximum size of a coding unit, which limit a total number of times a height and a width of the maximum coding unit are hierarchically split, nay be predeternined. [30] The order of the split information and the skip mode information which is selectively determined for the codng units according to depths maybe determined by at least one of an image sequence to which the coding units according to depths belong, a slice, a slice type according to aprediction direction, and a quantization parameter of a data unit, [31] The order of the split information and the skip mode information which is selectively determined for the coding units according to depths may be determined by the depths of the coding units in the maximum coding unit. [32] The order of the split information and tie skip mode information of the coding units according to depths may be determined in such a manner that if a coding unit is the maximum coding unit, the skip mode information precedes the split information, and if the coding unit is not the maximum coding unit, the split information precedes the skip mode information. [33] There may be provided a method of decoding a video by considering a skip and split order, the method including receiving and parsing a bitstream of encoded video data; extracting, from the bitstream, information about a maximum size of a coding unit being a data unit in which a picture is decoded. information about an order of split information and skip mode information about coding units according to depthsand, according to the order of the split information and the skip mode information, information about a coded depth and an encoding mode and encoded video data according to a maximum coding unit of the picture; and based on the extracted information about the maximum size of the coding unit and the information about the coded depth and the encoding mode, decoding the encoded video data of the picture according to coding units having a tree structure including coding units of coded depths. [341 The extracting may include: if a coding unit is the maximum coding unit, according to the order of the split information and the skip mode information, determining whether 6 the maximum coding unit is predicted in a skip mode according to the skip mode information before determining whether the maxinum coding unit is split accord ding to the split inform mation; if the coding unit is not the maximum coding.unit, determining whether the coding unit is split according to the split information before determining whether the coding unit is predicted in a skip mode according to the skip mode information; and extracting the information about the coded depth and the encoding mode of the coded depth and the encoded video data according to coding units of the coded depth. [351 in the extracting, if one piece of split and skip information obtained by combining the split information and the skip mode information for coding unit according to depths is extracted, the coding units according to depths may be predicted in a skip mode without being split, and if the split information or the skip mode information for the coding units according to depths is extracted., the coding to depths may not be split or may not be predicted in a skip mode. [361 There may be provided an apparatus for encoding a video by considering a skip and split order, the apparatus including: a maximum coding unit splitter which splits a picture into a maximum coding unit, including coding units being data units in which the picture is encoded; a coding unit and encoding mode determiner which, for the maximum coding unit, determines coding units having a tree structure including coding units of coded depths and determines encoding modes for the coding units of the coded depths by performing encoding based on the coding uits according to depths, the coding units according to depths obtained by hierarchically splitting the maximum coding unit as a depth deepens; and an output unit which outputs information about a maximum coding unit size and, for the maximum coding unit, information indicating an order of split information and skip mode information which is selectively determined for the coding units according to depths. information about the encoding modes of the coding units of the coded depths including the split information and the skip mode information which are arranged according to the order, and encoded video data [37] There may be provided an apparatus for decoding a video by considering a skip and split order, the apparatus including: a eceiv er which receives and parse.s a bitstream of encoded video data: a data extractor which extracts, from the bitstrean information about a maximum size of a coding unit being a data unit in which a picture is decoded, information about an order of split information and skip mode information of coding units according to depths, and, according to the order of the split information and the skip mode information, information about a coded depth and an encoding mode according to a maximum coding unit of the picture; and a decoder which, based on the information about the maximum size of the coding unit and the information about the 6a coded depth and the encoding mode, decodes the encoded video data of the picture according to coding units having a tree structure including coding units of coded depths, [38] There may be provided a computer-readable recording medium having embodied thercon a program for exceuting the encoding method. Also, according to an aspect of another exemplary embodiment, there is provided a cotmputer-readable recording medium having embodied thereon a program for executing the decodbig method. Mode for the Invention [39] An apparatus for encoding a video. n apparatus for decoding a video, a method of encoding a video, and a method of decoding a video according to exemplary embodiments will be explained with reference to FIGS. 1 through 23. Encoding and decoding of a video based on a spatially hierarchical data unit according to one or more exemplary embodiments will be explained with reference to FIGS. 1 through 15, and encoding and decoding of a video considering an order of skip and split according to one. or more exemplary embodiments will be explained with reference to FIGS. 16 through 23. [40] Exemplary embodiments will now be described more fully with reference to the accompanyig drawings [41] 1lereinafter, a 'coding unit is an encoding data unit in which the image data is encoded at an encoder side; for example an encoding apparatus including a processor and an encoder and an encoded data unit in which the encoded iniagce data is decoded at a decoder side, for example a decoding apparatus including a processor and a decoder, according to the exemplary embodiments. [42] Hereinafter, an image' may denote a still image for a video or a moving image. that is, the video itself. [43] An apparatus for encoding a video, an apparatus for decoding a video, a method of encoding a video, and a method of decoding a video according to exemplary embodiments will be explained with reference to FIGS. 1 through 15. [44] FIG. I is a block diagram of an apparatus 1.00 for encoding a video, according to an exemplary embodiment. [45] The apparatus 100 includes a maximum coding unit splitter 110, a coding unit determiner 120, and an output unit 130. [46] The maximum coding unit splitter 110 may split a current picture based on a maximum coding unit for the current picture of an image. If the current picture is larger than the maximum coding unit, image data of the current picture may be split into the at least one maximum coding unit. The maximum coding unit according to an exemplary embodiment may be a data unit having a size of 32x32, 64x64, 1.28x 1.28, 256x256, etc.. wherein a shape of the data unit is a square having a width and length in squares of 2. The image data may be output to the coding unit determiner 120 according to the at least one maximum coding unit. [47] A coding unit according to an exemplary embodiment may be characterized by a maxinum size and a depth. The depth denotes a number of times the coding unit is spatially split from there maximum coding unit, and as the depth deepens or increases, deeper coding units according to depths may be split from the maximum coding unit to a minimum coding unit. A depth of the maximum coding unit is an uppermost depth and a depth of the minimum coding unit is a lowermost depth. Since a size of a. coding unit corresponding to each depth decreases as the depth of the maximum coding unit deepens. a coding unit corresponding to an upper depth may include a plurality of coding units corresponding to lower depths. [481 As described above, the image data of the current picture is split into the maximum coding units according to a maximum size of the coding unit, and each of the maximum coding units may include deeper coding units that are split according to depths, Since the maximum coding unit according to an exemplary embodiment is split according to depths, the image data of a spatial domain included in the maximum coding unit may be hierarchically classified according to depths. [491 A maximum depth and a maximum size of a coding unit, which limit the total number of times a height and a width of the maximum coding unit are hierarchically split may be predetermined. [501 The coding unit determiner 120 encodes at least one split region obtained by splitting a region of the maximum coding unit according to depths, and determines a depth to output a finally encoded image data according to the at least one split region. In other words, the coding unit determiner 1-20 determines a coded depth by encoding the image data in the deeper coding units according to depths, according to the maximum coding unit of the current picture, and selecting a depth having the least encoding error. Thus, the encoded image data of the coding unit corresponding to the determined coded depth are finally output. Also, the coding units corresponding to the coded depth may be regarded as encoded coding units. [51] The determined coded depth and the encoded image data according to the determined coded depth are output to the output unit 130. [52] The image data in the maximum coding unit is encoded based on the deeper coding units corresponding to at least one depth equal to or below the maximum depth, and results of encoding the image data are compared based on each of the deeper coding units. A depth having the least encoding error may be selected after comparing encoding errors of the deeper coding units. At least one coded depth may be selected for each maximum coding unit. [531 The size of the maximum coding unit is split as a coding unit is hierarchically split according to depths, and as the number of coding units increases. Also, even if coding units corresponding to same depth in one maximum coding unit, each of the coding units corresponding to the same depth may be split to a lower depth by measuring an encoding error of the image data of the each coding unit, separately. Accordingly, even when image data is included in one maximum coding unit, the image data is split to regions according to the depths, the encoding errors may differ according to regions in the one maximurn coding unite, and thus the coded depths may differ according to regions in the image data. Thus, one or more coded depths may be determined in one maximum coding unit, and the image data of the maximum coding unit may be divided according to coding units of at least one coded depth. [541 Accordingly, the coding unit determiner 120 may determine coding units having a tree structure included in the maximum coding unit. The "coding units having a tree structure' according to an exemplary embodiment include coding units corresponding to a depth determined to be the coded depth, from among all deeper coding units included in the maxImum coding unit. A coding unit of a coded depth may be hierar chically determined according to depths in the same region of the maximum coding unit, and may be independently determined in different regions. Similarly, a coded depth in a current region may be independently determined from a coded depth in another region. [551 A maximum depth according to an exemplary embodiment is an index related to the number of splitting times from a maximum coding unit to a minimum coding unit A first maximum depth according to an exemplary embodiment may denote the total number of splitting times from the maximum coding unit to the minimum coding unit, A second maximum depth according to an exemplary embodiment may denote the total number of depth levels from the maximum coding unit to the minimum coding unit. For example, when a depth of the maximum coiling unit is 0, a depth of a coding unit, in which the maximum coding unit is split once, may be set to 1, and a depth of a coding unit, in which the maximum coding unit is split twice may be set to 2. Here, if the minimum coding unit is a coding unit in which the maximum coding unit is split four times, 5 depth levels of depths 0, 1 2, 3 and 4 exist, and thus the first maximum depth may be set to 4, and the second maximum depth may be set to 5. [56 Prediction encoding and transformation may be performed according to the maximum coding unit. The prediction encoding and the transformation are also performed based on the deeper coding units according to a depth equal to or depths less than the maximum depth, according to the maximum coding unit. Transformation may be performed according to method of orthogonal transfonnation or integer trans formation. [571 Since the number of deeper coding units increases whenever the maximum coding unit is split according to depths, encoding including the prediction encoding and the transformation is performed on all of the deeper coding unis generated as the depth deepens For convenience of description the predictionencoding and the trans formation will now be described based on a coding unit of a current depth, in a maximum coding unit. [58] The apparatus 100 may variably select a size or shape of a data unit for encoding the image data. In order to encode the image data. operations, such as prediction encoding, transformation, and entropy encoding, are performed, and at this time, the same data unit may be used for all operations or different data units may be used for each operation. [59] For example, the apparatus 100 may select not only a coding unit for encoding the image data, but also a data unit different from the coding unit so as to perform the prediction encoding on the image data in the coding unit, [60] In order to perform prediction encoding in the maximum coding unit, the prediction encoding may be performed based on a coding unit corresponding to a coded depth, i.e., based on a coding unit that is no longer split to coding units corresponding to a lower depth. lereinafter. the coding unit that is no longer split and becomes a basis unit for prediction encoding will now be referred to as a "prediction unit'. A partition obtained by splitting the prediction unit may include a data unit obtained by splitting at least one of a height and a width of the prediction unit. [61] For example, when a coding unit of 2Nx2N (where N is a positive integer) is no longer split and becomes a prediction unit of 2Nx2N, and a size of a partition may be 2Nx2N. 2NxN, Nx2N, or NxN. Examples of a partition type include symmetrical partitions that are obtained by symmetrically splitting a height or width of the prediction un it, partitions obtained by asymmetrically splitting the height or width of the prediction unit, such as I;n or n: 1, partitions that are obtained by geometrically splitting the prediction unit, and partitions having arbitrary shapes. [62] A prediction mode of the prediction unit may be at least one of an intra mode, a inter mode, and a skip mode. For example, the intra mode or the inter mode may be performed on the partition of 2Nx2N, 2NxN, Nx2N, or NxN. Also, the skip mode may be performed only on the partition of 2Nx2N. The encoding is independently performed on one prediction unit in a coding unit, thereby selecting a prediction mode having a least encoding error. [63] The apparatus 100 may also perform the transformation on the image data in a coding unit based not only on the coding unit for encoding the image data, but also based on a data unit that is different from the coding unit. [64J In order to perform the transformation in the coding unit, the transformation may be performed based on a data unit having a size smaller than or equal to the coding unit. For example, the data unit for the transformation may include a data unit for an intra mode and a data unit for an inter mode. [65] A data unit used as a base of the transformation will now be referred to as a 'trans formation unit. A transformation depth indicating the number of splitting times to reach the transformation unit by splitting the height and width of the coding unit may also be set in the transformation unit. For example. in a current coding unit of 2Nx2N, a transformation depth may be 0 when the size of a transformation unit is also 2Nx2N, may be I when each of the height and width of the current coding unit is split into two equal parts, totally split into 41 transformation units, and the size of the transformation unit is thus NxN, and may be 2 when each of the height and width of the current coding unit is spht into four equal parts, totally split into 42 transformation units and the size of the transformation unit is thus N/2xN/. For example, the transformation unit may be set according to a hierarchical tree structure, in which a transformation unit of an upper transformation depth is split into four transfornation units of a lower transformation depth according to the hierarchical characteristics of a transformation depth. [661 Similarly to the coding unit, the transformation unit in the coding unit may be re cursively split into smaller sized regions, so that the transformation unit may be de termined independently in units of regions. Thus, residual data in the coding unit may be divided according to the transformation having the tree structure according to trans formation depths. [671 Encoding information according to coding units corresponding to a coded depth requires not only information about the coded depth, but also information related to prediction encoding and transformation. Accordingly the coding unit determiner 120 not only determines a coded depth having a least encoding error, but also determines a partition type in a prediction unit, a prediction mode according to prediction units, and a size of a transformation unit for transfonnation. [681 Coding units according to a tree structure in a maximum coding unit and a method of determining a partition, according to exemplary emboditnents wil be described in detail later with reference to FIGS. 3 through 12. [69] The coding unit deterniner 120 may measure an encoding error of deeper coding units according to depths by using Rate-Distortion Optimization based on Lagrangian multipliers. [70] The output unit 130 outputs the image data of the maximum coding unit, which is encoded based on the at least one coded depth detennined by the coding unit determiner 120, and information about the encoding mode according to the coded depth, in bitstreams. [711 The encoded image data may be obtained by encoding residual data of an image. [721 The information about the encoding mode acceding to coded depth may include in formation about the coded depth, about the partition type in the prediction unit, the prediction mode, and the size of the transformation unit. [731 The information about the coded depth may be defined by using split information according to depths, which indicates whether encoding is perfored on coding units of a lower depth instead of a current depth. If the current depth of the current coding unit is the coded depth, image data in the current coding unit is encoded and output, and thus the split information may be, defined not to split the current coding unit to a lower depth. Alternatively, if the current depth of the current coding unit is not the coded depth, the encoding is performed on the coding unit of the lower depth, and thus the split information may be defined to split the current coding unit to obtain the coding units of the lower depth. [74] If the current depth is not the coded depth, encoding is performed on the coding unit that is split into the coding unit of the lower depth. Since at least one coding unit of the lower depth exists in one coding unit of the current depth, the encoding is repeatedly performed on each coding unit of the lower depth, and thus the encoding may be re cursively performed for the coding units having the same depth. [751 Since the coding units having a tree structure are determined for one maximum coding unit, and information about at least one encoding models determined for a coding unit of a coded depth, information about at least one encoding mode may be de termined for one maximum coding unit. Also, a coded depth of the image data of the maximum coding unit may be different according to locations since the image data is hierarchically split according to depths, and thus information about the coded depth and the encoding mode may be set for the image data. [761 Accordingly, the output unit 130 may assign encoding information about a corre sponding coded depth and an encoding mode to at least one of the coding unit, the prediction unit, and a minimum unit included in the maximum coding unit. [771 The minimu unit according to an exemplary embodiment is a rectangular data unit obtained by splitting the minimum coding unit constituting the lowermost depth by 4. Alternativelythe minimum unit may be a maximum rectangular data unit that may be included in all of the coding units. prediction units, partition units, and transformation units included in the maximum coding unit. [78] For example, the encoding information output through the output unit 130 may be classified into encoding information according to coding units, and encoding in formation according to prediction units. The encoding information according to the coding units may include the information about the prediction mode and about the size of the partitions. The encoding information according to the prediction units may include information about an estimated direction of an inter mode, about a reference image index of the inter mode, about a motion vector, about a chroma component of an intra mode, and about an interpolation method of the intra mode. Also, information about a maximum size of the coding unit defined according to pictures, slices, or GOPs, and information about a maximum depth may be inserted into SPS (Sequence Parameter Set) or a header of a bitstream. [79] In the apparatus 100, the deeper coding unit may be a coding unit obtained by dividing a height or width f a coding unit of an upper depth by two. In other words, when the size of the coding unit of the current depth is 2Nx2N, the size of the coding unit of the lower depth is NxN. Also, the coding unit of the current depth having the size of 2Nx2N may include maximum 4 of the coding unit of the lower depth. [80 Accordingly, the apparatus 100 may form the coding units having the tree stature by determining coding units having an optimum shape and an optimum size for each maximum coding unit, based on the size of the maximum coding unit and the maximum depth determined considering characteristics of the current picture. Also, since encoding may be performed on each maximum coding unit by using any one of various prediction modes and transformations, an optimum encoding mode may be de termined considering characteristics of the coding unit of various image sizes. [8 1] Thus, if an im( age having highs solution or large data amount is encoded in a con ventional macroblock, a number of macroblocks per picture excessively increases. Ac cordingly, a number of pieces of compressed information generated for each macroblock increases, and thus it is difficult to transmit the compressed information and data compression efficiency decreases, However, by using the apparatus 100, image compression efficiency may be increased since a coding unit is adjusted while considering characteristics of an image while increasing a maximum size of a coding unit while considering a size of the image. [82] FIG. 2 is a block diagram of an apparatus 200 for decoding a video, according to an exemplary embodiment. [831 The apparatus 200 includes a receiver 210, an image data and encoding information extractor 220, and an image data decoder 230. Defi nitions of various tears, such as a coding unit, a depth, a prediction unit, a transformation unit, and information about various encoding modes, for various operations of the apparatus 200 are identical to those described with reference to FIG. 1 and the apparatus 100. [84] The receiver 210 receives and parses a bitstream of an encoded video. The image data and encoding information extractor 220 extracts encoded image data for each coding unit from the parsed bitstream, wherein the coding units have a tree structure according to each maximum coding unit; and outputs the extracted image data to the image data decoder 230. The image data and encoding information extractor 220 may extract information about a maximum size of a coding unit of a current picture, from a header about the current picture or SPS. [85] Also, the image data and encoding information extractor 220 extracts information about a coded depth and an encoding mode for the coding units having a tree structure according to each maximum coding unit, from the parsed bitstream. The extracted in formation about the coded depth and the. encoding mode is output to the image data decoder 230. In other words. the image data in a bit stream is split into the maximum coding unit so that the image data decoder 230 decodes the image data for each maximum coding unit. [86J The information about the coded depth and the encoding mode according to the maximum coding unit may be set for information about at least one coding unit corre sponding to the coded depth, and information about an encoding mode may include in formation about a partition type of a corresponding coding unit corresponding to the coded depth, about a prediction mode, and a size of a transformation unit Also, splitting information according to depths may be extracted as the information about the coded depth. [87] The information about the coded depth and the encoding mode according to each maximum coding unit extracted by the image data and encoding information extractor 220 is information about a coded depth and an encoding mode determined to generate a minimum encoding error when an encoder, such as the apparatus 100, repeatedly performs encoding for each deeper coding unit according to depths according to each maximum coding unit. Accordingly, the apparatus 200 may restore an image by decoding the image data according to a coded depth and an encoding mode that generates the minimum encoding error. [88) Since encoding information about the coded depth and the encoding mode may be assigned to a predetermined data unit from among a corresponding coding unit, a prediction unit, and a mininuun unit, the inage data and encoding information extractor 220 may extract the information about the coded depth and the encoding mode according to the predetermined data units. The predetermined data units to which the same information about the coded depth and the encoding mode is assigned may be inferred to be the data units included in the same maximum coding unit [89] The image data decoder 230 restores the current picture by decoding the image data in each maximum coding unit based on the information about the coded depth and the encoding mode according to the maximum coding units. In other words, the image data decoder 230 may decode the encoded image data based on the extracted information about the partition type, the prediction mode, and the transformation unit for each coding unit from among the coding units having the tree structure included in each maximum coding unit. A decoding process may include a prediction including intra prediction and motion compensation, and a inverse transformation. Inverse trans formation may be performed according to method of inverse orthogonal transformation or inverse integer transformation, [901 The image data decoder 230 may perform intra prediction or motion compensation according to a partition and a prediction mode of each coding unit, based on the in formation about the partition type and the prediction node of the prediction unit of the coding unit according to coded depths. [91) Also, the image data decoder 230 may perform inverse transfonnation according to each transformation unit in the coding unit, based on the information about the size of the transformation unit of the coding unit according to coded depths, so as to perform the inverse transformation according to maximum coding units. [92J The image data decoder 230 may determine at least one coded depth of a current maximum coding unit by using split information according to depths. If the split in formation indicates that image data is no longer split in the current depth, the current depth is a coded depth. Accordingly, the image data decoder 230 may decode encoded data of at least one coding unit corresponding to the each coded depth in the current maximum coding unit by using the information about the partition type of the prediction unit, the prediction mode. and the size of the transformation unit for each coding unit corresponding to the coded depth, and output the image data of the current maximum coding unit. [93] In other words, data units containing the encoding information including the same split information may be gathered by observing the encoding infomation set assigned for the predetermined data unit from among the coding unit, the prediction unit, and the minimum unit. and the gathered data units may be considered to be one data unit to be decoded by the image data decoder 230 in the same encoding mode. [941 The apparatus 200 may obtain information about at least one coding unit that generates the minimum encoding error when encoding is recursively performed for each maximum coding unit, and may use the information to decode the current picture. In other words. the coding units having the tree structure determined to be the optimum coding units in each maximum coding unit may be decoded. Also. the maximum size of coding unit is determined considering resolution and a amount of image data. [95] Accordingly, even if image data has high resolution and a large amount of data, the image data. may be efficiently decoded and restored by using a size of a coding unit and an encoding mode, which are adaptively determined according to characteristics of the image data. by using information about an optimum encoding mode received from an encoder.

[961 A method of determining coding units having a tree structure, a prediction unit, and a transformation unit, according to an exemplary embodiment, will now be described with reference to FIGS. 3 through 13. [971 FIG. 3 is a diagran for describing a concept of coding units according to an exemplary embodiment [98] A size of a coding unit may be expressed in width x height, and may be 64x64, 32x32, 16, and 8x8, A coding unit of 64x64 may be split into partitions of 64x64, 64x32 32x64 or 32132, and a coding unit of 32x32 may be split into partitions of 32x32, 32x16. 16x32, or 16x16 a coding unit of 16x16 may be split into partitions of 16x16, 16x8, 8x16. or8x8. and acoding unit of 8x8 may be split into partitions of 8x8, 8x4, 4x8, or 4x4. [99j In video data 310, a resolution is 1920x1080, a maximum size of acoding unit is 64, and a maximum depth is 2. In video data 320, a resol ution is 920x 1080, a maximum size of a coding unit is 64, and a maximum depth is 3. In video data 330, a resolution is 352x28 a maximum size of a coding unit is 16. and a maximum depth is 1. The maximum depth shown in FIG. 3 denotes a total number of splits from a maximum coding unit to a minimum decoding unit. [100] If a resolution is high or a data amount is large, a maximum size of a coding unit may be large so as to not only increase encoding efficiency but also to accurately reflect characteristics of an image. Accordingly, the maximum size of the coding unit of the video data 310 and 320 having the higher resolution than the video data 330 may be 64. [101] Since the maximum depth of the video data 310 is 2, coding units 315 of the video data 310 may include a maximum coding unit having a long axis size of 64, and coding units having long axis sizes of 32 and 16 since depths are deepened to two layers by splitting the maximum coding unit twice. Meanwhile since the maximum depth of the video data 330 is 1 coding units 335 of the video data 330 may include a maximum coding unit having a long axis size of 16, and coding units having a long axis size of 8 since depths are deepened to one layer by splitting the maximum coding unit once. [1021 Since the maximum depth of the video data 320 is 3, coding units 325 of the video data 320 may include a maximum coding unit having a long axis siie of 64, and coding units having long axis sizes of 32, 16, and 8 since the depths are deepened to 3 layers by splitting the maximum coding unit three times. As a depth deepensi detailed in formation may be precisely expressed. [103] FIG. 4 is a block diagram of an image encoder 400 based on coding units, according to an exemplary embodiment. [104] The imaae encoder 400 performs operations of the coding unit determiner 120 of the apparatus 100 to encode image data. In other words, an intra predictor 410 performs intra prediction on coding units in an intra mode, from among a current frame 405, and a motion. estimator 420 and a motion compensator 425 perfonns inter estimation and motion compensation on coding units in an inter mode from among the current frame 405 by using the current frame 405, and a reference frame 495. [105] Data output from the intra predictor 410. the motion estimator 420, and the motion compensator 425 is output as a quantized transformation coefficient through a transformer 430 and a quantizer 440. The quantized transformation coefficient is restored as data in a spatial domain through an inverse quantizer 460 and an inverse transformer 470, and the restored data in the spatial domain is output as the reference frame 495 after being post-processed through a deblocking unit 480 and a loop filtering unit 490. The quantized transformation coefficient may be output as a bitstream 455 through an entropy encoder 450. [106] In order for the image encoder 400 to be applied in the apparatus 100, all elements of the image encoder 400, i.e., the intra predictor 410. the motion estimator 420. the motion compensator 425, the transformer 430, the quantizer 440, the entropy encoder 450, the inverse quantizer 460, the inverse transformer 470, the deblocking unit 480, and the loop filtering unit 490 perform operations based on each coding unit from among coding units having a tree structure while considering the maximum depth of each maximum coding unit [1071 Specifically, the intra predictor 410, the motion estimator 420, and the motion com pensator 425 determines partitions and a prediction mode of each coding uin it from among the coding units hav ing a tree structure while considering the maximum size and the maximum depth of a current maximum coding unit, and the transformer 430 determines the size of the transformation unit in each coding unit from among the coding units having a. tree structure [108] FIG, 5 is a block diagram of an image decoder 500 based on coding units according to an exemplary embodiment. [109] A parser 510 parses encoded image data to be decoded and information about encoding required for decoding from a bitstream 505. The encoded image data is output as inverse quantized data through an entropy decoder 520 and an inverse quantizer 530, and the inverse quantized data is restored to image data in a spatial domain through an inverse transformer 540. [110] An intra predictor 550 performs intra prediction on coding units in an intra mode with respect to the image data in the spatial domain, and a motion compensator 560 performs motion compensation on coding units in an inter mode by using a reference frame 585. [1111 The image data in the spatial domain, which passed through the intra predictor 550 and the motion compensator 560, may be output as a restored frame 595 after being post-processed through a deblocking unit 570 and a loop filtering unit 580. Also, the image data that is post-processed through the deblocking unit 570 and the loop filtering unit 580 may be output as the reference frame 585. [1121 In order to decode the image data in the image data decoder 230 of the apparatus 200, the image decoder 500 may perform operations that are performed after the parser 510. [113] In order for the image decoder 500 to be applied in the apparatus 200, all elements of the image decoder 500, i.e., the parser 5 10, the entropy decoder 520, the inverse quantizer 530, the inverse transformer 540, the intra predictor 550. the motion com pensator 560, the deblocking unit 570, and the ioop filtering unit 580 perform op erations based on coding units having a tree structure for each maximum coding unit. [1 14] Specifically, the intra predictor 550 and the motion compensator 560 perform op erations based on partitions and a prediction mode foreach of the coding units having a tree structure, and the inverse transfonner 540 perform operations based on a size of a transformation unit for each coding unit. [115] FIG 6 is a diagram illustrating deeper coding units according to depths, and partitions, according to an exemplary embodiment. [116] The apparatus 100 and the apparatus 200 use hierarchical coding units so as to consider characteristics of an image. A maximum height a maximum. width, and a maximum depth of coding units may be adaptively determined according to the charac teristics of the inageo or may be differently set by a user. Sizes of deeper coding units according to depths may be determined according to the predetermined maximum size of the coding unit. [117] In a hierarchical structure 600 of coding unts, according to an exemplary em bodiment, the maximum height and the maximum width of the coding units are each 64, and the maximum depth is 4, Since a depth deepens along a vertical axis of the hi erarchical structure 600, a height and a width of the deeper coding unit are each split. Also, a prediction unit and partitions, which are bases for prediction encoding of each deeper coding unit, are shown along a horizontal axis of the hierarchical structure 600. [1181 In other words, a coding unit 610 is a maximum coding unit in the hierarchical structure 600, wherein a depth is 0 and a size, i.e., a height by width, is 64x64. The depth deepens along the vertical axis, and a coding unit 620 having a size of 32x32 and a depth of , a coding unit 630 having a size of 16x16 and a depth of 2, a coding unit 640 having a size of 8x8 and a depth of 3, and a coding unit 650 having a size of 4x4 and a depth of 4 exist. The coding unit 650 having the size of 4x4 and the depth of 4 is a minimum coding unit. [119] The prediction unit and the partitions of a coding unit are arranged along the horizontal axis according to each depth. In other words, if the coding unit 610 having the size of 64x64 and the depth of 0 is a prediction unit, the prediction unit may be split into partitions include in the coding unit 61.0, i.e. a partition. 610 having a size of 64x64, partitions 612 having the size of 64x32, partitions 614 having the size of 32x64, or partitions 61.6 having the size of 32x32. [120] Similarly, a prediction unit of the coding unit 620 having the size of 3 2 x32 and the depth of 1 may be split into partitions included in the coding unit 620, i e., a partition 620 having a size of 32x32, partitions 622 having a size of 32x16, partitions o24 having a size of 16x32. and partitions 626 having a size of 16x 1.6. [121] Similarly, a prediction unit of the coding unit 630 having the size of 16x16 and the depth of 2 may be split into partitions included in the coding unit 630, i.e. a partition having a size of 16x16 included in the coding unit 630, partitions 632 having a size of 16x8 partitions 634 having a size of 8x 16, and partitions 636 having a size of x8. [122] Similarly, a prediction unit of the coding unit 640 having the size of 8x8 and the depth of 3 may be split into partitions included in the coding unit 640, ie. a partition having a size of 8x8 included in the coding unit 640, partitions 642 having a size of 8x4, partitions 644 having a size of 4x8, and partitions 646 having a size of 4x4. [123] The coding unit 650 having the size of 4x4 and the depth of 4 is the minimum coding unit and a coding unit of the lowermost depth. A prediction unit of the coding unit 650 is only assigned to a partition having a size of 4x4, as opposed to being partitioned into partitions 652 having a size of 4x2, partitions 654 having a size of 2x4, and partitions 656 having a size of 2x2. [124] In order to determine the at least one coded depth of the coding unit- constituting the maximum coding unit 610, the coding unit determiner 120 of the apparatus 100 performs encoding for coding units corresponding to each depth included in the maximum coding unit 610. [125] A number of deeper coding units according to depths including data in the same range and the same size increases as the depth deepens. For example four coding units corresponding to a depth of 2 are required to cover data that is included in one coding unit corresponding to a depth of 1. Accordingly, in order to compare encoding results of the same data according to depths, the coding unit corresponding to the depth of 1 and four coding units corresponding to the depth of 2 are each encoded. [1261 In order to perform encoding for a current depth from among the depth, a least encoding error may be selected for the current depth by performing encoding for each prediction unit in the coding units corresponding to the current depth, along the horizontal axis of the hierarchical structure 600, Alternatively, the minnmM encoding error may be searched for by comparing the least encoding errors according to depths, by performing encoding for each depth as the depth deepens along the vertical axis of the hierarchical structure 600. A depth and a partition having the minimum encoding error in the coding unit 610 may be selected as the coded depth and a partition type of the coding unit 610. 1271 FIG. 7 is a diagram for describing a relationship between a coding unit 710 and trans formation units 720, according to an exemplary embodiment. [128] The apparatus 100 or 200 encodes or decodes an image according to coding units having sizes smaller than or equal to a maximum coding unit for each maximum coding unit. Sizes of transformation uits for transformation during encoding may be selected based on data units that are not larger than corresponding coding unit. [129] For example, in the apparatus 100 or 200, if a size of the coding unit 710 is 64x64,. transformation may be performed by using the transformation units 720 having a size of 32x32, [130] Also, data of the coding unit 710 having the size of 64x64 may be encoded by performing the transfonnation on each of the transformation units having the size of 32x32, 16x 16 8xS and 4x4, which are smaller than 64x64, and then a transformation unit having the least coding error may be selected. [131] FIG. 8 is a diagram for describing encoding information of coding units corre sponding to a coded depth, according to an exemplary embodiment. [132] The output unit 130 of the apparatus 100 may encode and transmit information 800 about a partition type, information 810 about a prediction mode, and information 820 about a size of a transformation unit for each coding unit corresponding to a coded depth, as information about an encoding mode. [133] The information 800 indicates information about a shape of a partition obtained by splitting a prediction unit of a current coding unit, wherein the partition is a data unit for prediction encoding the current coding unit, For example, a current Coding unit CU 0 having a size of 2Nx2N may be split into any one of a partition 802 having a size of 2Nx2N, a partition 804 having a size of 2NxN, a partition 806 having a size of Nx2N, and a partition 808 having a size of NxN. Here, the information 800 about a partition type is set to indicate one of the partition 804 having a size of 2NxN, the partition 806 having a size of Nx2N, and the partition 808 having a size of NxN [1341 The information 810 indicates a prediction mode of each partition. For example, the information 8 10 may indicate a mode of prediction encoding performed on a partition indicated by the information 800,,i.e., an hitra mode 812, an inter nmode 814, or a skip mode 816. [135] The information 820 indicates a transformation unit to be based on when trans fornation is performed on a current coding unit. For example, the transformation unit may be a first intra transformation unit 822, a second intra transformation unit 824,a first inter transformation unit 826, or a second inter transformation unit 828. [1361 The image data and encoding information extractor 220 of the apparatus 200 may extract and use the information 800, 810, and 820 for decoding. [137] FIG. 9 is a diagram. of deeper coding units according to depths, according to an exemplary embodiment. [1381 Split information may be used to indicate a change of a depth. The spilt information indicates whether coding unit of a current depth is split into coding units of a lower depth. [139] A prediction unit 910 for prediction encoding a coding unit 900 having a depth of 0 and a size of 2N_0x2N_) may include partitions of a partition type 912 having a size of 2NOx2N O a partition type 914 having a size of 2N 0xN, a partition type 916 having a size of N_Ox2N_0; and a partition type 918 having a size of NOxN 0. FIG. 9 only illustrates the partition types 912 through 918 which are obtained by sym metrically splitting the prediction unit 910, but a partition type is not limited thereto, and the partitions of the prediction unit 910 may include asymmetrical partitions, partitions having a predetermined shape, and partitions having a geometrical shape. [1401 Prediction encoding is repeatedly performed on one partition having a size of 2N_0x2N0 two partitions having a size of 2NOxN_0, two partitions having a size of N_Ox2N 0, and four partitions having a size of NOxN_0 according to each partition type, The prediction encoding in an intra mode and an inter mode may be performed on the partitions having the sizes of 2NOx2N_0 N_Ox2Nj0 2NOxN_0, and NOxN-0. The prediction encoding in a skip mode is performed only on the partition having the size of 2N Ox2N_0. [141] Errors of encoding including the prediction encoding in the partition types 912 through 918 are compared, and the least encoding error is determined among the partition types. If an encoding error is smallest in one of the partition types 912 through 916, the prediction unit 910 may not be split into a lower depth. [142] If the encoding enor is the smallest in the partition type 918, a depth is changed from 0 to I to split the partition type 918 in operation 920, and encoding is repeatedly performed on coding units 930 having a depth of 2 and a size of N OxN O to search for a niinimum encoding error. 1431 A prediction unit 940 for prediction encoding the coding unit 930 having a depth of 1 and a size of 2N_1x2Ni (=NOxNA) may include pai-tions of a partition type 942 having a size of 2N_1x2N 1, a partition type 944 having a size of 2N_ixNla partition type 946 having a size of NI x2NI, and a partition type 948 having a size of [144] If an encoding error is the smallest in the partition type 948, a depth is changed from 1 to 2 to split the partition type 948 in operation. 950, and encoding is repeatedly performed on coding units 960, which have a depth of 2 and a size of N_2xN_2 to search for a minimum encoding error.

[145] When a maximum depth is d, split operation according to each depth may be performed up to when a depth becomes d-1, and split information may be encoded as up to when a depth is one of 0 to d-2. In other words, when encoding is performed up to when the depth is d- I after a coding unit corresponding to a depth of d-2 is split in operation 970, a prediction unit 990 for prediction encoding a coding unit 980 having a depth of d-I and a size of 2Nd(d-I)x2N_(d-d) may include partitions of a partition type 992 having a size of 2N.(d-i)x2N d-1) a partition type 994 having a size of 2NJd-_!)xNd-l) a partition type 996 having a size of N_(d-i)x2Nd4-1.). and a partition type 998 having a size of N(d-)xN(d-1). [1461 Prediction encoding may be repeatedly performed on one partition having a size of 2N (d-I)x2N (d-1), two partitions having a size of 2N_(d-l)xN -d- .), two partitions having a size of N(d- I )x2N_(d- ), four partitions having a size of N_(d- I )xN_(d- 1) from anong the partition types 992 through 998 to search for a partition type having a minimum encoding error. [1471 Even when the partition type 998 has the minimum encoding error, since a maximum depth is d, a coding unit CUId- 1) having a depth of d-I is no longer split to a lower depth, and a coded depth for the coding units constituting a current maximum coding unit 900 is determined to be d- 1 and a partition type of the coding unit 900 may be de termined to be N(d- i)xNd-.1) Also, since the maximum depth is d and a minituni coding unit 980 having a lowermost depth of d- I is no longer split to a lower depth, split information for a coding unit 980 is not set. [148] A data unit 999 may bea minimum unit for the current maximum coding unit. A minimum unit according to an exemplary embodiment may be a rectangular data unit obtained by splitting a minimum coding unit 980 by 4. By performing the encoding re peatedly, the apparatus 100 may select a depth having the least encoding error by comparing encoding errors according to depths of the coding unit 900 to determine a coded depth, and set a corresponding partition type and a prediction mode as an encoding mode of the coded depth. [149] As such, the minimum encoding errors according to depths are compared in all of the depths of 1 through U, and a depth having the least encoding error may be determined as a coded depth. The coded depth, the partition type of the prediction unit, and the prediction mode may be encoded and transmitted as information about an encoding mode. Also, since a coding unit is split from a depth of 0 to a coded depth, only split information of the coded depth is set to 0. and split information of depths excluding the coded depth is set to 1. [150] The image data and encoding information extractor 220 of the apparatus 200 may extract and use the information about the coded depth and the prediction unit of the coding unit 900 to decode the partition 9123,'Ihe apparatus 200 may determine a depth,.

in which split information is 0, as a coded depth by using split information according to depths, and use information about an encoding mode of the corresponding depth for decoding. [151] FIGS. 10 through 12 are diagrams for describing a relationship between coding units 1010, prediction units 1060, and transformation units 1070, according to an exemplary embodiment, [152] The coding units 1010 are coding units having a tree structure, corresponding to coded depths determined by the apparatus 100, in a maximum coding unit. The prediction units 1060 are partitions of prediction units of each of the coding units 1010 , and the transformation units 1070 are. transformation units of each of the coding units 1010. [153J When a depth of a maximum coding unit is 0 in the coding units 1010, depths of coding units 101.2 and 1054 are 1, depths of coding units 1014, 1016, 1018, 1028. 1050, and 1052 are 2, depths of coding units 1020, 1022, 1024, 1026, 1030, 1032. and 1048 are 3, and depths of coding units 1040, 1042, 1044, and 1046 are 4. [154] In the prediction units 1060, some coding units 1014, 1016, 1022, 1032, 1048, 1050, 1052, and 1054 are split into partitions for prediction encoding. In oiier words. partition types in the coding units 1014, 1022, 1050, and 1054 have a size of 2NxN. partition types in the coding units 1016, 1048 and 1052 have a size of Nx2N, and a partition type of the coding unit 1032 has a size of NxN. Prediction units and partitions of the coding units 1010 are smaller than or equal to each coding unit. [155] Transformation or inverse transformation is performed on image data of the coding unit 1052 in the transformation units 1070 in a data unit that is smaller than the coding unit 1052. Also, the coding units 1014, 1016, 1022, 1032, 1048, 1050, and 1052 in the transformation units 1070 are different from those in the prediction units 1060 in terms of sizes and shapes, In other words, the apparatuses 100 and 200 may perform intra prediction, motion estimation, motion compensation, transformation, and inverse trans formation individually on a data unit in the same coding unit. [156] Accordingly, encoding is recursively performed on each of coding units having a hi erarcbical structure in each region of a maximum coding unit to determine an optimum coding unit, and thus coding units having a recursive tree structure may be obtained. Encoding information may include split information about a coding unit, information about a partition type, information about a prediction mode, and information about a size of a transformation unit. Table 1 shows the encoding infonnation that may be set by the apparatuses 100 and 200, [157] Table 1 [Table 1 ITable I Split Information 0 (Encoding on Coding Unit having Size of 2Nx2N Split In and Current Depth of d) formation I Predictio Partition Type Size of Transformation Unit Repeatedly n Mode Encode Intra, Symmetrical Asymmetrical Split In- Split 1,n- Coding Units Inter, Partition Partition Type formation 0 formation -1 of having Lower Skip Type of Trans- Transformatio Depth of (Only formation n Unit d+l 2Nx2N) Unit 2Nx2N, 2NxnU, 2Nx2N NxN 2NxN, 2NxnD, (Symmetrical Nx2N, NxN nLx2N, Type), N/ nRx2N 2xN/2 (A symmetrical Type) 1581 The output unit 130 of the apparatus 100 may output the encoding information about the coding units having a tree structure, and the image data and encoding information extractor 220 of the apparatus 200 may extract the encoding information about the coding Units having a tree structure from a received bitstream. [159] Split information indicates whether a current coding unit is split into coding units of a lower depth. If split information of a current depth d is 0, a depth, in which a current coding unit is no longer split into a lower depth. is a coded depth, and thus information about a partition type, prediction mode, and a size of a transformation unit may be defined for the coded depth. If the current coding unit is further split according to the split information, encoding is independently performed on four split coding units of a lower depth. [160] A prediction mode may be one of an intra mode, an inter mode, and a skip mode. The intra mode and the inter mode may be defined in all partition types, and the skip mode is defined only in a partition type having a size of 2Nx2N. [161] The information about the partition type may indicate symmetrical partition types having sizes of 2Nx2N, 2NxN, Nx2N, and NxN, which are obtained by symmetrically splitting a height or a width of a prediction unit, and asymmetrical partition types having sizes of 2NxnU, 2NxnD, nLx2N, and nRx2N, which are obtained by asym metrically splitting the height or width of the prediction unit. The asymmetrical partition types having the sizes of 2NxnU and 2NxnD may be respectively obtained by splitting the height of the prediction uniting 1:3 and 3:1, and the asymmetrical partition types having the sizes of nLx2N and nRx2N may be respectively obtained by splitting the width of the prediction unit in 1:3 and 3:1 [162] The size of the transformation unit may be set to be two types in the intra mode and two types in the inter mode. in other words, if split information of the transformation unit is 0, the size of the transformation unit may be 2Nx2N which is the size of the current coding unit. If split information of the transformation unit is 1, the trans formation units may be obtained by splitting the current coding unit. Also, if a partition type of the current coding unit having the size of 2Nx2N is a symmetrical partition type, a size of a transformation unit may be NxN, and if the partition type of the current coding unit is an asymmetrical partition type, the size of the transformation unit may be N/2xN/2. [j631 The encoding information about coding units having a tree structure may include at least one of a coding unit corresponding to a coded depth, a prediction unit, and a minimum unit. The coding unit corresponding to the coded depth may include at least one of a prediction unit and a minimum unit containing the same encoding in formation, [1 64] Accordingly it is determined whether adjacent data units are included in the same coding unit corresponding to the coded depth by comparing encoding information of the adjacent data units. Also, a corresponding coding unit corresponding to a coded depth is determined by using encoding information of a data unit, and thus a dis tribution of coded depths in a maximum coding unit may be determined. [165] Accordingly, if a current coding unit is predicted based on encoding information of adjacent data units, encoding information of data units in deeper coding units adjacent to the current coding unit may be directly referred to and used, [1661 Alternatively, if a current coding unit is predicted based on encoding information of adjacent data units, data units adjacent to the current coding unit are searched using encoded information of the data units, and the searched adjacent coding units may be referred for predicting the current coding unit. [1671 FIG. 13 is a diagram for describing a relationship between a coding unit, a prediction unit or a partition, and a transformation unilt according to encoding mode information of Table 1. [168] A maximum coding unit 1300 includes coding units 1302, 1304, 1306, 1312, 1314, 1316, and 1318 of coded depths Here, since the coding unit 1318 is a coding unit of a coded depth, split information may be set to 0. Information about a partition type of the coding unit 1318 having a size of 2Nx2N may be set to be one of a partition type 1322 having a size of 2Nx2N,. a partition type 1324 having a size of 2NxN, a partition type 1326 having a size of Nx2N, a partition type 1328 having a size of NxN, a partition type 1332 having a size of 2NxnU, a partition type 1334 having a size of 2NxnD, a partition type 1336 having a size of nLx2N, and a partition type 1338 having a size of nRx2N. [169] When the partition type is set to be symmetrical, ie the partition type 1322, 1324, 1326, or 1328, a transformation unit 1342 having a size of 2Nx2N is set if split in formation (TU size flag) of a transformation unit is 0, and a transformation unit 1344 having a size of NxN is set if a TU size flag is 1. [170] When the partition type is set to be asymmetrical. i.e., the partition type 1332, 1334, 1336, or 1338, a transformation unit 1352 having a size of 2Nx2N is set if a TU size flag is 0, and a transformation unit 1354 having a size of N!2xNl2 is set if a TU size flag is . [171] Referring to FIG. 13, the TU size flag is a flag having a value or 0 or 1, but the TU size flag is not limited to 1 bit, and a transformation unit may be hierarchically split having a tree structure while the TU size flag increases from 0. [172] In this case, the size of a transformation unit that has been actually used may be expressed by using a TU size flag of a transformation unit, according to an exemplary embodiment, together with a maximum size and minimum size of the transformation unit. According to an exemplary embodiment, the video encoding apparatus 100 is capable of encoding maximum transformation unit size information, minimum trans formation unit size information, and a maximum TU size flag. The result of encoding the maximum transformation unit size information, the minimum transformation unit size information, and the maximum TU size flag may be inserted into an SPS. According to an exemplary embodiment, the video decoding apparatus 200 may decode video by using the maximum transformation unit size information, the minimum transformation unit size information, and the maximum TU size flag. [1731 For example, if the size of a current coding unit is 64x64 and a maximum trans formation unit size is 32x32, then the size of a transformation unit may be 32x32 when a TU size flag is 0, may be 16x 16 when the TU size flag is 1, and may be 8x8 when the TU size flag is 2, [174] As another example, if the size of the current coding unit is 32x32 and a minimum transformation unit size is 32x32, then the size of the transformation unit may be 32x32 when the TU size flag is 0. Here, the TO size flag cannot be set to a value other than 0, since the size of the transformation unit cannot be less than 32x32. [175] As another example, if the size of the current coding unit is 64x64 and a maximum TU size flag is 1, then the TU size flag may be 0 or 1. Here, the TU size flag cannot be set to a value other than 0 or 1. [1761 Thus, if it is defined that the maximum TU size flag is 'MaxTransformSizeindex'. a minimum. transformation. unit size is 'MinTransformSize. and a transformation unit size is 'RootluSize' when the TU size flag is 0, then a current mininum transformation unit size CurrMinTuSize that can be determined in a current coding unit, may be defined by Equation (1): [177] CurrM inTuSize = max(MinTransformSize, RootTuSize (2AMaxTransformSizelIndex))...... ) [178] Conpared to the current minimum transformation unit size CunMinTuSize' that can be determined in the current coding unit, a transformation unit size 'RootTuSize when the TU size flaa is 0 may denote a maximum transformation unit size that can be selected in the system. In Equation (1). -RootTuSize/(2AMaxTransformSizeindex) denotes a transformation unit size when the transformation unit size RootTuSize' when the TU size flag is 0. is split a number of times corresponding to the maximum TU size flag, and 'MinTransformSize' denotes a minimum transformation size. Thus. a smaller value from among RootTuSize(2^MIaxTransformSizelndexj and 'Mi nTrans formSize' may be the current minimum transformation unit size 'CurrMinTuSize' that can be determined in the current coding unit. [179] According to an exemplary embodiment, the maximum transformation unit size RootTuSize may vary according to the type of a prediction mode. [180] For example, if a current prediction mode is an inter mode, then 'RootTuSize' may be determined by using Equation (2) below. In Equation (2), 'MaxTransformSize' denotes a maximan transportation unit size. and 'PU Size' denotes a current prediction unit size. [181] RootTuSize =min(MaxTransfom1Size, PUSize) .. (2) [182] That is, if the current prediction mode is the inter mode, the transformation unit size RootTuSize' when the TU size flag is 0. may be a smaller value from among the maximum transformation unit size and the current prediction unit size [1831 If a prediction mode of a current partition unit is an intra mode, 'RootluSize may be determined by using Equation (3) below. In Equation (3), 'PartitionSize' denotes the size of the current partition unit. [184] RootTuSize = min(MaxTransformSize, PartitionSize).,.(3) [185J That is, if the current prediction mode is the intra mode the transformation unit size RootTuSize'Whden the TU size flag is 0 may be a smaller value from among the maximum transforation unit size and the size of the current partition unit. [186] However, the current maxinmm transformation unit size 'RootTuSize' that varies according to the type of a prediction mode in a partition unit is just an example and is not limited thereto. [187] FIG. 14 is a flowchart illustrating a method of encoding a video, according to an exemplary embodiment.

[1881 In operation 1210, a cunrent picture is split into at least one maximum coding unit. A maximum depth indicating the total number of possible splitting times may be prede termined. [189] In operation 1220, a coded depth to output a final encoding result according to at least one split region, which is obtained by splitting a region of each maximum coding unit according to depths, is determined by encoding the at least one split region, and a coding unit according to a tree structure is determined. [190] The maximum. coding unit is spatially split whenever the depth deepens, and thus is split into coding units of a lower depth. Each coding unit may be split into coding units of another lower depth by being spatially split independently from adjacent coding units. Encoding is repeatedly performed on each coding unit according to depths. [191] Also, a transformation unit according to partition types having the least encoding error is determined for each deeper coding unit. in order to determine a coded depth having a minimum encoding error in each maximum coding unit, encoding errors may be measured and compared in all deeper coding units according to depths. [192] In operation 1230, encoded image data constituting the final encoding result according to the coded depth is output for each maximum coding unit, with encoding information about the coded depth and an encoding mode.. The information about the encoding mode may include information about a coded depth or split information, in formanton about a partition type of a prediction unit, a prediction mode, and a size of a transformation unit. The enoeded information about the encoding mode may be transmitted to a decoder with the encoded image data. [193] FIG 15 is a flowchart illustrating a method of decoding a video, according to an exemplary embodiment. [194] In operation 1310, a bitstream of an encoded video i received and parsed. [195] In operation 1320, encoded image data of a current picture assigned to a maximum coding unit, and information about a coded depth and an encoding mode according to maximum coding units are extracted from the parsed bitstream. The coded depth of each maximum coding unit is a depth having the least encoding error for the each maximum coding unit. In encoding each maximum coding unit the image data is encoded based on at least one data unit obtained by hierarchically splitting the each maximum coding unit according to depths. [196] According to the information about the coded depth and the encoding mode, the maximum coding unit may be split into coding units having a tree structure. Each coding unit of the coding units having the tree structure is determined as a coding unit cor-esponding to a coded depth, optimally encoded as to output the least encoding error. Accordingly, encoding and decoding efficiency of an image may be improved by decoding each piece of encoded image data in the coding units after determining at least one coded depth according to coding units. [197] In operation. 1330, the image data of each maximum coding unit is decoded based on the information about the coded depth and the encoding mode according to the maximum coding units. The decoded image data may be reproduced by a reproducing apparatus, stored in a storage medium, or transmitted through a network, [198] Encoding and decoding of a video considering an order of skip and split according to exemplary embodiments will now be explained with reference to FIGS. 16 through 23. [199] FIG. 16 is a block diagram illustrating an apparatus 1400 for encoding a video by considering a skip and split order, according to an exemplary embodiment, [2001 Referring to FIG. 1 the apparatus 1400 includes a maximum. coding unit splitter 1410, a coding unit and encoding mode determiner 1420, and an output unit 1430. [201] The apparatus 1400 of FIG. 16 may be an example of the apparatus 100 of FIG. 1, and the maximum coding unit splitter 110, the coding unit determiner 120, and the output unit 130 of the apparatus 100 of FIG. I may correspond to the maximum coding unit splitter 1410, the coding unit and encoding mode determiner 1420, and the output unit 1430 of FIG. 16, respectively. [202] The maximum coding unit splitter 1410 splits a picture of an input image into maximum coding units having predetermined sizes, and image data according to the maximum coding units is output to the coding unit and encoding mode determiner 1420. [203] The coding unit and encoding mode detemiiner 1420 hierarchically splits regions of each of the maximum coding units input from the maximum coding unit splitter 1410 as a depth deepens, and individually performs encoding based on coding units according to depths corresponding to split numbers for every independent region hier archically split. The coding unit and encoding mode determiner 1420 determines an encoding mode and a coded depth to output an encoding result according to each region. The encoding mode may include information about a partition type of a coding unit corresponding to the coded depth, about a prediction mode, and about a size of a transformation unit. [2041 In order to determine an encoding mode and a coded depth to output an encoding result for every dependent region of a maximum coding unit, the coding unit and encoding mode determiner 1420 may perform encoding based on coding units according to depths, and may search for a coded depth hav ing a least encoding error in original image data and an encoding mode related to the coded depth. Accordingly, the codmig unit and encoding mode determiner 1420 may determine the coding units having the tree structure by determining coding units corresponding to coded depths for each maximum coding unit of the current picture [2051 Information about the coded depth and the encoding mode determined by the coding unit and encoding mode determiner 1420 and a corresponding encoding result are output to the output unit 1430. [2061 The output unit 1430 outputs information about a coded depth and an encoding mode according to a maximum coding unit, and encoded video data. An encoding mode includes skip mode information indicating whether a prediction mode of a coding unit is a skip mode, and split information indicating whether the coding unit is split to a lower depth. Since a prediction mode of a coding unit may be determined in a coding unit of a coded depth which is not further split, skip mode information may be encoded in the coding unit of the coded depth, [2071 The output unit 1430 may selectively determine an order in which skip mode in formation and split information of coding units according to depths are output. [208] The output unit 1430 may output information indicating a selectively determined order in which skip mode information and split information are output. Accordingly, the output unit 1430 may output information about an order in which skip mode in formation and split information are output. the information about an encoding mode including the skip mode information and the split information which are arranged in the selectively determined order, and encoded video data. [209] The order of the skip mode information and the split information which is selectively determined for every coding unit according to depths may be determined according to at least one of an image sequence to which a coding unit corresponding to each depth belongs, a slice, a slice type according to a prediction direction, and a quantization parameter tQP) of a data unit. [2101 Also, the order of the skip mode information and the split information which is se lectively determined for every coding unit according to depths may be individually de termined according to depths of coding units in a maximum coding unit. [211] For example, the order of the skip mode information and the split information may be determined in such a manner that the skip mode information precedes the split in formation for a maximum coding unit, and the split information precedes the skip mode information for coding units of lower depths other than the maximum coding unit. [212] The output unit 1430 may perform encoding by combining the split information and the skip mode information as one piece of split and skip information. Also, the output unit 1430 may assign different bit numbers to the split and skip information according to a frequency of occurrence of a combination of the split information and the skip mode information. [213] For example, if both split information indicating that a corresponding coding unit is split and skip mode information indicating that a prediction mode of the corresponding coding unit is not a skip mode are encoded, the split and skip information may be assigned one bit. Also, in cases other than the case where both the split information in dicating that the corresponding coding unit is split and the skip mode information in dicating that the prediction mode of the corresponding coding unit is not the skip mode are encoded, the split and skip information may be assigned two bits and output. [214] The output unit 1430 may not encode a transformation coefficient and prediction related information such as a prediction direction and a motion vector, for a coding unit that is predicted in a skip mode, Selectively, the output unit 1430 may encode motion vector predictor index information about a prediction unit adjacent to a current coding unit. Also, the output unit 1430 may output information about a maximum size of the coding units. [215] FIG. 17 is a block diagram illustrating an apparatus 1500 for decoding a video by considering a skip and split order, according to an exemplary embodiment. [216] Referring to FIG. 17, the apparatus 1500 includes a receiver 1510, a data extractor 1520, and a decoder 1530. The apparatus 1500 of FIG. 17 may be an example of the apparatus 200 of FIG. 2. The receiver 210, the image data and encoding information extractor 220, and the image data decoder 230 of the apparatus 200 of FIG 2 may correspond to the receiver 1510, the data extractor 1520, and the decoder 1530 of the apparatus 1500 of FIG. 17, respectively, [217] The receiver 1510 receives and parses a bitstream of an encoded video. [2181 The data extractor 1520 receives the parsed bitstream from the receiver 1510, and extracts encoded video data and information about a coded depth and an encoding mode for each maximum coding unit from the bitstrean. Also, the data extractor 1520 may extract information about a maximum size of the coding units from the bitstream. The data extractor 1520 extracts, from the bitstream, information about an order of skip mode information and split information of coding units according to depths. [219] The data extractor 1520 may read the skip mode information and the split in formation from. the information about the encoding mode based on the extracted in formation about the order of the skip mode information and the split information, and extract the encoded video data in coding units according to depths based on the skip mode information and the split information. [220J The order of the skip mode information and the split information may be selectively set according to at least one of an image sequence to which a coding unit corre sponding to each depth belongs, a slice,a slice type according to a prediction direction, and a QP of a data unit, Also, the order of the skip mode information and the split in formation may be selectively set according to depths of coding units according to depths in a maximum coding unit. [2211 For example, if a coding unit is a maximum coding unit, according to the order of the skip mode information and the split information, whether the coding unit is predicted in a skip mode according to the skip mode information may be determined before de termining whether the coding unit is split according to the split information. Also, if a coding unit is not a maximum coding unit, whether the coding unit is split according to the split information may be determined before determining whether the coding unit is predicted in a skip mode according to the skip mode information. [222] The data extractor 1520 may extract one piece of split and skip information obtained by combining the skip mode information and the split information for the coding units according to the depths. For example, if one bit of split and skip information is extracted, a corresponding coding unit may be predicted in a skip mode without being split, and if two bits of split and skip information is read, whether a corresponding coding unit is split may be determined based on the split information and whether the corresponding coding unit is predicted in a skip mode may be determined based on the skip mode information. [223] The data extractor 1520 may extract only the split information and the skip mode in formation fix a coding unit hat is predicted in a skip mode, and may not extract in formation for prediction decoding such as a transformation coefficient and prediction related information such as a prediction direction and a motion vector. Motion vector predictor index information for a coding unit that is predicted in a skip mode may be selectively extracted. Accordingly, the decoder 1530 may perform prediction decoding on a current coding unit by borrowing motion information of a prediction unit adjacent to the current coding unit that is predicted in a skip mode, or inferring motion in formation of the current coding unit from motion information of the adjacent prediction unit. [224] The decoder 1530 decodes encoded video data according to a coding unit of at least one coded depth for every maximum coding unit of the encoded video data based on the information about the coded depth and the encoding mode, [225 Decoded and restored video data may be transmitted to various tenninals which may reproduce the video data or may be stored in a storage device. [226] The apparatus 1400 of FIG. 16 and the apparatus 1500 of FIG. 17 may determine an order of skip mode information and split information by considering a data unit, an encoding mode, or the like. Also, the order of the skip mode information and the split information may be determined by considering a total bit number of the skip mode in formation and the split information, and a frequency of occurrence of a skip mode in encoding and decoding of video data. Since the order of the skip mode information and the split information of coding units according to depths may be set, encoded data transmission efficiency may be further improved. [227] FIG. 1-8 illustrates coding units according to coded depths in a maximum coding unit, according to an exemplary embodiment.

[228] In order to explain an order in which the data extractor 1520 reads an encoded bitstream output from the output unit 1430 by considering an order of skip mode in formation and split information, a maximum coding unit 1600 is exemplary illustrated. [2291 Coding units inclIded in the maximum coding unit 1600 include the maximum coding unit 1600 having a depth of 0, coding units 1610, 1620 1630. and 1640 having a depth of 1, and coding units 1622. 1624. 1626, and 1628 having a depth of 2. Also, the coding units 1610. 1630, and 1640 having the coded depth of 1 and the coding units 1622, 1624, 1.626, and 1628 having the coded depth of 2 are determined as coded depths of the maximum coding unit 16(K). Also, it is assumed that prediction modes of the coding units 161-0, 1.630, and 1640 having the depth of 1 are set to skip modes, and prediction modes of the coding units 1622, 1624, 1626, and 1628 having the depth of 2 are not set to skip modes. [230] An example where the data extractor 1520 of the apparatus 1500 reads split in formation before reading skip mode information for the maximum coding unit 1600 of a current picture will be first explained. In this example where the split information precedes the skip mode information, if the split information is 1, split information of coding units of lower depths is recursively read, and if the split information is 0, skip mode information of a coding unit of a corresponding depth is read. [2311 Accordingly, an order in which split information and skip mode information are set or read is as follows. [232] Split informaation I about the maximum coding unit 1600, split information 0 and skip information 1 about the coding unit 1610 having the depth of 1, split information 0 about the coding unit 1620 having the depth of L split information 0 and skip in formation 0 about the coding unit 1622 having the depth of 2, split information 0 and the skip information 0 about the coding unit 1624 having the depth of 2, split in formation 0 and skip information 0 about the coding unit 1626 having the depth of 2, split information 0 and skip information 0 about the coding unit 1628 having the depth of 2, split information 0 and skip information I about the coding unit 1630 having the depth of 1, and split information 0 and skip information 1 about the coding unit 1640 having the depth of I may be sequentially read. Accordingly, a total bit number of the split information and the skip mode information of the maximum coding unit 1600 is 16. [233] Also, another example where the data extractor 1520 of the apparatus 1400 mads skip mode information of the maximum coding unit 1600 of a current picture earlier than split information will be explained, In this example where the skip mode in formation precedes the split information, if the skip mode information is 1, split in formation of coding units having lower depths do not need to be set, and if the skip mode information is 0, the split information is set. Accordingly, an order in which the split information and the skip mode information. are set or read is as follows, [2341 Skip mode information 0 about the maximum coding unit 1600, skip mode in formation 1 about the coding unit 16h10 aving the depth of 1 skip mode information 0 and split information I about the coding unit 1620 having the depth of 1, skip mode in formation 0 and split information 0 about the coding unit 1622 having the depth of 2, skip mode information 0 and split information 0 about the coding unit 1624 having the depth of 2. skip mode information 0 and split information 0 about the coding unit 1626 having the depth of 2, skip mode information 0 and split information 0 about the coding unit 1628 having the depth of 2. skip mode information 1 about the coding unit 1630 having the depth of 1, and skip mode information I about the coding unit 1640 having the depth of I may be sequentially read. In this case, a total bit number of the split information and the skip mode information about the maximum coding unit 1600 is 14. [235] FIGS, 19 through 21 are flowcharts illustrating methods of encoding and decoding skip information and split information, according to various exemplary embodiments. [236] If the output unit 1430 of the apparatus 1400 outputs an encoded bitstream in such a manner that split information precedes skip mode information according to a split first method, the data extractor 1520 of the apparatus 1500 reads encoded video data according to an order in which the skip mode information and the split information are read. [237] That is, in operation 1650, according to the split first method, the data extractor 1520 reads split information about a maximum coding unit having a depth of 0 and de termines whether the maximum coding unit is split. If it is determined in operation 1650 that the maximum coding unit is not split, the method proceeds to operation 1652. In operation 1652, skip mode information is read and it is determined whether the maximum coding unit is predicted in a skip mode. If it is determined in operation 1650 that the maximum coding unit is split, the method proceeds to operation 1654. In operation 1654, split information of a coding unit having a depth of I is read. Similarly, in operation 1654, it is determined whether the coding unit having the depth of I is split. If it is determined in operation 1654 that the coding unit having the depth of I is not split according to split information of the coding unit hav ing the depth of 1, the method proceeds to operation 1656. in operation 1656, skip mode information of the coding unit hav ing the depth of I is read, If it is determined in operation 1654 that the coding unit having the depth of 1 is split. the method proceeds to operation 1658. In operation 1658, split information of a coding unit having a depth of 2 is read and it is determined whether the coding unit having the depth of 2 is split. If it is determined in operation 1658 that the coding unit having the depth of 2 is not split, the method proceeds to operation 1660, in operation 1660, skip mode information of the coding unit having the depth of 2 is read. If it is determined in operation 1658 that the coding unit having the depth of 2 is split, the method may proceed to a next depth. [2381 If the output unit 1430 of the apparatus 1400 outputs an encoded bitstream in such a manner that skip mode information precedes split information according to a skip first method, the data extractor 1520 of the apparatus 1500 reads encoded video data according to an order in which the skip mode information and the split information are read. [239] That is, in operation 1670, according to the skip first method, the data extractor 1520 reads skip mode information about a maximum coding unit having a depth of 0. If it is determined from the reading that a prediction mode of the maximum coding unit is a skip mode, the decoder 1530 may decode the maximum coding unit in a skip mode. In operation 1670, if it is detennined from the reading that the prediction mode of the maximum coding unit is not a skip mode, the method may proceed to operation 1 672. In operation 1672, the data extractor 1 520 may read split information of the maxnIum coding unit having the depth of 0. In operation 1672, if it is determined from the reading that the maximum coding unit is not split, the decoder 1530 may decode the maximum coding unit. In operation 1672. if it is detennined from the reading that the maximum coding unit is split, the method proceeds to operation 1674, In operation 1674, the data extractor 1520 may read skip mode information of a coding unit having a depth of 1. [2401 SimIlarly, in operation 1674 according to the skip mode information of the coding unit hav ing the depth of 1, if it is determined from the reading that a prediction mode of the coding unit having the depth of I is a skip mode, the coding unit having the depth of I may be decoded in a skip mode. If it is determined from the reading in operation 1674 that a prediction mode of the coding unit having the depth of 1 is not a skip mode, the method proceeds to operation 1676, In operation 1676, split in formation of the coding unit having the depth of 1. may be read. [2411 If the output unit 1430 of the apparatus 1400 performs encoding in such a manner that skip mode information precedes split information for a maximum coding unit and split information precedes skip mode information for coding units other than the maximum coding unit, the data extractor 1520 of the apparatus 1500 reads encoded video data according to an order in which the skip mode information and the split in formation are read. [242] That is, in operation 1680, according to a skip first method for a maximum coding unit having a depth of 0, the data extractor 1520 reads skip mode information about the maximum coding unit having the depth of 0. If it is determined from the reading that a prediction mode of the maximum coding unit is a skip mode, the decoder 1530 may decode the maximum coding unit in a skip mode, in operation 1680, if it is determined from the reading that the prediction mode of the maximum coding unit is not a skip mode, the method proceeds to operation 1682. In operation 1682, the data extractor 1 520 may read split information of the maximum coding unit having the depth of 0. In operation 1682, if it is determined from the reading that the maximum coding unit is not split the decoder 1530 may decode the maximum coding unit In operation 1682. if it is determined from the reading that the maximum coding unit is split, the data extractor 1520 may read split information and skip mode information of a coding unit having a depth of 1 in operations 1684 and 1686. [243] In operation 1684, according to a split first method for the coding unit having the depth of 1, if it is determined from the reading that the coding unit having the depth of I is not split according to split information of the coding unit having the depth of 1, the method proceeds to operation 1686. In operation 1686, skip mode information of the coding unit having the depth of I is read. in operation 1684, if it is determined from the reading that the coding unit having the depth of I is split, the method proceeds to operation 1688, and split information of a coding unit having a depth of 2 may be read. In operation 1688, if the coding unit having the depth of 2 is not split according to the split information of the coding unit having the depth of 2, the method proceeds to operation 1690. In operation 1690, skip mode information of the coding unit having the depth of 2 may be read, and if the coding unit having the depth of 2 is split, the method may proceed to a next depth. [244] Total bit numbers of skip mode information and split information according to the exemplar embodiments of FIGS 19 through 21 will be compared with one another as follows. [245] In detail, if a maximum coding unit is encoded in a skip mode, total bit numbers of skip mode information and split information according to various exemplary em bodiments are as shown in Table 2. [2461 Table 2 [Table 2] [ Table I Embodiment Skip mode information and Total bit number split information Split first method (FIG. 19) Split information 0, skip 2 bits mode information 1. Skip first method (FIG. 20) Skip mode information I 1 bit Maximum coding unit skip Skip mode information 1 I bit first method (FIG. 21) [2471 According to a split first method of Table 2, since split infonation of a maximum coding unit having a depth of 0 is encoded to be '0 and skip mode information of the maximum coding unit having the depth of 0 is encoded to be 'l', the data extractor 1520 may read two bits of skip mode information and split information in total. According to askip first method of Table 2. since skip mode information of the maximum coding unit having the depth of 0 is encoded to be 'I', the data extractor 1520 may read one bit of skip mode inforation in total. According to a maximum coding unit skip first method of Table 2, since skip mode infonnation of the maximum coding unit having the depth of 0 is encoded to be 1% the data extractor 1520 may read only one bit of skip mode information in total. [248] In detail, if a coding unit having a depth of 2 is encoded in a skip mode, total hit numbers of skip mode information and split information according to various exemplary embodiments are as shown in Table 3. [249] Table 3 [Table 31 [Table] Embodiment Skip mode information and Total bit number split information Split first method (FIG. 19) Split information I, split in- 4 bits formation 1, split in formation 0, skip mode in formation 1 Skip first method (FIG. 20) Skip mode information 0, 5 bits split information Lskip mode information 0, split information 1 skip mode information I Maximum coding unit skip Skip mode information 0, 5 bits first method (FIG 211) split information 1, split in formation I split in formation 0. skip mode in formation 1 [250] According to a split first method of Table 3, since split information of a maximum coding unit having a depth of 0 is encoded to be'l.', split information of a coding unit having a depth of I is encodedto be ', split information of a coding unit having a depth of 2 is encoded to be 0', and skip mode information of the coding unit having the depth of 2 is encoded to be '1, the data extractor 1 520 may read four bits of skip mode information and split information in total. According to a skip first method of Table 3, since skip mode information of the maxinmm coding unit having the depth of 0 is encoded to be 'O', split information of the maximum coding unit having the depth of 0 is encoded to be 1', skip mode nifoination of the coding unit having the depth of 1 is encoded to be 0', split information of the coding unit having the depth of 1 is encoded to be '1', and skip mode information of the coding unit having the depth of 2 is encoded to be '1', the data extractor 1520 may read five bits of skip mode information and split information in total. According to a maximum coding unit skip first method of Table 3, since skip mode information of the maximum coding unit having the depth of 0 is encoded to be '0', split information of the maximum coding unit having the depth of 0 is encoded to be '. split information of the coding unit having the depth of I is encoded to be ', split information of the coding unit having the depth of 2 is encoded to be '0' and skip iode information of the coding unit having the depth of 2 is encoded to be T, the data extractor 1520 may read five bits of skip mode information and split information in total. [251] As described above with reference to FIGS. 19 through 21, by changing an order of split information and skip mode information, a total bit number of skip mode in formation about coding units according to depths may be varied. For example, if a coding unit of an upper depth is predicted and encoded in a skip mode. since split in formation of a coding unit of a lower depth does not need to be encoded, if there are many regions predicted and encoded in a skip mode, it may be advantageous in terms of a bit rate that skip mode information precedes split information. However, in an image with a small number of skip modes, it may be advantageous in terms of a bit rate that split information precedes skip mode information. [252) Accordingly, a bit rate may be adjusted by adjusting an order of split information and skip mode information according to characteristics of an image, a sequence, a data unit level such as a slice, a QP, and a slice type. Also, like in the example explained with reference to FIG. 21 where a skip first method is selected only for a maximum coding unit and a split first method is selected for coding units having depths other than the maximum coding unit, an order of split information and skip mode information may be changed according to depths. [253] In the exemplary embodiment described with reference to FIG. 18, skip mode in formation or split information is earlier read in units of pictures. The apparatus 1400 of FIG.. 16 and the apparatus 1500 of FIG, 17 may variably determine an order in which skip mode information and split information are output or read according to a data unit, a depth, a QP, and a slice type according to a prediction direction without being limited to the exemplary embodiment of HG. 1 8.

[254J Also, split information and skip mode information may be combined and used as one piece of split and skip information. The apparatus 1.400 of FIG. 16 and the apparatus 1 500 of FIG, 17 may use split and skip information that is assigned I bit for a com bination of split information and skip mode information having a high frequency of oc cun'ence, and split and skip information that is assigned 2 bits for a combination having a low frequency of occurrence. [255] If split information precedes skip mode information, since split information of a coding unit of a lower depth is immediately read when split information of a coding unit of a current depth is 1, a skip mode of a current coding unit is not read. AC cordingly, three combinations, that is, split information I, a combination of split in formation 0 and skip mode information 0, and a combination of split information 0 and skip mode information I, may occur. For example, a frequency of occurrence of the combination of split information 0 and skip mode information . is the highest, the combination is assigned 1 bit, and each of the split information I and the combination of split information 0 and skip mode information 0 may be assigned 2 bits. [256] FIG 22' is a flowchart illustrating a method of encoding a video by considering a skip and split order. according to an exemplary embodiment. [257] In operation 1710 a picture is split into maximum coding units having predetermined maximum sizes. [2581 In operation 1720, for each of coding units having a tree structure, an encoding mode about a coded depth to output an encoding result and a coding uimt of the coded depth is determined by performing encoding based on coding units according to depths, according to regions obtained by hierarchically splitting the maximum coding unit as a depth deepens. [259] In operation 1730, information indicating an order of skip mode information and split information which is selectively determined for every coding unit according to depths, information about the encoding mode including the skip mode information and the split information which are arranged according to the determined order, and encoded video data are output for every maximum coding unit. [2601 Also, one piece of combined split and skip infonation obtained by combining the split information and the skip mode information may be set. Also, a bit number of the corresponding split and skip information niay be assigned based on a freqency of oc currence of a combination of the split information and the ski p mode information. [261] FIG. 23 is a flowchart illustrating a method of decoding a video by considering a skip and split order, according to an exemplary embodiment. [262] In operation 1810, a bitstream of an encoded video is received and parsed. [2631 In operation 1820, information about an order of skip mode information and split in formation of coding units according to depths is extracted from the bitstream, and according to the order of the skip mode infonnation and the split information, in formation about a coded depth and an encoding mode and encoded video data are extracted according to a maximum coding unit from the bitstream. [2641 Also, one piece of combined split and skip information obtained by combining the split information and the skip mode information may be read. The method of decoding the video of FIG. 23 may read a combination of the split information and the sip mode information based on the split and skip information that is discriminatively assigned based on a frequency of occurrence of a combination of the split information and the skip mode information. [2651 In operation 1830, encoded video data is decoded according to coding units having a tree structure for every maximum coding unit of encoded video data based on the in formation about the coded depth and the encoding mode. 266] Exemplary embodiments can be written as computer programs and can be imu plemented in general-use digital computers that execute the programs using a computer readable recording medium. Examples of the computer readable recording medium include magnetic storage media (e.g., ROM, floppy disks, hard disks, etc.) and optical recording media (e.g., CD-ROMs. or DVDs). Moreover, one or more units of the apparatus 1400 and the apparatus 1500 can include a processor or microprocessor executing a computer program stored in a computer-readable medium, such as the local storage 220 [267] While exemplary embodiments have been particularly shown and described above, it will be understood by those of ordinary skill in the art that various changes in form and details may be made therein without departing from the spirit and scope of the inventive concept as defined by the appended claims. The exemplary embodiments should be considered in a descriptive sense only and not for purposes of limitation. Therefore, the scope of the inventive concept is defined not by the detailed description of exemplary embodiments but by the appended claims, and all differences within the scope will be construed as being included in the present invention. [268]

Claims

1. A method of decoding a video, the method comprising: receiving a bitstream of encoded video; extracting, from the bitstream, split information of a coding unit in a maximum coding unit of a picture; and when the split information indicates a split for a current depth, splitting a coding unit of the current depth, independently from neighboring coding units, into coding units of a lower depth, and when the split information indicates a non-split for the current depth, determining at least one partition from the coding unit of the current depth and decoding the coding unit of the current depth by performing a prediction based on the at least one partition, wherein, when skip information for the coding unit of the current depth indicates a skip mode, the coding unit of the current depth is decoded by performing a prediction in the skip mode based on a partition having a size equal to a size of the coding unit of the current depth; and when the skip information for the coding unit of the current depth does not indicate the skip mode, the coding unit of the current depth is decoded by performing a prediction in a prediction mode indicated by prediction mode information obtained from the bitstream, wherein the picture is split into a plurality of maximum coding units according to information about the maximum size of the coding unit obtained from the bitstream.

2. The method of claim 1, wherein the split information indicates whether a corresponding coding unit is split into coding units of a lower depth.

3. The method of claim 1, wherein, when the skip information for the coding unit of the current depth does not indicate the skip mode, the coding unit of the current depth is decoded by performing a prediction in a prediction mode indicated by prediction mode information, obtained from the bitstream, based on at least one partition having a size equal to or less than the size of the coding unit of the current depth.

4. The method of claim 3, wherein the at least one partition having a size equal to or less than the size of the coding unit of the current depth is obtained from the coding unit of the current depth based on partition type information obtained from the bitstream.

5. The method of claim 4, wherein the partition type information indicates one of a symmetric partition type and an asymmetric partition type.