Source: https://patents.google.com/patent/US10136149B2/en
Timestamp: 2019-06-18 17:56:52
Document Index: 611551827

Matched Legal Cases: ['Application No. 10', 'Application No. 10', 'Application No. 2', 'Application No. 10', 'Application No. 2', 'application No. 201510150297', 'application No. 1264', 'application No. 201510149521', 'Application No. 10', 'Application No. 2010313967', 'Application No. 2', 'Application No. 2013128302', 'application No. 2012121859', 'Application No. 10827104', 'Application No. 15158612', 'Application No. 15158613', 'Application No. 15158614', 'Application No. 15158640', 'Application No. 2', 'application No. 2', 'Application No. 2015', 'Application No. 201510148781', 'Application No. 2015', 'Application No. 2015', 'Application No. 2015', 'application No. 2015108338', 'application No. 2015108351', 'application No. 2015108352', 'Application No. 2010313967', 'Application No. 10', 'Application No. 201080049289']

US10136149B2 - Method and apparatus for encoding residual block, and method and apparatus for decoding residual block - Google Patents
US10136149B2
US10136149B2 US14/323,424 US201414323424A US10136149B2 US 10136149 B2 US10136149 B2 US 10136149B2 US 201414323424 A US201414323424 A US 201414323424A US 10136149 B2 US10136149 B2 US 10136149B2
US14/323,424
US20140314149A1 (en
2009-10-28 Priority to KR10-2009-0102818 priority Critical
2009-10-28 Priority to KR1020090102818A priority patent/KR101457894B1/en
2010-10-28 Priority to US12/914,248 priority patent/US8811479B2/en
2014-07-03 Priority to US14/323,424 priority patent/US10136149B2/en
2014-10-23 Publication of US20140314149A1 publication Critical patent/US20140314149A1/en
2018-11-20 Publication of US10136149B2 publication Critical patent/US10136149B2/en
A decoding apparatus includes a splitter which splits the image into a plurality of maximum coding units, hierarchically splits a maximum coding unit among the plurality of maximum coding units into a plurality of coding units, and determines one or more transformation residual blocks from a coding unit among the plurality of coding units, wherein the one or more transformation residual blocks include sub residual blocks, a parser which obtains an effective coefficient flag of a sub residual block among the sub residual blocks from a bitstream, the effective coefficient flag of the sub residual block indicating whether at least one non-zero effective transformation coefficient exists in the sub residual block, and when the effective coefficient flag indicates that at least one non-zero transformation coefficient exists in the sub residual block, obtains transformation coefficients of the sub residual block based on location information of the non-zero transformation coefficient and level information of the non-zero transformation coefficient obtained from the bitstream, and an inverse-transformer which performs inverse-transformation on a transformation residual block including the sub residual block based on the transformation coefficients of the sub residual block.
This application is a continuation of U.S. patent application Ser. No. 12/914,248 filed Oct. 28, 2010, which claims priority from Korean Patent Application No. 10-2009-0102818, filed on Oct. 28, 2009 in the Korean Intellectual Property Office, the entire disclosures of the prior applications are incorporated herein by reference in their entireties.
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 prediction mode based on a macroblock having a predetermined size. Also, the related art video codec encodes a residual block by using a transformation unit having a small size, such as 4×4 or 8×8.
Hereinafter, exemplary embodiments will be described more fully with reference to the accompanying drawings. It is understood that expressions such as “at least one of,” when preceding a list of elements, modify the entire list of elements and do not modify the individual elements of the list.
In the exemplary embodiments, a “coding unit” is an encoding data unit in which the image data is encoded at an encoder side and an encoded data unit in which the encoded image data is decoded at a decoder side. Also, a “coded depth” refers to a depth where a coding unit is encoded.
The maximum coding unit splitter 110 may split a current picture of an image based on a maximum coding unit for the current picture. 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 32×32, 64×64, 128×128, 256×256, 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.
For example, when a coding unit of 2N×2N (where N is a positive integer) is no longer split and becomes a prediction unit of 2N×2N, a size of a partition may be 2N×2N, 2N×N, N×2N, or N×N. Examples of a partition type include symmetrical partitions that are obtained by symmetrically splitting at least one of a height and a width of the prediction unit, partitions obtained by asymmetrically splitting the height or the width of the prediction unit (such as 1:n or n:1), partitions that are obtained by geometrically splitting the prediction unit, and partitions having arbitrary shapes.
A data unit used as a base of the transformation will hereinafter be referred to as a transformation unit. A transformation depth indicating a number of splitting times to reach the transformation unit by splitting the height and the width of the coding unit may also be set in the transformation unit. For example, in a current coding unit of 2N×2N, a transformation depth may be 0 when the size of a transformation unit is also 2N×2N, may be 1 when each of the height and width of the current coding unit is split into two equal parts, totally split into 4^1 transformation units, and the size of the transformation unit is thus N×N, and may be 2 when each of the height and width of the current coding unit is split into four equal parts, totally split into 4^2 transformation units, and the size of the transformation unit is thus N/2×N/2. 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 transformation units of a lower transformation depth according to hierarchical characteristics of a transformation depth.
In the video encoding apparatus 100, the deeper coding unit may be a coding unit obtained by dividing at least one of a height and a width of a coding unit of an upper depth, which is one layer above, by two. For example, when the size of the coding unit of the current depth is 2N×2N, the size of the coding unit of the lower depth may be N×N. Also, the coding unit of the current depth having the size of 2N×2N may include maximum 4 of the coding unit of the lower depth.
A size of a coding unit may be expressed in width×height. For example, the size of the coding unit may be 64×64, 32×32, 16×16, or 8×8. A coding unit of 64×64 may be split into partitions of 64×64, 64×32, 32×64, or 32×32, and a coding unit of 32×32 may be split into partitions of 32×32, 32×16, 16×32, or 16×16, a coding unit of 16×16 may be split into partitions of 16×16, 16×8, 8×16, or 8×8, and a coding unit of 8×8 may be split into partitions of 8×8, 8×4, 4×8, or 4×4.
Referring to FIG. 3, there is exemplarily provided first video data 310 with a resolution of 1920×1080, and a coding unit with a maximum size of 64 and a maximum depth of 2. Furthermore, there is exemplarily provided second video data 320 with a resolution of 1920×1080, and a coding unit with a maximum size of 64 and a maximum depth of 3. Also, there is exemplarily provided third video data 330 with a resolution of 352×288, and a coding unit with a maximum size of 16 and a maximum depth of 1. The maximum depth shown in FIG. 3 denotes a total number of splits from a maximum coding unit to a minimum decoding unit.
Similarly, a prediction unit of the fourth coding unit 640 having the size of 8×8 and the depth of 3 may be split into partitions included in the fourth coding unit 640, i.e., a partition having a size of 8×8 included in the fourth coding unit 640, partitions 642 having a size of 8×4, partitions 644 having a size of 4×8, and partitions 646 having a size of 4×4.
Referring to FIG. 9, a prediction unit 910 for prediction encoding a coding unit 900 having a depth of 0 and a size of 2N_0×2N_0 may include partitions of a partition type 912 having a size of 2N_0×2N_0, a partition type 914 having a size of 2N_0×N_0, a partition type 916 having a size of N_0×2N_0, and a partition type 918 having a size of N_0×N_0. Although FIG. 9 only illustrates the partition types 912 through 918 which are obtained by symmetrically splitting the prediction unit 910, it is understood that a partition type is not limited thereto. For example, according to another exemplary embodiment, the partitions of the prediction unit 910 may include asymmetrical partitions, partitions having a predetermined shape, and partitions having a geometrical shape.
In the prediction units 1060, some encoding units 1014, 1016, 1022, 1032, 1048, 1050, 1052, and 1054 are obtained by splitting coding units of the encoding units 1010. In particular, partition types in the coding units 1014, 1022, 1050, and 1054 have a size of 2N×N, partition types in the coding units 1016, 1048, and 1052 have a size of N×2N, and a partition type of the coding unit 1032 has a size of N×N. Prediction units and partitions of the coding units 1010 are smaller than or equal to each coding unit.
Referring to FIG. 14A, when a transformation residual block 1410 is generated by transforming a residual block, a significance map, which indicates a location of a nonzero effective transformation coefficient in the transformation residual block 1410 while scanning transformation coefficients in the transformation residual block 1410 according to a zigzag scanning order. After scanning the transformation coefficients in the transformation residual block 1410, level information of an effective transformation coefficient are encoded. For example, a process of encoding a transformation residual block 1420 having a size of 4×4, as illustrated in FIG. 14B, will now be described. In FIG. 14B, it is assumed that transformation coefficients at locations indicated by X are nonzero effective transformation coefficients. Here, a significance map indicates an effective transformation coefficient as 1 and a 0 transformation coefficient as 0 from among transformation coefficients in a residual block 1430, as shown in FIG. 14C. The significance map is scanned according to a predetermined scanning order, while context adaptive binary arithmetic coding is performed thereon. For example, when the significance map of FIG. 14C is encoded according to a raster scanning order, and scanning is performed from left to right and top to bottom, context adaptive binary arithmetic coding is performed on the significance map corresponding to an binary string of “111111110101000.” Level information of an effective coefficient, i.e., a sign and an absolute value of the effective coefficient, is encoded after the significance map is encoded.
Such a process in the related technical field may be utilized for encoding a transformation residual block having a small size, such as 4×4 or 8×8, but may not be suitable for encoding a transformation residual block having a large size, such as 16×16, 32×32, or 64×64. In particular, if all transformation coefficients in a transformation residual block are scanned and encoded according to the process of FIGS. 14A through 14C with respect to a transformation residual block having a large size, a length of a binary string corresponding to a significance map may increase and encoding efficiency may deteriorate.
The frequency band splitter 1510 splits a transformation residual block into predetermined frequency band units. Referring back to FIG. 14A, in the exemplary transformation residual block 1410, an upper left transformation coefficient has a low frequency component, and a lower right transformation coefficient has a high frequency component. Most of the effective transformation coefficients of the transformation residual block 1410 may exist in low frequency bands, and the transformation coefficients having high frequency components may mostly have a value of 0. In this case, a nonzero effective transformation coefficient from among the transformation coefficients of the high frequency component is sparse. Specifically, distribution of effective transformation coefficients of high frequency components may be sparser when a transformation residual block is generated by performing transformation with a transformation unit having a size of 16×16, 32×32, 64×64, or above, which is larger than a related art transformation unit having a size of 4×4 or 8×8, as in the image encoder 400. Accordingly, the frequency band splitter 1510 may split the transformation residual block into the frequency band units while considering distribution characteristics according to the frequency bands of the transformation coefficients in the transformation residual block.
Referring to FIG. 18A, the frequency band splitter 1510 splits a transformation residual block 1810 according to a split form, such as one of the split forms shown in FIGS. 16A through 16J. FIG. 18A shows a split form corresponding to the split form of FIG. 16E, though it is understood that the process with reference to FIG. 18A may also be applied to other split forms. The effective coefficient flag generator 1520 respectively sets effective coefficient flags of frequency band units 1811 through 1813 including effective transformation coefficients as 1, and respectively sets effective coefficient flags of frequency band units 1814 through 1817 that do not include an effective transformation coefficient as 0. The effective coefficient encoder 1530 encodes a significance map indicating locations of the effective transformation coefficients while scanning the entire transformation residual block 1810. As described above, the significance map indicates whether a transformation coefficient according to each scan index is an effective transformation coefficient or 0. After encoding the significance map, the effective coefficient encoder 1530 encodes level information of each effective transformation coefficient, The level information of the effective transformation coefficient includes sign and absolute value information of the effective transformation coefficient. For example, the significance map of the frequency band units 1811 through 1813 including the effective transformation coefficients may have a binary string value, such as “1000100010101110100100100010001,” when scanning is performed according to a raster scanning order as shown in FIG. 18A.
Also, when information about the effective transformation coefficient is encoded while scanning the entire transformation residual block 1810 as shown in FIG. 18A, an end-of-block (EOB) flag indicating whether an effective transformation coefficient is the last effective transformation coefficient may be set for the entire transformation residual block 1810 or each frequency band unit. When an EOB flag is set for the entire transformation residual block 1810, only an EOB flag of a transformation coefficient 1802 of the last effective transformation coefficient according to the scanning order from among transformation coefficients of FIG. 18A may have a value of 1. For example, as described above, if the significance map according to FIG. 18A has a value of “1000100010101110100100100010001,” an EOB flag corresponding to such a significance map has a value of “000000000001” since only the last effective transformation coefficient from among 12 effective transformation coefficients included in “1000100010101110100100100010001” has a value of 1. In other words, a total of 12 bits are used to express the EOB flag corresponding to the significance map of FIG. 18A.
Alternatively, in order to reduce a number of bits used to express an EOB flag, the effective coefficient encoder 1530 may define a flag (Tlast) indicating whether a last effective transformation coefficient exists according to each frequency band unit, set Tlast as 1 if the last effective transformation coefficient according to each frequency band unit exists and as 0 if the last effective transformation coefficient does not exist, and sets an EOB flag for only a frequency band unit where Tlast is 1, thereby reducing a number of bits used to identify locations of effective transformation coefficients in the entire transformation residual block and the last effective transformation coefficient. In detail, referring to FIG. 18A, the effective coefficient encoder 1530 may check the existence of a last effective transformation coefficient for each of the frequency band units 1811 through 1813 including the effective transformation coefficients, and set Tlast as 1 in the frequency band unit 1812 including the last effective transformation coefficient, and set Tlast as 0 in the remaining frequency band units 1811 and 1813. If each bit of Tlast indicates the existence of the last effective transformation coefficient in each of the frequency band units 1811 through 1813 according to an order of scanning the transformation coefficients, a most significant bit (MSB) of Tlast may indicate whether the effective transformation coefficient exists in a lowest frequency band unit, and a least significant bit (LSB) of Tlast may indicate whether the last effective transformation coefficient exists in the frequency band unit 1812. That is, a bit value of “001” is set since Tlast has a value of 0 for the frequency band unit 1811, 0 for the frequency band unit 1813, and 1 for the frequency band unit 1812. Here, since an effective transformation coefficient in a transformation residual block may end at the frequency band unit 1811 that is the lowest, a Tlast value may not be separately assigned for the frequency band unit 1811. That is, Tlast may be set only for the frequency bands 1812 and 1813 excluding the frequency band 1811 from among the frequency band units 1811 through 1813 that are scanned according to a scanning order. Here, two bit values of “01” are set as Tlast. “0” that is the MSB of “01” indicates that the last effective transformation coefficient of the transformation residual block does not exist in the frequency band unit 1813, and “1” that is the LSB of “01” indicates that the last effective transformation coefficient of the transformation residual block exists in the frequency band unit 1812. Tlast may have a value of “00” if the last effective transformation coefficient of the transformation residual block exists in the frequency band 1811 of the lowest frequency band unit. Thus, when all bits of Tlast are 0, it may be determined that the last effective transformation coefficient of the transformation residual block exists in the frequency band unit 1811.
In the present exemplary embodiment, the effective coefficient encoder 1530 sets an EOB flag only for the frequency band unit in which Tlast is 1, i.e., the frequency band unit including the last effective transformation coefficient of the transformation residual block. Referring to FIG. 18A, the effective coefficient encoder 1530 sets an EOB flag only for each effective transformation coefficient existing in the frequency band unit 1812 in which Tlast is 1. Since a total four effective transformation coefficients exist in the frequency band unit 1812, the EOB flag has four bits of “0001.” According to another exemplary embodiment, a total of six to seven bits are used to identify the location of the effective transformation coefficients in the transformation residual block, and the last effective transformation coefficient, since two to three bits are set for Tlast and four bits are set for the EOB flag. Here, five to six bits are saved compared to the previously described exemplary embodiment in which a total of 12 bits are used to set the EOB flag, such as “000000000001.”
According to another exemplary embodiment, when an EOB flag is set for each frequency band unit, EOB flags of a transformation coefficient 1801 in the frequency band unit 1811, a transformation coefficient 1802 in the frequency band unit 1812, and a transformation coefficient 1803 in the frequency band unit 1813 are set to 1. EOB flags are not set for the frequency band units 1814 through 1817 that do not include the effective transformation coefficients. As such when an EOB flag is set for each frequency band unit including an effective transformation coefficient, an effective transformation coefficient in a predetermined frequency band unit is scanned, and then an effective transformation coefficient in a following frequency band unit may be scanned. For example, a transformation coefficient in the frequency band unit 1812 may be scanned after the transformation coefficient 1803 of the frequency band unit 1813 is scanned. Referring to FIG. 18B, effective transformation coefficient information is encoded independently for each frequency band unit. The effective coefficient encoder 1530 encodes a significance map indicating locations of effective transformation coefficients, and level information of each effective transformation coefficient while independently scanning each frequency band unit of a transformation residual block 1820. For example, a significance map of a frequency band unit 1821 has a binary string value such as “1000100010011” when scanned according to a raster scanning order as shown in FIG. 18B. Also, the effective coefficient encoder 1530 sets an EOB flag of an effective transformation coefficient 1831 corresponding to a last effective transformation coefficient from among effective transformation coefficients of the frequency band unit 1821 as 1. Similarly, the effective coefficient encoder 1530 generates a binary string value, such as “101010001,” as a significance map of a frequency band unit 1822. Also, the effective coefficient encoder 1530 sets an EOB of an effective transformation coefficient 1832 from among effective transformation coefficients in the frequency band unit 1822 as 1. Similarly, the effective coefficient encoder 1530 generates a binary string value, such as “11001,” as a significance map of a frequency band unit 1823, and sets an EOB flag of an effective transformation coefficient 1833 as 1.
According to a method and an apparatus for encoding a residual block according to one or more exemplary embodiments as described above, information about an effective transformation coefficient may be efficiently encoded according to distribution characteristics of the effective transformation coefficient in a transformation residual block having a size that is greater than or equal to 16×16, by splitting the transformation residual block into frequency band units. Thus, a transformation residual block having a large size is split into frequency band units, and an effective coefficient flag indicating an existence of the effective transformation coefficient is generated according to frequency band units. Accordingly, a scanning process of a frequency band, in which an effective transformation coefficient does not exist in the transformation residual block, may be skipped and a number of bits generated to encode the effective transformation coefficient may be reduced.
a splitter which splits the image into a plurality of maximum coding units, hierarchically splits a maximum coding unit among the plurality of maximum coding units into a plurality of coding units based on split information of a coding unit, and determines a transformation residual block from a coding unit among the plurality of coding units based on split information of the transformation residual block, wherein the transformation residual block includes a plurality of sub residual blocks;
a parser which:
obtains, from a bitstream, a coded block flag indicating whether the transformation residual block includes at least one non-zero effective transformation coefficient,
when the coded block flag indicates that the transformation residual block includes at least one non-zero effective transformation coefficient, obtains, from the bitstream, effective coefficient flags of second sub residual blocks among the plurality of sub residual blocks except a first sub residual block which has lowest frequency band and located on an upper-left side among the plurality of sub residual blocks in the transformation residual block, each of the effective coefficient flags of the second sub residual blocks indicating whether at least one non-zero effective transformation coefficient exists in each of the second sub residual blocks,
when a particular effective coefficient flag among the effective coefficient flags indicates that at least one non-zero transformation coefficient exists in a particular second sub residual block among the second sub residual blocks, obtains transformation coefficients of the particular second sub residual block based on a significance map indicating a location of the non-zero transformation coefficient in the particular second sub residual block and level information of the non-zero transformation coefficient in the particular second sub residual block obtained from the bitstream,
when the particular effective coefficient flag indicates that the at least one non-zero effective transformation coefficient does not exist in the particular second sub residual block, determines the transformation coefficients of the particular second sub residual block as zero, and
when the coded block flag indicates that the transformation residual block includes at least one non-zero effective transformation coefficient, obtains transformation coefficients of the first sub residual block based on a significance map indicating a location of a non-zero transformation coefficient in the first sub residual block and level information of the non-zero transformation coefficient in the first sub residual block obtained from the bitstream; and
an inverse-transformer which performs inverse-transformation on the transformation residual block including the first sub residual block and the second sub residual blocks,
wherein the transformation coefficients of a sub residual block among the plurality of sub residual blocks are a subset of transformation coefficients of the transformation residual block,
wherein each of the effective coefficient flags of the second sub residual blocks except the first residual block is obtained independently from other effective coefficient flags and independent from whether at least one non-zero effective transformation coefficient exists in another sub residual block among the sub residual blocks,
wherein the non-zero effective transformation coefficients of the particular second sub residual block determined as having the non-zero effective transformation coefficient based on the effective coefficient flag of the particular second sub residual block, are obtained by performing scanning independently from other second sub residual block,
wherein the plurality of sub residual blocks are square and have same size,
wherein, when the split information of the coding unit of a current depth indicates a split, the coding unit of the current depth is split into the plurality of coding units of the lower depth, independently from neighboring coding units, and
when the split information of the coding unit of the current depth indicates a non-split, one or more transformation residual blocks including the transformation residual block are obtained from the coding unit of the current depth.
US14/323,424 2009-10-28 2014-07-03 Method and apparatus for encoding residual block, and method and apparatus for decoding residual block Active US10136149B2 (en)
KR10-2009-0102818 2009-10-28
US12/914,248 US8811479B2 (en) 2009-10-28 2010-10-28 Method and apparatus for encoding residual block, and method and apparatus for decoding residual block
US14/323,424 US10136149B2 (en) 2009-10-28 2014-07-03 Method and apparatus for encoding residual block, and method and apparatus for decoding residual block
US14/619,160 US10154273B2 (en) 2009-10-28 2015-02-11 Method and apparatus for encoding residual block, and method and apparatus for decoding residual block
US14/619,299 US10178401B2 (en) 2009-10-28 2015-02-11 Method and apparatus for encoding residual block, and method and apparatus for decoding residual block
US14/619,323 US10171826B2 (en) 2009-10-28 2015-02-11 Method and apparatus for encoding residual block, and method and apparatus for decoding residual block
US14/619,187 US10257530B2 (en) 2009-10-28 2015-02-11 Method and apparatus for encoding residual block, and method and apparatus for decoding residual block
US12/914,248 Continuation US8811479B2 (en) 2009-10-28 2010-10-28 Method and apparatus for encoding residual block, and method and apparatus for decoding residual block
US14/619,160 Continuation US10154273B2 (en) 2009-10-28 2015-02-11 Method and apparatus for encoding residual block, and method and apparatus for decoding residual block
US14/619,299 Continuation US10178401B2 (en) 2009-10-28 2015-02-11 Method and apparatus for encoding residual block, and method and apparatus for decoding residual block
US14/619,323 Continuation US10171826B2 (en) 2009-10-28 2015-02-11 Method and apparatus for encoding residual block, and method and apparatus for decoding residual block
US14/619,187 Continuation US10257530B2 (en) 2009-10-28 2015-02-11 Method and apparatus for encoding residual block, and method and apparatus for decoding residual block
US20140314149A1 US20140314149A1 (en) 2014-10-23
US10136149B2 true US10136149B2 (en) 2018-11-20
US12/914,248 Active 2031-12-22 US8811479B2 (en) 2009-10-28 2010-10-28 Method and apparatus for encoding residual block, and method and apparatus for decoding residual block
US14/323,424 Active US10136149B2 (en) 2009-10-28 2014-07-03 Method and apparatus for encoding residual block, and method and apparatus for decoding residual block
US14/619,160 Active US10154273B2 (en) 2009-10-28 2015-02-11 Method and apparatus for encoding residual block, and method and apparatus for decoding residual block
US14/619,299 Active US10178401B2 (en) 2009-10-28 2015-02-11 Method and apparatus for encoding residual block, and method and apparatus for decoding residual block
US14/619,187 Active US10257530B2 (en) 2009-10-28 2015-02-11 Method and apparatus for encoding residual block, and method and apparatus for decoding residual block
US14/619,323 Active US10171826B2 (en) 2009-10-28 2015-02-11 Method and apparatus for encoding residual block, and method and apparatus for decoding residual block
US4591907A (en) 1983-07-13 1986-05-27 Thomson-Csf Method and device for detection of moving points in a television image for digital television systems providing conditional-replenishment bit-rate compression
US6356213B1 (en) 2000-05-31 2002-03-12 Lucent Technologies Inc. System and method for prediction-based lossless encoding
RU2209527C2 (en) 1996-11-28 2003-07-27 Томсон Мюльтимедиа Method and device for video data compression
US20040114683A1 (en) 2002-05-02 2004-06-17 Heiko Schwarz Method and arrangement for coding transform coefficients in picture and/or video coders and decoders and a corresponding computer program and a corresponding computer-readable storage medium
US20050175250A1 (en) 2004-02-10 2005-08-11 Sanyo Electric Co., Ltd. Image decoding apparatus
US20060088096A1 (en) 2004-10-21 2006-04-27 Samsung Electronics Co., Ltd. Video coding method and apparatus
US20070047653A1 (en) 2005-08-29 2007-03-01 Samsung Electronics Co., Ltd. Enhanced motion estimation method, video encoding method and apparatus using the same
WO2007077178A1 (en) 2006-01-06 2007-07-12 France Telecom Method of coding and decoding an image or a sequence of images, corresponding devices, computer programs and signal
US20070248161A1 (en) 1996-09-20 2007-10-25 At&T Corp. System and method for generating video data for implicit coefficient prediction decoding
US20080219578A1 (en) 2007-03-07 2008-09-11 Samsung Electronics Co., Ltd. Method and apparatus for context adaptive binary arithmetic coding and decoding
US20080246637A1 (en) 2007-04-03 2008-10-09 National Tsing Hua University Cabac Decoding Method
US20080279465A1 (en) 2001-07-02 2008-11-13 Qualcomm Incorporated Apparatus and method for encoding digital image data in a lossless manner
RU2341035C1 (en) 2005-03-25 2008-12-10 Самсунг Электроникс Ко., Лтд. Video signal coding and decoding procedure based on weighted prediction and related device for implementation thereof
US20090210219A1 (en) 2005-05-30 2009-08-20 Jong-Mo Sung Apparatus and method for coding and decoding residual signal
US20090225843A1 (en) 2008-03-05 2009-09-10 Samsung Electronics Co., Ltd. Method and apparatus for encoding and decoding image
US20090226103A1 (en) 2008-03-10 2009-09-10 Samsung Electronics Co., Ltd. Image encoding apparatus and image decoding apparatus
EP2106145A2 (en) 2008-03-28 2009-09-30 Samsung Electronics Co., Ltd. Method and apparatus for intra-prediction video coding/decoding
CA2738504A1 (en) 2008-10-03 2010-04-08 Qualcomm Incorporated Video coding with large macroblocks
CA2883978A1 (en) 2009-10-28 2011-05-05 Samsung Electronics Co., Ltd. Method and apparatus for encoding residual block, and method and apparatus for decoding residual block
JP2006501740A (en) 2002-10-03 2006-01-12 ノキア コーポレイション Context-based adaptive variable length coding for the adaptive block transform
CN1497503A (en) 2002-10-08 2004-05-19 株式会社Ntt都科摩 Image coding method and device, decoding device and method, coding and decoding program
US20090219988A1 (en) 2006-01-06 2009-09-03 France Telecom Methods of encoding and decoding an image or a sequence of images, corresponding devices, computer program and signal
KR20080092940A (en) 2006-01-06 2008-10-16 프랑스 텔레콤 Method of coding and decoding an image or a sequence of images, corresponding devices, computer programs and signal
JP2011501535A (en) 2007-10-12 2011-01-06 クゥアルコム・インコーポレイテッドＱｕａｌｃｏｍｍ Ｉｎｃｏｒｐｏｒａｔｅｄ Entropy coding of the interleaved sub-blocks of video blocks
KR20090099236A (en) 2008-03-17 2009-09-22 삼성전자주식회사 Method and apparatus for encoding transformed coefficients and method and apparatus for decoding transformed coefficients
CA2883923A1 (en) 2009-10-28 2011-05-05 Samsung Electronics Co., Ltd. Method and apparatus for encoding residual block, and method and apparatus for decoding residual block
CN104796708A (en) 2009-10-28 2015-07-22 三星电子株式会社 Method and apparatus for encoding residual block, and method and apparatus for decoding residual block
Communication dated Apr. 14, 2014, issued by the Korean Intellectual Property Office in counterpart Korean Application No. 10-2009-0102818.
Communication dated Apr. 28, 2014, issued by the Canadian Intellectual Property Office in counterpart Canadian Application No. 2,777,587.
Communication dated Aug. 3, 2015, issued by the Korean Intellectual Property Office in counterpart Korean Application No. 10-2015-0047489.
Communication dated Dec. 13, 2016, issued by the Canadian Intellectual Property Office in counterpart Canadian Patent Application No. 2,883,978.
Communication dated Dec. 5, 2017, issued by The State Intellectual Property Office of P.R. China in counterpart Chinese application No. 201510150297.4.
Communication dated Dec. 8, 2017, issued by the Indian Patent Office in counterpart Indian application No. 1264/MUMNP/2012.
Communication dated Jan. 23, 2014, issued by the Mexican Institute of Industrial Property in counterpart Mexican Application No. MX/a/2012/004803.
Communication dated Jan. 31, 2018, issued by the State Intellectual Property Office in counterpart Chinese application No. 201510149521.8.
Communication dated Jul. 16, 2015, issued by the Korean Intellectual Property Office in counterpart Korean Application No. 10-2014-0148719.
Communication dated Jul. 19, 2013 issued by the Australian Patent Office in counterpart Australian Application No. 2010313967.
Communication dated Jul. 22, 2013 issued by the Mexican Institute of Industrial Property in counterpart Mexican Application No. MX/A/2012/004803.
Communication dated Jul. 4, 2016 issued by the Canadian Patent Office in counterpart Canadian Patent Application No. 2,883,913.
Communication dated Jun. 2, 2015, issued by the Russian Federal Service for Intellectual Property in counterpart Russian Application No. 2013128302.
Communication dated Mar. 22, 2013 from the Russian Patent Office in counterpart application No. 2012121859/08(033061).
Communication dated May 29, 2015, issued by the European Patent Office in counterpart European Application No. 10827104.0.
Communication dated May 29, 2015, issued by the European Patent Office in counterpart European Application No. 15158612.0.
Communication dated May 29, 2015, issued by the European Patent Office in counterpart European Application No. 15158613.8.
Communication dated May 29, 2015, issued by the European Patent Office in counterpart European Application No. 15158614.6.
Communication dated May 29, 2015, issued by the European Patent Office in counterpart European Application No. 15158640.1.
Communication dated Nov. 10, 2016, issued by the Canadian Intellectual Property Office in counterpart Canadian Patent Application No. 2,883,923.
Communication dated Nov. 6, 2017, issued by the Canadian Intellectual Property Office in counterpart Canadian application No. 2,883,920.
Communication dated Oct. 13, 2015, issued by the Japanese Patent Office in counterpart Japanese Application No. 2015-005065.
Communication dated Oct. 25, 2016, issued by the State Intellectual Property Office of the People's Republic of China in counterpart Chinese Patent Application No. 201510148781.3.
Communication dated Oct. 27, 2015, issued by the Japanese Patent Office in counterpart Japanese Application No. 2015-043127.
Communication dated Oct. 27, 2015, issued by the Japanese Patent Office in counterpart Japanese Application No. 2015-043128.
Communication dated Oct. 27, 2015, issued by the Japanese Patent Office in counterpart Japanese Application No. 2015-043129.
Communication from the Russian Patent Office dated Apr. 13, 2016 in a counterpart Russian application No. 2015108338.
Communication from the Russian Patent Office dated Apr. 13, 2016 in a counterpart Russian application No. 2015108351.
Communication from the Russian Patent Office dated Apr. 13, 2016 in a counterpart Russian application No. 2015108352.
Communication, Issued by the Australian Intellectual Property Office, dated Aug. 25, 2014, in counterpart Australian Application No. 2010313967.
Communication, Issued by the Korean Intellectual Property Office, dated Jul. 29, 2014, in counterpart Korean Application No. 10-2009-0102818.
Communication, Issued by the State Intellectual Property Office of P.R. China, dated Jun. 26, 2014, in counterpart Chinese Application No. 201080049289.6.
International Search Report dated Jun. 15, 2011, in corresponding Application PCT/KR2010/007486.
Kim, et al.; "Enlarging MB Size for High Fidelity Video Coding Beyond HD", Video Coding Experts Group (VCEG), Oct. 2008, 6 pages total.
Marpe, et al.; "Context-Based Adaptive Binary Arithmetic Coding in the H.264/AVC Video Compression Standard", IEEE Transactions on Circuits and Systems for Video Technology, Jul. 2003, vol. 13, No. 7, 17 pages total.
Richardson, "Chapter 3: Video Coding Concepts", H.264 and MPEG-4 Video Compression: Video Coding for Next-Generation Multimedia, Oct. 2003, 57 pages total.
Said, et al.; "A New, Fast, and Efficient Image Codec Based on Set Partitioning in Hierarchical Trees", IEEE Transactions on Circuits and Systems for Video Technology, Jun. 1996, vol. 6, No. 3, 8 pages total.
Topiwala, et al.; "Local Zerotree Codling", Institute of Electrical and Electronics Engineers, International Conference, Oct. 1999, vol. 2, 4 pages total.
Wien, et al.; "Hybrid Video Coding Using Variable Size Block Transforms", Proceedings of SPIE, Jan. 2002, vol. 4671, 12 pages total.
US9503736B2 (en) 2016-11-22 Method and apparatus for encoding video by using block merging, and method and apparatus for decoding video by using block merging
EP2838267A2 (en) 2015-02-18 Method and apparatus for encoding video and method and apparatus for decoding video, based on hierarchical structure of coding unit
RU2607250C2 (en) 2017-01-10 Method and apparatus for encoding residual block, method and apparatus for decoding residual block
US9654790B2 (en) 2017-05-16 Video-encoding method and video-encoding apparatus based on encoding units determined in accordance with a tree structure, and video-decoding method and video-decoding apparatus based on encoding units determined in accordance with a tree structure
US9503727B2 (en) 2016-11-22 Method and apparatus for coding video and method apparatus for decoding video, accompanied with intra prediction
US8885711B2 (en) 2014-11-11 Image encoding/decoding method and device
EP2869563B1 (en) 2018-06-13 METHOD FOR ENTROPY DECODING of a VIDEO
US9479784B2 (en) 2016-10-25 Encoding method and device of video using data unit of hierarchical structure, and decoding method and device thereof