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
  • 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/46—Embedding additional information in the video signal during the compression process
• • 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/119—Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks
• • 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/124—Quantisation
• • 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/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/44—Decoders specially adapted therefor, e.g. video decoders which are asymmetric with respect to the encoder
• • 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/46—Embedding additional information in the video signal during the compression process
  • H04N19/463—Embedding additional information in the video signal during the compression process by compressing encoding parameters before transmission
• • 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
• • 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

Definitions

• An image compression scheme divides an original image into blocks each having a predetermined size, and generates a predicted image by performing inter prediction or intra prediction in units of blocks. Also, the image compression scheme transforms, quantizes, and entropy-encodes residual data that is a difference between the predicted image and the original image. Transform coefficients obtained after transformation and quantization may be encoded by an encoder to have a smaller size before being stored or transmitted. When the encoder outputs the encoded transform coefficients, many coefficients whose values are 0 exist in a high frequency component.
• scan order for coefficients is predetermined and can not be altered according to the characteristic of coefficient.
• aspects of exemplary embodiments provide an adaptive coefficient scan order which may improve image compression efficiency by effectively arranging coefficients.
• aspects of exemplary embodiments also provide a method and apparatus for encoding an image and a method and apparatus for decoding an image using an adaptive coefficient scan order, which may efficiently define various scan orders by using only one parameter.
• FIG. 1 is a reference diagram illustrating a block to be scanned in a zigzag scan order
• FIG. 2 is a reference diagram illustrating a block to be scanned in a vertical scan order
• FIG. 3 is a reference diagram illustrating a block to be scanned in a horizontal scan order
• FIG. 4 is a block diagram illustrating an apparatus for encoding an image using an adaptive coefficient scan order, according to an exemplary embodiment
• FIG. 5 is a reference diagram for explaining an adaptive scan order according to an exemplary embodiment
• FIG. 6 is a reference diagram illustrating a scan order applied to coefficients of a 4x4 block, according to an exemplary embodiment
• FIG. 7 is a diagram illustrating coefficients scanned in the scan order of FIG. 6, according to an exemplary embodiment
• FIG. 8 is a flowchart illustrating a method of encoding an image using an adaptive coefficient scan order, according to an exemplary embodiment
• FIG. 9 is a block diagram illustrating an apparatus for decoding an image using an adaptive coefficient scan order, according to an exemplary embodiment.
• FIG. 10 is a flowchart illustrating a method of decoding an image using an adaptive coefficient scan order, according to an exemplary embodiment.
• a method of encoding an image using an adaptive coefficient scan order including: projecting coefficients of a current block to a reference axis, from among a horizontal axis and a vertical axis, along a first straight line perpendicular to a second straight line with a predetermined angle ⁇ from the reference axis; scanning the coefficients of the current block in an arrangement order of the projected coefficients projected to the reference axis; and entropy-encoding information about the predetermined angle ⁇ and the scanned coefficients.
• a method of decoding an image using an adaptive coefficient scan order including: acquiring angle information about a predetermined angle ⁇ for determining a scan order of coefficients of a current block to be decoded from a bitstream; using the predetermined angle ⁇ , projecting the coefficients of the current block to a reference axis, from among a horizontal axis and a vertical axis, along a first straight line perpendicular to a second straight line with the predetermined angle ⁇ from the reference axis, and determining the scan order based on an arrangement order of the projected coefficients projected to the reference axis; and scanning the coefficients of the current block from the bitstream in the determined scan order.
• an apparatus for decoding an image using an adaptive coefficient scan order including: an entropy-encoding unit which acquires angle information about a predetermined angle ⁇ for determining a scan order of coefficients of a current block to be decoded from a bitstream; and a scanning unit which, using the predetermined angle ⁇ projects the coefficients of the current block to a reference axis, from among a horizontal axis and a vertical axis, along a first straight line perpendicular to a second straight line with the predetermined angle ⁇ from the reference axis, to determine the scan order based on an arrangement order of the projected coefficients projected to the reference axis, and scans the coefficients of the current block from the bitstream in the determined scan order.
• a method of encoding an image using an adaptive coefficient scan order including: scanning coefficients of a current block according to a determined scanning order; entropy-encoding information about a predetermined angle ⁇ and the scanned coefficients, wherein the scanning order is determined to correspond to an arrangement order of the coefficients projected to a reference axis, from among a horizontal axis and a vertical axis, along a first straight line perpendicular to a second straight line with the predetermined angle ⁇ from the reference axis.
• FIGS. 1 through 3 are reference diagrams for explaining a difference between coefficients which are rearranged in coefficient scan orders.
• FIG. 1 illustrates coefficients arranged in a zigzag scan order
• FIG. 2 illustrates coefficients arranged in a vertical scan order
• FIG. 3 illustrates coefficients arranged in a horizontal scan order.
• a current block if coefficients of a current block are sequentially scanned in a zigzag scan order starting from a direct current (DC) coefficient 11, the scanned coefficients are ⁇ 10, 3, 4, 2, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0 ⁇ .
• scanning is performed until a last significant transform coefficient 12 is reached, an end of block (EOB) flag indicating whether each coefficient is a last significant transform coefficient is allocated to the last significant transform coefficient 12, and scanning is substantially not performed after the last significant transform coefficient 12.
• EOB end of block
• coefficients of a current block are sequentially scanned in a vertical scan order starting from a DC coefficient 21, the scanned coefficients are ⁇ 10, 4, 2, 1, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ⁇ .
• scanning is performed until a last significant transform coefficient 22 is reached, an EOB flag indicating whether each coefficient is a last significant transform coefficient is allocated to the last significant transform coefficient 22, and scanning is substantially not performed after the last significant transform coefficient 22.
• a vertical scan order is a most efficient scan order.
• arrangement types where coefficients are rearranged are changed depending on scan orders.
• scanning is generally performed in a predefined scan order. Accordingly, one or more exemplary embodiments may define various can orders with an angle and efficiently compress an image by reducing the number of bits added to define the various scan orders.
• FIG. 4 is a block diagram illustrating an apparatus 400 for encoding an image using an adaptive coefficient scan order, according to an exemplary embodiment.
• the apparatus 400 includes a subtraction unit 405, a prediction unit 410, a transformation and quantization unit 420, an entropy-encoding unit 430, a scanning unit 425, and a control unit 440.
• the subtraction unit 405 generates residual data by subtracting the predicted block of the current block generated by the prediction unit 410 from original image data.
• the transformation and quantization unit 420 transforms the residual data into a frequency domain by performing frequency transformation such as discrete cosine transformation (DCT), and quantizes the frequency domain to output quantized transform coefficients.
• DCT discrete cosine transformation
• transform coefficients refers to coefficients which are transformed and quantized by the transformation and quantization unit 420.
• the scanning unit 425 rearranges the transform coefficients output from the transformation and quantization unit 420 in a coefficient scan order that is defined by using a predetermined angle ⁇ and then outputs the rearranged transform coefficients. Adaptive coefficient scanning performed by the scanning unit 425 will be explained in detail below.
• the entropy-encoding unit 430 performs variable-length coding on the transform coefficients to generate a bitstream.
• the entropy-encoding unit 430 encodes the transform coefficients by generating additional information such as size information and a significant map of the transform coefficients.
• An inverse transformation and inverse quantization unit 415 reconstructs the residual data by performing inverse quantization and inverse transformation.
• An addition unit 417 reconstructs the current block by adding the predicted block to the reconstructed residual data.
• the reconstructed current block passes through a deblocking filter 414,is stored in a storage unit 413, and is used as reference data of a next block.
• the control unit 440 controls each element of the apparatus 400, and determines a prediction mode and a scan order for encoding of the current block by, for example, comparing costs of the bitstream, e.g., rate-distortion (RD) costs, according to scan orders, which will be explained in detail below.
• RD rate-distortion
• FIG. 5 is a reference diagram for explaining an adaptive scan order according to an exemplary embodiment.
• the scanning unit 425 projects each of the coefficients of the current block to an axis, selected as a reference axis from among a horizontal axis x and a vertical axis y, along a straight line perpendicular to a straight line with a predetermined angle ⁇ which ranges from 0 to 90 degrees, from the reference axis.
• coefficients 51 and 52 are projected to the horizontal axis x along straight lines 55 and 56 perpendicular to a straight line 50 with the predetermined angle ⁇ from the horizontal axis x.
• FIG. 6 is a reference diagram illustrating a scan order applied to coefficients of a 4x4 block, according to an exemplary embodiment.
• FIG. 7 is a diagram illustrating coefficients scanned in the scan order of FIG. 6, according to an exemplary embodiment.
• the scanning unit 425 projects each of coefficients of a current block to a horizontal axis x along a straight line perpendicular to a straight line with a predetermined angle ⁇ from the horizontal axis x that is a reference axis.
• coefficients (0, 0), (1, 0), (0, 1), (2, 0), (1, 1), (3, 0), (0, 2), (2, 1), (1, 2), (3, 1), (0, 3), (2, 2), (1, 3), (3, 2), (2, 3), and (3, 3) are sequentially scanned in FIG. 6.
• coefficients of a current block as shown in FIG. 7 are scanned in the scan order of FIG. 6, scanned coefficients are ⁇ 10, 4, 3, 2, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0 ⁇ .
• a scan order is determined to be a vertical scan order, if the predetermined angle ⁇ is 45 degrees, a scan order is determined to be a zigzag scan order, and if the predetermined angle ⁇ is 90 degrees, a scan order is determined to be a horizontal scan order, according to the present exemplary embodiment, various scan orders including a related art scan order may be defined by using only one angle ⁇ .
• the scanning unit 425 may scan and output coefficients of a current block in different scan orders by using a plurality of angles, compare costs obtained after encoding performed by the entropy-encoding unit 430 according to the different scan orders, and determine a scan order with a smallest cost as a scan order to be finally applied to the current block.
• the information about the scan order may be encoded by selecting one of a plurality of predefined angles in units of sequences or frames. For example, a scanning method using one of predefined angles ⁇ 1, ⁇ 2 and ⁇ 3 may be performed in the same sequence or frame.
• FIG. 8 is a flowchart illustrating a method of encoding an image using an adaptive coefficient scan order, according to an exemplary embodiment.
• the entropy-encoding unit 430 when the scan order is determined and the coefficients scanned in the determined scan order are input, the entropy-encoding unit 430 generates a significant map Sigmap by expressing a significant coefficient having a value other than 0 by '1' and a coefficient having a value 0 as '0' In the significant map Sigmap, an EOB flag indicating whether each coefficient is a last significant coefficient is allocated to each of significant coefficients whose values are 1.
• the method of encoding the image using the adaptive coefficient scan order according to the present exemplary embodiment may use various scan orders with small overhead, compression efficiency according to image characteristics may be improved.
• FIG. 9 is a block diagram illustrating an apparatus 1000 for decoding an image using an adaptive coefficient scan order, according to an exemplary embodiment.
• the apparatus 1000 includes an entropy-decoding unit 1010, a prediction unit 1020, a residual reconstructing unit 1030, a control unit 1040, an addition unit 1050, a scanning unit 1015, and a storage unit 1060.
• the entropy-decoding unit 1010 acquires angle information about a predetermined angle for determining a scan order and information about coefficients of a current block to be decoded from an input bitstream.
• the scanning unit 1015 projects each of the coefficients of the current block to an axis, selected as a reference axis from among a horizontal axis and a vertical axis, along a straight line perpendicular to a straight line with the predetermined angle from the reference axis, and determines a scan order based on an arrangement order of coefficients projected to the reference axis, as described above.
• the scanning unit 1015 rearranges the coefficients extracted from the entropy-decoding unit 1010 and outputs the rearranged coefficients to the residual reconstructing unit 1030.
• the residual reconstructing unit 1030 reconstructs residual data by performing inverse quantization and inverse transformation on transform coefficients.
• the prediction unit 1020 generates and outputs a predicted image according to a prediction mode of the current block extracted from the bitstream.
• the addition unit 1050 reconstructs the current block by adding the reconstructed residual and the predicted image. The reconstructed current block is stored in the storage unit 1050, and is used to decode a next block.
• the control unit 1040 controls each element of the apparatus 1000.
• angle information about a predetermined angle ⁇ for determining a scan order of coefficients of a current block to be decoded from a bitstream is acquired.
• the coefficients acquired from the bitstream in the determined scan order are rearranged and output.
• the rearranged and output coefficients are subjected to inverse quantization and inverse transformation to generate residual data.
• the current block is reconstructed by adding the generated residual data and a predicted image of the current block.
• image compression efficiency may be improved by efficiently defining various scan orders by using only angle information.
• Exemplary embodiments may be embodied as computer-readable codes in a computer-readable recording medium.
• the computer-readable recording medium may be any recording apparatus capable of storing data that is read by a computer system. Examples of the computer-readable recording medium include read-only memories (ROMs), random-access memories (RAMs), CD-ROMs, magnetic tapes, floppy disks, and optical data storage devices.
• the computer readable medium may be distributed among computer systems that are interconnected through a network, and an exemplary embodiment may be stored and implemented as computer readable codes in the distributed system.
• one or more units of the encoding apparatus 400 and decoding apparatus 1000 can include a processor or microprocessor executing a computer program stored in a computer-readable medium.

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)
• Compression, Expansion, Code Conversion, And Decoders (AREA)
• Transmission Systems Not Characterized By The Medium Used For Transmission (AREA)

