EP2723077B1 - Image encoding device, image encoding method and image encoding program, as well as image decoding device, image decoding method and image decoding program - Google Patents

Image encoding device, image encoding method and image encoding program, as well as image decoding device, image decoding method and image decoding program Download PDF

Info

Publication number
EP2723077B1
EP2723077B1 EP12800165.8A EP12800165A EP2723077B1 EP 2723077 B1 EP2723077 B1 EP 2723077B1 EP 12800165 A EP12800165 A EP 12800165A EP 2723077 B1 EP2723077 B1 EP 2723077B1
Authority
EP
European Patent Office
Prior art keywords
intra prediction
probable
mode
coding
list
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
EP12800165.8A
Other languages
German (de)
English (en)
French (fr)
Other versions
EP2723077A4 (en
EP2723077A1 (en
Inventor
Toru Kumakura
Shigeru Fukushima
Motoharu Ueda
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
JVCKenwood Corp
Original Assignee
JVCKenwood Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from JP2011135322A external-priority patent/JP5252032B2/ja
Priority claimed from JP2011135321A external-priority patent/JP5477343B2/ja
Application filed by JVCKenwood Corp filed Critical JVCKenwood Corp
Publication of EP2723077A1 publication Critical patent/EP2723077A1/en
Publication of EP2723077A4 publication Critical patent/EP2723077A4/en
Application granted granted Critical
Publication of EP2723077B1 publication Critical patent/EP2723077B1/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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/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/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/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/186—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 colour or a chrominance component
    • 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/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

Definitions

  • the present invention relates to techniques for picture coding and picture decoding, and particularly to techniques for intra-screen coding and intra-screen decoding.
  • MPEG-4 AVC which is an international standard of moving picture coding
  • a method called intra prediction is employed for intra-screen coding by which processing is completed within one screen.
  • intra prediction a prediction picture of a block to be processed is generated by replicating, in a specified direction, a decoded sampled value adjacent to the block to be processed.
  • the quality of a prediction picture can be improved by increasing the number of definitions of prediction directions.
  • the symbol 201 of Fig. 2A shows an example in which 17 prediction directions are defined, and the symbol 202 of Fig. 2B shows an example in which 34 prediction directions are defined.
  • an increase of the number of definitions of prediction directions leads to an increase of the information amount of intra prediction modes to be transmitted. Since the code amount associated with intra prediction modes accounts for a larger proportion of the total amount of generated codes when the number of definitions of prediction directions increases, an efficient transmission method is highly required.
  • JP 2009-246975 A describes a means for reducing the total number of intra prediction modes to be transmitted so as to reduce the code amount associated with the intra prediction modes.
  • the intra prediction modes for multiple blocks are scanned in units of predetermined integration units, and, when all the intra prediction modes within an integration unit are the same, only the intra prediction mode is transmitted for the integration unit, thereby reducing the number of intra prediction modes to be transmitted.
  • YAMAMOTO T ET AL "Flexible representation of intra prediction modes", 2.
  • FDMR Flexible Directional Mode Representation
  • FDMR also provides functionality to utilize the rank order of the intra prediction modes in the probable mode derivation process.
  • FDMR is designed to use more than one probable mode.
  • FDMR provides the flexible framework for intra prediction mode coding with the comparable coding efficiency compare to the one included in TMuC.
  • coding efficiency improvement can also be obtained when adding some complexity in encoding or decoding process.
  • an intra prediction mode is generally coded based on a probability model of intra prediction modes in which it is assumed that an intra prediction mode for a neighboring block of a block subject to coding in a picture is highly likely to be selected also for the block subject to coding.
  • a probability model of intra prediction modes in which it is assumed that an intra prediction mode for a neighboring block of a block subject to coding in a picture is highly likely to be selected also for the block subject to coding.
  • there is a method of defining such a probability model in a simplified way however, since it cannot be said that the actual probability of intra prediction modes are sufficiently reflected in the method, it has been difficult to efficiently code an intra prediction mode.
  • the method of adaptively defining an optimal probability model for each block enables efficient coding of an intra prediction mode but also causes complication of intra prediction processing.
  • the present invention has been made in view of such a situation, and a purpose thereof is to provide techniques for picture coding and picture decoding by which the coding efficiency can be improved while complication of intra prediction processing is prevented.
  • a picture coding device of an embodiment of the present invention is provided as set forth in claim 1.
  • a picture coding method is provided as set forth in claim 2.
  • a picture decoding device of yet another embodiment of the present invention is provided as set forth in claim 4.
  • a further embodiment of the present invention is a picture decoding method as set forth in claim 5.
  • a picture coding computer program of the present invention is defined in claim 3, and a picture decoding computer program of the present invention is defined in claim 6.
  • the coding efficiency can be improved while complication of intra prediction processing is prevented.
  • a "target block” means a block to be coded when a coding process is performed by a picture coding device, while it means a block to be decoded when a decoding process is performed by a picture decoding device.
  • a “processed block” means a decoded block that has been coded when a coding process is performed by a picture coding device, while it means a decoded block when a decoding process is performed by a picture decoding device.
  • Figs. 3 are diagrams that show coding trees for coding the 9 patterns of intra prediction modes shown in Figs. 1 .
  • a method for transmitting an intra prediction mode according to MPEG-4 AVC follows the coding tree of the symbol 301 in Fig. 3A .
  • an inner node (circle) is assigned a code
  • a leaf (square) is assigned a mode number of intra prediction.
  • a leaf denoted by the symbol 302 is a most probable mode, which will be described later.
  • the most probable mode is assigned "1”
  • the mode 7 is assigned the code "0111", for example.
  • Figs. 4 are diagrams that show coding syntax for transmitting an intra prediction mode according to the coding trees shown in Figs. 3 .
  • prev_intra_pred_flag is a syntax element identifying if it is a most probable mode
  • rem_intra_pred_mode is a syntax element indicating a mode number.
  • 1 bit of prev_intra_pred_flag is first read from a coded sequence, and, if the prev_intra_pred_flag is 1, the intra prediction mode will be set to the most probable mode and the next syntax will be handled. If the prev_intra_pred_flag is not 1, another 3 bits of prev_intra_pred_flag will be read out, and the intra prediction mode will be set to a prediction mode indicated by rem_intra_pred_mode.
  • the 17 patterns of intra prediction modes shown in Fig. 2A can be coded according to the coding tree of the symbol 303 in Fig. 3B , using a similar transmission method.
  • processed neighboring blocks which are adjacent to a target block, are referred to.
  • the processed neighboring blocks are defined as the uppermost block among blocks positioned adjacent to the left side of the target block (referred to as a "reference block A") and the leftmost block among blocks positioned adjacent to the upper side of the target block (referred to as a "reference block B").
  • FIG. 18 An example of processed neighboring reference blocks will be described with reference to Fig. 18 .
  • all the blocks spatially positioned above or/and to the left of the target block 1801 are processed blocks (symbols 1802-1811), and the other blocks are unprocessed blocks (symbols 1812-1815).
  • the two blocks 1807 and 1809 are positioned adjacent to the left side of the target block 1801, and the upper block 1807 is defined as the reference block A.
  • the block 1803 is positioned adjacent to the upper side of the target block 1801, and hence, the block 1803 is defined as the reference block B.
  • the most probable mode is identical with one of the intra prediction modes for the reference blocks.
  • the coding trees shown in Figs. 3 assign a 1-bit code to a most probable mode and assign a 1+3-bit, i.e., a 4-bit code to each of the other modes, according to the following probability model:
  • Such a transmission method has the advantage of reducing the code amount of intra prediction modes on average by assigning a shorter code word to a subject prediction mode when the mode is identical with a most probable mode.
  • the actual probability of a most probable mode p(mpm) is merely about 0.2 on average, and the coding trees shown in Figs. 3 do not necessarily reflect the actual distribution of intra prediction modes. Therefore, it cannot be said that the method described above is an optimal method for improving coding efficiency.
  • an effective way is, for example, to adaptively switch among coding trees according to the distribution of prediction modes of processed blocks.
  • a method requires condition judgment and process branches for each block, causing an increase of circuit size and complication of processing.
  • the present embodiment enables improvement of coding efficiency while preventing an increase of circuit size or complication of processing.
  • FIG. 5 is a block diagram that shows a configuration of a picture coding device according to an embodiment.
  • a picture coding device of the embodiment comprises a subtracting unit 501, an orthogonal transformation and quantization unit 502, an inverse quantization and inverse transformation unit 503, an adding unit 504, a decoded picture memory 505, an intra prediction unit 506, a texture information coding unit 507, an intra prediction mode coding unit 508, and an intra prediction mode selecting unit 509. Since the embodiment of the present invention focuses on intra prediction, constituting elements related to inter-screen prediction are not illustrated in the drawings and the description thereof will be omitted.
  • the intra prediction mode selecting unit 509 selects an optimal intra prediction mode for each block of a picture and provides the selected intra prediction mode to the intra prediction unit 506 and the intra prediction mode coding unit 508.
  • the intra prediction mode coding unit 508 performs variable-length coding on an input intra prediction mode and outputs an intra prediction mode bitstream. The configuration and operation of the intra prediction mode coding unit 508 will be detailed later.
  • the intra prediction unit 506 generates an intra prediction picture based on an input intra prediction mode and the decoded picture of a neighboring block stored in the decoded picture memory 505 and provides the intra prediction picture thus generated to the subtracting unit 501.
  • the subtracting unit 501 subtracts an intra prediction picture from an original picture subject to coding so as to generate a difference picture and provides the generated difference signal to the orthogonal transformation and quantization unit 502.
  • the orthogonal transformation and quantization unit 502 performs orthogonal transformation and quantization on a difference picture so as to generate texture information and provides the texture information thus generated to the inverse quantization and inverse transformation unit 503 and the texture information coding unit 507.
  • the texture information coding unit 507 performs entropy coding on texture information and outputs a texture information bitstream.
  • the inverse quantization and inverse transformation unit 503 performs inverse quantization and inverse orthogonal transformation on texture information received from the orthogonal transformation and quantization unit 502 so as to generate a decoded difference signal and provides the decoded difference signal thus generated to the adding unit 504.
  • the adding unit 504 adds an intra prediction picture and a decoded difference signal so as to generate a decoded picture and stores the decoded picture thus generated in the decoded picture memory 505.
  • FIG. 8 is a block diagram that shows a configuration of a moving picture decoding device according to the embodiment.
  • a picture decoding device of the embodiment comprises a texture information decoding unit 801, an inverse quantization and inverse transformation unit 802, an intra prediction mode decoding unit 803, an adding unit 804, a decoded picture memory 805, and an intra prediction unit 806. Since the embodiment of the present invention focuses on intra prediction, constituting elements related to inter-screen prediction are not illustrated in the drawings and the description thereof will be omitted.
  • the decoding process performed by the picture decoding device shown in Fig. 8 corresponds to the decoding process performed within the picture coding device shown in Fig. 5 . Accordingly, the configurations of the inverse quantization and inverse transformation unit 802, adding unit 804, decoded picture memory 805, and intra prediction unit 806 shown in Fig. 8 have functions corresponding to those of the configurations of the inverse quantization and inverse transformation unit 503, adding unit 504, decoded picture memory 505, and intra prediction unit 506 in the picture coding device shown in Fig. 5 , respectively.
  • the intra prediction mode decoding unit 803 performs entropy decoding on an input intra prediction mode bitstream so as to generate an intra prediction mode and provides the intra prediction mode thus generated to the intra prediction unit 806.
  • the configuration and operation of the intra prediction mode decoding unit 803 will be detailed later.
  • the intra prediction unit 806 generates an intra prediction picture based on an input intra prediction mode and the decoded picture of a neighboring block stored in the decoded picture memory 805 and provides the intra prediction picture thus generated to the adding unit 804.
  • the texture information decoding unit 801 performs entropy decoding on texture information so as to generate texture information and provides the texture information thus generated to the inverse quantization and inverse transformation unit 802.
  • the inverse quantization and inverse transformation unit 802 performs inverse quantization and inverse orthogonal transformation on texture information received from the texture information decoding unit 801 so as to generate a decoded difference signal and provides the decoded difference signal thus generated to the adding unit 804.
  • the adding unit 804 adds an intra prediction picture and a decoded difference signal so as to generate a decoded picture and stores the decoded picture thus generated in the decoded picture memory 805 to output the picture.
  • the coding process and decoding process for an intra prediction mode according to the embodiment of the present invention are performed by the intra prediction mode coding unit 508 in the moving picture coding device shown in Fig. 5 and the intra prediction mode decoding unit 803 in the moving picture decoding device shown in Fig. 8 , respectively.
  • the coding process and decoding process for an intra prediction mode according to the embodiment will be detailed.
  • the screen is hierarchically divided into rectangle blocks, as shown in Fig. 18 , and processes on the respective blocks are sequentially performed in a certain process order.
  • Each divided block is referred to as a coding block.
  • the block 1817 in Fig. 18 corresponds to the maximum division unit in the embodiment, which is referred to as the maximum coding block.
  • the block 1816 in Fig. 18 corresponds to the minimum division unit in the embodiment, which is referred to as the minimum coding block.
  • the minimum coding block has a size of 4x4 pixels and the maximum coding block has a size of 16x16 pixels.
  • a prediction block has a size in a range from the size of the minimum coding block to the size of the maximum coding block inclusive.
  • the blocks 1802, 1803, and 1804 are 16x16 blocks
  • the blocks 1805, 1810, 1811, and 1801 are 8x8 blocks
  • the blocks 1806, 1807, 1808, and 1809 are 4x4 blocks.
  • the blocks 1812, 1813, 1814, and 1815 are unprocessed blocks, and the sizes of the coding blocks are not fixed.
  • an optimal size of a prediction block is determined and transmitted.
  • the size of a prediction block is derived from a bitstream.
  • the description will be made using a prediction block as a unit of processing.
  • the reference blocks are defined as a block A, which is the uppermost block among blocks positioned adjacent to the left side of the target block, and a block B, which is the leftmost block among blocks positioned adjacent to the upper side of the target block.
  • the prediction mode for the block A is defined as refModeA
  • the prediction mode for the block B is defined as refModeB.
  • the intra prediction mode for each reference block is also referred to as a "reference intra prediction mode". When there is no reference block, the reference intra prediction mode is set to the DC prediction mode (also referred to as the "average value mode").
  • the composition of intra prediction modes is changed according to the size of the prediction block.
  • a 4x4 block are defined the 17 patterns of intra prediction modes shown as the symbol 201 in Fig. 2A
  • for an 8x8 block and a 16x16 block are defined the 34 patterns of intra prediction modes shown as the symbol 202 in Fig. 2B .
  • Fig. 6 is a block diagram of a detailed configuration of the intra prediction mode coding unit 508 shown in Fig. 5 according to the first embodiment.
  • the intra prediction mode coding unit 508 of the first embodiment comprises an intra prediction mode memory 601, a most probable mode list construction unit 602, a most probable mode determination flag calculating unit 603, a most probable mode determination flag coding unit 604, a most probable mode index calculating unit 605, a most probable mode index coding unit 606, a non-probable mode index calculating unit 607, a non-probable mode index coding unit 608, and a most probable mode determination unit 609.
  • a procedure for coding an intra prediction mode will be described also with reference to the flowchart of Fig. 7 .
  • the most probable mode list construction unit 602 derives the intra prediction modes refModeA and refModeB of neighboring blocks from the intra prediction mode memory 601, constructs a most probable mode list mpmList, and determines the size of the most probable mode list mpmlistsize (step S701). The procedure for constructing a most probable mode list will be detailed later.
  • the most probable mode list construction unit 602 also stores the subject intra prediction mode in the intra prediction mode memory 601.
  • the most probable mode list size mpmListSize is set to either 1 or 2; mpmListSize is set to 1 when the reference modes refModeA and refModeB are identical with each other, while mpmListSize is set to 2 when the reference modes refModeA and refModeB are different from each other.
  • the most probable mode determination flag calculating unit 603 derives the subject prediction mode and the most probable mode list mpmList and calculates a most probable mode determination flag mpmFlag. Meanwhile, the most probable mode index calculating unit 605 calculates a most probable mode index mpmIndex (step S702). The most probable mode determination flag coding unit 604 then codes the most probable mode determination flag mpmFlag (step S703). The procedures for calculating a most probable mode determination flag and a most probable mode index will be detailed later.
  • the most probable mode determination unit 609 determines the most probable mode determination flag mpmFlag (step S704).
  • the non-probable mode index calculating unit 607 will calculate a non-probable mode index remModeIndex (step S707) and the non-probable mode index coding unit 608 will code the calculated non-probable mode remModeIndex (step S708).
  • the procedures for calculating a non-probable mode index and coding a non-probable mode will be detailed later.
  • the most probable mode list construction unit 602 derives the intra prediction modes refModeA and refModeB of neighboring blocks from the intra prediction mode memory 601 to compare the refModeA and refModeB (step S1101).
  • mpmList[0] is set to refModeA (step S1102) and mpmListSize is set to 1 (step S1103) before the process proceeds to the step S702 in Fig. 7 .
  • mpmList[0] is set to min(refModeA,refModeB) and mpmList[1] is set to max(refModeA,refModeB) (step S1104) and mpmListSize is set to 2 (step S1105) before the process proceeds to the step S702 in Fig. 7 .
  • mpmList is scanned in ascending order to advance the process.
  • the most probable mode determination flag calculating unit 603 initializes the most probable mode determination flag mpmFlag to false, and the most probable mode index calculating unit 605 initializes the most probable mode index mpmIndex to 0.
  • a parameter i used to scan the mpmList is initialized to 0 (step S1201).
  • step S1203 If the parameter i is less than mpmListSize (step S1202), i.e., if all the elements of mpmList are not scanned yet, mpmList[i] and currModeIndex will be compared (step S1203).
  • mpmList[i] and currModeIndex are identical with each other, it means that the subject prediction mode is identical with the i-th element in the most probable mode list, so that mpmFlag and mpmIndex are set to true and i, respectively (step S1204) before the process proceeds to the step S703 in Fig.7 .
  • mpmList[i] and currModeIndex are different from each other, on the other hand, i is incremented by one (step S1205) and the scanning is continued.
  • the procedures for calculating the most probable mode determination flag and the most probable mode index will be terminated, and the process will proceed to the step S703 in Fig. 7 .
  • Such a case indicates that the subject prediction mode is not included in the most probable mode list, and resetting of mpmFlag and mpmIndex is not performed. Namely, mpmFlag is false, and mpmIndex is 0.
  • mpmList is scanned in descending order of the index to advance the process.
  • the non-probable mode index calculating unit 607 initializes the non-probable mode index remModeIndex to the subject prediction mode currModeIndex and also initializes the parameter i used to scan the mpmList to (mpmListSize-1) (step S1301) .
  • step S1302 If the parameter i is greater than or equal to 0 (step S1302), i.e., if all the elements of mpmList are not scanned yet, remModeIndex and mpmList[i] will be compared (step S1303). If remModeIndex is greater than mpmList[i], the value of remModeIndex will be decremented by one (step S1304). Thereafter, the value of the parameter i is also decremented by one (step S1305) and the scanning is continued.
  • the procedure for calculating the non-probable mode index will be terminated, and the process will proceed to the step S708 in Fig. 7 .
  • the non-probable mode index coding unit 608 determines the size of the target block (step S1401).
  • remModeIndex is converted to one of the values [0, 15] when one most probable mode is provided, and remModeIndex is converted to one of the values [0, 14] when two most probable modes are provided.
  • 4 bits are sufficient to express remModeIndex with a fixed length, so that 4-bit fixed-length coding is performed on remModeIndex (step S1402) before the process is terminated.
  • the 34 patterns of intra predictions are defined therefor.
  • remModeIndex is converted to one of the values [0, 32] when one most probable mode is provided, and remModeIndex is converted to one of the values [0, 31] when two most probable modes are provided.
  • 33 patterns are possible for the non-probable mode index; accordingly, a 5-bit fixed length is not sufficient, and variable-length coding is necessary.
  • step S1403 When remModeIndex is less than 31 (step S1403), 5-bit fixed-length coding is performed on remModeIndex (step S1404) before the process is terminated.
  • step S1405 the 6-bit sequence "111110” is coded when remModeIndex is 31 (step S1406), and the 6-bit sequence "111111” is coded when remModeIndex is 32 (step S1407), before the process is terminated.
  • the 17 patterns shown as the symbol 201 in Fig. 2A are defined for a 4x4 block, in order to simply code or decode the non-probable mode index of the 4x4 block.
  • the definition of 18 patterns has the advantage that all the prediction directions can be expressed in increments of 5 degrees, preventing the degradation in prediction accuracy as shown in the symbol 201.
  • remModeIndex is converted to one of the values [0, 16] when one most probable mode is provided, and remModeIndex is converted to one of the values [0, 15] when two most probable modes are provided.
  • 16 patterns are possible for the non-probable mode index; accordingly, as with the cases of an 8x8 block and a 16x16 block in the present embodiment, variable-length coding is necessary, causing complication of the process. Meanwhile, if the definition of 33 patterns shown as the symbol 204 in Fig.
  • Fig. 9 is a block diagram of a detailed configuration of the intra prediction mode decoding unit 803 shown in Fig. 8 according to the first embodiment.
  • the intra prediction mode decoding unit 803 of the first embodiment comprises an intra prediction mode memory 901, a most probable mode list construction unit 902, a most probable mode determination flag decoding unit 903, a most probable mode index decoding unit 904, a most probable mode calculating unit 905, a non-probable mode index decoding unit 906, and a non-probable mode calculating unit 907.
  • the intra prediction mode decoding process performed by the intra prediction mode decoding unit 803 shown in Fig. 9 correlates with the intra prediction mode coding process performed by the intra prediction mode coding unit 508 shown in Fig. 6 . Accordingly, the configurations of the intra prediction mode memory 901 and most probable mode list construction unit 902 shown in Fig. 9 have the same functions as the configurations of the intra prediction mode memory 601 and most probable mode list construction unit 602 shown in Fig. 6 , respectively.
  • the most probable mode list construction unit 902 derives the intra prediction modes refModeA and refModeB of neighboring blocks from the intra prediction mode memory 901, constructs a most probable mode list mpmList, and determines the size of the most probable mode list mpmlistsize (step S1001). Since the procedure for constructing a most probable mode list follows the procedure shown in the flowchart of Fig. 11 , as with the procedure performed by the most probable mode list construction unit 602 in Fig. 6 , detailed description thereof will be omitted.
  • the most probable mode determination flag decoding unit 903 reads 1 bit from a coded sequence and decodes the most probable mode determination flag mpmFlag (step S1002) so as to determine the value of the most probable mode determination flag mpmFlag (step S1003).
  • the most probable mode index decoding unit 904 will determine the number of most probable modes mpmListSize (step S1004). If mpmListSize is 1, the most probable mode index mpmIndex will be set to 0 (step S1005). If mpmListSize is 2, another bit will be read from the coded sequence and the most probable mode index mpmIndex will be decoded (step S1006). Thereafter, the most probable mode calculating unit 905 defines the mpmIndex-th element of the most probable mode list mpmList, i.e., mpmList[mpmIndex], as the subject prediction mode currModeIndex (step S1007) and terminates the process.
  • the non-probable mode index decoding unit 906 will decode the non-probable mode index remModeIndex (step S1008) and the non-probable mode calculating unit 907 will calculate the subject prediction mode currModeIndex based on the calculated remModeIndex (step S1009). Thereafter, the subject prediction mode currModeIndex is stored in the intra prediction mode memory 901 before the process is terminated.
  • the procedures for decoding a non-probable mode index and calculating a subject prediction mode will be described later.
  • the non-probable mode index decoding unit 906 determines the size of the target block (step S1501).
  • step S1502 When the target block is a 4x4 block, 4-bit fixed-length decoding is performed to acquire remModeIndex (step S1502).
  • remModeIndex When the target block is an 8x8 block or a 16x16 block, 5-bit fixed-length decoding is performed to acquire remModeIndex (step S1503). The value of remModeIndex is then determined (step S1504).
  • remModeIndex is other than "11111"
  • the procedure for decoding the non-probable mode index will be terminated, and the process will proceed to the step S1009 in Fig. 10 .
  • nextBit will be further decoded (step S1505) and the value of nextBit will be determined (step S1506). If nextBit is "0”, remModeIndex will be set to 31, and the procedure for decoding the non-probable mode index will be terminated, so that the process will proceed to the step S1009 in Fig. 10 . If nextBit is "0”, remModeIndex will be set to 32, and the procedure for decoding the non-probable mode index will be terminated, so that the process will proceed to the step S1009 in Fig. 10 .
  • mpmList is scanned in ascending order of the index to advance the process.
  • the non-probable mode calculating unit 907 initializes the subject prediction mode currModeIndex to the non-probable mode index remModeIndex and also initializes the parameter i used to scan mpmList to 0 (step S1601).
  • step S1602 If the parameter i is less than mpmListSize (step S1602), i.e., if all the elements of mpmList are not scanned yet, currModeIndex and mpmList[i] will be compared (step S1603). If currModeIndex is greater than or equal to mpmList[i], the value of currModeIndex will be incremented by one (step S1604). Thereafter, the value of the parameter i is also incremented by one (step S1605) and the scanning is continued.
  • Fig. 23 shows coding syntax for an intra prediction mode in a bitstream output by the coding device or interpreted by the decoding device according to the present embodiment.
  • the present embodiment differs from the first embodiment in that, if refModeA and refModeB are identical with each other when the most probable mode list is constructed, another prediction mode different from the reference prediction mode will be added to the most probable mode list, so that two most probable modes will be always provided. With such operation, process branches in subsequent coding or decoding processing can be reduced, thereby simplifying the process.
  • the composition of intra prediction modes is changed according to the size of the prediction block.
  • the 18 patterns of the symbol 203 in Figs. 2 are defined for a 4x4 block
  • the 34 patterns of the symbol 201 together with the symbol 202 in Figs. 2 are defined for an 8x8 block and a 16x16 block.
  • the definitions of 18 patterns and 34 patterns have the advantage that all the prediction directions can be expressed in increments of 11.25 degrees and 7.125 degrees, respectively, so that less degradation in prediction accuracy is seen compared to the definitions of 17 patterns and 33 patterns in which part of directions cannot be expressed.
  • the difference from the first embodiment is the composition of the intra prediction modes for a 4x4 block. Since two most probable modes are always provided in the present embodiment, when 18 patterns of intra prediction modes are defined, the non-probable modes can be always fixed to 16 patterns; accordingly, when fixed-length coding is performed on the non-probable modes, codes can be equally assigned.
  • the configuration of the intra prediction mode coding unit 508 in the second embodiment is the same as that in the first embodiment shown in Fig. 6 , detailed operations of the most probable mode list construction unit 602, the most probable mode index coding unit 606, and the non-probable mode index coding unit 608 are different from those in the first embodiment.
  • the procedure for coding an intra prediction mode will be described with reference to the flowchart of Fig. 17 .
  • the most probable mode list construction unit 602 derives the intra prediction modes for neighboring blocks from the intra prediction mode memory 601, constructs a most probable mode list mpmList, and determines the size of the most probable mode list mpmlistsize (step S1701). The procedure for constructing a most probable mode list will be detailed later.
  • the most probable mode list construction unit 602 also stores the subject intra prediction mode in the intra prediction mode memory 601.
  • the present embodiment differs from the first embodiment in that the most probable mode list mpmList is constructed so that the most probable mode list size mpmListSize is always 2.
  • the most probable mode determination flag calculating unit 603 and the most probable mode index calculating unit 605 derive the subject prediction mode and the most probable mode list mpmList and calculate the most probable mode determination flag mpmFlag and the most probable mode index mpmIndex (step S1702), and the most probable mode determination flag mpmFlag is coded (step S1703). Since the detailed procedures for calculating the most probable mode determination flag and the most probable mode index are the same as those at S702 in Fig. 7 , the description thereof will be omitted.
  • the most probable mode determination unit 609 determines the most probable mode determination flag mpmFlag (step S1704).
  • the most probable mode index coding unit 606 will code the most probable mode index mpmIndex (step S1705) and terminate the process. Since the most probable mode list size mpmListSize is always set to 2 in the present embodiment, the procedure of determining the most probable mode list size mpmListSize (step S705) in the first embodiment shown in Fig. 7 is omitted.
  • the non-probable mode index calculating unit 607 will calculate a non-probable mode index remModeIndex (step S1706) and the non-probable mode index coding unit 608 will code the calculated non-probable mode remModeIndex (step S1707). Since the procedure for calculating the non-probable mode index is the same as that at the step S707 in Fig. 7 , the description thereof will be omitted. The procedure for coding a non-probable mode will be detailed later.
  • the most probable mode list construction unit 602 derives the intra prediction modes refModeA and refModeB of neighboring blocks from the intra prediction mode memory 601 to compare the refModeA and refModeB (step S1901).
  • mpmList[0] is set to refModeA (step S1902). Subsequently, whether or not refModeA is the average value mode is determined (step S1903), and, if refModeA is the average value mode, mpmList[1] will be set to 0 (step S1904). If refModeA is not the average value mode, mpmList[1] will be set to 2 (step S1905). As shown in the symbols 201 and 202 in Figs. 2 , 0 indicates the vertical direction prediction mode, and 2 indicates the average value mode. The mpmList[1] should be a mode having a value different from that of the mpmList[0].
  • mpmList[1] is set to the average value mode when refModeA is not the average value mode; if mpmList[1] is set to the average value mode when refModeA is the average value mode, mpmList[1] and mpmList[0] will be the same.
  • the value to be set for mpmList[1] is determined in advance, which is any of refModeA, refModeB, and a value that does not change in the coding process.
  • mpmList[1] may be set to 1 (horizontal direction prediction mode) at the step S1904. It is generally preferable that such a predetermined value is a prediction mode occurring frequently. Thereafter, mpmListSize is set to 2 (step S1407) before the process proceeds to the step S1702 in Fig. 17 .
  • mpmList[0] is set to min(refModeA,refModeB) and mpmList[1] is set to max(refModeA,refModeB) (step S1906) and mpmListSize is set to 2 (step S1907) before the process proceeds to the step S1702 in Fig. 17 .
  • the non-probable mode index coding unit 608 determines the size of the target block (step S2001).
  • remModeIndex is converted to one of the values [0, 15] as two most probable modes are provided. Since 4 bits are sufficient to express remModeIndex with a fixed length, 4-bit fixed-length coding is performed on remModeIndex (step S2002) before the process is terminated.
  • remModeIndex is converted to one of the values [0, 31] as two most probable modes are provided. Since 5 bits are sufficient to express remModeIndex with a fixed length, 5-bit fixed-length coding is performed on remModeIndex (step S2003) before the process is terminated.
  • the number of non-probable modes changes according to the number of most probable modes, causing complication of the process due to variable-length coding of a non-probable mode or a decline in the coding efficiency due to a decrease of the number of candidates of intra prediction modes.
  • the number of most probable modes is 2, so that fixed-length coding can be always performed on the non-probable mode index without causing a decrease of the number of candidates of intra prediction modes; accordingly, the coding efficiency can be further improved while the simple coding procedure is maintained.
  • the configuration of the intra prediction mode decoding unit 803 in the second embodiment is the same as that in the first embodiment shown in Fig. 9 , detailed operations of the most probable mode list construction unit 902, the most probable mode index decoding unit 904, and the non-probable mode index decoding unit 906 are different from those in the first embodiment.
  • the procedure for decoding an intra prediction mode will be described with reference to the flowchart of Fig. 21 .
  • the most probable mode list construction unit 902 derives the intra prediction modes for neighboring blocks from the intra prediction mode memory 901, constructs a most probable mode list mpmList, and determines the size of the most probable mode list mpmlistsize (step S2101).
  • the second embodiment differs from the first embodiment in that the most probable mode list mpmList is constructed so that the most probable mode list size mpmListSize is always 2. Since the procedure for constructing a most probable mode list follows the procedure shown in the flowchart of Fig. 19 , as with the procedure performed by the most probable mode list construction unit 602 in Fig. 6 , detailed description thereof will be omitted.
  • the most probable mode determination flag decoding unit 903 reads 1 bit from a coded sequence and decodes the most probable mode determination flag mpmFlag (step S2102) so as to determine the most probable mode determination flag mpmFlag (step S2103).
  • the most probable mode index decoding unit 904 will read another bit from the coded sequence and decode the most probable mode index mpmIndex (step S2104). Thereafter, the most probable mode calculating unit 905 defines the mpmIndex-th element of the most probable mode list mpmList, i.e., mpmList[mpmIndex], as the subject prediction mode currModeIndex (step S2105) and terminates the process. Since the most probable mode list size mpmListSize is always set to 2 in the second embodiment, the procedure of determining the most probable mode list size mpmListSize (step S1004) in the first embodiment shown in Fig. 10 is omitted.
  • the non-probable mode index decoding unit 906 will decode the non-probable mode index remModeIndex (step S2106) and the non-probable mode calculating unit 907 will calculate the subject prediction mode currModeIndex based on the calculated remModeIndex (step S2107). Thereafter, the subject prediction mode currModeIndex is stored in the intra prediction mode memory 901 before the process is terminated.
  • the procedure for decoding the non-probable mode index will be described later. Since the procedure for calculating the subject prediction mode is the same as that at the step S1009 in Fig. 10 , the description thereof will be omitted.
  • the non-probable mode calculating unit 907 determines the size of the target block (step S2201).
  • step S2202 When the target block is a 4x4 block, 4-bit fixed-length decoding is performed to acquire remModeIndex (step S2202). The procedure for decoding the non-probable mode index is then terminated, and the process will proceed to the step S2107 in Fig. 21 .
  • step S2203 When the target block is an 8x8 block or a 16x16 block, 5-bit fixed-length decoding is performed to acquire remModeIndex (step S2203). The procedure for decoding the non-probable mode index is then terminated, and the process will proceed to the step S2107 in Fig. 21 .
  • Fig. 24 shows coding syntax for an intra prediction mode in a bitstream output by the coding device or interpreted by the decoding device according to the present embodiment.
  • the third embodiment differs from the second embodiment only in the procedure for constructing the most probable mode list; accordingly, only the procedure for constructing the most probable mode list will be described, and the other description will be omitted.
  • the most probable mode list construction unit 602 derives the intra prediction modes refModeA and refModeB of neighboring blocks from the intra prediction mode memory 601 to compare the refModeA and refModeB (step S2501).
  • mpmList[0] is set to refModeA (step S2502). Subsequently, whether or not refModeA is the average value mode is determined (step S2503), and, if refModeA is the average value mode, mpmList[1] will be set to 0 (step S2504). If refModeA is not the average value mode, mpmList[1] will be set to a prediction mode having the smallest mode index among prediction modes of which the prediction directions are next to the prediction direction of refModeA, with reference to a table (step S2505).
  • Fig. 26 shows an example of a next prediction mode reference table for the intra prediction modes shown as the symbol 201 in Figs.
  • the prediction modes next to the prediction mode 0 are modes 11 and 12, so that the mode 11 having a smaller value is set as the next mode of the prediction mode 0.
  • mpmListSize is set to 2 (step S2507) before the process proceeds to the step S1702 in Fig. 17 .
  • mpmList[0] is set to min(refModeA,refModeB) and mpmList[1] is set to max(refModeA,refModeB) (step S2506) and mpmListSize is set to 2 (step S2507) before the process proceeds to the step S1702 in Fig. 17 .
  • the third embodiment differs from the second embodiment in the method for setting mpmList[1] when refModeA is identical with refModeB and is not the average value mode.
  • mode 0 is exclusively assigned to mpmList[1] when refModeA is identical with refModeB and is not the average value mode.
  • a mode next to refModeA is assigned to mpmList[1] when refModeA is identical with refModeB and is not the average value mode.
  • Such a mode next to refModeA is expected to occur frequently, so that, although the computational amount in the procedure of constructing the most probable mode list is increased compared to that in the second embodiment, the most probable mode list can be constructed more effectively, thereby improving the coding efficiency.
  • the picture coding device and the picture decoding device according to the embodiment as described above provide the following effects.
  • a bitstream of a moving picture output by a moving picture coding device has a specific data format so as to be decoded according to the coding method used in the embodiment, and a moving picture decoding device appropriate for the moving picture coding device can decode a bitstream having such a specific data format.
  • the bitstream may be converted so as to have a data form suitable for the transmission mode of the communication path before being transmitted.
  • a moving picture transmission device configured to convert a bitstream output by the moving picture coding device into coded data having a data form suitable for the transmission mode of the communication path and transmit the coded data to the network; and a moving picture receiving device configured to receive the coded data from the network, restore the data to a bitstream, and provide the bitstream to the moving picture decoding device.
  • the moving picture transmission device comprises a memory for buffering a bitstream output by the moving picture coding device, a packet processing unit for packetizing a bitstream, and a transmission unit for transmitting packetized coded data via the network.
  • the moving picture receiving device comprises a receiving unit for receiving packetized coded data via the network, a memory for buffering received coded data, and a packet processing unit for performing packet processing on coded data to generate a bitstream and providing the bitstream to the moving picture decoding device.
  • the processing associated with the coding or decoding described above may be performed not only by using hardware, such as a transmission device, a storage device, and a receiving device, but also by using firmware stored in a read only memory (ROM) or a flash memory, computer software, and the like.
  • firmware stored in a read only memory (ROM) or a flash memory computer software, and the like.
  • firmware program or a software program may be stored in a computer-readable recording medium or the like so as to be provided, may be provided from a server via a wired or wireless network, or may be provided through data broadcasting using digital terrestrial broadcasting or digital satellite broadcasting.
  • the present invention can be used as techniques for picture coding and picture decoding, and particularly techniques for intra-screen coding and intra-screen decoding.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
EP12800165.8A 2011-06-17 2012-06-13 Image encoding device, image encoding method and image encoding program, as well as image decoding device, image decoding method and image decoding program Active EP2723077B1 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
JP2011135322A JP5252032B2 (ja) 2011-06-17 2011-06-17 画像復号装置、画像復号方法、画像復号プログラム、受信装置、受信方法、及び受信プログラム
JP2011135321A JP5477343B2 (ja) 2011-06-17 2011-06-17 画像符号化装置、画像符号化方法及び画像符号化プログラム
PCT/JP2012/003863 WO2012172796A1 (ja) 2011-06-17 2012-06-13 画像符号化装置、画像符号化方法及び画像符号化プログラム、並びに画像復号装置、画像復号方法及び画像復号プログラム

Publications (3)

Publication Number Publication Date
EP2723077A1 EP2723077A1 (en) 2014-04-23
EP2723077A4 EP2723077A4 (en) 2014-11-26
EP2723077B1 true EP2723077B1 (en) 2021-07-21

Family

ID=47356802

Family Applications (1)

Application Number Title Priority Date Filing Date
EP12800165.8A Active EP2723077B1 (en) 2011-06-17 2012-06-13 Image encoding device, image encoding method and image encoding program, as well as image decoding device, image decoding method and image decoding program

Country Status (7)

Country Link
US (1) US20140098865A1 (ko)
EP (1) EP2723077B1 (ko)
KR (5) KR101842851B1 (ko)
CN (6) CN103597826B (ko)
BR (2) BR112013032349B1 (ko)
TW (5) TWI642298B (ko)
WO (1) WO2012172796A1 (ko)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DK2838270T3 (da) * 2011-06-28 2017-01-02 Samsung Electronics Co Ltd Videoafkodningsfremgangsmåde ved anvendelse af intraforudsigelse
US20140064359A1 (en) * 2012-08-31 2014-03-06 Qualcomm Incorporated Intra prediction most probable mode order improvement for scalable video coding
FR3051309A1 (fr) * 2016-05-10 2017-11-17 Bcom Procedes et dispositifs de codage et de decodage d'un flux de donnees representatif d'au moins une image
US10506228B2 (en) 2016-10-04 2019-12-10 Qualcomm Incorporated Variable number of intra modes for video coding
JP7165192B2 (ja) * 2017-11-17 2022-11-02 鴻穎創新有限公司 調整済みイントラモードリストに基づいてビデオデータを符号化するための装置および方法

Family Cites Families (35)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4130780B2 (ja) * 2002-04-15 2008-08-06 松下電器産業株式会社 画像符号化方法および画像復号化方法
EP2860978B1 (en) * 2002-05-28 2020-04-08 Dolby International AB Method and systems for image intra-prediction mode estimation, communication, and organization
EP2309758B1 (en) * 2002-11-20 2014-07-30 Panasonic Intellectual Property Corporation of America Moving image predicting method, moving image encoding method and device, and moving image decoding method and device
US8009731B2 (en) * 2002-11-25 2011-08-30 Panasonic Corporation Motion compensation method, picture coding method and picture decoding method
JP2006093777A (ja) 2004-09-21 2006-04-06 Victor Co Of Japan Ltd 動画像符号化装置及び動画像符号化プログラム
CN100455021C (zh) * 2004-09-30 2009-01-21 华为技术有限公司 帧内预测模式的选择方法
CN1784016A (zh) * 2004-12-03 2006-06-07 松下电器产业株式会社 内部预测装置
CN100348051C (zh) * 2005-03-31 2007-11-07 华中科技大学 一种增强型帧内预测模式编码方法
KR100678911B1 (ko) * 2005-07-21 2007-02-05 삼성전자주식회사 방향적 인트라 예측의 적용을 확장하여 비디오 신호를인코딩하고 디코딩하는 방법 및 장치
JP4791129B2 (ja) * 2005-10-03 2011-10-12 ルネサスエレクトロニクス株式会社 画像符号化装置、画像符号化方法及び画像編集装置
BRPI0620645B8 (pt) * 2006-01-05 2022-06-14 Nippon Telegraph & Telephone Método e aparelho de codificação de vídeo, e método e aparelho de decodificação de vídeo
KR101365570B1 (ko) * 2007-01-18 2014-02-21 삼성전자주식회사 인트라 예측 부호화, 복호화 방법 및 장치
US8619853B2 (en) * 2007-06-15 2013-12-31 Qualcomm Incorporated Separable directional transforms
RU2496252C2 (ru) * 2007-06-29 2013-10-20 Шарп Кабусики Кайся Устройство кодирования изображения, способ кодирования изображения, устройство декодирования изображения, способ декодирования изображения, программа и запоминающий носитель
CN101641958B (zh) * 2007-09-12 2011-10-19 索尼株式会社 图像处理设备和图像处理方法
CN100551075C (zh) * 2007-10-15 2009-10-14 中兴通讯股份有限公司 一种低复杂度的帧内预测模式选择方法
CN101202915A (zh) * 2007-12-06 2008-06-18 北京大学深圳研究生院 一种帧内预测模式的选择方法及装置
KR101433170B1 (ko) * 2008-01-05 2014-08-28 경희대학교 산학협력단 인접 블록의 공간 예측 방향성을 이용하여 화면 내 예측모드를 추정하는 인코딩 및 디코딩 방법, 그 장치
JP2009177447A (ja) * 2008-01-24 2009-08-06 Panasonic Corp 動画像送受信システム
US20090245371A1 (en) 2008-03-28 2009-10-01 Samsung Electronics Co., Ltd. Method and apparatus for encoding/decoding information about intra-prediction mode of video
CN101668202A (zh) * 2008-09-01 2010-03-10 中兴通讯股份有限公司 帧内预测模式的选择方法和装置
KR101306834B1 (ko) * 2008-09-22 2013-09-10 에스케이텔레콤 주식회사 인트라 예측 모드의 예측 가능성을 이용한 영상 부호화/복호화 장치 및 방법
JPWO2010087157A1 (ja) * 2009-01-29 2012-08-02 パナソニック株式会社 画像符号化方法及び画像復号方法
KR101527085B1 (ko) * 2009-06-30 2015-06-10 한국전자통신연구원 인트라 부호화/복호화 방법 및 장치
KR101702553B1 (ko) * 2009-07-04 2017-02-03 에스케이 텔레콤주식회사 영상 부호화/복호화 방법 및 장치
KR101452860B1 (ko) * 2009-08-17 2014-10-23 삼성전자주식회사 영상의 부호화 방법 및 장치, 영상 복호화 방법 및 장치
US8902978B2 (en) 2010-05-30 2014-12-02 Lg Electronics Inc. Enhanced intra prediction mode signaling
CN101977317B (zh) * 2010-10-27 2012-07-04 无锡中星微电子有限公司 帧内预测方法及装置
AU2011354441B2 (en) * 2011-01-07 2014-07-17 Hfi Innovation Inc. Method and apparatus of improved intra luma prediction mode coding
US9654785B2 (en) * 2011-06-09 2017-05-16 Qualcomm Incorporated Enhanced intra-prediction mode signaling for video coding using neighboring mode
AU2012270960B2 (en) * 2011-06-13 2017-02-16 Sun Patent Trust Image decoding method, image coding method, image decoding apparatus, image coding apparatus, and image coding and decoding apparatus
CN106412585A (zh) * 2011-06-17 2017-02-15 联发科技股份有限公司 内部预测模式编码的方法
KR101876173B1 (ko) * 2011-06-17 2018-07-09 엘지전자 주식회사 인트라 예측 모드 부호화/복호화 방법 및 장치
JP2013074327A (ja) 2011-09-26 2013-04-22 Jvc Kenwood Corp 画像復号装置、画像復号方法及び画像復号プログラム
AU2012200345B2 (en) * 2012-01-20 2014-05-01 Canon Kabushiki Kaisha Method, apparatus and system for encoding and decoding the significance map residual coefficients of a transform unit

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
None *

Also Published As

Publication number Publication date
TW201701673A (zh) 2017-01-01
TWI562617B (ko) 2016-12-11
CN105187834B (zh) 2017-06-27
KR101590733B1 (ko) 2016-02-01
CN105245892B (zh) 2017-03-29
TW201830970A (zh) 2018-08-16
KR101842851B1 (ko) 2018-03-27
CN105245894B (zh) 2017-08-08
BR122020013891B1 (pt) 2022-09-13
EP2723077A4 (en) 2014-11-26
CN107197280B (zh) 2020-06-16
TW201306600A (zh) 2013-02-01
CN107197280A (zh) 2017-09-22
CN105245892A (zh) 2016-01-13
KR101953522B1 (ko) 2019-02-28
CN103597826A (zh) 2014-02-19
KR101742932B1 (ko) 2017-06-01
TW201616867A (zh) 2016-05-01
CN105245894A (zh) 2016-01-13
EP2723077A1 (en) 2014-04-23
CN105187834A (zh) 2015-12-23
TW201524199A (zh) 2015-06-16
CN103597826B (zh) 2017-05-17
CN105187836A (zh) 2015-12-23
TWI487333B (zh) 2015-06-01
CN105187836B (zh) 2017-07-18
KR20180032672A (ko) 2018-03-30
WO2012172796A1 (ja) 2012-12-20
TWI530166B (zh) 2016-04-11
BR112013032349B1 (pt) 2022-09-13
US20140098865A1 (en) 2014-04-10
BR112013032349A2 (pt) 2016-12-20
TWI642298B (zh) 2018-11-21
KR20160133010A (ko) 2016-11-21
KR20170063966A (ko) 2017-06-08
KR20140024461A (ko) 2014-02-28
TWI628951B (zh) 2018-07-01
KR20160017107A (ko) 2016-02-15
KR101677003B1 (ko) 2016-11-16

Similar Documents

Publication Publication Date Title
US10805631B2 (en) Method and apparatus for performing prediction using template-based weight
EP3282700B1 (en) Method decoding video signals
US20190230364A1 (en) Method and apparatus for performing optimal prediction based on weight index
EP2723077B1 (en) Image encoding device, image encoding method and image encoding program, as well as image decoding device, image decoding method and image decoding program
US10015487B2 (en) Picture coding device, picture coding method and picture coding program as well as picture decoding device, picture decoding method, and picture decoding program
CN108353194A (zh) 编码和解码视频信号的方法和装置
US10382792B2 (en) Method and apparatus for encoding and decoding video signal by means of transform-domain prediction
JP5477343B2 (ja) 画像符号化装置、画像符号化方法及び画像符号化プログラム
JP5664684B2 (ja) 画像復号装置、画像復号方法、画像復号プログラム、受信装置、受信方法、及び受信プログラム
JP5252032B2 (ja) 画像復号装置、画像復号方法、画像復号プログラム、受信装置、受信方法、及び受信プログラム
JP5664681B2 (ja) 画像復号装置、画像復号方法、画像復号プログラム、受信装置、受信方法、及び受信プログラム
JP5664682B2 (ja) 画像復号装置、画像復号方法、画像復号プログラム、受信装置、受信方法、及び受信プログラム
JP2013074327A (ja) 画像復号装置、画像復号方法及び画像復号プログラム
JP5983715B2 (ja) 画像復号装置、画像復号方法、及び画像復号プログラム
JP5664683B2 (ja) 画像復号装置、画像復号方法、画像復号プログラム、受信装置、受信方法、及び受信プログラム
JP2013074326A (ja) 画像符号化装置、画像符号化方法及び画像符号化プログラム

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20131211

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

DAX Request for extension of the european patent (deleted)
A4 Supplementary search report drawn up and despatched

Effective date: 20141027

RIC1 Information provided on ipc code assigned before grant

Ipc: H04N 19/463 20140101AFI20141021BHEP

Ipc: H04N 19/11 20140101ALI20141021BHEP

Ipc: H04N 19/46 20140101ALI20141021BHEP

Ipc: H04N 19/176 20140101ALI20141021BHEP

Ipc: H04N 19/593 20140101ALI20141021BHEP

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

17Q First examination report despatched

Effective date: 20180420

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

INTG Intention to grant announced

Effective date: 20210212

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602012076176

Country of ref document: DE

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 1413721

Country of ref document: AT

Kind code of ref document: T

Effective date: 20210815

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG9D

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20210721

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1413721

Country of ref document: AT

Kind code of ref document: T

Effective date: 20210721

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210721

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210721

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211122

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210721

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210721

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211021

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210721

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210721

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211021

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210721

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210721

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210721

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210721

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211022

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602012076176

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210721

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210721

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210721

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210721

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210721

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210721

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210721

26N No opposition filed

Effective date: 20220422

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210721

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210721

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20220630

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220613

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220630

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220613

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220630

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220630

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO

Effective date: 20120613

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210721

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210721

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210721

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20240502

Year of fee payment: 13

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20240502

Year of fee payment: 13

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20240509

Year of fee payment: 13

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210721