HUE031188T2 - Berendezés kép kódolására - Google Patents
Berendezés kép kódolására Download PDFInfo
- Publication number
- HUE031188T2 HUE031188T2 HUE15175096A HUE15175096A HUE031188T2 HU E031188 T2 HUE031188 T2 HU E031188T2 HU E15175096 A HUE15175096 A HU E15175096A HU E15175096 A HUE15175096 A HU E15175096A HU E031188 T2 HUE031188 T2 HU E031188T2
- Authority
- HU
- Hungary
- Prior art keywords
- block
- mode
- scan
- prediction
- intra
- Prior art date
Links
- 238000000034 method Methods 0.000 claims description 27
- 241000282836 Camelus dromedarius Species 0.000 claims 1
- 206010035148 Plague Diseases 0.000 claims 1
- 241000607479 Yersinia pestis Species 0.000 claims 1
- 230000009466 transformation Effects 0.000 description 24
- 239000013598 vector Substances 0.000 description 14
- 238000013139 quantization Methods 0.000 description 12
- 230000006835 compression Effects 0.000 description 6
- 238000007906 compression Methods 0.000 description 6
- 230000002457 bidirectional effect Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 238000001914 filtration Methods 0.000 description 4
- 238000011002 quantification Methods 0.000 description 4
- 238000005192 partition Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 238000000844 transformation Methods 0.000 description 2
- 208000037170 Delayed Emergence from Anesthesia Diseases 0.000 description 1
- 241000023320 Luma <angiosperm> Species 0.000 description 1
- 230000003044 adaptive effect Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 230000000903 blocking effect Effects 0.000 description 1
- 230000003139 buffering effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 239000011159 matrix material Substances 0.000 description 1
- OSWPMRLSEDHDFF-UHFFFAOYSA-N methyl salicylate Chemical compound COC(=O)C1=CC=CC=C1O OSWPMRLSEDHDFF-UHFFFAOYSA-N 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- VYMDGNCVAMGZFE-UHFFFAOYSA-N phenylbutazonum Chemical compound O=C1C(CCCC)C(=O)N(C=2C=CC=CC=2)N1C1=CC=CC=C1 VYMDGNCVAMGZFE-UHFFFAOYSA-N 0.000 description 1
- 229920000136 polysorbate Polymers 0.000 description 1
- 238000007430 reference method Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
- H04N19/103—Selection of coding mode or of prediction mode
- H04N19/109—Selection of coding mode or of prediction mode among a plurality of temporal predictive coding modes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
- H04N19/103—Selection of coding mode or of prediction mode
- H04N19/11—Selection of coding mode or of prediction mode among a plurality of spatial predictive coding modes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
- H04N19/12—Selection from among a plurality of transforms or standards, e.g. selection between discrete cosine transform [DCT] and sub-band transform or selection between H.263 and H.264
- H04N19/122—Selection of transform size, e.g. 8x8 or 2x4x8 DCT; Selection of sub-band transforms of varying structure or type
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
- H04N19/129—Scanning of coding units, e.g. zig-zag scan of transform coefficients or flexible macroblock ordering [FMO]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
- H04N19/13—Adaptive entropy coding, e.g. adaptive variable length coding [AVLC] or context adaptive binary arithmetic coding [CABAC]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
- H04N19/136—Incoming video signal characteristics or properties
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
- H04N19/157—Assigned coding mode, i.e. the coding mode being predefined or preselected to be further used for selection of another element or parameter
- H04N19/159—Prediction type, e.g. intra-frame, inter-frame or bidirectional frame prediction
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
- H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
- H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
- H04N19/18—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being a set of transform coefficients
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
- H04N19/593—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving spatial prediction techniques
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
- H04N19/61—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding in combination with predictive coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
- H04N19/91—Entropy coding, e.g. variable length coding [VLC] or arithmetic coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
- H04N19/96—Tree coding, e.g. quad-tree coding
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Discrete Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
- Magnetic Resonance Imaging Apparatus (AREA)
Description
(12) EUROPEAN PATENT SPECIFICATION (45) Date of publication and mention (51) Int Cl.: of the grant of the patent: H04N 191129 <201401> H04N 191159 <201401> 12.10.2016 Bulletin 2016/41 H04N 19I176<201401> H04N 19I13<201401> H04N 191122 <201401> H04N 19161 <201401> (21) Application number: 15175096.5 "<>4N 19I96<2”4<”> H04N 19111 <2”4”> H04N 191109 <201401> H04N 19191 <201401> (22) Date of filing: 22.04.2011 H04N WM*"4* M04N 19M9*™>
(54) APPARATUS FOR ENCODING AN IMAGE
VORRICHTUNG ZUR CODIERUNG EINES BILDES APPAREIL DE CODAGE DONE IMAGE (84) Designated Contracting States: (74) Representative: Griinecker Patent- und AL AT BE BG CH CY CZ DE DK EE ES FI FR GB Rechtsanwálte
GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PartG mbB PL PT RO RS SE SI SK SM TR LeopoldstraSe 4 80802 München (DE) (30) Priority: 23.04.2010 KR 20100038158 (56) References cited: (43) Date of publication of application: EP-A2-2 600 613 EP-A2- 2 600 614 25.11.2015 Bulletin 2015/48 EP-A2- 2 608 541 EP-A2- 2 608 543 (62) Document number(s) of the earlier application(s) in · Marta Karczewicz ET AL: "Joint Collaborative accordance with Art. 76 EPC: Team on Video Coding (JCT-VC) of ITU-T SG16 11772290.0 / 2 563 020 WP3 and ISO/IEC JTC1/SC29/WG11",, 13 April 2010 (2010-04-13), XP055152381, Retrieved from (73) Proprietor: M&K Holdings Inc. the Internet:
Seoul 06586 (KR) URL:http://wftp3.itu.int/av-arch/jctvc-sit e/2010_04_A_Dresden/JCTVC-A121.zip (72) Inventors: [retrieved on 2014-11-11] • OH, Soo Mi · WINKEN (FRAUNHOFER HHI) M ET AL: "Video 463-887 Gyeonggi-do (KR) coding technology proposal by Fraunhofer HHI", • YANG, Moonock 1. JCT-VC MEETING; 15-4-2010 - 23-4-2010;
16-199 Singapore (SG) DRESDEN; (JOINTCOLLABORATIVE TEAM ON VIDEO CODING OF ISO/IEC JTC1/SC29/WG11 AND ITU-TSG.16 ), 16 April 2010 (2010-04-16), XP030007557, ISSN: 0000-0049
Note: Within nine months of the publication of the mention of the grant of the European patent in the European Patent Bulletin, any person may give notice to the European Patent Office of opposition to that patent, in accordance with the Implementing Regulations. Notice of opposition shall not be deemed to have been filed until the opposition fee has been paid. (Art. 99(1) European Patent Convention).
Description vide an improved apparatus for encoding an image.
[0008] This object is solved by the subject matter of [Technical Field] the independent claim.
[0009] The invention is set out in the appended set of [0001] The present invention relates to an image 5 claims; the further examples called embodiments in the processing apparatus and method, and more particular- description are illustrative examples, not embodiments ly, to an apparatus for reducing the amount of residual claimed in the present application. signals of an image and entropy-coding the residual sig- [0010] The present invention is directed to an appara- nals. tus for encoding a moving picture, and more particularly, 10 to an apparatus for effectively encoding transformed re-[Background Art] sidual signals of a moving picture having a predetermined size or more.
[0002] To efficiently transmit a moving picture signal at a low data rate while maintaining high image quality, [Technical Solution] various digital moving picture compression technologies 15 have been proposed. These moving picture compression [0011] One aspect of the present invention provides technologies include H.261, Motion Picture Experts an apparatus for encoding a moving picture, including: a
Group (MPEG)-2/H.262, H.263, MPEG-4, Advanced coding mode determiner configured to divide an input
Video Coding (AVC)/H.264, and so on. The compression image into coding units and determine a prediction mode technologies include a discrete cosine transform (DCT) 20 of the coding unit and a size of a predictive coding block scheme, a motion compensation (MC) scheme, a quan- of the coding unit; a transform/quantization unit config-tization scheme, an entropy coding scheme, and so on. ured to transform and quantize a residual block between [0003] For image coding, each picture is divided into the predictive coding block and a prediction block gen- a plurality of slices, and each slice is divided into a plu- erated through intra prediction or inter prediction; an in-rality of coding blocks of a predetermined size. Since an 25 verse quantization/transform unit configured to inversely image of a high-definition (FID) grade or above has many quantize and inversely transform the quantized transform flat areas, an image compression can be improved by block into a frequency domain; a deblocking filter config- encoding the image with coding blocks that are larger ured to apply a deblocking filtering process to image data than a macroblock (MB). received from the inverse quantization/transform decod- [0004] Therefore, new prediction technique is required 30 ing unit; a prediction block generator configured to gen- and changes in transform coding, entropy coding, intra erate the predictive coding block; and an entropy coder prediction and inter prediction is required as the size of configured to encode the quantized transform coeffi- the coding unit increases to increase image compression dents from the transform coding/quantization unit, ratio without increase of the complexity of image com- wherein, when a size of a transform block is equal to or pression. 35 larger than a predetermined size, the entropy coder di- [0005] Marta Karczewicz ET AL, "Joint Collaborative vides the quantized transform coefficients into a plurality
Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 ofsubsets, and scans and entropy-codes non-zero quan- and ISO/IEC JTC1/SC29/WG11", (20100413), URL:ht- tized transform coefficients of the each subset. tp ://wftp3. itu. i nt/a v-arch/jctvc- site/2010_04_A_Dresden/JCTVC-A121.zip, 40 [Advantageous Effects] (20141111), XP055152381 [A] 1-7 Section 2.3.2: relates to a proposal based on JMKTA software, namely, block [0012] The present invention enables coding efficiency sizes bigger than 16x16, mode dependent directional to be enhanced by reducing the amount of residual sig- transform for intra-coding, luma high precision filtering, nals of a block to be encoded. Also, by effectively scan- single pass switch interpolation filters with offsets, 45 ning a quantized transform coefficient other than 0 during quadtree based adaptive loop filtering and Internal bit- entropy coding, the number of bits required for the en- depth increase. tropy coding is minimized, such that the coding efficiency [0006] WINKEN (FRAUNHOFER HHI) MET AL.'Vid- can be improved, eo coding technology proposal by Fraunhofer HHI", 1. JCT-VC MEETING; 15-4-2010 - 23-4-2010; DRESDEN; 50 [Description of Drawings] (JOINTCOLLABORATIVE TEAM ON VIDEO CODING OF ISO/IEC JTC1/SC29/WG11 AND ITU-TSG.16), [0013] (20100416), ISSN 0000-0049, XP030007557 [A] 1-7 p. 17: relates to a proposed algorithm based on the hybrid FIG. 1 shows a block division structure according to video coding approach using temporal and spatial pre- 55 an exemplary embodiment of the present invention, diction followed by transform coding of the residual and FIG. 2 illustrates a method of determining a coding entropy coding. mode according to the present invention.
[0007] It is therefore the object of the invention to pro- FIG. 3 illustrates an apparatus for encoding a moving picture according to the present invention. slice. FIGS. 4 to 6 are diagrams illustrating an adaptive [0020] When the type of the slice is intra (I), all predic- block division method according to the present in- tive coding blocks in the slice are intra predicted, and a vention. prediction type of a predictive coding block can be deter- FIG. 7 is a diagram illustrating a method of encoding 5 mined according to a size of the predictive coding block, a residual signal. However, when the slice type is unidirectional prediction (P) or bidirectional prediction (B), a prediction type of a [Mode for Invention] predictive coding block may be determined according to prediction mode information and a size of the predictive [0014] Hereinafter, various embodiments of the 10 coding block. Thus, it is preferable to generate the prepresent invention will be described in detail with refer- diction type of the predictive coding block on the basis ence to the accompanying drawings. However, the of the slice type, the prediction mode information and the present invention is not limited to the exemplary embod- information indicating the size of the predictive coding iments disclosed below, but can be implemented in var- block, and insert the generated prediction type in a head- ious types. Therefore, many other modifications and var- 15 er of the coding unit. iations of the present invention are possible and it is to [0021] When the predictive coding block is intra-coded, be understood that within the scope of the disclosed con- intra prediction mode information used for intra prediction cept, the present invention may be practiced otherwise as well as the prediction type needs to be transmitted to than as has been specifically described. a decoder.
[0015] For image coding, each picture is divided into 20 [0022] When the predictive coding block is inter-coded, a plurality of slices, and each slice is divided into a plu- the predictive coding block is encoded by any one of uni- rality of coding units of a predetermined size. Since an directional prediction and bidirectional prediction. In the image of a high-definition (HD) grade or above has many case of unidirectional prediction, a bit stream should inflat areas, an image compression ratio can be improved elude information on a reference picture and motion vec-by encoding the image with coding units that are greater 25 tor information used for prediction as well as a prediction than a macroblock (MB) having a size of 16x16. type of the predictive coding block for unidirectional pre- [0016] Coding unit according to the present invention diction. In the case of bidirectional prediction, a header may be a block having a size of 32x32 or block having of the predictive coding block should include information a size of 64X64 as well as MBs having the size of 16x16. on two reference pictures and motion vector information
Also, a block having a size of 8x8 or less may be the 30 used for bidirectional prediction as well as a prediction coding unit. For convenience, the largest coding unit is type of the block for bidirectional prediction. The motion referred to as a super macroblock (SMB). A size of the vector information may include information indicating a SMB may be determined according to information indi- residual motion vector and a motion vector predictor, eating a size of the smallest coding unit and depth infor- [0023] FIG. 1 shows a hierarchical division structure mation. The depth information indicates a difference be- 35 illustrating allowable predictive coding blocks for a SMB tween a size of the SMB and a size of the smallest coding having a size of 64x 64 according to an exemplary em-unit. bodiment of the present invention.
[0017] Thus, coding unit that will be used for encoding [0024] When an SMB is used as a coding unit, it is all pictures of an image sequence may be SMB or sub- preferable to havefoursub-blockdivisionstepsasshown block of the SMB. The allowable sizes of the coding units 40 jn FIG. 1, but block division is not limited to the four submay be designated by default or in a sequence header. block division steps. When there are four sub-block divi-
When the allowable sizes of coding units are designated sion steps, a total of 13 predictive block types (64x64, in the sequence header, the allowable sizes of the coding 64 x 32, 32x 64, 32 x 32, 32x16, 16 x 32, 16x16, 16x 8, units are designated according to the size of the smallest 8X16, 8x8, 8x4, 4x8 and 4x4) can be defined, coding unit and the depth information. 45 [0025] Here, there may be no data to be transmitted [0018] Each picture or slice is divided into a plurality for inter predictive coding blocks having a greater size of SMB units. Each SMB or sub-block of the SMB may than an MB. Thus, it is preferable to newly add an is intra-coded or inter-coded and decoded. MB64_SKIP mode when a size of a predictive coding [0019] To enable the coding unit (i.e., an SMB or a sub- block is 64x 64, and an MB32_SKIP mode when the size block of the SMB) to be accurately decoded, an encoder 50 of the predictive coding block is 32x32. To transmit the should add size information on a predictive coding block mode information to the decoder, an MB64_SKIP_flag of the coding unit and prediction mode information indi- or an MB32_SKIP_flag may be used. When values of eating that the coding unit has been coded in intra pre- these flags are 1, there is no transmission data of the diction mode or in inter prediction mode to a bit stream. corresponding predictive coding block.
To this end, the prediction mode information and the in- 55 [0026] Meanwhile, when plural successive SMBs are formation indicating the size of the predictive coding not encoded, an MB64_SKIP_flag may be inserted in a block should be included in the bitstream of coding unit. first SMB only, and may be omitted in the following SMBs.
The prediction mode varies according to a type of the In this case, the number of SMBs that are successively skipped may be added to the slice or the first SMB. Spe- [0034] However, when the 32X32 block has data to be cifically, when the plural of successive SMBs are not en- encoded but is not divided into 16X16 blocks, coding coded, a SMB_SKIP_flag of the first SMB is set to 1, and size of the 32x32 block which is one of 32X32, 32X16 may also be applied to several successive SMBs in com- and 16X32 and information about whether the 32X32 mon. In this case, information corresponding to the 5 blocks are intra-coded or inter-coded is inserted in head-numberofSMBs that are not successively encoded (e.g., ers of the 32x32 blocks, and a data block is generated an SMB_SKIP_number) may be added to the slice. using encoded data.
[0027] When a coding unit has a size of 32X32, block [0035] When the 32X32 block has data to be encoded having a size of 32X32, 32X16 or 16X32 in addition to and isdivided into 16X16 blocks, it isdetermined whether existing block having a size of 16X16,16X8, 8X16,8X8, 10 there is data to be encoded in the corresponding 16X16 8x4, 4X8 or 4X4 can be used as a predictive coding blocks. When there is no data to be encoded in the cor-block. responding 16x16 blocks, the SKIP mode is determined [0028] In an inter-prediction mode, a prediction type as the 16X16 block mode, and an mb16_skip_flag is (Mb32_type) of a coding unit may indicate a 32X32 par- transmitted to the decoder. On the other hand, when tition when the prediction type is 0, a 32X16 partition 15 there is data to be encoded in the corresponding 16X16 when the prediction type is 1, a 16X32 partition when blocks, coding size of the 16x16 block which is one of the prediction type is 2, and a 16X16 partition when the 16X16, 16X8 and 8X16 and information about whether prediction type is 3. the 16X16 block is intra-coded or inter-coded is inserted [0029] When a coding unit isdivided into four sub-cod- in a header of the 16X16 block, and a data block is gening units, the four sub-coding units are encoded and 20 erated using encoded data. transmitted in a raster scan order. In this case, a quan- [0036] When blocks having such a variety of sizes are tization parameter may be transmitted for each coding used, block size information may vary according to each unit, and may be transmitted only once in a header of a sequence level, picture level, slice level, SMB or sub-super-coding unit when the same quantization parameter coding unit of the SMB. is applied to all the sub-coding units. However, when a 25 [0037] FIG. 3 illustrates an apparatus for encoding a quantization parameter needs to be changed in a sub- moving picture according to the present invention, codingunit.onlyadifferencevaluewithrespecttoaquan- [0038] Referring to FIG. 3, an apparatus for encoding tization parameter of the upper layer coding unit or the a moving picture according to the present invention in-preceding coding unit of the same level may be transmit- eludes a coding mode determiner 110, a transform/quan-ted. 30 tization unit 120, an entropy coder 130, an intra predictor [0030] Each sub-coding unit may be divided using a 140, a motion compensator 150, a motion estimator 155, quadtree method, and a coded block pattern (cbp) and an inverse quantization/transform unit 160, a deblocking a residual coefficient may also be transmitted using the filter 170, a picture storage 180, an adder 185 and a subquadtree method. When a 1-bit cbp is used, a cbp value tracter 190. of 1 may indicate that the coding unit has at least one 35 [0039] The coding mode determiner 110 analyzes an coefficientotherthanO.andacbpvalueofOmayindicate input video signal to divide a picture into coding units, that all coefficients are 0. and determines a size of a predictive coding block and [0031] FIG. 2 illustrates a method ofdetermining a cod- a prediction mode for each coding unit. Also, the coding ing mode when a size of an SMB is 64x64 according to mode determiner 110 sends the predictive coding block the present invention. 40 corresponding to the determined size to the subtracter [0032] As illustrated in FIG. 2, when an SMB is a 64X64 190. block, an encoder determines whether or not it is possible [0040] The transform/quantization unit 120 determines to skip the 64x64 block, and determines a SKIP mode a size of a transform block to transform residual signal as a coding mode when it is possible to skip the 64x64 received from the subtracter 190. The size of a transform block. At this time, an mb64_skip_flag should be trans- 45 block may be equal to or less than that of the predictive mitted to the decoder. When the 64x64 block has data coding block, but may be set differently in an inter mode, to be encoded but is not divided into 32 x 32 blocks, cod- In other words, the size of the transform block may be ing size of the SMB which is one of 64x64, 64X32 and greater than that of the predictive coding block in the inter 32X64 and information about whether the SMB is intra- mode. In this case, the transform/quantization unit 120 coded or inter-coded is inserted in an SMB header, and 50 receives multiple residual blocks from the subtracter 190 an SMB data block is generated using encoded data. and generates one transform block consisting of the mul- [0033] When the 64X 64 block has data to be encoded tiple residual blocks. A size of the transform block is equal and isdivided into 32 X 32 blocks, it is likewise determined to or less than that of the coding unit. The transform/quan-whetherthere is data to be encoded in the corresponding tization unit 120 performs a two-dimensional (2D) dis-32X32 blocks. When there is no data to be encoded in 55 crete cosine transform (DCT) on the transform block to the corresponding 32X32 blocks, the SKIP mode is de- generate transform coefficients. The DCT may be an in-termined as the 32X32 block mode, and an teger DCT. mb32_skip_flag is transmitted to the decoder. [0041] Also, the transform/quantization unit 120 deter- mines a quantization step size used for quantizing the predictively encoded, selects one of a predetermined transform coefficients, and quantizes the transform co- number of intra prediction modes according to a size of efficients using a quantization matrix determined accord- the current block, and performs intra prediction, ing to the determined quantization step size and a coding [0050] The entropy coder 130 entropy-codes the quan- mode. 5 tization coefficients quantized by the transform/quantiza- [0042] The inverse quantization/transform unit 160 in- tion unit 120, motion information generated by the motion versely quantizes and inversely transforms the quantiza- estimator 155, and so on. The quantized transform co- tion coefficients quantized by the transform coding/quan- efficients are converted into one-dimensional (1D) quantization unit 120, thereby restoring a residual block in the tized transform information by a predetermined scanning spatial domain from a residual block transformed into the 10 method and entropy-coded. frequency domain. [0051] An intra prediction process will bedescribed be- [0043] The deblocking filter 170 receives image data low with reference to FIG. 3. that is inversely quantized and inversely transformed [0052] First, the intra predictor 140 receives position from the inverse quantization/transform unit 160 and per- and size information on a coding block to be encoded forms a filtering process for removing a blocking effect. 15 from the coding mode determiner 110.
The deblocking filtering process may be applied to a [0053] Next, the intra predictor 140 receives valid ref- boundary between predictive coding blocks and between erence pixels for determining an intra prediction mode of transform blocks. The boundary is an edge of a grid hav- the current predictive coding block from the picture storing a predetermined size or more and the predetermined age 180. The reference pixels have already been encod- size may be 8X8. The deblocking filtering process in- 20 ed and restored, and are adjacent to the current predic-cludes a step of determining a boundary to be filtered, a tive coding block (hereafter, referred to as current block), step of determining a boundary filtering strength to be When the current block is positioned at an upper bound- applied to the boundary, a step of determining whether ary of the current picture, pixels adjacent to the upper or not to apply the deblocking filter 170, and a step of side of the current block are notdefined. When the current selecting a filter to be applied to the boundary when it is 25 block is positioned at a left boundary of the current pic-determined to apply the deblocking filter 170. ture, pixels adjacent to the left side of the current block [0044] Whether or not to apply the deblocking filter 170 are not defined. Also, when the current block is positioned is determined according to i) whether or not the boundary at the upper or left boundary of the slice, pixels adjacent filtering strength is greater than 0 and ii) whether or not to the upper or left side are not defined. a value indicating the difference between boundary pixels 30 [0054] When there are no pixels adjacent to the left or of P block and Q block is less than a first reference value upper side of the current block or there are no pixels that determined according to a quantization parameter. have been previously encoded and restored as men- [0045] Two or more filters may exist. When an absolute tioned above, an intra prediction mode of the current value of a difference between two pixels adjacent to the block can be determined using only valid pixels. block boundary is equal to or greater than a second ref- 35 [0055] However, the invalid reference pixels may be erence value, a weak filter is selected. The second ref- generated using pixels adjacent to the current block or erence value is determined by the quantization parame- available pixel. For example, when pixels of an upper ter and the boundary filtering strength block are not valid, pixels on the upper side may be gen- [0046] The picture storage 180 receives filtered image erated using one or more available reference pixels on from the deblocking filter 170, stores the image in picture 40 the left side. units. The picture may be an image of a frame or an [0056] Meanwhile, even when there are pixels on the image of a field. The picture storage 180 has a buffer upper or left side of the current block, the pixels may be (not shown) capable of storing a plurality of pictures. determined as invalid pixels according to a coding mode [0047] The motion estimator 155 performs motion es- of a block to which the pixels belongs. For example, when timation using at least one reference picture stored in the 45 a block to which pixels adjacent to the upper side of the picture storage 180, and outputs a reference picture in- current block belong has been inter-coded and restored, dex representing the reference picture and a motion vec- the pixels may be determined as invalid pixels. In this tor. case, reference pixels may be generated using reference [0048] The motion compensator 150 extracts a predic- pixel of a block having intra mode. tion block corresponding to a block to be encoded from 50 [0057] Next, the intra predictor 140 determines the in- the reference picture used for motion estimation among tra prediction mode of the current block using the refer- a plurality of reference pictures stored in the picture stor- ence pixels. The number of intra prediction modes deage 180 according to the reference picture index and the pends on a size of the block. motion vector input from the motion estimator 155, and [0058] According to the size of the block, 33, 16 or 2 outputs the extracted prediction block. 55 directional modes and at least one non-directional mode [0049] The intra predictor 140 performs intra-predic- are allowed. The non-directional mode may be a direct tion using reconstructed pixel values in the same picture. current (DC) mode or a planar mode.
The intra predictor 140 receives a current block to be [0059] Different numbers of intra prediction modes can be assigned to blocks having the same size. To indicate the upper block, and a flag indicating one of the intra that different numbers of intra prediction modes are al- prediction modes of the upper and left blocks are trans- lowed, information indicating the number of intra predic- mitted. In this case, when the left and upper blocks of the tion modes can be inserted in at least one of a sequence current block have the same intra prediction mode, only header, picture header, slice header and a coding unit 5 the flag indicating that the intra prediction mode of the header. It is preferable to insert the information in a se- current block is equal to one of the intra prediction mode quence header or a picture header. of the left block and the intra prediction mode of the upper [0060] Next, when the intra prediction mode of the cur- block may be transmitted. Likewise, when only one of rent block is determined, a prediction block of the current the intra prediction modes of the upper and left blocks is block is generated. The prediction block is generated us- 10 valid and equal to that of the current block, only the flag ing reference pixels including generated pixel or using a indicating the intra prediction mode of the current block linear combination of the reference pixels on the basis is equal to one of the intra prediction mode of the left of the intra prediction mode of the current block. For ex- block and the intra prediction mode of the upper block ample, in a directional mode of a specific direction, a may be transmitted. prediction mode can be generated using reference pixels 15 [0068] However, when the intra prediction mode of the on the upper side of the current block and those on the current block is different from those of the left and upper left side of the current block. blocks, it is determined whether or not the intra prediction [0061] The valid reference pixels used to generate the mode number of the current block is smaller than those prediction block may be filtered reference pixels. A filter of the left and upper blocks. to be applied to the valid reference pixels may be plural 20 [0069] When it is determined that both of the intra prein number. Also, the plurality of filters may be adaptively diction mode numbers of the left and upper blocks of the applied according to a size of the current block and the current block are greater than the intra prediction mode intra prediction mode. number of the current block, the intra prediction mode of [0062] Next, a residual blockobtained by using the cur- the current block is determined as a final intra prediction rent block and the prediction block generated by the intra 25 mode. However, when only one of the intra prediction predictor 140 are encoded by the transform/quantization mode numbers of the left and upper blocks of the current unit 120 and the entropy coder 130. block is notgreaterthan the intra prediction modenumber [0063] Meanwhile, the intra prediction mode of the cur- of the current block, an intra prediction mode having a rent block is separately encoded. The intra prediction mode number obtained by subtracting 1 from the intra mode may be encoded by the intra predictor 140, a sep- 30 prediction mode number of the current block is deter-arate intra prediction mode coder (not shown) or the en- mined as the final intra prediction mode of the current tropy coder 130. block. Also, when neither of the intra prediction mode [0064] The intra prediction mode of the current block numbers of the left and upper blocks of the current block is encoded using intra prediction modes ofan upper block is greater than the intra prediction mode number of the and a left block of the current block. 35 current block, an intra prediction mode having a mode [0065] First, the intra prediction modes of the left and number obtained by subtracting 2 from the intra predicupper blocks of the current block are derived. When the tion mode number of the current block is determined as upper block is plural in number, a leftmost upper block the final intra prediction mode of the current block. or a block having the minimum mode number is set as [0070] Next, the final intra prediction mode of the cur- an upper block of the current block. Also, when the left 40 rent block is encoded. Using different coding tables ac- block is plural in number, an uppermost left block or a cording to whether or not the upper block of the current block having the minimum mode number is set as a left block has the same intra prediction mode as the left block block of the current block. When the upper block or the of the current block, the final intra prediction mode of the left block is not encoded in intra prediction mode, the DC current block is encoded. The intra prediction mode of mode (mode number 2) may be set as an intra prediction 45 the upper block or the left block of the current block may mode of the upper block or the left block. be a modified intra prediction mode. In other words, the [0066] Next, when the intra prediction mode number intra prediction mode of the upper block or the left block of the upper or left block is equal to or greater than the of the current block may be an intra prediction mode mod- number of allowable intra prediction modes of the current ified by a table for mapping intra prediction modes allow- block, the intra prediction mode of the upper or left block 50 able for the upper block and the left block to a predeter- is converted into one of the intra prediction modes al- mined number of intra prediction modes. The predeter- lowed for the current block. mined number may be 9 or 3.
[0067] Next, when the intra prediction mode of the cur- [0071] A quantized transform coefficient coding proc- rent block is equal to one of the intra prediction mode of ess of the entropy coder 130 of FIG. 3 will be described the left block and the intra prediction mode of the upper 55 below. block, a flag indicating that the intra prediction mode of [0072] The quantized transform coefficients are entro- the current block is equal to one of the intra prediction py-coded using context-adaptive variable length coding mode of the left block and the intra prediction mode of (CAVLC) or context-adaptive binary arithmetic coding (CABAC). When a size of transform block becomes large, plied to the subsets. In the intra prediction, a scan pattern there is a high possibility that a large number of bits will selected by the intra prediction direction may be applied be required to scan and entropy-code coefficients other to the subsets. than 0. Thus, it is preferable to introduce new scan meth- [0077] It may be effective to scan the quantized trans- od for reducing the number of bits for a transform block 5 form coefficients in the subset in a reverse direction. In having a size equal to or largerthan a predetermined size. other words, the quantized transform coefficients can be [0073] First, it is determined whether or not to divide scanned from the last non-zero coefficient of the subset quantized transform coefficients into a plurality of sub- in a reverse direction according to a scan pattern. Like- sets. It depends on a size of transform block. In other wise, the plurality of subsets are scanned from a subset words, when the size of a transform block is equal to or to including the last non-zero coefficient of the transform larger than a predetermined size, the quantized trans- block to a main subset in a reverse direction. form coefficients are divided into a plurality of subsets. [0078] Meanwhile, for correct entropy decoding of the
The predetermined size may be 8X8 or 16X16. The plu- decoder, an encoder encodes information capable of in- rality of subsets consist of one main subset and one or dicating a position of the last non-zero coefficient in the more residual subsets. The main subset is positioned at 15 transform block and information capable of indicating a an upper left side including a DC coefficient, and the one position of the last non-zero coefficient in each subset, or more residual subsets cover area other than area that and transmits the encoded information to the decoder, the main subset covers. The information may indicate a position of the last non- [0074] Next, when the size of the transform block is zero coefficient in each subset. Also, the information may equal to or largerthan the predetermined size, the quan- 20 be map information consisting of flags indicating whether tized transform coefficients are divided into a main subset each transform coefficients is 0 or not and flags indicating and one or more residual subsets, and quantized trans- whether the non-zero coefficient is the last non-zero coform coefficients included in each subset are scanned efficient or not in the transform block. A scan pattern for and encoded. The quantized transform coefficients in the generating the map information may be the same as the subset may be scanned using one of a plurality of scan 25 scan pattern in the subsets. patterns. A scan pattern in which the number of bits to [0079] In another example for scanning quantized be encoded becomes the minimum may be selected ac- transform coefficients of the transform block, the quan-cording to distribution of non-zero pixels of the quantized tized transform coefficients of a transform block may be transform coefficients in the subset. The plurality of scan rearranged using an interleaving method and converted patterns may include zigzag scan, vertical scan and hor- 30 into a plurality of sub-blocks, and each of the sub-blocks izontalscan. Also, vertical scan or horizontal scan of Mo- may be scanned and encoded. tion Picture Experts Group (MPEG)-4 may be included. [0080] Meanwhile, when an image has a boundary in When a scan pattern is transmitted for each subset, a a specific direction and an equivalent prediction mode is large number of bits are required. Therefore one scan used, different sub-blocks are used for similar data at a pattern may be applied to a plurality of subsets. 35 motion boundary portion, and unnecessary overhead [0075] Meanwhile, the scan pattern may be adaptively may occur. In this case, it may be further effective to selected according to the prediction mode and the intra divide a coding unit in a specific direction according to a prediction direction. For example, in the inter prediction shape of the boundary portion of the image and perform mode, itis possible to apply onlyone predetermined scan motion estimation on each divided area. pattern (e.g., zigzag scan) or one of the plurality of scan 40 [0081] With reference to FIGS. 4 to 6, a method of dipatterns. In the former case, scan pattern information rection-adaptively dividing a block in consideration of does not need to be transmitted to the decoder, but in characteristics of an image will be described. In FIGS. 4, the latter case, scan pattern information needs to be 5 and 6, a coding unit of 32 X 32 will be described as an transmitted to the decoder. In the intra prediction mode, example. However, the size of a coding unit is not limited a scan pattern can be selected according to the intra- 45 to32x32,andthemethodcanalsobeappliedtoa64x64 prediction direction. For example, it is possible to apply block or a 16x16 block. horizontal scan in a vertical intra prediction mode, vertical [0082] In one example of the simplest adaptive mode, scan in a horizontal intra prediction mode, and zigzag a coding unit is divided into two blocks by a straight line scan in a DC mode. so as to extract statistical dependency of a prediction [0076] A scan pattern to be applied to the main subset 50 area on local topography. In other words, a boundary and the one or more residual subsets may be a prede- portion of the image is matched to straight lines and di- termined pattern. The predetermined pattern may be zig- vided. zag scan. In addition to zigzag scan, horizontal scan or [0083] As shown in the drawings, when there is a vertical scan may be applied to the subsets. The scan boundary that traverses an image of a 32X32 block, a pattern applied to the subsets may also be adaptively 55 boundary portion traversing the image should be divided determined according to the prediction mode and the in- into small blocks to efficiently compress the image ac- tra prediction direction. In other words, in the inter pre- cording to a conventional image division method, diction mode, a predetermined scan pattern may be ap- [0084] Thus, as shown in FIG. 4, the one 32X 32 block should be divided into at least 10 blocks and encoded. the same direction as the current block. The straight line
Therefore, 10 motion vectors should be transmitted to a information ordifferential information on the current block decodertogetherwith information for representing image may be expressed as one corresponding index, which division, and thus much additional information other than may be variable-length coded and transmitted, image information is required. 5 [0093] Meanwhile, whether or not to apply the direc- [0085] Meanwhile, as shown in FIG. 5 or 6, when there tion-adaptive division method may be determined ac- is a boundary that traverses the image of the 32x32 cording to a size of a predictive coding block. Since the block, the number of pieces of additional information to direction-adaptive division method applied to an exces-be transmitted to the decoder can be remarkably reduced sively small coding block may increase the amount of by matching the image boundary with at leastone straight n> information and complexity to be transmitted, it is pref-line indicating the image boundary. erable not to apply the method.
[0086] For example, when the boundary that traverses [0094] As shown in FIG. 7, the method of dividing a the 32x32 block is matched to two straight lines as shown predictive coding block according to a shape of a bound-in FIG. 5, the 32 x 32 block is divided into four 16x16 ary portion of an image may be applied only to specific blocks, and straight lines that match respective first and 15 directions limited to a predetermined number. For exam-fourth 16x16 blocks to a block boundary can be obtained. pie, the method of dividing a block may be limited to four In this case, six division areas are required, and motion directions of a horizontal direction, a vertical direction, vectors to be transmitted to the decoder can be reduced an upward diagonal direction and a downward diagonal to six. direction, or two directions of the horizontal direction and [0087] Likewise, when the boundary that traverses the 20 the vertical direction. The number of cases of dividing block is matched to one straight line as shown in FIG. 6, the block in the specific directions may vary according to the 32x 32 block is divided into two blocks, and only one a size of the predictive coding block. For example, a prepiece of block mode information and two motion vectors dictive coding block having a size of 32x32 may be dineed to be transmitted to the decoder. vided in a specific direction (e.g., the horizontal direction) [0088] Meanwhile, when a block is divided using a 25 using seven methods, and a predictive coding block hav-straight line, information on the used straight line should ing a size of 16x16 may be divided using three methods, be additionally transmitted to the decoder. The straight Also, regardless of the size of the predictive coding block, line information to be transmitted will be described below. it is possible to divide the predictive coding block using [0089] The straight line information to be transmitted the same number of methods. can be transmitted using various methods. 30 [0095] According to chroma, the predictive coding [0090] A first example is to represent the information block can also be divided into the same partitions, and on the straight line using a distance and angle with re- all the following methods can also be applied to the divi- spect to a predetermined position. In this case, the pre- sion. The predictive coding block having respective divi- determined position may beapixelattheupperleftcorner sion areas should include, in a header, a flag indicating orthe center of the block. The distance maybe an integer 35 presence of a division block, information indicating how or a quantized value. The angle may be 0 to 180, and the division has been made, and encoded reference pic- may also be a quantized value. ture indices that are referred to according to respective [0091] A second example is to transmit position values division areas. of both ends of the straight line that traverses the block [0096] When one block is direction-adaptively predict- to the decoder. The position values may be expressed 40 ed, motion estimation and motion compensation should as values indicating how far both of the ends are from be performed on each of two divided areas. Thus, a mo- the pixel at the upper left corner of the block while going tion vector should be derived from each of the divided around the boundary of the block clockwise beginning at areas, and a residual signal between each of the divided the upper left corner. In this case, either of the ends may areas and a reference area obtained based on the motion be represented as a position from the pixel while going 45 vector should be derived and encoded, around the boundary clockwise, and the other may be [0097] A residual signal can be encoded using anyone represented as a position from the pixel while going of the following methods. around the boundary counterclockwise, such that [0098] First, a residual signal can be derived from each straight line information may be expressed. In this case, of two areas divided from one predictive coding block, information on straight lines close to more various shapes 50 and then the two residual signals can be added to form can be expressed using a small number of bits. one block residual signal and transform-coded. In this [0092] When there are neighboring blocks that have case, it is quite possible that there will be difference be- been direction-adaptively divided and encoded already, tween the overall distribution of residual signals in the it is effective to transmit differential information between respective areas divided along a boundary, and thus it straight line information on the current block and straight 55 is preferable to apply a filter to the boundary. line information on one selected from the neighboring [0099] In another method, encoding maybe performed blocks. It is more preferable to encode differential infor- by applying shape-adaptive transform to each of the di- mation using direction information on blocks divided in vided areas. As shown in FIG. 7, when one block is di- vided into two areas, an upper left block is subjected to [0107] Here, one straight line is used for block division, horizontal 1D transform as it is and then vertical IDtrans- However, it is also possible to divide one block into at form, and a lower right block is rearranged or rotated by least two division areas using information consisting of 180 degrees as shown in the drawing and subjected to at least two straight lines, and coding of the divided areas 1D transform and then vertical 1D transform. In this case, 5 can be performed as described above, residual coefficients separately encoded according to the [0108] While the invention has been shown and de- respective division areas may be transmitted to the de- scribed with reference to certain exemplary embodi- coder, or may be combined and transmitted. ments thereof, it will be understood by those skilled in [0100] In still another method, padding may be per- the art that various changes in form and details may be formed according to the respective divided areas to gen- 10 made therein without departing from the scope of the erate and encode a block. In otherwords, when a current invention as defined by the appended claims, division area is encoded, the other division area constituting the block is padded with a value of the current division area to constitute the one block and then is sub- Claims jected to 2D transform coding. Padding may be horizontal 15 padding (horizontally copying an undefined area from a 1. An apparatus for encoding an image, the apparatus defined area) and vertical padding (vertically copying an comprising: undefined area from a defined area). In this case, it is preferable to perform horizontal padding and then vertical an intra predictor (140) configured to generate padding. Also, an undefined pixel adjacent to one or more 20 a prediction block using intra prediction; defined pixels may be padded through linear combination a transform/quantization unit (120) configured of the defined pixels. Also, directionality may be given to transform and quantize a residual block to according to a division direction, such that any one of generate a quantized transform block; horizontal padding and vertical padding may be per- an inverse quantization/transform unit (160) formed first. 25 configured to inversely quantize and inversely [0101] Next, motion vector estimation will be de- transform the quantized transform block; and scribed. an entropy coder (130) configured to entropy- [0102] When one block is divided into two areas using code quantized transform coefficients of the a straight line, a motion vector of each of the divided quantized transform block, areas is differentially encoded using an already encoded 30 wherein the quantized transform coefficients are motion vector. divided into a plurality of sub-blocks if it is deter- [0103] In a first method, a first area of the divided areas mined that a size of a transform block is equal may select one of motion vectors of adjacent blocks as to or larger than 8x8 in an intra prediction, a motion vector predictor, and a second area may select wherein the plurality of sub-blocks are scanned one of motion vectors of adjacent blocks other than the 35 and non-zero coefficients of each sub-block are first area as a motion vector predictor. scanned according to a scan pattern, wherein [0104] In a second method, a first area of the divided said scan pattern for scanning the plurality of areas mayselectoneofmotion vectors of adjacent blocks sub-blocks and for scanning the non-zero coef- as a motion vector predictor, and a second area may ficients of each sub-block is determined by an select a motion vector of the first area as a motion vector 40 intra prediction mode of the prediction block to predictor. entropy-code the scanned non-zero coeffi- [0105] In a third method, when there is a direction- cients, wherein, when the intra prediction mode adaptively divided block among blocks adjacent to a cur- is a horizontal mode, the scan pattern is a ver- rent block, a motion vector of the direction-adaptively di- tical scan pattern, vided block is used as a reference motion vector in con- 45 wherein the entropy coder (130) scans the non- sideration of directivity of the divided blocks. Thus, when zero coefficients of each sub-block in a reverse there are a plurality of direction-adaptively divided blocks, direction from a last non-zero coefficient of each motion vectors in a predetermined sequence or motion sub-block, vectors of blocks having similar division directions may be used as reference motion vectors. so 2. The apparatus of claim 1, wherein the entropy coder [0106] In a fourth method, a first area of the divided (130) scans the plurality of sub-blocks in a reverse areas may set a motion vector of one of blocks adjacent direction from a last sub-block. to the first area as a motion vector predictor of the first area, and a second area may select any one of motion 3. The apparatus of claim 1, wherein the entropy coder vectors of blocks adjacent to the second area and a mo- 55 (130) encodes positions of the non-zero coefficients tion vector of a block or a division area at the same po- and information for identifying the non-zero coeffi- sition in a previous picture as a motion vector predictor cients of each sub-block, and encode a differential motion vector. 4. The apparatus of claim 1, wherein when the intra Unterblock in einer Rückwártsrichtung von ei- prediction mode is a vertical mode, the scan pattern nem letzten Nicht-Null-Koeffizient von jedem is a horizontal scan pattern. Unterblock abtastet. 5. The apparatus of claim 1, wherein a scan pattern for 5 2. Vorrichtung nach Anspruch 1, wobei der Entropie- scanning flags indicating whether each transform co- Codierer(130)dieVielzahlvon Unterblöcken in einer efficient of each sub-block is 0 or not is the same as Rückwártsrichtung von einem letzten Unterblock ab- the scan pattern for scanning the non-zero coeffi- tastet. cients of each sub-block. 10 3. Vorrichtung nach Anspruch 1, wobei der Entropie- 6. The apparatus of claim 1 .wherein the intra prediction kodierer (130) Positionen der Nicht-Null-Koeffizien- mode is coded using an upper intra prediction mode ten und Information zum Identifizieren der Nicht- and a left intra prediction mode, and when the upper Null-Koeffizienten eines jeden Unterblocks kodiert. intra prediction modeorthe left intra prediction mode is unavailable, the upper intra prediction mode orthe i5 4. Vorrichtung nach Anspruch 1, wobei, wenn der Inleft intra prediction mode is set to a DC mode. trapradiktionsmodus ein vertikaler Modus ist, das
Abtastmuster ein horizontales Abtastmuster ist.
Patentansprüche 5. Vorrichtung nach Anspruch 1, wobei ein Abtastmus- 20 ter zum Abtasten von Flaggen, die anzeigen, ob je- 1. Vorrichtung zum Codieren eines Bildes, wobei die der Transformationskoeffizient von jedem Unter-
Vorrichtung umfasst: block gleich 0 ist oder nicht, das gleiche Abtastmus ter ist, wie zum Abtasten der Nicht-Null-Koeffizienten einen Intra-Prádiktor (140), der konfiguriert ist von jedem Unterblock. zum Erzeugen eines Prádiktor-Blocks mittels In- 25 traprádiktion; 6. Vorrichtung nach Anspruch 1, wobei der Intrapradik- eine Transformations/Quantisierungseinheit tionsmodus kodiert ist mittels einem oberen Intrap- (120), die konfiguriert ist zum Transformieren rádiktionsmodus und einem linken Intraprádiktions- und Quantisieren eines Restblocks, urn einen modus, und wenn der obere Intrapradiktionsmodus quantisierten Transformationsblock zu erzeu- so oderder linké Intrapradiktionsmodus nichtverfügbar gen; ist, wird der obere Intrapradiktionsmodus Oder der eine inverse Transformations/Quantisierungs- linké Intrapradiktionsmodus in einen DC-Modus ein- einheit (160), die konfiguriert ist zum inversen gestellt.
Quantisieren und inversen Transformieren des quantisierten Transformationsblocks; und 35 einen Entropiekodierer(130), der konfiguriert ist Revendications zum Entropie-kodieren von quantisierten Trans- formationskoeffizienten des quantisierten 1. Appareil de codage d’une image, I’appareil Transformationsblocks, comprenant: wobei die quantisierten Transformationskoeffi- 40 zienten in eine Vielzahl von Unterblöcken unter- un prédicteur intra (140) configure pourgénérer teilt sind, falls bestimmt wird, dass eine GröBe un bloc de prédiction en utilisant une prediction eines Transformationsblocks gleich odergröBer intra ; ist als 8x8 in einer Intra-Prádiktion, une unité de transformation / quantification wobei die Vielzahl von Unterblöcken abgetastet 45 (120) configurée pour effectuer une transforma- werden und Nicht-Null-Koeffizienten von jedem tion et une quantification d’un bloc résiduel pour
Unterblock abgetastet werden entsprechend ei- générer un bloc de transformation quantifié ; nem Abtastmuster, wobei das Abtastmuster une unité de quantification / transformation in- zum Abtasten der Vielzahl von Unterblöcken verse (160) configurée pour réaliser une quan- und zum Abtasten der Nicht-Null-Koeffizienten so tification inverse et une transformation inverse von jedem Unterblock durch einen Intrapradik- du bloc de transformation quantifié ; et tionsmodus des Prádiktor-Blocks bestimmt un codeur entropique (130) configure pour ef- wird, umdieabgetasteten Nicht-Null-Koeffizien- fectuer un codage entropique de coefficients de ten zu entropiekodieren, wobei, wenn der Intra- transformation quantifiésdu blocdetransforma- prádiktionsmodus ein horizontaler Intraprádikti- 55 tion quantifié, onsmodus ist, das Abtastmuster ein vertikaler dans lequel les coefficients de transformation
Abtastmodus ist, wobei der Entropiekodierer quantifiéssontdivisésen une pluralité de sous- (130) die Nicht-Null-Koeffizienten von jedem blocs s’il est déterminé qu’une taille d’un bloc de transformation est égale ou supérieure á 8x8 dans une prédiction intra, dans lequel la pluralité de sous-blocs sont ba-layés et des coefficients non nuls de chaque sous-bloc sont balayés selon un motif de ba-layage, dans lequel ledit motif de balayage pour balayer la pluralité de sous-blocs et pour balayer les coefficients non nuls de chaque sous-bloc est déterminé par un mode de prédiction intra du bloc de prédiction pour réaliser un codage entropique des coefficients non nuls balayés, dans lequel, lorsque le mode de prédiction intra est un mode horizontal, le motif de balayage est un motif de balayage vertical, dans lequel le codeur entropique (130) báláié les coefficients non nuls de chaque sous-bloc dans un sens inverse á partird’un dernier coefficient non nul de chaque sous-bloc. 2. Appareil selon la revendication 1, dans lequel le codeur entropique (130) báláié la pluralité de sous-blocs dans un sens inverse á partird’un derniersous-bloc. 3. Appareil selon la revendication 1, dans lequel le codeur entropique (130) encode des positions des coefficients non nuls et des informations pour identifier les coefficients non nuls de chaque sous-bloc. 4. Appareil selon la revendication 1, dans lequel, lorsque le mode de prédiction intra est un mode vertical, le motif de balayage est un motif de balayage horizontal. 5. Appareil selon la revendication 1, dans lequel un motif de balayage pour balayer des indicateurs indiquant si chaque coefficient de transformation de chaque sous-bloc est 0 ou non est le mérne que le motif de balayage pour balayer les coefficients non nuls de chaque sous-bloc. 6. Appareil selon la revendication 1, dans lequel le mode de prédiction intra est codé en utilisant un mode de prédiction intra supérieur et un mode de prédiction intra gauche, et lorsque le mode de prédiction intra supérieurou le modede prédiction intra gauche est indisponible, le mode de prédiction intra supérieur ou le mode de prédiction intra gauche est régié sur un mode courant continu. FIG. 1
FIG. 2
FIG. 3
FIG. 4
FIG. 5
REFERENCES CITED IN THE DESCRIPTION
This list of references cited by the applicant is for the reader's convenience only. It does not form part of the European patent document. Even though great care has been taken in compiling the references, errors or omissions cannot be excluded and the EPO disclaims all liability in this regard.
Non-patent literature cited in the description • MARTA KARCZEWICZ et al. Joint Collaborative · WINKEN (FRAUNHOFER HHI) M et al. 1. JCT-VC Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 MEETING; 15-4-2010 - 23-4-2010; DRESDEN; and ISO/IEC JTC1ISC29/WG11, ht- (JOINTCOLLABORATIVE TEAM ON VIDEO COD-
tp:llwftp3. itu. inti a v-arch/jctvc-sitei 2010_ 04_A_Dres ING OF ISO/IEC JTC1/SC29/WG11 AND denlJCTVC-A121.zip [0005] ITU-TSG.16). Video coding technology proposal by
Fraunhofer HHI, ISSN 0000-0049, 17 [0006]
Claims (6)
- Szabadalmi igénypontok i.
- Berendezés kép kódolására, az berendezés tsnvJtnaz: latra prcdtktort (140), amely égy ven kialakítva, bogy geasíábc-si imxükoio blokkor tVtb, v? a' s o mm pte>hko-> t, iy&ö$£fömiáldík¥ani«iö egyaéget(ff% asMy igy v&pÉíaíaklíva, 1¾¾ feÉossdbmsáljots és kvantáljots maradék blokkok hogy generálion kvant&lt tmnvxtomiácié blokkot; ímm kv«atáitór^s^iiilff^(«^ei fi60)* 4®|k«gyláb kisyyty%io|y saver* kyfbtiioo és inverzen transzformáljon kve^í:|^^rm^4''^iidfcQi'^i. vwvtötíatótYtfe hogy entrópia kódolja ti kvamÉl lópywösb .ahol & kvmitlüt ttms2fomMő iényezbk fal vannak osztivá főbb iiMíÖfa, ha meg vasi Ismárpzva, hogy pnnszfemtáeió blokk mdrotepgybblb vagyi^p^ mim 8xH alsói a több alblokk la van tapogan a ás mindegyik alhioUs mos natla tényezői te varrnak tapogat tetaímgatésl minta szedni, ahol a letapogatás snissia a több ilblokk letapogatására ás oalla tábpéz^lMk lotaptigafiiÉ't mag van határozva a predtkdó blokk tmmpzedíkeiö módja által, hogy em rója ekódolj a a letapogatott nem ««Ha tényezőket, akti, ha az mbs ptfÍlk:o|éMt$II hopjttwtlÜis 5i«kls a letapogatás mosta vumkális letapogatás minta, ahol az entrópia kódoló {130) letapogatja mindegyik alblokk stem mb ki fénycsőit fordított· irányban mtntíegyih alblokk utolsó nem nulla tényezőjétől. :<lÁí 1. igáméval *z<?m'ó tevemie,m akt'' as entröpji kóstoló (130) ietapvg ,tj& a több álblokkot tbidiimt irányba» azotólső súblokktóh
- 3. Az I< igéoyptssst ss'aristts berendezés,, ahol tsz entrópia kódoló (Ί.30) k6dol|á á tsons :"l^|:^iye3sbk ádMej^MsIÉhiokk netp tspilá Ay^Sln^ azonosítására,
- 4. Az 1. igéi syponi szerinti 'beremfazés* abot he aa lóba preőikdé mód verfífells mód. -a letapogatás. minta Imrizontálm letapogatás minta
- 5. At·: 1. igénypont szerinti berendezés, ahol letapogatás mists tiagak letapogatására jobs, hogy vajon mindegyik alblokk mindegyik iranv-forrná}© tényezője 0 vagy nem- ©gyártat© mint a letapogatás minta mindegyik, alblokk asm nulla tényezőmók Uítapogatáaára.
- 6, Az 1, igduypoid ssvrmd bvomdoiCs, shot íoí bum pmdikció .mód kódolvg vau ffelhasznáívfe tdbö mbs m-dikmb ««Vdot <:s bal mirs prudikeió módok & ha a &lsö ódra orodikssó mód vagy a bid infra predikció mm nem CCheilb a ítelsó mtra prédikáló mód vagy a bid bura pmdskejó mód DC módnt van heáHitvs.
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
KR20100038158 | 2010-04-23 |
Publications (1)
Publication Number | Publication Date |
---|---|
HUE031188T2 true HUE031188T2 (hu) | 2017-07-28 |
Family
ID=44834700
Family Applications (8)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
HUE15175096A HUE031188T2 (hu) | 2010-04-23 | 2011-04-22 | Berendezés kép kódolására |
HUE15175100A HUE032615T2 (hu) | 2010-04-23 | 2011-04-22 | Berendezés kép kódolására |
HUE15175097A HUE034345T2 (hu) | 2010-04-23 | 2011-04-22 | Berendezés kép kódolására |
HUE19174960A HUE057125T2 (hu) | 2010-04-23 | 2011-04-22 | Berendezés kép dekódolására |
HUE11772290A HUE026246T2 (hu) | 2010-04-23 | 2011-04-22 | Képkódoló berendezés |
HUE17160486A HUE046331T2 (hu) | 2010-04-23 | 2011-04-22 | Berendezés kép dekódolására |
HUE15175089A HUE034476T2 (hu) | 2010-04-23 | 2011-04-22 | Berendezés kép kódolására |
HUE15175114A HUE032617T2 (hu) | 2010-04-23 | 2011-04-22 | Berendezés kép kódolására |
Family Applications After (7)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
HUE15175100A HUE032615T2 (hu) | 2010-04-23 | 2011-04-22 | Berendezés kép kódolására |
HUE15175097A HUE034345T2 (hu) | 2010-04-23 | 2011-04-22 | Berendezés kép kódolására |
HUE19174960A HUE057125T2 (hu) | 2010-04-23 | 2011-04-22 | Berendezés kép dekódolására |
HUE11772290A HUE026246T2 (hu) | 2010-04-23 | 2011-04-22 | Képkódoló berendezés |
HUE17160486A HUE046331T2 (hu) | 2010-04-23 | 2011-04-22 | Berendezés kép dekódolására |
HUE15175089A HUE034476T2 (hu) | 2010-04-23 | 2011-04-22 | Berendezés kép kódolására |
HUE15175114A HUE032617T2 (hu) | 2010-04-23 | 2011-04-22 | Berendezés kép kódolására |
Country Status (28)
Country | Link |
---|---|
US (11) | US9100651B2 (hu) |
EP (8) | EP2947878B1 (hu) |
JP (8) | JP5688136B2 (hu) |
KR (10) | KR101376136B1 (hu) |
CN (11) | CN104601998B (hu) |
AU (6) | AU2011243334B2 (hu) |
BR (6) | BR122014030030A2 (hu) |
CA (9) | CA2934942C (hu) |
CY (6) | CY1116723T1 (hu) |
DK (6) | DK2945382T3 (hu) |
ES (8) | ES2602677T3 (hu) |
HR (6) | HRP20150964T1 (hu) |
HU (8) | HUE031188T2 (hu) |
IL (6) | IL222579A (hu) |
LT (5) | LT2950534T (hu) |
MX (6) | MX348484B (hu) |
MY (11) | MY162154A (hu) |
PE (8) | PE20170650A1 (hu) |
PH (5) | PH12014501184B1 (hu) |
PL (8) | PL2945382T3 (hu) |
PT (6) | PT2563020E (hu) |
RS (6) | RS55261B1 (hu) |
RU (7) | RU2549157C1 (hu) |
SG (11) | SG185371A1 (hu) |
SI (6) | SI2950534T1 (hu) |
SM (2) | SMT201500244B (hu) |
WO (1) | WO2011133002A2 (hu) |
ZA (1) | ZA201208766B (hu) |
Families Citing this family (60)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8867854B2 (en) * | 2008-10-01 | 2014-10-21 | Electronics And Telecommunications Research Institute | Image encoder and decoder using undirectional prediction |
RU2549157C1 (ru) * | 2010-04-23 | 2015-04-20 | М энд К ХОЛДИНГС ИНК. | Устройство для кодирования движущегося изображения |
KR20110123651A (ko) * | 2010-05-07 | 2011-11-15 | 한국전자통신연구원 | 생략 부호화를 이용한 영상 부호화 및 복호화 장치 및 그 방법 |
US9706204B2 (en) * | 2010-05-19 | 2017-07-11 | Sk Telecom Co., Ltd. | Image encoding/decoding device and method |
US10499059B2 (en) | 2011-03-08 | 2019-12-03 | Velos Media, Llc | Coding of transform coefficients for video coding |
US9167253B2 (en) | 2011-06-28 | 2015-10-20 | Qualcomm Incorporated | Derivation of the position in scan order of the last significant transform coefficient in video coding |
CN107580221B (zh) * | 2011-09-09 | 2020-12-08 | 株式会社Kt | 用于解码视频信号的方法 |
US9787982B2 (en) | 2011-09-12 | 2017-10-10 | Qualcomm Incorporated | Non-square transform units and prediction units in video coding |
SI2744204T1 (sl) * | 2011-09-14 | 2019-02-28 | Samsung Electronics Co., Ltd., | Postopek dekodiranja enote za napovedovanje (PU) na podlagi njene velikosti |
KR20130049523A (ko) * | 2011-11-04 | 2013-05-14 | 오수미 | 인트라 예측 블록 생성 장치 |
KR20130050149A (ko) * | 2011-11-07 | 2013-05-15 | 오수미 | 인터 모드에서의 예측 블록 생성 방법 |
KR20130050407A (ko) * | 2011-11-07 | 2013-05-16 | 오수미 | 인터 모드에서의 움직임 정보 생성 방법 |
KR20130050404A (ko) * | 2011-11-07 | 2013-05-16 | 오수미 | 인터 모드에서의 복원 블록 생성 방법 |
CN108712652A (zh) * | 2012-06-29 | 2018-10-26 | 韩国电子通信研究院 | 视频编码方法和计算机可读介质 |
GB2496015B (en) * | 2012-09-05 | 2013-09-11 | Imagination Tech Ltd | Pixel buffering |
CN103220529B (zh) * | 2013-04-15 | 2016-02-24 | 北京大学 | 一种视频编解码环路滤波的实现方法 |
CN103428492B (zh) * | 2013-07-16 | 2016-11-16 | 山东大学 | 一种高清AVS编码中快速zig-zag扫描的方法 |
US9451254B2 (en) * | 2013-07-19 | 2016-09-20 | Qualcomm Incorporated | Disabling intra prediction filtering |
KR102218196B1 (ko) | 2013-10-28 | 2021-02-23 | 삼성전자주식회사 | 인코더, 이의 동작 방법과, 상기 인코더를 포함하는 장치들 |
US9813730B2 (en) * | 2013-12-06 | 2017-11-07 | Mediatek Inc. | Method and apparatus for fine-grained motion boundary processing |
WO2015142070A1 (ko) * | 2014-03-19 | 2015-09-24 | 삼성전자 주식회사 | 경계 필터링을 수반한 비디오 부호화 및 비디오 복호화 방법 및 장치 |
KR101663668B1 (ko) * | 2014-06-27 | 2016-10-07 | 삼성전자주식회사 | 영상 패딩영역의 비디오 복호화 및 부호화 장치 및 방법 |
EP3210379B1 (en) * | 2014-10-20 | 2021-02-17 | Google LLC | Continuous prediction domain |
CN105631905A (zh) * | 2014-10-29 | 2016-06-01 | 新相微电子(开曼)有限公司 | 一种用于tft-lcd驱动ic的图像压缩算法及控制装置 |
KR20160131526A (ko) * | 2015-05-07 | 2016-11-16 | 삼성전자주식회사 | 시스템 온 칩, 상기 시스템 온 칩을 포함하는 디스플레이 시스템, 및 상기 디스플레이 시스템의 동작 방법 |
US10142627B2 (en) | 2015-06-18 | 2018-11-27 | Qualcomm Incorporated | Intra prediction and intra mode coding |
US10841593B2 (en) | 2015-06-18 | 2020-11-17 | Qualcomm Incorporated | Intra prediction and intra mode coding |
US11463689B2 (en) | 2015-06-18 | 2022-10-04 | Qualcomm Incorporated | Intra prediction and intra mode coding |
US9699461B2 (en) * | 2015-08-14 | 2017-07-04 | Blackberry Limited | Scaling in perceptual image and video coding |
KR20180040515A (ko) * | 2015-09-10 | 2018-04-20 | 삼성전자주식회사 | 부호화 장치, 복호화 장치, 그 부호화 및 복호화 방법 |
CN114222139A (zh) * | 2016-05-28 | 2022-03-22 | 世宗大学校产学协力团 | 视频信号的解码方法 |
US20170347094A1 (en) * | 2016-05-31 | 2017-11-30 | Google Inc. | Block size adaptive directional intra prediction |
CN117412037A (zh) | 2016-08-31 | 2024-01-16 | 株式会社Kt | 用于处理视频信号的方法和设备 |
JP6891895B2 (ja) * | 2016-09-16 | 2021-06-18 | ソニーグループ株式会社 | 画像処理装置および画像処理方法 |
EP3300362A1 (en) * | 2016-09-27 | 2018-03-28 | Thomson Licensing | Method for improved intra prediction when reference samples are missing |
CN116962687A (zh) * | 2016-11-29 | 2023-10-27 | 成均馆大学校产学协力团 | 影像编码/解码方法、装置以及对比特流进行存储的记录介质 |
US10694202B2 (en) * | 2016-12-01 | 2020-06-23 | Qualcomm Incorporated | Indication of bilateral filter usage in video coding |
CN108933941A (zh) * | 2017-05-26 | 2018-12-04 | 富士通株式会社 | 图像编码方法和装置以及图像解码方法和装置 |
CN107864379B (zh) * | 2017-09-28 | 2021-07-02 | 珠海亿智电子科技有限公司 | 一种应用于视频编解码的压缩方法 |
EP3487177A1 (en) * | 2017-11-21 | 2019-05-22 | Thomson Licensing | Method and apparatus for low-complexity bi-directional intra prediction in video encoding and decoding |
US11153607B2 (en) * | 2018-01-29 | 2021-10-19 | Mediatek Inc. | Length-adaptive deblocking filtering in video coding |
US10771783B2 (en) | 2018-06-11 | 2020-09-08 | Google Llc | Transforms for large video and image blocks |
US11695967B2 (en) * | 2018-06-22 | 2023-07-04 | Op Solutions, Llc | Block level geometric partitioning |
US11277644B2 (en) | 2018-07-02 | 2022-03-15 | Qualcomm Incorporated | Combining mode dependent intra smoothing (MDIS) with intra interpolation filter switching |
BR112020026971A2 (pt) | 2018-07-02 | 2021-03-30 | Huawei Technologies Co., Ltd. | Aparelho e método para filtragem em codificação de vídeo |
EP3840386A4 (en) | 2018-09-04 | 2021-09-22 | Huawei Technologies Co., Ltd. | METHOD AND DEVICE FOR DETERMINING A REFERENCE FRAME FOR BIDIRECTIONAL INTER-FRAME PREDICTION |
US11303885B2 (en) | 2018-10-25 | 2022-04-12 | Qualcomm Incorporated | Wide-angle intra prediction smoothing and interpolation |
JP7418152B2 (ja) * | 2018-12-17 | 2024-01-19 | キヤノン株式会社 | 画像符号化装置、画像符号化方法、画像復号装置、画像復号方法 |
CN111385572B (zh) * | 2018-12-27 | 2023-06-02 | 华为技术有限公司 | 预测模式确定方法、装置及编码设备和解码设备 |
KR20200083357A (ko) | 2018-12-28 | 2020-07-08 | 인텔렉추얼디스커버리 주식회사 | 화면 간 예측 부호화 및 복호화 방법 및 장치 |
CN111416975B (zh) * | 2019-01-08 | 2022-09-16 | 华为技术有限公司 | 预测模式确定方法和装置 |
CN113273191A (zh) * | 2019-01-10 | 2021-08-17 | 世宗大学校产学协力团 | 影像编码/解码方法及装置 |
US10728555B1 (en) * | 2019-02-06 | 2020-07-28 | Sony Corporation | Embedded codec (EBC) circuitry for position dependent entropy coding of residual level data |
US10666986B1 (en) | 2019-03-08 | 2020-05-26 | Sony Corporation | Sub-block based entropy coding for embedded image codec |
CN113574877B (zh) | 2019-03-12 | 2024-06-28 | 现代自动车株式会社 | 用于有效地对残差块解码的方法和装置 |
CN110113614B (zh) * | 2019-05-13 | 2022-04-12 | 格兰菲智能科技有限公司 | 图像处理方法及图像处理装置 |
CN110418131B (zh) * | 2019-07-15 | 2021-07-27 | 杭州电子科技大学 | 一种码率预估方法及基于码率预估快速模式决策方法 |
US11553208B2 (en) * | 2019-11-27 | 2023-01-10 | Tencent America LLC | Method and system of video coding using a subset of available intra prediction modes for multiple reference lines |
CN112004088B (zh) * | 2020-08-06 | 2024-04-16 | 杭州当虹科技股份有限公司 | 一种适用于avs2编码器的cu级qp分配算法 |
WO2023068731A1 (ko) * | 2021-10-22 | 2023-04-27 | 엘지전자 주식회사 | 영상 디코딩 방법 및 그 장치 |
Family Cites Families (42)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5748244A (en) * | 1995-03-28 | 1998-05-05 | Daewoo Electronics Co., Ltd. | Adaptive runlength coding based on zero and non-zero subblocks |
JP2001016595A (ja) * | 1999-04-30 | 2001-01-19 | Fujitsu Ltd | 動画像符号化装置および復号装置 |
EP1296524A1 (en) * | 2001-09-20 | 2003-03-26 | STMicroelectronics S.r.l. | Process and apparatus for the compression of digital video signals, a system and a computer program product therefor |
KR100798446B1 (ko) * | 2001-09-26 | 2008-01-28 | 에스케이 텔레콤주식회사 | 적응적 더블 스캔 방법 |
EP2262269B1 (en) * | 2001-12-17 | 2018-01-24 | Microsoft Technology Licensing, LLC | Skip macroblock coding |
CN101448162B (zh) * | 2001-12-17 | 2013-01-02 | 微软公司 | 处理视频图像的方法 |
CN1265649C (zh) * | 2002-01-24 | 2006-07-19 | 株式会社日立制作所 | 运动图像的编码方法、解码方法、编码装置及解码装置 |
KR100846778B1 (ko) * | 2002-07-16 | 2008-07-16 | 삼성전자주식회사 | 복수개의 주사 패턴을 이용한 부호화 방법, 복호화 방법,및 그 장치 |
JP2004180064A (ja) * | 2002-11-28 | 2004-06-24 | Ricoh Co Ltd | 情報圧縮装置および方法、ならびにそのプログラム |
US7392195B2 (en) * | 2004-03-25 | 2008-06-24 | Dts, Inc. | Lossless multi-channel audio codec |
JP2006054846A (ja) * | 2004-07-12 | 2006-02-23 | Sony Corp | 符号化方法、符号化装置、復号方法、復号装置およびそれらのプログラム |
CN1665301A (zh) * | 2005-03-07 | 2005-09-07 | 清华大学 | 一种视频编解码中的自适应的扫描方法 |
CN1870748A (zh) * | 2005-04-27 | 2006-11-29 | 王云川 | 因特网协议电视 |
KR100736086B1 (ko) * | 2005-09-06 | 2007-07-06 | 삼성전자주식회사 | 엔트로피 코딩의 성능 향상 방법 및 장치, 상기 방법을이용한 비디오 코딩 방법 및 장치 |
US8199819B2 (en) * | 2005-10-21 | 2012-06-12 | Electronics And Telecommunications Research Institute | Apparatus and method for encoding and decoding moving picture using adaptive scanning |
JP4114885B2 (ja) * | 2005-10-31 | 2008-07-09 | 松下電器産業株式会社 | 画像符号化装置、方法、及びプログラム |
KR100728031B1 (ko) * | 2006-01-23 | 2007-06-14 | 삼성전자주식회사 | 가변 블록 크기 움직임 예측을 위한 부호화 모드 결정 방법및 장치 |
JP2007300389A (ja) * | 2006-04-28 | 2007-11-15 | Victor Co Of Japan Ltd | 画像符号化装置および画像符号化プログラム |
KR100927733B1 (ko) * | 2006-09-20 | 2009-11-18 | 한국전자통신연구원 | 잔여계수의 상관성에 따라 변환기를 선택적으로 이용한부호화/복호화 장치 및 그 방법 |
US9455739B2 (en) * | 2007-03-14 | 2016-09-27 | Nippon Telegraph And Telephone Corporation | Code amount estimating method and apparatus, and program and storage medium therefor |
KR100871588B1 (ko) * | 2007-06-25 | 2008-12-02 | 한국산업기술대학교산학협력단 | 인트라 부호화 장치 및 그 방법 |
KR100968027B1 (ko) * | 2007-06-27 | 2010-07-07 | 티유미디어 주식회사 | 가변블록 기반의 디블록킹 필터링 방법 및 장치와, 이에적용되는 디블록킹 필터 |
JP2009027541A (ja) * | 2007-07-20 | 2009-02-05 | Ntt Docomo Inc | 画像符号化装置、方法及びプログラム、並びに、画像復号装置、方法及びプログラム |
US20090245351A1 (en) * | 2008-03-28 | 2009-10-01 | Kabushiki Kaisha Toshiba | Moving picture decoding apparatus and moving picture decoding method |
KR101457894B1 (ko) * | 2009-10-28 | 2014-11-05 | 삼성전자주식회사 | 영상 부호화 방법 및 장치, 복호화 방법 및 장치 |
EP2559166B1 (en) * | 2010-04-13 | 2017-11-01 | Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. | Probability interval partioning encoder and decoder |
CN114143553A (zh) * | 2010-04-13 | 2022-03-04 | Ge视频压缩有限责任公司 | 显著性图和变换系数块的编码 |
RU2549157C1 (ru) * | 2010-04-23 | 2015-04-20 | М энд К ХОЛДИНГС ИНК. | Устройство для кодирования движущегося изображения |
US9661338B2 (en) * | 2010-07-09 | 2017-05-23 | Qualcomm Incorporated | Coding syntax elements for adaptive scans of transform coefficients for video coding |
KR20120012385A (ko) * | 2010-07-31 | 2012-02-09 | 오수미 | 인트라 예측 부호화 장치 |
KR101373814B1 (ko) * | 2010-07-31 | 2014-03-18 | 엠앤케이홀딩스 주식회사 | 예측 블록 생성 장치 |
KR20180039757A (ko) * | 2010-08-17 | 2018-04-18 | 엠앤케이홀딩스 주식회사 | 영상 복호화 장치 |
KR20120016991A (ko) * | 2010-08-17 | 2012-02-27 | 오수미 | 인터 프리딕션 방법 |
US8976861B2 (en) * | 2010-12-03 | 2015-03-10 | Qualcomm Incorporated | Separately coding the position of a last significant coefficient of a video block in video coding |
US10992958B2 (en) * | 2010-12-29 | 2021-04-27 | Qualcomm Incorporated | Video coding using mapped transforms and scanning modes |
WO2012093969A1 (en) * | 2011-01-07 | 2012-07-12 | Agency For Science, Technology And Research | Method and an apparatus for coding an image |
US10499059B2 (en) * | 2011-03-08 | 2019-12-03 | Velos Media, Llc | Coding of transform coefficients for video coding |
US9106913B2 (en) * | 2011-03-08 | 2015-08-11 | Qualcomm Incorporated | Coding of transform coefficients for video coding |
US9172962B2 (en) * | 2012-01-20 | 2015-10-27 | Blackberry Limited | Methods and systems for pipelining within binary arithmetic coding and decoding |
GB2501535A (en) * | 2012-04-26 | 2013-10-30 | Sony Corp | Chrominance Processing in High Efficiency Video Codecs |
KR20140129607A (ko) * | 2013-04-30 | 2014-11-07 | 주식회사 칩스앤미디어 | 동영상 처리 방법 및 장치 |
US9215464B2 (en) * | 2013-09-19 | 2015-12-15 | Blackberry Limited | Coding position data for the last non-zero transform coefficient in a coefficient group |
-
2011
- 2011-04-22 RU RU2014118774/08A patent/RU2549157C1/ru active
- 2011-04-22 RS RS20160901A patent/RS55261B1/sr unknown
- 2011-04-22 CN CN201510057144.5A patent/CN104601998B/zh active Active
- 2011-04-22 KR KR1020127028862A patent/KR101376136B1/ko active IP Right Review Request
- 2011-04-22 KR KR1020167020630A patent/KR20160093104A/ko not_active IP Right Cessation
- 2011-04-22 PL PL15175089T patent/PL2945382T3/pl unknown
- 2011-04-22 LT LTEP15175114.6T patent/LT2950534T/lt unknown
- 2011-04-22 SG SG2012078812A patent/SG185371A1/en unknown
- 2011-04-22 WO PCT/KR2011/002972 patent/WO2011133002A2/ko active Application Filing
- 2011-04-22 SG SG10201503179VA patent/SG10201503179VA/en unknown
- 2011-04-22 SG SG10201503173PA patent/SG10201503173PA/en unknown
- 2011-04-22 SG SG10201503178RA patent/SG10201503178RA/en unknown
- 2011-04-22 PL PL15175100T patent/PL2950533T3/pl unknown
- 2011-04-22 CN CN201510555800.4A patent/CN105120274B/zh active Active
- 2011-04-22 LT LTEP15175089.0T patent/LT2945382T/lt unknown
- 2011-04-22 MY MYPI2015001011A patent/MY162154A/en unknown
- 2011-04-22 HU HUE15175096A patent/HUE031188T2/hu unknown
- 2011-04-22 PE PE2017000365A patent/PE20170650A1/es unknown
- 2011-04-22 SG SG10201503151YA patent/SG10201503151YA/en unknown
- 2011-04-22 SG SG10201503177TA patent/SG10201503177TA/en unknown
- 2011-04-22 PE PE2012002064A patent/PE20130929A1/es active IP Right Grant
- 2011-04-22 HU HUE15175100A patent/HUE032615T2/hu unknown
- 2011-04-22 CA CA2934942A patent/CA2934942C/en active Active
- 2011-04-22 PT PT117722900T patent/PT2563020E/pt unknown
- 2011-04-22 EP EP15175097.3A patent/EP2947878B1/en active Active
- 2011-04-22 HU HUE15175097A patent/HUE034345T2/hu unknown
- 2011-04-22 KR KR1020147010243A patent/KR20140057671A/ko not_active IP Right Cessation
- 2011-04-22 MY MYPI2012004700A patent/MY157593A/en unknown
- 2011-04-22 EP EP17160486.1A patent/EP3197158B1/en active Active
- 2011-04-22 DK DK15175089.0T patent/DK2945382T3/en active
- 2011-04-22 MY MYPI2015000951A patent/MY162148A/en unknown
- 2011-04-22 BR BR122014030030-1A patent/BR122014030030A2/pt not_active Application Discontinuation
- 2011-04-22 CA CA2934927A patent/CA2934927C/en active Active
- 2011-04-22 JP JP2013506093A patent/JP5688136B2/ja active Active
- 2011-04-22 RS RS20170833A patent/RS56193B1/sr unknown
- 2011-04-22 RU RU2012149839/08A patent/RU2523963C2/ru active
- 2011-04-22 SI SI201131157A patent/SI2950534T1/sl unknown
- 2011-04-22 LT LTEP15175097.3T patent/LT2947878T/lt unknown
- 2011-04-22 ES ES15175096.5T patent/ES2602677T3/es active Active
- 2011-04-22 KR KR1020167020633A patent/KR20160093107A/ko not_active IP Right Cessation
- 2011-04-22 SI SI201131159A patent/SI2947878T1/sl unknown
- 2011-04-22 CA CA2857849A patent/CA2857849C/en active Active
- 2011-04-22 CN CN201510552979.8A patent/CN105245877B/zh active Active
- 2011-04-22 ES ES15175114.6T patent/ES2618917T3/es active Active
- 2011-04-22 MX MX2015004590A patent/MX348484B/es unknown
- 2011-04-22 KR KR1020137020592A patent/KR20130103803A/ko not_active IP Right Cessation
- 2011-04-22 PT PT151750965T patent/PT2947877T/pt unknown
- 2011-04-22 ES ES15175097.3T patent/ES2620772T3/es active Active
- 2011-04-22 SG SG10201503180SA patent/SG10201503180SA/en unknown
- 2011-04-22 DK DK15175096.5T patent/DK2947877T3/en active
- 2011-04-22 HU HUE19174960A patent/HUE057125T2/hu unknown
- 2011-04-22 EP EP11772290.0A patent/EP2563020B1/en active Active
- 2011-04-22 SG SG10201503182WA patent/SG10201503182WA/en unknown
- 2011-04-22 HU HUE11772290A patent/HUE026246T2/hu unknown
- 2011-04-22 MY MYPI2015000950A patent/MY162147A/en unknown
- 2011-04-22 RS RS20170227A patent/RS55761B1/sr unknown
- 2011-04-22 MY MYPI2015000986A patent/MY179498A/en unknown
- 2011-04-22 CN CN201510055876.0A patent/CN104717498B/zh active Active
- 2011-04-22 ES ES15175100.5T patent/ES2618932T3/es active Active
- 2011-04-22 CN CN201180031338.8A patent/CN103004197B/zh active Active
- 2011-04-22 PL PL17160486T patent/PL3197158T3/pl unknown
- 2011-04-22 CA CA2935176A patent/CA2935176C/en active Active
- 2011-04-22 EP EP15175100.5A patent/EP2950533B1/en active Active
- 2011-04-22 LT LTEP15175096.5T patent/LT2947877T/lt unknown
- 2011-04-22 DK DK15175100.5T patent/DK2950533T3/en active
- 2011-04-22 RS RS20150573A patent/RS54213B1/en unknown
- 2011-04-22 SI SI201131040A patent/SI2947877T1/sl unknown
- 2011-04-22 EP EP15175114.6A patent/EP2950534B1/en active Active
- 2011-04-22 HU HUE17160486A patent/HUE046331T2/hu unknown
- 2011-04-22 PT PT151750890T patent/PT2945382T/pt unknown
- 2011-04-22 MX MX2015004584A patent/MX348486B/es unknown
- 2011-04-22 PL PL15175097T patent/PL2947878T3/pl unknown
- 2011-04-22 KR KR1020167020632A patent/KR20160093106A/ko not_active IP Right Cessation
- 2011-04-22 DK DK15175097.3T patent/DK2947878T3/en active
- 2011-04-22 HU HUE15175089A patent/HUE034476T2/hu unknown
- 2011-04-22 CA CA2935202A patent/CA2935202C/en active Active
- 2011-04-22 SG SG10201503183TA patent/SG10201503183TA/en unknown
- 2011-04-22 ES ES15175089.0T patent/ES2632996T3/es active Active
- 2011-04-22 CA CA2934930A patent/CA2934930C/en active Active
- 2011-04-22 RU RU2014118776A patent/RU2658148C2/ru active
- 2011-04-22 PT PT151750973T patent/PT2947878T/pt unknown
- 2011-04-22 PL PL15175096T patent/PL2947877T3/pl unknown
- 2011-04-22 PL PL11772290T patent/PL2563020T3/pl unknown
- 2011-04-22 PT PT151751005T patent/PT2950533T/pt unknown
- 2011-04-22 PE PE2017000368A patent/PE20170653A1/es unknown
- 2011-04-22 EP EP15175089.0A patent/EP2945382B1/en active Active
- 2011-04-22 CN CN201510552994.2A patent/CN105245885B/zh active Active
- 2011-04-22 MX MX2015004587A patent/MX348485B/es unknown
- 2011-04-22 EP EP19174960.5A patent/EP3565247B1/en active Active
- 2011-04-22 MY MYPI2015000988A patent/MY162153A/en unknown
- 2011-04-22 MX MX2015004581A patent/MX348487B/es unknown
- 2011-04-22 KR KR1020137020595A patent/KR101476117B1/ko active IP Right Grant
- 2011-04-22 KR KR1020147010242A patent/KR20140057670A/ko not_active IP Right Cessation
- 2011-04-22 PE PE2017000364A patent/PE20170649A1/es unknown
- 2011-04-22 SG SG10201503185PA patent/SG10201503185PA/en unknown
- 2011-04-22 EP EP15175096.5A patent/EP2947877B1/en active Active
- 2011-04-22 CA CA2935205A patent/CA2935205C/en active Active
- 2011-04-22 MY MYPI2015001012A patent/MY157877A/en unknown
- 2011-04-22 PE PE2017000369A patent/PE20170654A1/es unknown
- 2011-04-22 MX MX2015004591A patent/MX348488B/es unknown
- 2011-04-22 PE PE2017000366A patent/PE20170651A1/es unknown
- 2011-04-22 SI SI201130625T patent/SI2563020T1/sl unknown
- 2011-04-22 CN CN201510552987.2A patent/CN105245883B/zh active Active
- 2011-04-22 AU AU2011243334A patent/AU2011243334B2/en active Active
- 2011-04-22 SI SI201131158A patent/SI2950533T1/sl unknown
- 2011-04-22 BR BR122014030029-8A patent/BR122014030029A2/pt not_active Application Discontinuation
- 2011-04-22 CN CN201510555562.7A patent/CN105245887B/zh active Active
- 2011-04-22 CA CA2797047A patent/CA2797047C/en active Active
- 2011-04-22 BR BR122014030027-1A patent/BR122014030027A2/pt not_active Application Discontinuation
- 2011-04-22 PL PL19174960T patent/PL3565247T3/pl unknown
- 2011-04-22 BR BR122014030028-0A patent/BR122014030028A2/pt not_active Application Discontinuation
- 2011-04-22 ES ES17160486T patent/ES2746015T3/es active Active
- 2011-04-22 SG SG10201503176SA patent/SG10201503176SA/en unknown
- 2011-04-22 PT PT151751146T patent/PT2950534T/pt unknown
- 2011-04-22 CA CA2934940A patent/CA2934940C/en active Active
- 2011-04-22 SI SI201131259T patent/SI2945382T1/sl unknown
- 2011-04-22 MY MYPI2015000970A patent/MY163233A/en unknown
- 2011-04-22 MY MYPI2015000987A patent/MY163232A/en unknown
- 2011-04-22 PL PL15175114T patent/PL2950534T3/pl unknown
- 2011-04-22 CN CN201510552989.1A patent/CN105245884B/zh active Active
- 2011-04-22 MY MYPI2015000953A patent/MY162149A/en unknown
- 2011-04-22 DK DK15175114.6T patent/DK2950534T3/en active
- 2011-04-22 PE PE2017000367A patent/PE20170652A1/es unknown
- 2011-04-22 CN CN201510553023.XA patent/CN105245886B/zh active Active
- 2011-04-22 KR KR1020147010241A patent/KR20140057669A/ko not_active IP Right Cessation
- 2011-04-22 MY MYPI2015000971A patent/MY162152A/en unknown
- 2011-04-22 PE PE2014001238A patent/PE20142178A1/es active IP Right Grant
- 2011-04-22 ES ES19174960T patent/ES2897491T3/es active Active
- 2011-04-22 BR BR112012026809-0A patent/BR112012026809B1/pt active IP Right Grant
- 2011-04-22 DK DK11772290.0T patent/DK2563020T3/en active
- 2011-04-22 CN CN201510555751.4A patent/CN105120273B/zh active Active
- 2011-04-22 RS RS20170321A patent/RS55829B1/sr unknown
- 2011-04-22 KR KR1020167020631A patent/KR20160093105A/ko not_active IP Right Cessation
- 2011-04-22 BR BR122014030026A patent/BR122014030026A2/pt not_active Application Discontinuation
- 2011-04-22 MX MX2012012333A patent/MX2012012333A/es active IP Right Grant
- 2011-04-22 ES ES11772290.0T patent/ES2546514T3/es active Active
- 2011-04-22 LT LTEP15175100.5T patent/LT2950533T/lt unknown
- 2011-04-22 HU HUE15175114A patent/HUE032617T2/hu unknown
- 2011-04-22 RS RS20170234A patent/RS55780B1/sr unknown
-
2012
- 2012-09-21 US US13/624,753 patent/US9100651B2/en active Active
- 2012-10-21 IL IL222579A patent/IL222579A/en active IP Right Grant
- 2012-11-21 ZA ZA2012/08766A patent/ZA201208766B/en unknown
-
2014
- 2014-05-08 RU RU2014118779A patent/RU2658137C2/ru active
- 2014-05-08 RU RU2014118778A patent/RU2656985C2/ru active
- 2014-05-08 RU RU2014118777A patent/RU2658141C2/ru active
- 2014-05-08 RU RU2014118780A patent/RU2659470C2/ru active
- 2014-05-22 AU AU2014202818A patent/AU2014202818B2/en active Active
- 2014-05-22 AU AU2014202816A patent/AU2014202816B2/en active Active
- 2014-05-22 AU AU2014202817A patent/AU2014202817B2/en active Active
- 2014-05-22 AU AU2014202819A patent/AU2014202819B2/en active Active
- 2014-05-22 AU AU2014202820A patent/AU2014202820B2/en active Active
- 2014-05-26 PH PH12014501184A patent/PH12014501184B1/en unknown
- 2014-05-26 PH PH12014501183A patent/PH12014501183B1/en unknown
- 2014-05-27 PH PH12014501186A patent/PH12014501186A1/en unknown
- 2014-05-27 PH PH12014501185A patent/PH12014501185A1/en unknown
- 2014-05-27 PH PH12014501187A patent/PH12014501187B1/en unknown
- 2014-07-28 IL IL233841A patent/IL233841A/en active IP Right Grant
- 2014-07-28 IL IL233840A patent/IL233840A/en active IP Right Grant
- 2014-10-24 JP JP2014217428A patent/JP5877236B2/ja active Active
-
2015
- 2015-02-03 JP JP2015019650A patent/JP5928966B2/ja not_active Expired - Fee Related
- 2015-02-03 JP JP2015019646A patent/JP5919404B2/ja active Active
- 2015-02-03 JP JP2015019649A patent/JP5919407B2/ja active Active
- 2015-02-03 JP JP2015019647A patent/JP5919405B2/ja active Active
- 2015-02-03 JP JP2015019648A patent/JP5919406B2/ja active Active
- 2015-04-15 US US14/687,417 patent/US9191672B2/en active Active
- 2015-04-15 US US14/687,338 patent/US9237348B2/en active Active
- 2015-04-15 US US14/687,512 patent/US9191674B2/en active Active
- 2015-04-15 US US14/687,666 patent/US9264719B2/en active Active
- 2015-04-15 US US14/687,424 patent/US9197896B2/en active Active
- 2015-04-15 US US14/687,482 patent/US9191673B2/en active Active
- 2015-04-15 US US14/687,541 patent/US9197897B2/en active Active
- 2015-04-15 US US14/687,609 patent/US9232224B2/en active Active
- 2015-04-15 US US14/687,587 patent/US9264718B2/en active Active
- 2015-04-15 US US14/687,354 patent/US9197895B2/en active Active
- 2015-09-14 HR HRP20150964TT patent/HRP20150964T1/hr unknown
- 2015-09-29 CY CY20151100867T patent/CY1116723T1/el unknown
- 2015-10-07 SM SM201500244T patent/SMT201500244B/xx unknown
-
2016
- 2016-04-15 JP JP2016082316A patent/JP6084730B2/ja active Active
- 2016-07-21 IL IL246886A patent/IL246886A/en active IP Right Grant
- 2016-07-21 IL IL246884A patent/IL246884A/en active IP Right Grant
- 2016-07-21 IL IL246885A patent/IL246885B/en active IP Right Grant
- 2016-12-13 SM SM201600448T patent/SMT201600448B/it unknown
-
2017
- 2017-01-12 HR HRP20170054TT patent/HRP20170054T1/hr unknown
- 2017-01-12 CY CY20171100046T patent/CY1118425T1/el unknown
- 2017-03-20 CY CY20171100356T patent/CY1118877T1/el unknown
- 2017-04-11 CY CY20171100432T patent/CY1118907T1/el unknown
- 2017-04-11 CY CY20171100431T patent/CY1118908T1/el unknown
- 2017-05-15 HR HRP20170729TT patent/HRP20170729T1/hr unknown
- 2017-05-15 HR HRP20170726TT patent/HRP20170726T1/hr unknown
- 2017-05-15 HR HRP20170724TT patent/HRP20170724T1/hr unknown
- 2017-08-11 CY CY20171100872T patent/CY1119314T1/el unknown
- 2017-09-07 HR HRP20171353TT patent/HRP20171353T1/hr unknown
Also Published As
Similar Documents
Publication | Publication Date | Title |
---|---|---|
HUE031188T2 (hu) | Berendezés kép kódolására |