Applications Claiming Priority (3)

Publications (1)

Family

ID=44763394

Family Applications (3)

Family Applications After (2)

Country Status (16)

Families Citing this family (21)

Family Cites Families (63)

• 2010
  • 2010-07-07 KR KR20100065469A patent/KR20110112168A/ko not_active Application Discontinuation
  • 2010-09-01 KR KR20100085508A patent/KR20110112171A/ko not_active Application Discontinuation
  • 2010-10-05 KR KR1020100096920A patent/KR101503270B1/ko active IP Right Grant
  • 2010-10-20 KR KR1020100102506A patent/KR101754353B1/ko active IP Right Grant
• 2011
  • 2011-04-05 MX MX2012011650A patent/MX2012011650A/es active IP Right Grant
  • 2011-04-05 MX MX2012011550A patent/MX2012011550A/es active IP Right Grant
  • 2011-04-05 CA CA2795621A patent/CA2795621C/en active Active
  • 2011-04-05 JP JP2013503671A patent/JP5891218B2/ja active Active
  • 2011-04-05 CN CN201510217350.8A patent/CN104967859B/zh active Active
  • 2011-04-05 KR KR20110031289A patent/KR20110112224A/ko not_active Application Discontinuation
  • 2011-04-05 JP JP2013503673A patent/JP2013524679A/ja active Pending
  • 2011-04-05 PL PL11766128T patent/PL2556671T3/pl unknown
  • 2011-04-05 MY MYPI2012004418A patent/MY165375A/en unknown
  • 2011-04-05 CN CN201510219883.XA patent/CN104837023B/zh active Active
  • 2011-04-05 AU AU2011239059A patent/AU2011239059B2/en not_active Expired - Fee Related
  • 2011-04-05 CA CA2891093A patent/CA2891093C/en active Active
  • 2011-04-05 CA CA2891138A patent/CA2891138C/en active Active
  • 2011-04-05 HU HUE11766128A patent/HUE055102T2/hu unknown
  • 2011-04-05 CA CA2891099A patent/CA2891099C/en active Active
  • 2011-04-05 CN CN2011800277517A patent/CN102934433A/zh active Pending
  • 2011-04-05 CN CN201611028108.7A patent/CN106488237B/zh active Active
  • 2011-04-05 AU AU2011239137A patent/AU2011239137B2/en active Active
  • 2011-04-05 WO PCT/KR2011/002386 patent/WO2011126285A2/ko active Application Filing
  • 2011-04-05 BR BR112012025308-5A patent/BR112012025308B1/pt active IP Right Grant
  • 2011-04-05 CN CN201510217468.0A patent/CN104980753B/zh active Active
  • 2011-04-05 CA CA 2795479 patent/CA2795479A1/en not_active Abandoned
  • 2011-04-05 EP EP11766139A patent/EP2556673A2/de not_active Withdrawn
  • 2011-04-05 CN CN201610031642.7A patent/CN105681802B/zh active Active
  • 2011-04-05 ES ES11766128T patent/ES2879573T3/es active Active
  • 2011-04-05 CN CN201611047995.2A patent/CN106488239B/zh active Active
  • 2011-04-05 CN CN201611042229.7A patent/CN106454352B/zh active Active
  • 2011-04-05 CN CN201510220011.5A patent/CN104902280B/zh active Active
  • 2011-04-05 BR BR112012025306A patent/BR112012025306A2/pt not_active IP Right Cessation
  • 2011-04-05 CN CN201611041101.9A patent/CN106488238B/zh active Active
  • 2011-04-05 EP EP11766133.0A patent/EP2556672A4/de not_active Ceased
  • 2011-04-05 MY MYPI2015000948A patent/MY196086A/en unknown
  • 2011-04-05 CA CA3020464A patent/CA3020464C/en active Active
  • 2011-04-05 RU RU2012146753/08A patent/RU2518935C1/ru not_active IP Right Cessation
  • 2011-04-05 MY MYPI2014003543A patent/MY174869A/en unknown
  • 2011-04-05 CN CN201180027747.0A patent/CN102934432B/zh active Active
  • 2011-04-05 EP EP11766128.0A patent/EP2556671B1/de active Active
  • 2011-04-05 RU RU2012146749/08A patent/RU2540842C2/ru active
  • 2011-04-05 DK DK11766128.0T patent/DK2556671T3/da active
