Source: https://patents.google.com/patent/US9402079
Timestamp: 2018-02-20 00:28:32
Document Index: 612141948

Matched Legal Cases: ['Application No. 61', 'Application No. 10', 'Application No. 10', 'Application No. 201310093716', 'Application No. 13196509', 'Application No. 13196510', 'Application No. 200980134680', 'Application No. 2011', 'Application No. 09773750', 'Application No. 13196512', 'Application No. 13196513', 'Application No. 13196514', 'application No. 10', 'application No. 10', 'Application No. 13172075', 'Application No. 10']

US9402079B2 - Image encoding method and device, and decoding method and device therefor - Google Patents
US9402079B2
US9402079B2 US14802651 US201514802651A US9402079B2 US 9402079 B2 US9402079 B2 US 9402079B2 US 14802651 US14802651 US 14802651 US 201514802651 A US201514802651 A US 201514802651A US 9402079 B2 US9402079 B2 US 9402079B2
US14802651
US20150326879A1 (en )
This application is a continuation of application Ser. No. 14/501,769, filed Sep. 30, 2014, which is a continuation of application Ser. No. 13/002,398 now U.S. Pat. No. 8,879,626, filed Jan. 3, 2011, which is a National Stage of International Application No. PCT/KR2009/003634 filed Jul. 2, 2009, claiming priority based on U.S. Provisional Application No. 61/077,592 filed on Jul. 2, 2008, and Korean Patent Application No. 10-2008-0085914 filed on Sep. 1, 2008, in the Korean Intellectual Property Office, the disclosures of which are incorporated herein by reference in their entireties.
The information—partition type 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 2N×2N may be split into any one of a partition 802 having a size of 2N×2N, a partition 804 having a size of 2N×N, a partition 806 having a size of N×2N, and a partition 808 having a size of N×N. Here, the information—partition type 800 about a partition type is set to indicate one of the partition 804 having a size of 2N×N, the partition 806 having a size of N×2N, and the partition 808 having a size of N×N.
A prediction unit 910 for motion-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.
Motion-prediction encoding is repeatedly performed on one partition having a size of 2N_0×2N_0, two partitions having a size of 2N_0×N_0, two partitions having a size of N_0×2N_0, and four partitions having a size of N_0×N_0, according to each partition type. An intra mode and the motion-prediction encoding in an inter mode may be performed on the partitions having the sizes of 2N_0×2N_0, N_0×2N_0, 2N_0×N_0, and N_0×N_0. The prediction encoding in a skip mode is performed only on the partition having the size of 2N_0×2N_0.
If an encoding error is the smallest in the partition type 918 having a size of N_0×N_0, a depth is changed from ‘0’ to ‘1’ to split the partition type 918 in operation 920, and encoding is repeatedly performed on coding units 922, 924, 926 and 928 having a depth of 2 and a size of N_0×N_0 to search for a least encoding error.
Since encoding is repeatedly performed on the coding units 922, 924, 926, and 928 having the same depth, encoding of a coding unit having a depth of 1 will be described by using a coding unit from among the coding units 922, 924, 926, and 928. A prediction unit 930 for motion-predicting a coding unit having a depth of 1 and a size of 2N_1×2N_1 (=N_0×N_0), may include partitions of a partition type 932 having a size of 2N_1×2N_1, a partition type 934 having a size of 2N_1×N_1, a partition type 936 having a size of N_1×2N_1, and a partition type 938 having a size of N_1×N_1. Encoding is repeatedly performed on one partition having a size of 2N_1×2N_1, two partitions having a size of 2N_1×N_1, two partitions having a size of N_1×2N_1, and four partitions having a size of N_1×N_1, according to each partition type and by using motion estimation.
If the encoding error is the smallest in the partition type 938 having the size of N_1×N_1, the current depth is increased from ‘1’ to ‘2’ in operation 940, and encoding is repeatedly performed on coding units 942, 944, 946, and 948 having a depth of 2 and a size of N_2×N_2 so as to search for a least encoding error.
If a maximum depth is ‘d’, then split information corresponding to depths may be set to a depth of (d−1). That is, a prediction unit 950 for motion-predicting a coding unit having a depth of d−1 and a size of 2N_(d−1)×2N_(d_1), may include partitions of a partition type 952 having a size of 2N_(d−1)×2N_(d_1), a partition type 954 having a size of 2N_(d−1)×N_(d_1), a partition type 956 having a size of N_(d−1)×2N_(d_1), and a partition type 958 having a size of N_(d−1)×N_(d_1).
Encoding is repeatedly performed on one partition having a size of 2N_(d−1)×2N_(d_1), two partitions having a size of 2N_(d−1)×N_(d_1), two partitions having a size of N_(d−1)×2N_(d_1), and four partitions having a size of N_(d−1)×N_(d_1), according to each partition type and by using motion estimation. Since the maximum depth is ‘d’, the coding unit 952 having the depth of (d−1) is not any more split.
As illustrated in FIG. 13, if a coding unit having a size of 32×32 has 33 intra prediction modes, then directions of the 33 intra prediction modes should be set. According to an exemplary embodiment, a prediction direction for selecting neighboring pixels to be used as reference pixels based on pixels included in a coding unit, is set by using a ‘dx’ parameter and a ‘dy’ parameter so as to set intra prediction modes having various directionalities in addition to the intra prediction modes described above with reference to FIGS. 14A-C and 15. For example, when each of the 33 prediction modes is defined as mode N (N is an integer from 0 to 32), mode 0, mode 1, mode 2, and mode 3 are set as a vertical mode, a horizontal mode, a DC mode, and a plane mode, respectively, and each of mode 4 to mode 31 may be set as a prediction mode having a directionality of tan−1 (dy/dx) by using a (dx, dy) parameter expressed with one from among (1,−1), (1,1), (1,2), (2,1), (1,−2), (2,1), (1,−2), (2,−1), (2,−11), (5,−7), (10,−7), (11,3), (4,3), (1,11), (1,−1), (12,−3), (1,−11), (1,−7), (3,−10), (5,−6), (7,−6), (7,−4), (11,1), (6,1), (8,3), (5,3), (5,7), (2,7), (5,−7), and (4,−3) shown in Table 1.
FIG. 16 is a reference diagram for explaining inter prediction modes having various directionalities according to exemplary embodiments. As described above with reference to Table 1, each of intra prediction modes according to exemplary embodiments may have directionality of tan−1 (dy/dx) by using a plurality of (dx, dy) parameters.
Referring to FIG. 16, neighboring pixels A and B on a line 160 that extends from a current pixel P in a current coding unit, which is to be predicted, at an angle of tan−1 (dy/dx) determined by a value of a (dx, dy) parameter according to a mode, shown in Table 1, may be used as predictors of the current pixel P. In this case, the neighboring pixels A and B may be pixels that have been previously encoded and restored, and belong to previous coding units located above and to the left side of the current coding unit. Also, when the line 160 does not pass along neighboring pixels on locations each having an integral value but passes between these neighboring pixels, neighboring pixels closer to the line 160 may be used as predictors of the current pixel P. If two pixels that meet the line 160, e.g., the neighboring pixel A located above the current pixel P and the neighboring pixel B located to the left side of the current pixel P, are present, an average of values of the neighboring pixels A and B may be used as a predictor of the current pixel P. Otherwise, if a product of values of the ‘dx’ and ‘dy’ parameters is a positive value, the neighboring pixel A may be used, and if the product of the values of the ‘dx’ and ‘dy’ parameters is a negative value, the neighboring pixel B may be used.
f ′ ⁡ [ i ] ⁡ [ j ] = f ⁢ ⁢ 1 + f ⁢ ⁢ 2 + 2 × f ⁡ [ i ] ⁡ [ j ] 4 ⁢ ⁢ ( n = 2 ) ⁢ ⁢ f ′ ⁡ [ i ] ⁡ [ j ] = f ⁢ ⁢ 1 + f ⁢ ⁢ 2 + f ⁢ ⁢ 3 × f ⁡ [ i ] ⁡ [ j ] 4 ⁢ ⁢ ( n = 3 ) ( 2 )
f ′ ⁡ [ i ] ⁡ [ j ] = α + β + γ α f ⁡ [ i - 1 ] ⁡ [ j ] + β f ⁡ [ i ] ⁡ [ j - 1 ] + γ f ⁡ [ i ] ⁡ [ j ] ⁢ , ( 3 )
According to a sixth exemplary embodiment, the post-processor 1220 produces a second predicted coding unit by changing the value of each pixel in the first predicted coding unit by using a median between the values of a pixel of the first predicted coding unit, which is to be changed, and neighboring pixels of the pixel. Referring back to FIG. 19, for example, it is assumed that the value f[i][j] of the first pixel 1910 at the ith column and the jth row of the first predicted coding unit 1900, the value f[i][j-1] of the second pixel 1912, and the value f[i−1][j] of the third pixel 1911 have a relation of f[i][j−1]>f[i−1][j]>f[i][j]. In this case, the post-processor 1220 changes the value f[i][j] of the first pixel 1910 to the median f[i−1][j] among the first to third pixels 1910 to 1912.
In an eleventh exemplary embodiment, if the value of the first pixel 1910, which is located at the ith column and the jth row of the first predicted coding unit 1900 and is to be changed, is f[i][j], the value of a pixel located at an upper leftmost point of the first predicted coding unit 1900 is f[0][0], the value of a pixel located at the jth row as the first pixel 1910 and at the leftmost point of the first predicted coding unit 1900 is f[0][j], the value of a pixel located at the ith column as the first pixel 1910 and at the uppermost point of the first predicted coding unit is f[i][0], and G[i][j]=f[i][0]+f[0][j]−f[0][0], then the post-processor 1220 changes the value of the first pixel 1910 to f′[i] [j], as shown in the following equation:
a splitter which determines at least one coding unit included in a maximum coding unit by splitting the maximum coding unit according to split information obtained from a bitstream, and obtains at least one prediction unit from a current coding unit;
a predictor which obtains a first prediction value of a current prediction unit by using neighboring pixels of the current prediction unit, and
obtains a second prediction value of pixels located on a top border and a left border of the current prediction unit by using the obtained first prediction value and at least one neighboring pixel,
the second prediction value of the current prediction unit is obtained by using the at least one neighboring pixel and a weighted value of the obtained first prediction value, and the second prediction value of a top-left pixel of the current prediction unit is obtained by using a first neighboring pixel located at a same column as the top-left pixel and a second neighboring pixel located at a same row as the top-left pixel,
US14802651 2008-07-02 2015-07-17 Image encoding method and device, and decoding method and device therefor Active US9402079B2 (en)
US20150326879A1 true US20150326879A1 (en) 2015-11-12
US9402079B2 true US9402079B2 (en) 2016-07-26
US9565447B2 (en) 2010-01-19 2017-02-07 Samsung Electronics Co., Ltd. Method and apparatus for encoding and decoding motion vector based on reduced motion vector predictor candidates
KR20160085376A (en) * 2010-12-21 2016-07-15 가부시키가이샤 엔.티.티.도코모 Enhanced intra-prediction coding using planar representations
CN104247433A (en) * 2012-04-06 2014-12-24 索尼公司 Decoding apparatus, decoding method, encoding apparatus and encoding method
US6240211B1 (en) 1997-04-24 2001-05-29 Sgs-Thomson Microelectronics S.R.L. Method for motion estimated and compensated field rate up-conversion (FRU) for video applications and device for actuating such method
JP2008147998A (en) 2006-12-11 2008-06-26 Victor Co Of Japan Ltd Moving image hierarchy coder, moving image hierarchy coding program, moving image hierarchy decoder and moving image hierarchy decoding program
KR20090097014A (en) 2008-03-10 2009-09-15 삼성전자주식회사 Apparatus of encoding image and apparatus of decoding image
CN1984340A (en) 2005-11-02 2007-06-20 三星电子株式会社 Method and apparatus for encoding and decoding of video
US8406545B2 (en) 2008-03-10 2013-03-26 Samsung Electronics Co., Ltd. Apparatus for encoding image and apparatus for decoding image
Communication dated Apr. 28, 2014 issued by the Korean Intellectual Property Office in counterpart Korean Application No. 10-2009-0094050.
Communication dated Aug. 27, 2015 issued by the State Intellectual Property Office of P.R. China in counterpart Chinese Patent Application No. 201310093716.6.
Communication dated Feb. 25, 2014 Issued by the European Patent Office in counterpart European Patent Application No. 13196509.7.
Communication dated Feb. 27, 2014 issued by the European Patent Office in counterpart European Patent Application No. 13196510.5.
Communication dated Jan. 14, 2013 issued by the State Intellectual Property Office of the People's Republic of China in counterpart Chinese Patent Application No. 200980134680.3.
Communication dated Jan. 8, 2013 issued by the Japanese Patent Office in counterpart Japanese Patent Application No. 2011-516154.
Communication dated Jan. 9, 2013 issued by the European Patent Office in counterpart European Patent Application No. 09773750.6.
Communication dated Mar. 3, 2014 issued by the European Patent Office in counterpart European Application No. 13196512.1.
Communication dated Mar. 3, 2014 issued by the European Patent Office in counterpart European Patent Application No. 13196513.9.
Communication dated Mar. 3, 2014 issued by the European Patent Office in counterpart European Patent Application No. 13196514.7.
Communication dated Oct. 16, 2014 from the Korean Intellectual Property Office in a counterpart Korean application No. 10-2013-0048513.
Communication from the Korean Intellectual Property Office dated Dec. 24, 2015 in a counterpart Korean application No. 10-2014-0058652.
Communication, dated Aug. 12, 2013, issued by the European Patent Office in counterpart European Application No. 13172075.7.
Communication, issued by the Korean Intellectual Property Office, dated Apr. 21, 2016, in counterpart Korean Application No. 10-2015-0086152.