• 2012
  • 2012-11-02 ZA ZA2012/08293A patent/ZA201208293B/en unknown
• 2014
  • 2014-10-29 KR KR1020140148760A patent/KR101605774B1/ko active IP Right Grant
  • 2014-10-29 KR KR1020140148744A patent/KR101754354B1/ko active IP Right Grant
  • 2014-12-08 RU RU2014149335/08A patent/RU2595610C2/ru active
• 2015
  • 2015-01-30 ZA ZA2015/00722A patent/ZA201500722B/en unknown
  • 2015-01-30 ZA ZA2015/00720A patent/ZA201500720B/en unknown
  • 2015-01-30 ZA ZA2015/00723A patent/ZA201500723B/en unknown
  • 2015-05-07 JP JP2015095273A patent/JP5891327B2/ja active Active
  • 2015-05-07 JP JP2015095275A patent/JP5891329B2/ja active Active
  • 2015-05-07 JP JP2015095274A patent/JP5891328B2/ja active Active
  • 2015-05-07 JP JP2015095272A patent/JP5891326B2/ja active Active
  • 2015-07-03 KR KR1020150095377A patent/KR101605776B1/ko active IP Right Grant
  • 2015-07-03 KR KR1020150095376A patent/KR101605775B1/ko active IP Right Grant
  • 2015-07-03 KR KR1020150095378A patent/KR101710634B1/ko active IP Right Grant
• 2016
  • 2016-07-07 RU RU2016127315A patent/RU2641241C2/ru active
  • 2016-07-07 RU RU2016127284A patent/RU2639946C1/ru active
  • 2016-07-07 RU RU2016127324A patent/RU2640719C2/ru active
• 2017
  • 2017-02-20 KR KR1020170022468A patent/KR101806291B1/ko active IP Right Grant
  • 2017-06-28 KR KR1020170081836A patent/KR101794251B1/ko active Search and Examination
  • 2017-10-31 KR KR1020170144229A patent/KR101852988B1/ko active IP Right Grant
  • 2017-11-30 KR KR1020170163322A patent/KR101859452B1/ko active IP Right Grant
  • 2017-12-26 RU RU2017145697A patent/RU2674888C1/ru active
• 2018
  • 2018-04-23 KR KR1020180046991A patent/KR101974139B1/ko active IP Right Grant

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events