WO2012164880A1 - 画像符号化方法、画像符号化装置、画像復号方法、画像復号装置、および、画像符号化復号装置 - Google Patents
画像符号化方法、画像符号化装置、画像復号方法、画像復号装置、および、画像符号化復号装置 Download PDFInfo
- Publication number
- WO2012164880A1 WO2012164880A1 PCT/JP2012/003386 JP2012003386W WO2012164880A1 WO 2012164880 A1 WO2012164880 A1 WO 2012164880A1 JP 2012003386 W JP2012003386 W JP 2012003386W WO 2012164880 A1 WO2012164880 A1 WO 2012164880A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- merge
- block
- candidate
- unit
- merge candidate
- Prior art date
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/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
- H04N19/136—Incoming video signal characteristics or properties
- H04N19/137—Motion inside a coding unit, e.g. average field, frame or block difference
- H04N19/139—Analysis of motion vectors, e.g. their magnitude, direction, variance or reliability
-
- 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
-
- 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/105—Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for 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/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
-
- 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/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
- H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
- H04N19/51—Motion estimation or motion compensation
-
- 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/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
- H04N19/51—Motion estimation or motion compensation
- H04N19/513—Processing of motion vectors
- H04N19/517—Processing of motion vectors by encoding
- H04N19/52—Processing of motion vectors by encoding by predictive encoding
-
- 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/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
- H04N19/51—Motion estimation or motion compensation
- H04N19/577—Motion compensation with bidirectional frame interpolation, i.e. using B-pictures
-
- 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/70—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by syntax aspects related to video coding, e.g. related to compression standards
-
- 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/184—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 bits, e.g. of the compressed video stream
-
- 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/189—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding
- H04N19/196—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding being specially adapted for the computation of encoding parameters, e.g. by averaging previously computed encoding parameters
- H04N19/197—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding being specially adapted for the computation of encoding parameters, e.g. by averaging previously computed encoding parameters including determination of the initial value of an encoding parameter
Definitions
- the present invention relates to an image coding method and an image decoding method.
- inter prediction inter picture prediction
- an object of the present invention is to provide an image coding method and an image decoding method capable of improving coding efficiency in image coding and decoding using inter prediction.
- An image coding method is an image coding method for generating a bitstream by coding an image block by block, and a block spatially or temporally adjacent to a block to be coded
- First merging candidate merging candidates as candidates for the prediction direction, motion vector and reference picture index used for encoding the current block based on the prediction direction, motion vector and reference picture index used for coding
- a first derivation step of deriving as a candidate, a second derivation step of deriving as a second merge candidate a merge candidate having a predetermined vector as a motion vector, and the first merge candidate and the second merge candidate derived Select a merge candidate used to encode the target block to be encoded. Includes-up, and an encoding step of adding an index for identifying the merge candidate selected in the bit stream.
- FIG. 1A is a diagram for describing an example of a reference picture list in a B picture.
- FIG. 1B is a diagram showing an example of a reference picture list of prediction direction 0 in the B picture.
- FIG. 1C is a diagram showing an example of a reference picture list of prediction direction 1 in a B picture.
- FIG. 2 is a diagram for explaining a motion vector in the temporal prediction motion vector mode.
- FIG. 3 is a diagram showing an example of motion vectors of adjacent blocks used in the merge mode.
- FIG. 4 is a diagram for explaining an example of the merge block candidate list.
- FIG. 5 is a diagram showing the relationship between the merging block candidate size and the bit string assigned to the merging block index.
- FIG. 6 is a flowchart showing an example of encoding processing in the case of using the merge mode.
- FIG. 7 is a flowchart showing decoding processing in the case of using the merge mode.
- FIG. 8 is a diagram showing a syntax when attaching a merge block index to a bitstream.
- FIG. 9 is a block diagram showing the configuration of the image coding apparatus according to Embodiment 1.
- FIG. 10 is a flowchart showing the processing operation of the image coding apparatus according to Embodiment 1.
- FIG. 11 is a diagram showing an example of the merging block candidate list in the first embodiment.
- FIG. 12 is a flowchart of a process of calculating merging block candidates and merging block candidate list sizes according to the first embodiment.
- FIG. 13 is a flowchart showing a process of determining whether or not a merge block candidate is a mergeable candidate in the first embodiment, and updating the number of mergeable candidates.
- FIG. 14 is a flowchart of the process of adding a zero merge block candidate according to the first embodiment.
- FIG. 15 is a flowchart showing determination processing as to whether or not there is a zero merge block candidate in the first embodiment.
- FIG. 16 is a diagram showing an example of the zero merge block in the first embodiment.
- FIG. 17 is a flowchart showing processing relating to selection of a merge block candidate according to the first embodiment.
- FIG. 18 is a block diagram showing a configuration of an image coding apparatus according to Embodiment 2.
- FIG. 19 is a flowchart showing the processing operation of the image coding apparatus according to Embodiment 2.
- FIG. 20 is a block diagram showing a configuration of an image decoding apparatus according to Embodiment 3.
- FIG. 21 is a flowchart showing the processing operation of the image decoding apparatus according to Embodiment 3.
- FIG. 22 is a block diagram showing a configuration of an image decoding apparatus according to Embodiment 4.
- FIG. 23 is a flowchart showing the processing operation of the image decoding apparatus according to the fourth embodiment.
- FIG. 24 is a block diagram showing the configuration of the image coding apparatus according to the fifth embodiment.
- FIG. 25 is a flowchart showing the processing operation of the image coding apparatus according to the fifth embodiment.
- FIG. 20 is a block diagram showing a configuration of an image decoding apparatus according to Embodiment 3.
- FIG. 21 is a flowchart showing the processing operation of the image decoding apparatus according to Embodiment 3.
- FIG. 22 is a block diagram showing
- FIG. 26 is a diagram showing an example of the merge block candidate list in the fifth embodiment.
- FIG. 27 is a flowchart of a process of calculating merging block candidates and merging block candidate list sizes according to the fifth embodiment.
- FIG. 28 is a flowchart of the process of updating the number of mergeable candidates according to the fifth embodiment.
- FIG. 29 is a flowchart showing a process of adding a new candidate in the fifth embodiment.
- FIG. 30 is a block diagram showing a configuration of an image coding apparatus according to Embodiment 6.
- FIG. 31 is a flowchart showing the processing operation of the image coding apparatus according to Embodiment 6.
- FIG. 32 is a block diagram showing a configuration of an image decoding apparatus according to Embodiment 7.
- FIG. 33 is a flowchart showing the processing operation of the image decoding apparatus according to the seventh embodiment.
- FIG. 34 is a flowchart showing setting processing of a merge block candidate list size according to the seventh embodiment.
- FIG. 35 is a flowchart of a process of calculating merge block candidates according to the seventh embodiment.
- FIG. 36 is a diagram illustrating an example of syntax when adding a merge block index to a bitstream.
- FIG. 37 is a diagram showing an example of syntax in the case where the merging block candidate list size is fixed to the maximum value of the number of merging block candidates.
- FIG. 38 is a block diagram showing a configuration of an image decoding apparatus according to Embodiment 8.
- FIG. 39 is a flowchart showing the processing operation of the image decoding apparatus according to the eighth embodiment.
- FIG. 39 is a flowchart showing the processing operation of the image decoding apparatus according to the eighth embodiment.
- FIG. 40 is an overall configuration diagram of a content supply system for realizing content distribution service.
- FIG. 41 is an overall configuration diagram of a digital broadcasting system.
- FIG. 42 is a block diagram showing a configuration example of a television.
- FIG. 43 is a block diagram showing a configuration example of an information reproducing / recording unit for reading and writing information on a recording medium which is an optical disk.
- FIG. 44 is a view showing an example of the structure of a recording medium which is an optical disc.
- FIG. 45A is a diagram illustrating an example of a mobile phone.
- FIG. 45B is a block diagram showing a configuration example of a mobile phone.
- FIG. 46 shows a structure of multiplexed data.
- FIG. 47 is a diagram schematically showing how each stream is multiplexed in multiplexed data.
- FIG. 48 is a diagram showing in further detail how a video stream is stored in a PES packet sequence.
- FIG. 49 shows the structure of TS packets and source packets in multiplexed data.
- FIG. 50 shows the data structure of the PMT.
- FIG. 51 shows an internal structure of multiplexed data information.
- FIG. 52 shows an internal structure of stream attribute information.
- FIG. 53 shows a step of identifying video data.
- FIG. 54 is a block diagram showing a configuration example of an integrated circuit for implementing the moving picture coding method and the moving picture decoding method according to each of the embodiments.
- FIG. 55 shows a configuration for switching the drive frequency.
- FIG. 56 is a diagram showing the steps of identifying video data and switching the drive frequency.
- FIG. 49 shows the structure of TS packets and source packets in multiplexed data.
- FIG. 50 shows the data structure of the PMT.
- FIG. 51 shows an internal structure of multiplexed data information.
- FIG. 52 shows an internal
- FIG. 57 is a diagram showing an example of a look-up table in which video data standards are associated with drive frequencies.
- FIG. 58A is a diagram illustrating an example of a configuration in which modules of the signal processing unit are shared.
- FIG. 58B is a diagram illustrating another example of the configuration for sharing the modules of the signal processing unit.
- I pictures are not encoded by the inter prediction encoding process. That is, the I picture is encoded by intra-picture prediction (hereinafter referred to as "intra prediction") encoding processing.
- the P picture is inter-prediction coded with reference to one already coded picture preceding or following the picture to be coded in display time order.
- the B picture is inter-prediction encoded with reference to two already encoded pictures preceding or following the picture to be encoded in display time order.
- the reference picture list is a list in which a reference picture index is assigned to a coded reference picture to be referred to in inter prediction. For example, in the B picture, since coding can be performed with reference to two pictures, two reference picture lists (L0, L1) are generated.
- FIG. 1A is a diagram for describing an example of a reference picture list in a B picture.
- FIG. 1B shows an example of reference picture list 0 (L0) in prediction direction 0 in bidirectional prediction.
- the value 0 of the reference picture index 0 is assigned to the reference picture 0 of display order 2.
- the value 1 of the reference picture index 0 is assigned to the reference picture 1 of display order 1.
- the reference picture 2 of the display order 0 is assigned to the value 2 of the reference picture index 0. That is, a reference picture index having a smaller value is assigned to a reference picture closer in time to the current picture in display order.
- FIG. 1C shows an example of reference picture list 1 (L1) in prediction direction 1 in bidirectional prediction.
- the value 0 of the reference picture index 1 is assigned to the reference picture 1 of display order 1.
- the value 1 of the reference picture index 1 is assigned to the reference picture 0 in the display order 2.
- the value 2 of the reference picture index 2 is assigned to the reference picture 2 of display order 0.
- a motion vector detection mode is used as a coding mode for inter prediction of each block to be coded in a B picture.
- the motion vector detection mode the difference value between the predicted image data and the image data of the encoding target block and the motion vector used for generating the predicted image data are encoded.
- bi-directional prediction and uni-directional prediction can be selected as the prediction direction.
- bi-directional prediction a predicted image is generated with reference to two already coded pictures in front of or behind the current picture to be coded.
- one-way prediction a predicted image is generated with reference to one previously encoded one of the forward and backward pictures.
- FIG. 2 is a diagram for explaining a motion vector in the temporal prediction motion vector mode. Specifically, FIG. 2 shows the case where the block a of the picture B2 is encoded in the temporal prediction motion vector mode.
- the motion vector vb used for encoding the block b (hereinafter referred to as “co-located block”) in the same position as the block a in the picture P3 that is the reference picture behind the picture B2 is It's being used.
- the motion vector vb is a motion vector used when the block b is encoded with reference to the picture P1.
- two reference blocks for the block a are obtained from the picture P1 which is the forward reference picture and the picture P3 which is the backward reference picture. Then, block a is encoded by performing bi-directional prediction based on the two acquired reference blocks. That is, the motion vector used when encoding the block a is the motion vector va1 for the picture P1 and the motion vector va2 for the picture P3.
- merge mode is examined as an inter prediction mode of each encoding object block in B picture or P picture (nonpatent literature 2).
- the encoding target block is encoded by copying the prediction direction, the motion vector, and the reference picture index used for encoding the neighboring block of the encoding target block.
- the index of the adjacent block used for the copying is attached to the bit stream. This enables the decoding side to select the motion direction, motion vector, and reference picture index used for encoding. A specific example will be described with reference to FIG.
- FIG. 3 is a diagram showing an example of motion vectors of adjacent blocks used in the merge mode.
- the adjacent block A is a left adjacent encoded block to be encoded.
- the adjacent block B is an upper adjacent encoded block of the current block.
- the adjacent block C is an encoded block adjacent to the upper right of the current block.
- the adjacent block D is a coded block adjacent to the lower left of the current block to be coded.
- the adjacent block A is a block encoded by unidirectional prediction in the prediction direction 0.
- the adjacent block A has a motion vector MvL0_A in the prediction direction 0 as a motion vector for the reference picture indicated by the reference picture index RefL0_A in the prediction direction 0.
- MvL0 indicates a motion vector that refers to the reference picture specified by the reference picture list 0 (L0).
- MvL1 indicates a motion vector that refers to the reference picture specified by the reference picture list 1 (L1).
- the adjacent block B is a block encoded by unidirectional prediction in the prediction direction 1.
- the adjacent block B has a motion vector MvL1_B in the prediction direction 1 as a motion vector for the reference picture indicated by the reference picture index RefL1_B in the prediction direction 1.
- the adjacent block C is a block encoded by intra prediction.
- the adjacent block D is a block encoded by unidirectional prediction in the prediction direction 0.
- the adjacent block D has a motion vector MvL0_D in the prediction direction 0 as a motion vector for the reference picture indicated by the reference picture index RefL0_D in the prediction direction 0.
- prediction directions of adjacent blocks A to D for example, prediction directions of adjacent blocks A to D, motion vectors and reference picture indexes, and prediction directions according to temporal prediction motion vector mode determined using co-located blocks, motion vectors and reference picture indexes Among them, the one with the highest coding efficiency is selected as the prediction direction of the coding target block, the motion vector, and the reference picture index. Then, a merge block index representing a block of the selected prediction direction, motion vector and reference picture index is attached to the bitstream.
- the current block is encoded using the motion vector MvL0_A in the prediction direction 0 and the reference picture index RefL0_A. Then, only the value 0 of the merge block index indicating that the adjacent block A as shown in FIG. 4 is used is attached to the bitstream. Thereby, the information amount of a prediction direction, a motion vector, and a reference picture index can be reduced.
- non-mergeable candidate a candidate that can not be used for encoding
- uplicate candidates a combination of a prediction direction, a motion vector, and a reference picture index Candidates that match each other
- the merging block candidate is (1) a block encoded by intra prediction, (2) a slice including the block to be encoded or a block outside the picture boundary. It indicates that there is a certain or (3) a block which has not been encoded yet.
- the adjacent block C is encoded by intra prediction. Therefore, the merge block candidate of merge block index 3 is a non-merge candidate and is deleted from the merge block candidate list. Also, in the adjacent block D, the prediction direction, the motion vector, and the reference picture index match the adjacent block A. Therefore, the merge block candidate of the merge block index 4 is deleted from the merge block candidate list. As a result, finally, the number of merging block candidates becomes 3, and the list size of the merging block candidate list is set to 3.
- a merge block index is assigned a bit string and is variable-length encoded.
- the code amount is reduced by changing the bit string allocated to the merge mode index according to the size of the merge block candidate list size.
- FIG. 6 is a flowchart showing an example of encoding processing in the case of using the merge mode.
- step S1001 a motion vector of a merge block candidate, a reference picture index, and a prediction direction are obtained from the adjacent block and the co-located block.
- step S1002 the duplication candidate and the non-mergable candidate are deleted from the merging block candidate.
- step S1003 the number of merging block candidates after the deletion process is set to the merging block candidate list size.
- a merge block index used to encode the current block is determined.
- the determined merge block index is variable-length encoded using the bit string determined by the merge block candidate list size.
- FIG. 7 is a flowchart showing an example of the decoding process when using the merge mode.
- step S2001 a motion vector of a merge block candidate, a reference picture index, and a prediction direction are obtained from the adjacent block and the co-located block.
- step S2002 duplicate candidates and non-mergable candidates are deleted from the merge block candidates.
- step S2003 the number of merging block candidates after the deletion process is set to the merging block candidate list size.
- the merging block candidate list size is used to decode the merging block index used to decode the decoding target block from the bitstream.
- step S2005 a predicted image is generated using a merge block candidate indicated by the decoded merge block index, and a decoding process is performed.
- FIG. 8 shows a syntax when adding a merge block index to a bitstream.
- merge_idx represents a merge block index.
- merge_flag represents a merge flag.
- NumMergeCand represents a merge block candidate list size. In this NumMergeCand, the number of merging block candidates after deletion of the non-merging candidate and the overlapping candidate from the merging block candidates is set.
- the image is encoded or decoded using the merge mode.
- a motion vector at the time of encoding the current block is calculated from merge block candidates adjacent to the current block. Therefore, for example, when the adjacent block is a moving object region and the encoding target block is a still region, the motion vector that can be used in the merge mode is affected by the moving object region, so the prediction accuracy of the merge mode is In some cases, the coding efficiency may decrease.
- an image coding method is an image coding method for generating a bitstream by coding an image block by block, and spatially or temporally adjacent to a block to be coded
- merge candidates which are candidates for the prediction direction, motion vector, and reference picture index used for coding the target block
- a merge candidate having a predetermined vector as a motion vector can be derived as a second merge candidate. Therefore, for example, a merge candidate having a motion vector or the like for a stationary area can be derived as a second merge candidate. That is, the encoding target block having the predetermined motion can be efficiently encoded, and the encoding efficiency can be improved.
- the second merge candidate may be derived for each reference picture that can be referred to.
- the predetermined vector may be a zero vector.
- the predetermined vector is a zero vector, it becomes possible to derive a merge candidate having a motion vector for a still area. Therefore, when the block to be coded is a still area, it is possible to improve the coding efficiency.
- the image coding method further includes a determination step of determining the maximum number of merge candidates, and a determination step of determining whether the number of the first merge candidates derived is smaller than the maximum number.
- the second derivation step may derive the second merge candidate when it is determined that the number of the first merge candidates is smaller than the maximum number.
- the second merge candidate when it is determined that the first merge candidate is smaller than the maximum number, the second merge candidate can be derived. Therefore, the number of merge candidates can be increased without exceeding the maximum number, and encoding efficiency can be improved.
- the index may be encoded using the determined maximum number, and the encoded index may be added to the bitstream.
- the index can be encoded without depending on the number of merge candidates actually derived. Therefore, even when information necessary for deriving a merge candidate (for example, information such as a co-located block) is lost, the decoding side can decode the index, and error resistance can be improved. Also, on the decoding side, the index can be decoded independently of the number of merge candidates that are actually derived. That is, on the decoding side, the index decoding process can be performed without waiting for the merge candidate derivation process. That is, it is possible to generate a bit stream capable of performing the merge candidate derivation process and the index decryption process in parallel.
- information indicating the determined maximum number may be added to the bitstream.
- the maximum number can be added to the bitstream. Therefore, the maximum number can be switched in an appropriate unit, and encoding efficiency can be improved.
- a merge candidate in which a combination of a prediction direction, a motion vector, and a reference picture index does not overlap with the already derived first merge candidate may be derived as the first merge candidate.
- the image coding method may further include a switching step of switching the coding process to a first coding process conforming to a first standard or a second coding process conforming to a second standard. Adding an identification information indicating the first standard or the second standard to which the encoding process conforms to the bit stream, and the encoding process is switched to the first encoding process.
- the first derivation step, the second derivation step, the selection step, and the encoding step may be performed as the first encoding process.
- an image decoding method is an image decoding method for decoding a coded image included in a bitstream for each block, and is for decoding a block spatially or temporally adjacent to a decoding target block
- the merge candidate which is a candidate for the prediction direction, the motion vector, and the reference picture index used for decoding the decoding target block, as the first merge candidate, based on the prediction direction, the motion vector, and the reference picture index used in
- di candidate and the second merging candidates and a selection step of selecting a merge candidate for use in decoding of the decoding target block.
- a merge candidate having a predetermined vector as a motion vector can be derived as a second merge candidate. Therefore, for example, a merge candidate having a motion vector or the like for a stationary area can be derived as a second merge candidate. That is, a block having a predetermined motion can efficiently decode a coded bitstream, and a bitstream with improved coding efficiency can be decoded appropriately.
- the second merge candidate may be derived for each reference picture that can be referred to.
- the predetermined vector may be a zero vector.
- the predetermined vector is a zero vector, it becomes possible to derive a merge candidate having a motion vector for a still area. Therefore, it is possible to appropriately decode a bitstream with improved coding efficiency.
- the image decoding method further includes a determination step of determining a maximum number of merge candidates, and a determination step of determining whether the number of the first merge candidates derived is smaller than the maximum number.
- the second merge candidate may be derived when it is determined that the derived number of first merge candidates is smaller than the maximum number.
- the second merge candidates can be derived. Therefore, the number of merge candidates can be increased without exceeding the maximum number, and it becomes possible to appropriately decode a bitstream with improved coding efficiency.
- the index may be acquired by decoding the encoded index added to the bitstream using the determined maximum number.
- the index decoding process can be performed without waiting for the merge candidate derivation process, and the merge candidate derivation process and the index decoding process can be performed in parallel.
- the maximum number may be determined based on information indicating the maximum number added to the bit stream.
- the maximum number can be determined based on the information added to the bit stream. Therefore, it becomes possible to switch the maximum number in an appropriate unit and decode the encoded image.
- a merge candidate in which a combination of a prediction direction, a motion vector, and a reference picture index does not overlap with the already derived first merge candidate may be derived as the first merge candidate.
- the image decoding method further includes, according to identification information indicating a first standard or a second standard added to the bit stream, a first decoding process conforming to the first standard, or the second standard.
- the conforming second decoding process includes a switching step of switching the decoding process, and when the decoding process is switched to the first decoding process, the first derivation step and the second derivation process as the first decoding process.
- a step, the acquisition step, and the selection step may be performed.
- FIG. 9 is a block diagram showing the configuration of the image coding apparatus according to Embodiment 1.
- the image coding apparatus 100 generates a bit stream by coding an image block by block.
- the image coding apparatus 100 includes a subtraction unit 101, an orthogonal transformation unit 102, a quantization unit 103, an inverse quantization unit 104, an inverse orthogonal transformation unit 105, and an addition unit 106.
- the subtraction unit 101 generates prediction error data by subtracting prediction image data from input image data included in an input image sequence for each block.
- the orthogonal transformation unit 102 transforms the generated prediction error data from the image domain to the frequency domain.
- the quantization unit 103 performs quantization processing on the prediction error data converted into the frequency domain.
- the inverse quantization unit 104 performs inverse quantization processing on the prediction error data quantized by the quantization unit 103.
- the inverse orthogonal transform unit 105 transforms the frequency domain into the image domain for the prediction error data that has been subjected to the inverse quantization process.
- the adding unit 106 generates reconstructed image data by adding, for each block, predicted image data and prediction error data that has been inverse-quantized by the inverse orthogonal transformation unit 105.
- the block memory 107 stores reconstructed image data in block units.
- the frame memory 108 stores reconstructed image data in units of frames.
- the picture type determination unit 112 determines which picture type of I picture, B picture, and P picture to encode the input image data. Then, the picture type determination unit 112 generates picture type information indicating the determined picture type.
- the intra prediction unit 109 generates intra prediction image data of a block to be encoded by performing intra prediction using reconstructed image data in units of blocks stored in the block memory 107.
- the inter prediction unit 110 performs inter prediction by using reconstructed image data in units of frames stored in the frame memory 108 and a motion vector derived by motion detection or the like to obtain an inter predicted image of a target block to be encoded. Generate data.
- the switch 113 outputs the intra prediction image data generated by the intra prediction unit 109 to the subtraction unit 101 and the addition unit 106 as prediction image data of the encoding target block when the encoding target block is intra prediction encoded. Do. On the other hand, when the encoding target block is inter-prediction encoded, the switch 113 uses the sub prediction unit 101 and the adding unit 106 as inter prediction image data generated by the inter prediction unit 110 as prediction image data of the encoding target block. Output to
- the merge block candidate calculation unit 114 merges in merge mode using a motion vector of an adjacent block to be encoded and the motion vector of a co-located block (colPic information) stored in the colPic memory 115. Deriving block candidates. Furthermore, the merge block candidate calculation unit 114 adds the derived merge block candidate to the merge block candidate list.
- the merge block candidate calculation unit 114 derives a merge block candidate (hereinafter, referred to as “zero merge block candidate”) having a prediction direction for a still area, a motion vector, and a reference picture index as a new candidate by a method described later. Do. Then, the merging block candidate calculation unit 114 adds the derived zero merging block candidate as a new merging block candidate to the merging block candidate list. Furthermore, the merging block candidate calculation unit 114 calculates the number of merging block candidates.
- zero merge block candidate a merge block candidate having a prediction direction for a still area, a motion vector, and a reference picture index as a new candidate by a method described later. Do. Then, the merging block candidate calculation unit 114 adds the derived zero merging block candidate as a new merging block candidate to the merging block candidate list. Furthermore, the merging block candidate calculation unit 114 calculates the number of merging block candidates.
- the merge block candidate calculation unit 114 assigns a value of a merge block index to each of the derived merge block candidates. Then, the merge block candidate calculation unit 114 transmits the merge block candidate and the merge block index to the inter prediction control unit 111. Further, the merge block candidate calculation unit 114 transmits the calculated number of merge block candidates to the variable-length coding unit 116.
- the inter prediction control unit 111 is the smallest of the prediction mode using a motion vector derived by motion detection (motion detection mode) and the prediction mode using a motion vector derived from a merge block candidate (merge mode). Select a prediction mode that gives an error. Also, the inter prediction control unit 111 transmits, to the variable-length coding unit 116, a merge flag indicating whether the prediction mode is the merge mode. Further, when the merge mode is selected as the prediction mode, the inter prediction control unit 111 transmits, to the variable-length coding unit 116, a merge block index corresponding to the determined merge block candidate. Furthermore, the inter prediction control unit 111 transfers, to the colPic memory 115, colPic information including the motion vector of the current block and the like.
- the variable-length coding unit 116 generates a bitstream by performing variable-length coding processing on the quantized prediction error data, the merge flag, and the picture type information. Also, the variable-length coding unit 116 sets the number of merging block candidates as the merging block candidate list size. Then, the variable-length coding unit 116 assigns a bit string according to the merge block candidate list size to the merge block index used for coding, and performs variable-length coding on the assigned bit string.
- FIG. 10 is a flowchart showing the processing operation of the image coding apparatus 100 according to the first embodiment.
- step S101 the merging block candidate calculation unit 114 derives merging block candidates from the adjacent block and the co-located block of the current block. Further, the merge block candidate calculation unit 114 calculates the merge block candidate list size by a method described later.
- the merging block candidate calculation unit 114 selects adjacent blocks A to D as merging block candidates. Furthermore, the merge block candidate calculation unit 114 calculates a co-located merge block having a motion vector, a reference picture index, and a prediction direction calculated from the motion vector of the co-located block according to the temporal prediction mode as a merge block candidate.
- the merge block candidate calculation unit 114 assigns a merge block index to each merge block candidate as shown in (a) of FIG. Then, the merge block candidate calculation unit 114 performs the deletion of the non-mergable candidates and the overlap candidates and the addition of the new zero merge block candidate by a method described later, whereby the merge block candidate list as illustrated in FIG. And calculate the merge block candidate list size.
- the merge block index is assigned a shorter code as the value is smaller. That is, when the value of the merge block index is small, the amount of information required for the merge block index decreases.
- the merge block candidate calculation unit 114 may measure, for example, the number of times of being selected as a merge block for each merge block candidate, and may allocate a merge block index having a small value to a block having a large number of times. Specifically, it is conceivable to identify the selected merge block in the adjacent block, and to reduce the value of the merge block index for the identified merge block when encoding the target block.
- the merge block candidate does not have information such as a motion vector (if it is a block encoded by intra prediction, if it is a block located outside the boundary of a picture or slice, etc., or it is still encoded). If it is not a block, etc.), it can not be used for coding.
- merging block candidates that can not be used for encoding are called non-merging candidates.
- merge block candidates that can be used for encoding are called mergeable candidates.
- a candidate in which all other merge block candidates, a motion vector, a reference picture index, and a prediction direction all match is referred to as a duplication candidate.
- the adjacent block C is a block encoded by intra prediction, it is a non-mergable candidate.
- the adjacent block D is a duplicate candidate because all of the adjacent block A, motion vector, reference picture index, and prediction direction match.
- step S102 the inter prediction control unit 111 performs prediction error of the predicted image generated using the motion vector derived by motion detection and prediction error of the predicted image generated using the motion vector obtained from the merge block candidate. And the prediction mode are selected by the method described later. Here, if the selected prediction mode is the merge mode, the inter prediction control unit 111 sets the merge flag to 1, and otherwise sets the merge flag to 0.
- step S103 it is determined whether the merge flag is 1 (that is, whether the prediction mode is the merge mode).
- variable-length coding unit 116 adds a merge flag to the bit stream in step S104. Furthermore, in step S105, the variable-length coding unit 116 allocates a bit string according to the merge block candidate list size as shown in FIG. 5 to the merge block index of the merge block candidate used for encoding. Then, the variable-length coding unit 116 performs variable-length coding on the allocated bit sequence.
- step S106 the variable-length coding unit 116 adds the merge flag and the information on the motion detection vector mode to the bit stream.
- “0” is assigned as the value of the merge block index corresponding to the adjacent block A. Further, “1” is assigned as the value of the merge block index corresponding to the adjacent block B. Also, “2” is assigned as the value of the merge block index corresponding to the co-located merge block. Also, “3” is assigned as the value of the merge block index corresponding to the adjacent block C. Further, “4” is assigned as the value of the merge block index corresponding to the adjacent block D.
- variable-length coding unit 116 assigns a small value to the original merge block candidate and sets a large value to the new zero merge block candidate. You may assign a value. That is, the variable-length coding unit 116 may assign a merge block index of a small value in preference to the original merge block candidate.
- merge block candidates are not necessarily limited to the positions of adjacent blocks A to D.
- an adjacent block or the like located above the lower left adjacent block D may be used as a merge block candidate.
- not all adjacent blocks need to be used as merge block candidates.
- only adjacent blocks A and B may be used as merge block candidates.
- variable-length coding unit 116 adds the merge block index to the bit stream in step S105 in FIG. 10, but it is not necessary to add the merge block index to the bit stream. For example, when the merging block candidate list size is “1”, the variable-length coding unit 116 may not add the merging block index to the bitstream. This can reduce the amount of information of the merge block index.
- FIG. 12 is a flowchart showing the detailed process of step S101 of FIG. Specifically, FIG. 12 shows a method of calculating merging block candidates and merging block candidate list sizes. Hereinafter, FIG. 12 will be described.
- step S111 the merging block candidate calculation unit 114 determines whether or not the merging block candidate [N] is a mergeable candidate by a method described later.
- N is an index value for representing each merge block candidate.
- N takes a value from 0 to 4.
- the adjacent block A in FIG. 3 is allocated to the merge block candidate [0].
- the adjacent block B in FIG. 3 is allocated to the merge block candidate [1].
- a co-located merge block is allocated to the merge block candidate [2].
- the adjacent block C in FIG. 3 is allocated to the merge block candidate [3].
- the adjacent block D in FIG. 3 is allocated to the merge block candidate [4].
- step S112 the merging block candidate calculation unit 114 acquires the motion vector of the merging block candidate [N], the reference picture index, and the prediction direction, and adds the motion vector to the merging block candidate list.
- step S113 the merging block candidate calculation unit 114 searches the merging block candidate list for non-mergable candidates and duplication candidates, and deletes the candidates.
- step S114 the merging block candidate calculation unit 114 adds the new zero merging block candidate to the merging block candidate list by a method described later.
- the value of the merge block index may be reassigned so that a merge block index of a small value is allocated in preference to an existing merge block candidate. That is, the merge block candidate calculation unit 114 may reassign the value of the merge block index such that a merge block index having a large value is assigned to the new zero merge block candidate. Thereby, the code amount of the merge block index can be reduced.
- step S115 the merging block candidate calculation unit 114 sets the number of merging block candidates after the addition of the zero merging block as the merging block candidate list size.
- the number of merging block candidates is calculated as “5” by the method described later, and “5” is set as the merging block candidate list size.
- the new zero merge block candidate in step S114 is a candidate to be newly added to the merge block candidate when the number of merge block candidates has not reached the maximum number of merge block candidates by a method described later.
- the image coding apparatus 100 can improve the coding efficiency by adding new zero merging block candidates.
- FIG. 13 is a flowchart showing the detailed process of step S111 of FIG. Specifically, FIG. 13 illustrates a method of determining whether the merge block candidate [N] is a mergeable candidate and updating the number of mergeable candidates. Hereinafter, FIG. 13 will be described.
- step S121 the merging block candidate calculation unit 114 positions the merging block candidate [N] outside a slice or picture boundary including (1) a block encoded by intra prediction or (2) a coding target block. (3) It is determined whether it is a block which is not yet encoded.
- step S121 determines whether the merge block candidate [N] is a non-merge candidate in step S122.
- the merge block candidate calculation unit 114 sets the merge block candidate [N] as a mergeable candidate.
- FIG. 14 is a flowchart showing the detailed process of step S114 of FIG. Specifically, FIG. 14 shows a method of adding zero merge block candidates. Hereinafter, FIG. 14 will be described.
- step S131 the merging block candidate calculation unit 114 determines whether the number of merging block candidates is smaller than the maximum number of merging block candidates. That is, the merging block candidate calculation unit 114 determines whether the number of merging block candidates has reached the maximum number of merging block candidates.
- step S132 the merge block candidate calculation unit 114 has a new zero merge block candidate that can be added to the merge block candidate list as a merge block candidate. It is determined by the method described later.
- step S133 the merge block candidate calculation unit 114 assigns the value of the merge block index to the new zero merge block candidate, and adds the new block to the merge block candidate list. Add zero merge block candidates.
- step S134 the merging block candidate calculation unit 114 adds 1 to the number of merging block candidates.
- step S131 or step S132 determines whether the new zero merge block candidate addition process has reached the maximum number of merging block candidates, or if there is no new zero merging block candidate.
- FIG. 15 is a flowchart showing the detailed process of step S132 in FIG. Specifically, FIG. 15 shows a method of determining whether there is a zero merge block candidate. Hereinafter, FIG. 15 will be described.
- step S141 the merge block candidate calculation unit 114 updates the value of the reference picture index refIdxL0 in the prediction direction 0 used when generating the zero merge block candidate, and the value of the reference picture index refIdxL1 in the prediction direction 1.
- “ ⁇ 1” is set as an initial value.
- “+1” is added to the reference picture indexes refIdxL0 and refIdxL1 each time the process of step S141 is performed. That is, the merge block candidate calculation unit 114 first merges the zero merge block candidate having the motion vector (zero vector) of the value 0 and the reference picture index of the value 0 as the zero merge block candidate for the still area. Add to list Next, the merging block candidate calculation unit 114 adds a zero merging block candidate having a motion vector of value 0 and a reference picture index of value 1 to the merging block candidate list.
- step S142 the merging block candidate calculation unit 114 determines that the value of the updated reference picture index refIdxL0 in the prediction direction 0 is smaller than the maximum reference number of reference picture list 0 in the prediction direction 0, and refers to the updated prediction direction 1. It is determined whether the value of the picture index refIdxL1 is smaller than the maximum reference number of the reference picture list 1 in the prediction direction 1.
- step S143 the merge block candidate calculation unit 114 merges the motion vector (0, 0) and the reference picture index refIdxL0 of the value 0 into a zero merge block. Assign to the prediction direction 0 of. Further, in step S144, the merge block candidate calculation unit 114 assigns the motion vector (0, 0) and the reference picture index refIdxL1 of the value 0 to the prediction direction 1 of the zero merge block.
- the merge block candidate calculation unit 114 calculates a zero merge block of bi-directional prediction by the processes of step S143 and step S144.
- FIG. 16 shows an example of the calculated zero merge block.
- step S145 the merge block candidate calculation unit 114 determines whether a merge block candidate having the same motion vector, reference picture index, and prediction direction as the calculated zero merge block candidate already exists in the merge block candidate list. judge. That is, the merge block candidate calculation unit 114 determines whether the calculated zero merge block candidate is a duplication candidate.
- step S145 if the determination result in step S145 is false (No in S145), the merge block candidate calculation unit 114 sets the presence of the zero merge block candidate in step S146.
- step S142 determines whether there is no zero merge block candidate in step S147. judge.
- the merge block candidate calculation unit 114 calculates zero merge block candidates having a motion vector with a value 0 for each reference picture that can be referred to. Then, the merging block candidate calculation unit 114 newly adds the calculated zero merging block candidate to the merging block candidate list.
- the image coding apparatus 100 can improve the coding efficiency of the merge mode particularly when the coding target block is a still area.
- FIG. 17 is a flowchart showing the detailed process of step S102 of FIG. Specifically, FIG. 17 shows a process related to the selection of merge block candidates. Hereinafter, FIG. 17 will be described.
- step S151 the inter prediction control unit 111 sets 0 as the merge block candidate index, sets the prediction error (cost) of the motion vector detection mode as the minimum prediction error, and sets 0 as the merge flag.
- the cost is calculated, for example, by the following equation of the RD optimization model.
- D represents coding distortion.
- D the sum of absolute differences between a pixel value obtained by encoding and decoding an encoding target block using a predicted image generated with a certain motion vector and an original pixel value of the encoding target block is D.
- R represents the generated code amount.
- a code amount and the like necessary for encoding a motion vector used for generating a predicted image are used as R.
- ⁇ is Lagrange's undetermined multiplier.
- step S152 the inter prediction control unit 111 determines whether the value of the merging block candidate index is smaller than the number of merging block candidates of the current block. That is, the inter prediction control unit 111 determines whether there is a merge block candidate for which the processes of steps S153 to S155 described below have not yet been performed.
- step S152 the inter prediction control unit 111 calculates the cost of the merge block candidate to which the merge block candidate index is allocated. Then, in step S154, the inter prediction control unit 111 determines whether the calculated cost of the merge block candidate is smaller than the minimum prediction error.
- step S154 if the determination result in step S154 is true (Yes in S154), the inter prediction control unit 111 updates the values of the minimum prediction error, the merge block index, and the merge flag in step S155. On the other hand, if the determination result in step S154 is false (No in S154), the inter prediction control unit 111 does not update the values of the minimum prediction error, the merge block index, and the merge flag.
- step S156 the inter prediction control unit 111 adds 1 to the value of the merge block candidate index, and repeats steps S152 to S156.
- step S152 determines whether there are no unprocessed merge block candidates. If the determination result in step S152 is false (No in S152), that is, if there are no unprocessed merge block candidates, in step S157, the inter prediction control unit 111 finally sets the merge flag and Determine the merge block index value.
- a new merge block candidate having a motion vector for a still area and a reference picture index is added to the merge block candidate list as a merge block candidate.
- the image coding apparatus 100 calculates merge block candidates having a motion vector with a value 0 for each referenceable reference picture, and newly adds the calculated merge block candidates to the merge block candidate list. By doing this, it is possible to improve the coding efficiency of the merge mode, particularly when the coding target block is a static area.
- the merge block candidate calculation unit 114 may set a predetermined vector (eg, (0, 0, A merge block candidate having 1) or the like as a motion vector may be calculated as a new candidate instead of the zero merge block candidate.
- the variable-length coding unit 116 may add an offset parameter (OffsetX, OffsetY) or the like to the sequence, picture, or header of the slice.
- the merge block candidate calculation unit 114 may calculate a merge block candidate having a motion vector (OffsetX, OffsetY) as a new candidate.
- the merge flag is always added to the bit stream in the merge mode.
- the present invention is not limited to this.
- a merge mode is used in which the encoding target block is encoded by copying the prediction direction, the motion vector, and the reference picture index from the block adjacent to the encoding target block.
- the skip merge mode may be used.
- the skip merge mode using the merge block candidate list created as shown in (b) of FIG. 11, the prediction direction, the motion vector, and the reference picture index are copied from the adjacent block of the encoding target block as in the merge mode. Then, the encoding target block is encoded.
- the skip flag is set to 1 and the skip flag and the merge block index are added to the bitstream. If the prediction error data is not 0, the skip flag is set to 0, and the skip flag, merge flag, merge block index, and prediction error data are added to the bit stream.
- a merge mode is used in which the encoding target block is encoded by copying the prediction direction, the motion vector, and the reference picture index from the adjacent block of the encoding target block. It is not necessarily limited to this.
- motion vectors in the motion vector detection mode may be encoded using the merge block candidate list created as shown in (b) of FIG. That is, the motion vector of the merge block candidate specified by the merge block index is subtracted from the motion vector in the motion vector detection mode to obtain the difference. Then, the obtained difference and merge block index may be added to the bitstream.
- the motion vector MV_Merge of the merging block candidate is scaled using the reference picture index RefIdx_ME of the motion detection mode and the reference picture index RefIdx_Merge of the merging block candidate, and the scaling block candidate is the merged block candidate after scaling from the motion vector of the motion detection mode
- the difference may be determined by subtracting the motion vector scaledMV_Merge. Then, the obtained difference and merge block index may be added to the bitstream.
- An example of the scaling equation is shown below.
- POC (RefIdx_ME) indicates the display order of the reference picture indicated by the reference picture index RefIdx_ME.
- POC (RefIdx_Merge) indicates the display order of the reference picture indicated by the reference picture index RefIdx_Merge.
- curPOC indicates the display order of the picture to be encoded.
- a zero merge block candidate for bidirectional prediction is generated from a motion vector of value 0, a reference picture index of prediction direction 0, and a reference picture index of prediction direction 1; It is not limited to this.
- the merge block candidate calculation unit 114 may generate a zero merge block candidate of the prediction direction 0 using the motion vector of the value 0 and the reference picture index of the prediction direction 0, and add it to the merge block candidate list. Absent.
- the merge block candidate calculation unit 114 generates a zero merge block candidate of the prediction direction 1 using the motion vector of the value 0 and the reference picture index of the prediction direction 1, and adds it to the merge block candidate list. It does not matter.
- the merging block candidate calculation unit 114 may generate the zero merging block candidate in order from the reference picture index assigned to the reference picture closest to the coding target picture in display order.
- the merging block candidate calculation unit 114 determines whether or not the zero merging block candidate is a duplication candidate in step S145 of FIG. 15, but it is not necessary to determine in this way. For example, the determination in step S145 may be omitted. As a result, the image coding apparatus 100 can reduce the amount of processing for derivation of merge block candidates.
- the merging block candidate calculation unit 114 determines whether the number of merging block candidates is a threshold smaller than the maximum merging block candidate number and reaches a preset threshold. It does not matter. Thereby, the image coding apparatus 100 can reduce the amount of processing of merging block candidate list derivation.
- the addition of the zero merge block candidate is ended if the number of merge block candidates reaches the maximum number of merge block candidates, the present invention is not necessarily limited to this.
- the merging block candidate calculation unit 114 merges blocks until no new zero merging block candidate disappears, without determining whether the number of merging block candidates has reached the maximum merging block candidate number.
- the zero merge block candidate may be added to the candidate list. Thereby, the image coding apparatus 100 can expand the range of selection of merging block candidates, and can improve the coding efficiency.
- FIG. 18 is a block diagram showing a configuration of an image coding apparatus 200 according to Embodiment 2.
- the image coding apparatus 200 generates a bitstream by coding an image block by block.
- the image coding apparatus 200 includes a merge candidate derivation unit 210, a prediction control unit 220, and a coding unit 230.
- the merge candidate derivation unit 210 corresponds to the merge block candidate calculation unit 114 in the first embodiment.
- the merge candidate derivation unit 210 derives merge candidates. Then, the merge candidate derivation unit 210 generates, for example, a merge candidate list in which an index for identifying the merge candidate (hereinafter, referred to as a “merge index”) is associated with each derived merge candidate.
- a merge index an index for identifying the merge candidate
- the merge candidates are candidates for the prediction direction, motion vector, and reference picture index used for encoding the current block. That is, the merge candidate includes at least one set of prediction direction, motion vector, and reference picture index.
- the merge candidate corresponds to the merge block candidate of the first embodiment.
- the merge candidate list is the same as the merge block candidate list.
- the merge candidate derivation unit 210 includes a first derivation unit 211 and a second derivation unit 212.
- the first derivation unit 211 derives a first merge candidate based on the prediction direction, the motion vector, and the reference picture index used for coding a block spatially or temporally adjacent to the current block. Then, for example, the first derivation unit 211 associates the first merge candidate derived in this manner with the merge index and registers the first merge candidate in the merge candidate list.
- a spatially adjacent block is a block in a picture including a current block to be coded, and is a block adjacent to the current block to be coded.
- the spatially adjacent blocks are, for example, adjacent blocks A to D shown in FIG.
- the temporally adjacent block is a block included in a picture different from the picture including the current block and is a block corresponding to the current block.
- temporally adjacent blocks are, for example, co-located blocks.
- temporally adjacent block does not necessarily have to be a block (co-located block) at the same position as the coding target block.
- temporally adjacent blocks may be blocks adjacent to co-located blocks.
- the first derivation unit 211 may use, for example, a prediction direction, a motion vector, and a reference picture index used for coding a block other than the non-mergeable block among blocks spatially adjacent to the current block. 1 It may be derived as a merge candidate.
- a non-mergeable block is a block encoded by intra prediction, a block including a block to be coded, a block located outside the boundary of a picture or a picture, or a block not yet coded. Thereby, the first derivation unit 211 can derive the first merge candidate from the block suitable for obtaining the merge candidate.
- the second derivation unit 212 derives a merge candidate having a predetermined vector as a motion vector as a second merge candidate. Specifically, for example, the second derivation unit 212 derives the second merge candidate for each reference picture that can be referred to. As a result, the image coding apparatus 200 can increase the types of merge candidates, and can further improve the coding efficiency.
- the second derivation unit 212 does not necessarily have to derive the second merge candidate for each reference picture that can be referred to.
- the second derivation unit 212 may derive second merge candidates for a predetermined number of reference pictures.
- the predetermined vector may be, for example, a zero vector as in the first embodiment.
- the second derivation unit 212 can derive a merge candidate having a motion vector for a still area. Therefore, the image coding apparatus 200 can improve the coding efficiency when the coding target block is a still area.
- the predetermined vector does not have to be a zero vector.
- the second derivation unit 212 associates the second merge candidate derived in this manner with the merge index and registers the second merge candidate in the merge candidate list.
- the second derivation unit 212 registers the second merge candidate in the merge candidate list so that a merge index having a smaller value than the second merge candidate is allocated to the first merge candidate. You may Thereby, the image coding apparatus 200 can reduce the amount of codes when the first merge candidate is more likely to be selected as a merge candidate to be used for encoding than the second merge candidate, thereby improving the coding efficiency. It can be done.
- the prediction control unit 220 selects, from among the derived first merge candidate and second merge candidate, a merge candidate to be used for encoding the encoding target block. That is, the prediction control unit 220 selects a merge candidate to be used for encoding the current block from the merge candidate list.
- the encoding unit 230 adds an index (merge index) for identifying the selected merge candidate to the bitstream. For example, the encoding unit 230 encodes the merge index using the sum of the derived number of first merge candidates and the number of second merge candidates (number of merge candidates), and encodes the encoded merge index into a bitstream Add to
- FIG. 19 is a flowchart showing the processing operation of the image coding apparatus 200 according to Embodiment 2.
- the first derivation unit 211 derives a first merge candidate (S201). Subsequently, the second derivation unit 212 derives a second merge candidate (S202).
- the prediction control unit 220 selects a merge candidate to be used for encoding the coding target block from among the first merge candidate and the second merge candidate (S203). For example, as in the first embodiment, the prediction control unit 220 selects, from the merge candidate list, a merge candidate with the minimum cost shown in Expression 1.
- the encoding unit 230 adds an index for identifying the selected merge candidate to the bit stream (S204).
- a merge candidate having a predetermined vector as a motion vector can be derived as a second merge candidate. Therefore, the image coding apparatus 200 can derive, for example, a merge candidate having a motion vector for a still area or the like as a second merge candidate. That is, the image coding apparatus 200 can efficiently code the coding target block having a predetermined motion, and can improve coding efficiency.
- FIG. 20 is a block diagram showing a configuration of the image decoding apparatus 300 according to Embodiment 3.
- This image decoding apparatus 300 is an apparatus corresponding to the image coding apparatus 100 according to the first embodiment.
- the image decoding apparatus 300 decodes, for example, a coded image included in a bit stream generated by the image coding apparatus 100 according to the first embodiment for each block.
- the image decoding apparatus 300 includes a variable length decoding unit 301, an inverse quantization unit 302, an inverse orthogonal transformation unit 303, an addition unit 304, a block memory 305, a frame memory 306, and an intra A prediction unit 307, an inter prediction unit 308, an inter prediction control unit 309, a switch 310, a merge block candidate calculation unit 311, and a colPic memory 312 are provided.
- variable-length decoding unit 301 performs variable-length decoding processing on the input bit stream to generate picture type information, a merge flag, and a quantization coefficient. In addition, the variable-length decoding unit 301 performs variable-length decoding processing of the merging block index using the number of merging block candidates calculated by the merging block candidate calculation unit 311.
- the inverse quantization unit 302 performs inverse quantization processing on the quantization coefficient obtained by the variable length decoding processing.
- the inverse orthogonal transformation unit 303 generates prediction error data by transforming orthogonal transformation coefficients obtained by inverse quantization processing from the frequency domain to the image domain.
- the block memory 305 stores the decoded image data generated by adding the prediction error data and the predicted image data in block units.
- the frame memory 306 stores decoded image data in units of frames.
- the intra prediction unit 307 generates predicted image data of a block to be decoded by performing intra prediction using the decoded image data in units of blocks stored in the block memory 305.
- the inter prediction unit 308 generates predicted image data of a block to be decoded by performing inter prediction using decoded image data in units of frames stored in the frame memory 306.
- the switch 310 outputs the intra prediction image data generated by the intra prediction unit 307 to the addition unit 304 as prediction image data of the decoding target block when the decoding target block is subjected to intra prediction decoding.
- the switch 310 outputs the inter prediction image data generated by the inter prediction unit 308 to the adding unit 304 as prediction image data of the decoding target block.
- the merge block candidate calculation unit 311 derives a merge block candidate using motion vectors and the like of blocks adjacent to the decoding target block and motion vectors and the like (colPic information) of co-located blocks stored in the colPic memory 312. Do. Furthermore, the merging block candidate calculation unit 311 adds the derived merging block candidate to the merging block candidate list.
- the merge block candidate calculation unit 311 derives a merge block candidate having a motion vector for a still area and a reference picture index as a zero merge block candidate by a method described later. Then, the merging block candidate calculation unit 311 adds the derived zero merging block candidate as a new merging block candidate to the merging block candidate list. Furthermore, the merging block candidate calculation unit 311 calculates the number of merging block candidates.
- the merge block candidate calculation unit 311 assigns a value of a merge block index to each derived merge block candidate. Then, the merge block candidate calculation unit 311 transmits, to the inter prediction control unit 309, the merge block candidate to which the value of the merge block index is assigned. Also, the merge block candidate calculation unit 311 transmits the calculated number of merge block candidates to the variable length decoding unit 301.
- the inter prediction control unit 309 causes the inter prediction unit 308 to generate an inter prediction image using the information on the motion vector detection mode.
- the merge flag is “1”
- the inter prediction control unit 309 determines a motion vector, a reference picture index, and a prediction direction to be used for inter prediction from the plurality of merge block candidates based on the decoded merge block index. Do. Then, the inter prediction control unit 309 causes the inter prediction unit 308 to generate an inter prediction image using the determined motion vector, the reference picture index, and the prediction direction. Further, the inter prediction control unit 309 transfers colPic information including the motion vector of the decoding target block and the like to the colPic memory 312.
- the adding unit 304 generates decoded image data by adding the prediction image data and the prediction error data.
- FIG. 21 is a flowchart showing the processing operation of the image decoding apparatus 300 according to Embodiment 3.
- step S301 the variable-length decoding unit 301 decodes the merge flag.
- step S302 if the merge flag is "1" (Yes in S302), the merge block candidate calculation unit 311 generates merge block candidates in the same manner as in step S101 of FIG. 10 in step S303. Further, the merge block candidate calculation unit 311 calculates the number of merge block candidates as a merge block candidate list size.
- step S304 the variable-length decoding unit 301 performs variable-length decoding of the merge block index in the bitstream using the merge block candidate list size.
- the inter prediction control unit 309 causes the inter prediction unit 308 to generate an inter prediction image using the motion vector of the merge block candidate indicated by the decoded merge block index, the reference picture index, and the prediction direction.
- step S302 if the merge flag is "0" (No in S302), in step S306, the inter prediction unit 308 uses the information of the motion vector detection mode decoded by the variable-length decoding unit 301 to generate an inter predicted image. Generate
- the merging block index may be estimated to be “0” without being decoded.
- a new merging block candidate having a motion vector for a still area and a reference picture index can be added to the merging block candidate list as merging block candidates. it can.
- the image decoding apparatus 300 can appropriately decode a bitstream with improved coding efficiency. More specifically, merge target block having a motion vector with a value 0 is calculated for each referenceable reference picture, and the block to be encoded is a still region, in particular, by newly adding it to the merge block candidate list. In this case, it becomes possible to appropriately decode a bitstream with improved coding efficiency in merge mode.
- Embodiment 4 Although the image decoding apparatus according to the third embodiment includes the components as shown in FIG. 20, it is not necessary to include all the components.
- the image decoding apparatus according to the fourth embodiment will be specifically described below as a modification of the image decoding apparatus according to the third embodiment.
- FIG. 22 is a block diagram showing the configuration of an image decoding apparatus 400 according to Embodiment 4.
- This image decoding apparatus 400 is an apparatus corresponding to the image coding apparatus 200 according to the second embodiment.
- the image decoding apparatus 400 decodes, for example, a coded image included in a bit stream generated by the image coding apparatus 200 according to the second embodiment for each block.
- the image decoding apparatus 400 includes a merge candidate derivation unit 410, a decoding unit 420, and a prediction control unit 430.
- the merge candidate derivation unit 410 corresponds to the merge block candidate calculation unit 311 in the third embodiment.
- the merge candidate derivation unit 410 derives merge candidates. Then, the merge candidate derivation unit 410 generates, for example, a merge candidate list in which each derived merge candidate is associated with an index (merge index) for specifying the merge candidate.
- the merge candidate derivation unit 410 includes a first derivation unit 411 and a second derivation unit 412.
- the first derivation unit 411 derives the first merge candidate in the same manner as the first derivation unit 211 of the second embodiment. Specifically, the first derivation unit 411 derives the first merge candidate based on the prediction direction, the motion vector, and the reference picture index used for decoding the block spatially or temporally adjacent to the current block to be decoded . Then, the first derivation unit 411 registers, for example, the first merge candidate derived in this manner in the merge candidate list in association with the merge index.
- the second derivation unit 412 derives a merge candidate having a predetermined vector as a motion vector as a second merge candidate. Specifically, the second derivation unit 412 derives the second merge candidate in the same manner as the second derivation unit 212 of the second embodiment. Then, for example, the second derivation unit 412 associates the second merge candidate derived in this manner with the merge index and registers the second merge candidate in the merge candidate list.
- the second derivation unit 412 derives, for example, the second merge candidate for each reference picture that can be referred to.
- the types of merge candidates can be increased, and it becomes possible to appropriately decode a bitstream with improved coding efficiency.
- the predetermined vector may be, for example, a zero vector as in the first embodiment.
- the second derivation unit 412 can derive a merge candidate having a motion vector for a still area. Therefore, the image decoding apparatus 400 can appropriately decode the bit stream with improved coding efficiency.
- the decoding unit 420 obtains an index for specifying a merge candidate from the bit stream. For example, the decoding unit 420 decodes the encoded merge index added to the bit stream using the sum (the number of merge candidates) of the derived number of first merge candidates and the number of second merge candidates. Get the merge index by
- the prediction control unit 430 selects a merge candidate to be used for decoding the decoding target block from among the derived first merge candidate and second merge candidate based on the acquired index. That is, the prediction control unit 430 selects, from the merge candidate list, merge candidates to be used for decoding of the current block.
- FIG. 23 is a flowchart showing the processing operation of the image decoding apparatus 400 according to the fourth embodiment.
- the first derivation unit 411 derives a first merge candidate (S401). Subsequently, the second derivation unit 412 derives a second merge candidate (S402). Then, the decoding unit 420 obtains a merge index from the bit stream (S403).
- the prediction control unit 220 selects a merge candidate to be used for decoding the decoding target block from among the first merge candidate and the second merge candidate based on the acquired index (S404).
- a merge candidate having a predetermined vector as a motion vector can be derived as a second merge candidate. Therefore, the image decoding apparatus 400 can derive, for example, a merge candidate having a motion vector for a still area or the like as a second merge candidate. That is, the image decoding apparatus 400 can appropriately decode an image obtained by efficiently encoding a block having a predetermined motion, and appropriately decode a bitstream with improved encoding efficiency. It becomes possible.
- the fifth embodiment is different from the first embodiment in the method of deriving the merge block candidate list size.
- the derivation method of the merge block candidate list size in the present embodiment will be described in detail.
- the number of merging block candidates is set to the merging block candidate list size used when encoding or decoding the merging block index.
- the number of merging block candidates is obtained after deleting non-mergable candidates or duplication candidates using reference picture information including co-located blocks and the like.
- the image coding apparatus and the image decoding apparatus have a mismatch in the number of merge block candidates
- the image coding apparatus and the image decoding apparatus have a mismatch in the bit string assigned to the merge block index.
- the image decoding apparatus may not be able to decode the bitstream correctly.
- the motion vector or reference picture index of the co-located block becomes unknown. Therefore, information on merge block candidates generated from the co-located block is unknown. In such a case, it is not possible to correctly delete the unmergable candidate or the duplicate candidate from the merge block candidate at the time of decoding. As a result, the image decoding apparatus can not obtain the merge block candidate list size correctly, and can not decode the merge block index normally.
- the image coding apparatus calculates a merge block candidate list size used when coding or decoding a merge block index by a method not depending on reference picture information including co-located blocks and the like. . Therefore, the image coding apparatus can improve error tolerance.
- FIG. 24 is a block diagram showing a configuration of an image coding apparatus 500 according to Embodiment 5.
- the same components as in FIG. 9 will be assigned the same reference numerals and descriptions thereof will be omitted.
- the image coding apparatus 500 includes a subtractor unit 101, an orthogonal transform unit 102, a quantization unit 103, an inverse quantization unit 104, an inverse orthogonal transform unit 105, and a block memory 107.
- the merge block candidate calculation unit 514 merges in merge mode using a motion vector of an adjacent block to be encoded and a motion vector of a co-located block stored in the colPic memory 115 (colPic information). Deriving block candidates. Then, the merging block candidate calculation unit 514 calculates the number of mergeable candidates by a method described later.
- the merge block candidate calculation unit 514 assigns the value of the merge block index to the derived merge block candidate. Then, the merge block candidate calculation unit 514 transmits the merge block candidate and the merge block index to the inter prediction control unit 111. Further, the merge block candidate calculation unit 514 transmits the calculated number of mergeable candidates to the variable-length coding unit 116.
- the variable-length coding unit 516 generates a bit stream by performing variable-length coding processing on the quantized prediction error data, the merge flag, and the picture type information. In addition, the variable-length coding unit 516 sets the number of mergeable candidates as the merge block candidate list size. Then, the variable-length coding unit 516 performs variable-length coding by assigning a bit string according to the merging block candidate list size to the merging block index used for coding.
- FIG. 25 is a flowchart showing the processing operation of the image coding apparatus 500 according to the fifth embodiment.
- the same steps as in FIG. 10 will be assigned the same reference numerals and descriptions thereof will be omitted as appropriate.
- step S501 the merge block candidate calculation unit 514 derives merge block candidates from the adjacent block and the co-located block of the current block. Further, the merging block candidate calculation unit 514 calculates the merging block candidate list size by a method described later.
- the merging block candidate calculation unit 514 selects adjacent blocks A to D as merging block candidates. Furthermore, the merge block candidate calculation unit 514 calculates a co-located merge block including a motion vector or the like calculated in the temporal prediction mode from the motion vector of the co-located block as a merge block candidate.
- the merge block candidate calculation unit 514 assigns a merge block index to each merge block candidate as shown in (a) of FIG. Then, the merge block candidate calculation unit 514 performs the merge block candidate list as shown in (b) of FIG. Calculate merge block candidate list size.
- the merge block index is assigned a shorter code as the value is smaller. That is, when the value of the merge block index is small, the amount of information required for the merge block index decreases.
- the merge block candidate calculation unit 514 may measure, for example, the number of times of being selected as a merge block for each merge block candidate, and may allocate a merge block index with a small value to a block having a large number of times. Specifically, it is conceivable to identify the selected merge block in the adjacent block, and to reduce the value of the merge block index for the identified merge block when encoding the target block.
- the merge block candidate does not have information such as a motion vector (if it is a block encoded by intra prediction, if it is a block located outside the boundary of a picture or slice, etc., or it is still encoded). If the block is not included, the merge block candidate can not be used for encoding.
- merging block candidates that can not be used for encoding are called non-merging candidates.
- merge block candidates that can be used for encoding are called mergeable candidates.
- a candidate in which all other merge block candidates, a motion vector, a reference picture index, and a prediction direction all match is referred to as a duplication candidate.
- the adjacent block C is a block encoded by intra prediction, it is a non-mergable candidate.
- the adjacent block D is a duplicate candidate because all of the adjacent block A, motion vector, reference picture index, and prediction direction match.
- step S102 the inter prediction control unit 111 performs prediction error of the predicted image generated using the motion vector derived by motion detection and prediction error of the predicted image generated using the motion vector obtained from the merge block candidate. Compare with and select the prediction mode. Here, if the selected prediction mode is the merge mode, the inter prediction control unit 111 sets the merge flag to 1, and otherwise sets the merge flag to 0.
- step S103 it is determined whether the merge flag is 1 (that is, whether the prediction mode is the merge mode).
- variable-length coding unit 516 adds a merge flag to the bitstream in step S104. Further, in step S505, the variable-length coding unit 516 assigns a bit string according to the merge block candidate list size as shown in FIG. 5 to the merge block index of the merge block candidate used for encoding. Then, the variable-length coding unit 516 performs variable-length coding on the allocated bit sequence.
- step S106 the variable-length coding unit 516 adds information on the merge flag and the motion detection vector mode to the bit stream.
- the value of the merge block index is assigned “0” as the value of the merge block index corresponding to the adjacent block A. Further, “1” is assigned as the value of the merge block index corresponding to the adjacent block B. Also, “2” is assigned as the value of the merge block index corresponding to the co-located merge block. Also, “3” is assigned as the value of the merge block index corresponding to the adjacent block C. Further, “4” is assigned as the value of the merge block index corresponding to the adjacent block D.
- the way of assigning the value of the merge block index is not necessarily limited to this example.
- the original merge block Candidates may be assigned small values, and new candidates may be assigned large values. That is, the variable-length coding unit 516 may assign a merge block block index of a small value in preference to the original merge block candidate.
- merge block candidates are not necessarily limited to the positions of adjacent blocks A to D.
- an adjacent block or the like located above the lower left adjacent block D may be used as a merge block candidate.
- not all adjacent blocks need to be used as merge block candidates.
- only adjacent blocks A and B may be used as merge block candidates.
- variable-length coding unit 516 adds the merge block index to the bit stream in step S505 in FIG. 25, but it is not necessary to add the merge block index to the bit stream.
- the variable-length coding unit 116 may not add the merging block index to the bitstream. This can reduce the amount of information of the merge block index.
- FIG. 27 is a flowchart showing a detailed process of step S501 of FIG. Specifically, FIG. 27 illustrates a method of calculating merging block candidates and merging block candidate list sizes. Hereinafter, FIG. 27 will be described.
- step S511 the merging block candidate calculation unit 514 determines whether or not the merging block candidate [N] is a mergeable candidate by a method described later. Then, the merging block candidate calculation unit 514 updates the number of mergeable candidates according to the determination result.
- N is an index value for representing each merge block candidate.
- N takes a value from 0 to 4.
- the adjacent block A in FIG. 3 is allocated to the merge block candidate [0].
- the adjacent block B of FIG. 3 is allocated to the merge block candidate [1].
- a co-located merge block is allocated to the merge block candidate [2].
- the adjacent block C of FIG. 3 is allocated to the merge block candidate [3].
- the adjacent block D of FIG. 5 is allocated to the merge block candidate [4].
- step S512 the merging block candidate calculation unit 514 obtains the motion vector of the merging block candidate [N], the reference picture index, and the prediction direction, and adds it to the merging block candidate list.
- step S513 as shown in FIG. 26, the merging block candidate calculation unit 514 searches the merging block candidate list for non-mergable candidates and duplication candidates and deletes them.
- step S514 the merging block candidate calculation unit 514 adds a new candidate to the merging block candidate list by the method described in the first embodiment or the method described later.
- the merging block candidate calculation unit 514 reassigns the value of the merging block index so that a merging block candidate index having a small value is allocated prior to the existing merging block candidate. You may go. That is, the merging block candidate calculation unit 514 may reassign the value of the merging block index so as to assign a merging block index having a large value to the new candidate. Thereby, the code amount of the merge block index can be reduced.
- step S515 the merging block candidate calculation unit 514 sets the number of mergeable candidates calculated in step S511 as the merging block candidate list size.
- the number of mergeable candidates is calculated as “4” by the method described later, and “4” is set as the merge block candidate list size.
- the new candidate in step S514 is newly added to the merge block candidate when the number of merge block candidates has not reached the number of mergeable candidates by the method described in the first embodiment or the method described later.
- the new candidate is a merge block candidate having a predetermined vector (for example, a zero vector) as a motion vector.
- the new candidate may be an adjacent block located above the lower left adjacent block D in FIG.
- the new candidate may be, for example, a block corresponding to adjacent blocks A to D of the co-located block.
- the new candidate may be, for example, a block having a motion vector in the entire screen of a reference picture or a certain region, a reference picture index, and a statistical value of a prediction direction.
- the merging block candidate calculation unit 514 adds a new candidate having a new motion vector, a reference picture index, and a prediction direction, Coding efficiency can be improved.
- FIG. 28 is a flowchart showing the detailed process of step S511 of FIG. Specifically, FIG. 28 shows a method of determining whether the merge block candidate [N] is a mergeable candidate and updating the number of mergeable candidates. Hereinafter, FIG. 28 will be described.
- step S 521 the merging block candidate calculation unit 514 positions the merging block candidate [N] outside a slice or picture boundary including (1) a block encoded by intra prediction or (2) a coding target block. (3) It is determined whether it is a block which is not yet encoded.
- step S521 if the determination result in step S521 is true (Yes in S521), in step S522, the merge block candidate calculation unit 514 sets the merge block candidate [N] as a non-merge candidate. On the other hand, if the determination result in step S521 is false (No in S521), in step S523, the merge block candidate calculation unit 514 sets the merge block candidate [N] as a mergeable candidate.
- step S524 the merging block candidate calculation unit 514 determines whether the merging block candidate [N] is a mergeable candidate or a co-located merging block candidate.
- the merging block candidate calculation unit 514 adds 1 to the number of merging block candidates to update the number of merging block candidates.
- the determination result in step S524 is false (No in S524), the merging block candidate calculation unit 514 does not update the number of mergeable candidates.
- the merging block candidate calculation unit 514 determines whether the number of mergeable candidates is 1 regardless of whether the co-located block is a mergeable candidate or a non-mergeable candidate. Add As a result, even when the information of the co-located merge block is lost due to a packet loss or the like, the image encoding device and the image decoding device do not have a mismatch in the number of mergeable candidates.
- the number of mergeable candidates is set to the merge block candidate list size in step S515 in FIG. Furthermore, in step S505 in FIG. 25, the merging block candidate list size is used for variable-length coding of merging block index. As a result, even when reference picture information including a co-located block or the like is lost, the image coding apparatus 500 can generate a bitstream that can correctly decode the merge block index.
- FIG. 29 is a flowchart showing a detailed process of step S514 in FIG. Specifically, FIG. 29 shows a method of adding a new candidate. Hereinafter, FIG. 29 will be described.
- step S531 the merging block candidate calculation unit 514 determines whether the number of merging block candidates is smaller than the number of mergeable candidates. That is, the merging block candidate calculation unit 514 determines whether or not the number of merging block candidates has reached the number of mergeable candidates.
- step S532 determines whether there is a new candidate that can be added to the merge block candidate list as a merge block candidate. judge.
- step S532 is true (Yes in S532)
- the merge block candidate calculation unit 514 assigns the value of the merge block index to the new candidate in step S533, and adds the new candidate to the merge block candidate list. Furthermore, in step S534, 1 is added to the number of merging block candidates.
- step S101 or step S532 determines whether the new candidate addition process has reached the number of mergeable candidates, or if there is no new candidate.
- the merge block candidate list size used when encoding or decoding a merge block index depends on reference picture information including co-located blocks and the like. It can be calculated by This enables the image coding apparatus 500 to improve error resilience.
- the image coding apparatus 500 can always merge if the merge block candidate is a co-located merge block regardless of whether the co-located merge block is a mergeable candidate or not. Add 1 to the number of candidates. Then, the image coding apparatus 500 determines a bit string to be assigned to the merge block index using the number of mergeable candidates calculated in this manner. This enables the image coding apparatus 500 to generate a bitstream that can correctly decode the merge block index even when reference picture information including a co-located block is lost.
- image coding apparatus 500 merges a new candidate having a new motion vector, a reference picture index, and a prediction direction when the number of merge block candidates has not reached the number of mergeable candidates. Coding efficiency can be improved by adding as a block candidate.
- the merge flag is always added to the bit stream in the merge mode.
- the present invention is not limited to this.
- a merge mode is used in which the encoding target block is encoded by copying the prediction direction, the motion vector, and the reference picture index from the adjacent block of the encoding target block.
- the skip merge mode may be used.
- the prediction direction, motion vector and reference picture index are copied from the adjacent block of the encoding target block as in the merge mode.
- the skip flag is set to 1 and the skip flag and the merge block index are added to the bitstream. If the prediction error data is not 0, the skip flag is set to 0, and the skip flag, merge flag, merge block index, and prediction error data are added to the bit stream.
- a motion vector in the motion vector detection mode may be encoded using the merge block candidate list created as shown in (b) of FIG. That is, the motion vector of the merge block candidate specified by the merge block index is subtracted from the motion vector in the motion vector detection mode to obtain the difference. Then, the obtained difference and merge block index may be added to the bitstream.
- the motion vector MV_Merge of the merge block candidate is scaled as shown in Expression 2 using the reference picture index RefIdx_ME of the motion detection mode and the reference picture index RefIdx_Merge of the merge block candidate, and after scaling from the motion vector of the motion detection mode
- the difference may be obtained by subtracting the motion vector scaledMV_Merge of the merge block candidate of. Then, the obtained difference and merge block index may be added to the bitstream.
- the image coding apparatus is calculated so as to always add 1 if the merging block candidate is a co-located merging block regardless of whether the co-located merging block is a mergeable candidate or not.
- the bit sequence allocated to the merge block index was determined using the number of mergeable candidates.
- the image coding apparatus uses, for example, the number of mergeable candidates calculated to always always add 1 also to merge block candidates other than the co-located merge block in step S524 in FIG.
- Bit sequences to be assigned to merge block indexes may be determined. That is, the image coding apparatus may allocate a bit string to the merge block index using the merge block candidate list size fixed to the maximum value N of the number of merge block candidates. That is, the image coding apparatus may treat all merging block candidates as mergeable candidates, fix the merging block candidate list size at the maximum value N of the number of merging block candidates, and encode the merging block index. .
- the image coding apparatus since the maximum value N of the number of merging block candidates is 5 (adjacent block A, adjacent block B, co-located merge block, adjacent block C, adjacent block D), the image coding apparatus May always set the merge block candidate list size to 5 and encode the merge block index. Also, for example, when the maximum value N of the number of merging block candidates is 4 (adjacent block A, adjacent block B, adjacent block C, adjacent block D), the image coding apparatus always sets the merging block candidate list size to May be set to encode the merge block index.
- the image coding apparatus may determine the merge block candidate list size according to the maximum value of the number of merge block candidates. This enables the variable length decoding unit of the image decoding apparatus to generate a bitstream that can decode the merge block index in the bitstream without referring to the information of the adjacent block or the co-located block. The processing amount of the variable length decoding unit can be reduced.
- FIG. 30 is a block diagram showing a configuration of an image coding apparatus 600 according to Embodiment 6.
- the image coding apparatus 600 generates a bitstream by coding an image block by block.
- the image coding apparatus 600 includes a merge candidate derivation unit 610, a prediction control unit 620, and a coding unit 630.
- the merge candidate derivation unit 610 corresponds to the merge block candidate calculation unit 514 in the fifth embodiment.
- the merge candidate derivation unit 610 derives merge candidates. Then, the merge candidate derivation unit 610 generates, for example, a merge candidate list in which each derived merge candidate is associated with an index for specifying the merge candidate.
- the merge candidate derivation unit 610 includes a determination unit 611, a first derivation unit 612, a specification unit 613, a determination unit 614, and a second derivation unit 615.
- the determination unit 611 determines the maximum number of merge candidates. That is, the determination unit 611 determines the maximum value N of the number of merging block candidates.
- the determination unit 611 determines the maximum number of merge candidates based on the features of the input image sequence (sequence, picture, slice, block or the like). Also, for example, the determination unit 611 may determine a predetermined number as the maximum number of merge candidates.
- the first derivation unit 612 derives a first merge candidate based on the prediction direction, the motion vector, and the reference picture index used for encoding a block spatially or temporally adjacent to the current block.
- the first derivation unit 612 derives the first merge candidate so that the number of first merge candidates does not exceed the maximum number.
- the first derivation unit 612 registers, for example, the first merge candidate derived in this manner in the merge candidate list in association with the merge index.
- the first derivation unit 612 may use, for example, a prediction direction, a motion vector, and a reference picture index used for coding a block other than the non-mergeable block among blocks spatially adjacent to the current block. 1 It may be derived as a merge candidate.
- a non-mergeable block is a block encoded by intra prediction, a block including a block to be coded, a block located outside the boundary of a picture or a picture, or a block not yet coded. Thereby, the first derivation unit 612 can derive the first merge candidate from the block suitable for obtaining the merge candidate.
- the identifying unit 613 identifies a first merge candidate (overlap candidate) in which the prediction direction, the motion vector, and the reference picture index overlap with other first merge candidates. Then, the identifying unit 613 deletes the identified duplicate candidate from the merge candidate list.
- the determining unit 614 determines whether the number of first merge candidates is smaller than the determined maximum number. Here, the determination unit 614 determines whether the number of first merge candidates excluding the identified overlapping first merge candidate is smaller than the determined maximum number.
- the second derivation unit 615 When it is determined that the number of first merge candidates is smaller than the determined maximum number, the second derivation unit 615 derives a merge candidate having a predetermined vector as a motion vector as a second merge candidate. Specifically, the second derivation unit 615 derives the second merge candidate such that the sum of the number of first merge candidates and the number of second merge candidates does not exceed the maximum number. Here, the second derivation unit 615 derives the second merge candidate such that the sum of the number of first merge candidates excluding the duplication candidate and the number of second merge candidates does not exceed the maximum number.
- the predetermined vector may be, for example, a zero vector as in the fifth embodiment.
- the predetermined vector does not have to be a zero vector.
- the second derivation unit 615 associates the second merge candidate derived in this way with the merge index and registers the second merge candidate in the merge candidate list.
- the second derivation unit 615 may register the second merge candidate in the merge candidate list such that a merge index having a smaller value than the second merge candidate is assigned to the first merge candidate.
- the second derivation unit 615 does not necessarily have to derive the second merge candidate so that the sum of the number of first merge candidates and the number of second merge candidates matches the determined maximum number. If the sum of the number of first merge candidates and the number of second merge candidates is smaller than the determined maximum number, for example, there may be a value of a merge index to which no merge candidate is associated.
- the prediction control unit 620 selects, from among the first merge candidate and the second merge candidate, a merge candidate to be used for encoding the current block. That is, the prediction control unit 620 selects, from the merge candidate list, a merge candidate to be used for encoding of the current block.
- the encoding unit 630 encodes the index (merge index) for identifying the selected merge candidate using the determined maximum number. Specifically, as shown in FIG. 5, the encoding unit 630 performs variable-length encoding on the bit string assigned to the index value of the selected merge candidate. Furthermore, the encoding unit 630 adds the encoded index to the bit stream.
- the encoding unit 630 may further add information indicating the maximum number determined by the determination unit 611 to the bitstream. Specifically, the encoding unit 630 may write information indicating the maximum number in, for example, a slice header. As a result, the maximum number can be switched in an appropriate unit, and encoding efficiency can be improved.
- the encoding unit 630 does not necessarily have to add information indicating the maximum number to the bit stream. For example, when the maximum number is predetermined by the standard, or when the maximum number is the same as the predetermined value, the encoding unit 630 may not add information indicating the maximum number to the bitstream.
- FIG. 31 is a flowchart showing the processing operation of the image coding apparatus 600 according to Embodiment 6.
- the determination unit 611 determines the maximum number of merge candidates (S601).
- the first derivation unit 612 derives the first merge candidate (S602).
- the identifying unit 613 identifies a first merge candidate (overlap candidate) in which the prediction direction, the motion vector, and the reference picture index overlap with another first merge candidate (S603). ).
- the determination unit 614 determines whether the number of first merge candidates excluding the overlap candidate is smaller than the determined maximum number (S604).
- the second derivation unit 615 has a predetermined vector as a motion vector.
- the merge candidate is derived as a second merge candidate (S605).
- the second derivation unit 615 does not derive the second merge candidate.
- the prediction control unit 620 selects a merge candidate to be used for encoding the current block from among the first merge candidate and the second merge candidate (S606). For example, as in the first embodiment, the prediction control unit 620 selects, from the merge candidate list, a merge candidate with the minimum cost shown in Equation 1.
- the encoding unit 630 encodes the index for identifying the selected merge candidate using the determined maximum number (S607). Furthermore, the encoding unit 630 adds the encoded index to the bit stream.
- a merge candidate having a predetermined vector as a motion vector can be derived as a second merge candidate. Therefore, the image coding apparatus 600 can derive, for example, a merge candidate having a motion vector for a still area or the like as a second merge candidate. That is, the image coding apparatus 600 can efficiently code the coding target block having a predetermined motion, and can improve coding efficiency.
- an index for specifying a merge candidate can be coded using the determined maximum number. That is, the index can be encoded without depending on the number of merge candidates actually derived. Therefore, even when information necessary for deriving a merge candidate (for example, information such as a co-located block) is lost, the decoding side can decode the index, and error resistance can be improved. Also, on the decoding side, the index can be decoded independently of the number of merge candidates that are actually derived. That is, on the decoding side, the index decoding process can be performed without waiting for the merge candidate derivation process. That is, it is possible to generate a bit stream capable of performing the merge candidate derivation process and the index decryption process in parallel.
- image coding apparatus 600 when it is determined that the number of first merge candidates is smaller than the maximum number, second merge candidates can be derived. Therefore, the number of merge candidates can be increased without exceeding the maximum number, and encoding efficiency can be improved.
- second merge candidates can be derived according to the number of first merge candidates excluding the overlapping first merge candidates.
- the number of second merge candidates can be increased, and the types of combinations of prediction directions, motion vectors, and reference picture indexes that can be selected as merge candidates can be increased. Therefore, it is possible to further improve the coding efficiency.
- the image coding apparatus 600 includes the specifying unit 613 in the present embodiment, the specifying unit 613 is not necessarily required. That is, step S603 need not necessarily be included in the flowchart shown in FIG. Even in such a case, since the image coding apparatus 600 can code the index for identifying merge candidates using the determined maximum number, error tolerance can be improved. It becomes.
- the specification unit 613 specifies the duplication candidate, but this is not necessarily the case.
- the first derivation unit 612 identifies the duplication candidate, and derives the first merge candidate so that the identified duplication candidate is not included in the first merge candidate. It is also good. That is, the first derivation unit 612 may derive, as the first merge candidate, a merge candidate in which the combination of the prediction direction, the motion vector, and the reference picture index does not overlap with the already derived first merge candidate.
- the merge candidate based on the left adjacent block when the merge candidate based on the left adjacent block is already derived as the first merge candidate, the merge candidate based on the upper adjacent block does not overlap with the merge candidate based on the left adjacent block.
- the first derivation unit 612 may derive a merge candidate based on the upper adjacent block as a first merge candidate. Thereby, the first derivation unit 612 can exclude, from the first merge candidates, merge candidates in which the combination of the prediction direction, the motion vector, and the reference picture index overlaps the already derived first merge candidate.
- the image coding apparatus 600 can increase the number of second merge candidates, and can increase the types of combinations of prediction directions, motion vectors, and reference picture indexes that can be selected as merge candidates. Therefore, the first derivation unit 612 can further improve the coding efficiency.
- the image coding apparatus 600 may first derive a second merge candidate, and register the derived second merge candidate in the merge candidate list. Thereafter, the image coding apparatus 600 may derive the first merge candidate, and overwrite the second merge candidate registered in the merge candidate list with the derived first merge candidate.
- the seventh embodiment is different from the third embodiment in the method of deriving the merge block candidate list size.
- the derivation method of the merge block candidate list size in the present embodiment will be described in detail.
- FIG. 32 is a block diagram showing a configuration of an image decoding apparatus 700 according to Embodiment 7.
- the same components as in FIG. 20 will be assigned the same reference numerals and descriptions thereof will be omitted.
- This image decoding apparatus 700 is an apparatus corresponding to the image coding apparatus 500 according to the fifth embodiment.
- the image decoding apparatus 700 decodes, for example, a coded image included in a bit stream generated by the image coding apparatus 500 according to the fifth embodiment for each block.
- the image decoding apparatus 700 includes a variable-length decoding unit 701, an inverse quantization unit 302, an inverse orthogonal transformation unit 303, an addition unit 304, a block memory 305, a frame memory 306, an intra A prediction unit 307, an inter prediction unit 308, an inter prediction control unit 309, a switch 310, a merge block candidate calculation unit 711, and a colPic memory 312 are provided.
- variable-length decoding unit 701 performs variable-length decoding processing on the input bit stream to generate picture type information, a merge flag, and a quantization coefficient. Also, the variable-length decoding unit 701 performs variable-length decoding processing of the merge block index using the number of mergeable candidates described later.
- the merge block candidate calculation unit 711 uses the motion vector etc. of the adjacent block of the decoding target block and the motion vector etc. of the co-located block stored in the colPic memory 312 (colPic information) to use the merge block in merge mode.
- the candidates are derived by the method described later. Further, the merge block candidate calculation unit 711 assigns the value of the merge block index to each derived merge block candidate. Then, the merge block candidate calculation unit 711 transmits the merge block candidate and the merge block index to the inter prediction control unit 309.
- FIG. 33 is a flowchart showing the processing operation of the image decoding apparatus according to the seventh embodiment.
- step S701 the variable-length decoding unit 701 decodes the merge flag.
- step S702 if the merge flag is "1" (Yes in S702), in step S703, the merging block candidate calculation unit 711 calculates the number of mergeable candidates by a method described later. Then, the merging block candidate calculation unit 711 sets the calculated number of mergeable candidates as the merging block candidate list size.
- step S704 the variable-length decoding unit 701 performs variable-length decoding of the merge block index in the bitstream using the merge block candidate list size.
- step S705 the merging block candidate calculation unit 711 generates merging block candidates from the adjacent block and the co-located block of the decoding target block by the method described in the first or third embodiment or the method to be described later.
- the inter prediction control unit 309 causes the inter prediction unit 308 to generate an inter prediction image using the motion vector of the merge block candidate indicated by the decoded merge block index, the reference picture index, and the prediction direction.
- step S702 if the merge flag is "0" (No in step S702), in step S707, the inter prediction unit 308 performs inter prediction using information on the motion vector detection mode decoded by the variable length decoding unit 701. Generate an image.
- the merging block index may be estimated to be “0” without being decoded.
- FIG. 34 is a flowchart showing a detailed process of step S703 of FIG. Specifically, FIG. 34 illustrates a method of determining whether the merge block candidate [N] is a mergeable candidate and calculating the number of mergeable candidates. Hereinafter, FIG. 34 will be described.
- step S711 the merging block candidate calculation unit 711 determines that the merging block candidate [N] is (1) a block decoded by intra prediction, or (2) a slice including a decoding target block or a block positioned outside a picture boundary Or (3) It is determined whether it is a block that has not been decoded yet.
- step S712 the merging block candidate calculation unit 711 sets the merging block candidate [N] as a non-merging candidate.
- step S713 the merging block candidate calculation unit 711 sets the merging block candidate [N] as a mergeable candidate in step S713.
- step S714 the merging block candidate calculation unit 711 determines whether the merging block candidate [N] is a mergeable candidate or a co-located merging block candidate.
- the merge block candidate calculation unit 711 updates the number of merge block candidates by adding 1 to the number of merge block candidates in step S715.
- the merging block candidate calculation unit 711 does not update the number of mergeable candidates.
- the merging block candidate calculation unit 711 determines whether the number of mergeable candidates is 1 regardless of whether the co-located block is a mergeable candidate or a non-mergeable candidate. Add As a result, even when the information of the co-located merge block is lost due to a packet loss or the like, the image encoding device and the image decoding device do not have a mismatch in the number of mergeable candidates.
- the number of mergeable candidates is set to the merge block candidate list size in step S703 of FIG. Furthermore, in step S704 of FIG. 33, the merging block list size is used for variable length decoding of merging block index. Thus, even when reference picture information including a co-located block or the like is lost, the image decoding apparatus 700 can correctly decode the merge block index.
- FIG. 35 is a flowchart showing a detailed process of step S 705 of FIG. Specifically, FIG. 35 shows a method of calculating merge block candidates. Hereinafter, FIG. 35 will be described.
- step S721 the merging block candidate calculation unit 711 obtains the motion vector of the merging block candidate [N], the reference picture index, and the prediction direction, and adds the motion vector to the merging block candidate list.
- step S 722 as shown in FIG. 26, the merging block candidate calculation unit 711 searches the merging block candidate list for non-mergable candidates and duplication candidates, and deletes the candidates.
- step S723 the merging block candidate calculation unit 711 adds a new candidate to the merging block candidate list by the method described in the first or third embodiment or the method similar to FIG.
- FIG. 36 illustrates an example of syntax when adding a merge block index to a bitstream.
- merge_idx represents a merge block index
- merge_flag represents a merge flag.
- NumMergeCand represents a merge block candidate list size, and in the present embodiment, the number of mergeable candidates calculated in the processing flow of FIG. 34 is set.
- the merge block candidate list size used when encoding or decoding a merge block index does not depend on reference picture information including co-located blocks and the like. It can be calculated by the method. This enables the image decoding apparatus 700 to appropriately decode a bitstream with improved error resilience.
- the image decoding apparatus 700 always mergeable candidates if the merge block candidate is a co-located merge block regardless of whether the co-located merge block is a mergeable candidate or not. Add 1 to the number. Then, the image decoding apparatus 700 determines a bit string to be assigned to the merge block index using the number of mergeable candidates calculated in this manner. Thus, the image decoding apparatus 700 can correctly decode the merge block index even when the reference picture information including the co-located block is lost.
- the image decoding apparatus 700 merges a new candidate having a new motion vector, a reference picture index, and a prediction direction when the number of merge block candidates has not reached the number of mergeable candidates. By adding as a candidate, it is possible to appropriately decode a bitstream with improved coding efficiency.
- the image decoding apparatus is calculated so as to always add 1 if the merge block candidate is a co-located merge block regardless of whether the co-located merge block is a mergeable candidate or not.
- the number of mergeable candidates was used to determine a bit string to be assigned to a merge block index.
- the image decoding apparatus uses, for example, the number of mergeable candidates calculated to always always add 1 also to merge block candidates other than the co-located merge block in step S714 in FIG.
- the bit sequence to be assigned to the merge block index may be determined. That is, the image decoding apparatus may allocate a bit string to the merge block index using the merge block candidate list size fixed to the maximum value N of the number of merge block candidates. That is, the image decoding apparatus may regard all merging block candidates as merging candidates, fix the merging block candidate list size at the maximum value N of the number of merging block candidates, and decode the merging block index.
- the image decoding apparatus since the maximum value N of the number of merging block candidates is 5 (adjacent block A, adjacent block B, co-located merge block, adjacent block C, adjacent block D), the image decoding apparatus
- the merge block index may be decoded by always setting 5 as the merge block candidate list size.
- the variable-length decoding unit of the image decoding apparatus can decode the merge block index in the bitstream without referring to the information of the adjacent block or the co-located block.
- the processes of steps S714 and S715 in FIG. 34 can be omitted, and the processing amount of the variable-length decoding unit can be reduced.
- FIG. 37 shows an example of syntax in the case where the merging block candidate list size is fixed to the maximum value of the number of merging block candidates. As shown in FIG. 37, when fixing the merge block candidate list size to the maximum value of the number of merge block candidates, NumMergeCand can be deleted from the syntax.
- a modification of the image decoding apparatus according to the seventh embodiment as described above will be specifically described below as an image decoding apparatus according to the eighth embodiment.
- FIG. 38 is a block diagram showing a configuration of an image decoding apparatus 800 according to Embodiment 8.
- the image decoding apparatus 800 decodes the encoded image included in the bit stream block by block. Specifically, for example, the image decoding apparatus 800 decodes, for each block, the encoded image included in the bit stream generated by the image encoding apparatus 600 according to the sixth embodiment.
- the image decoding apparatus 800 includes a merge candidate derivation unit 810, a decoding unit 820, and a prediction control unit 830.
- the merge candidate derivation unit 810 corresponds to the merge block candidate calculation unit 711 in the seventh embodiment.
- the merge candidate derivation unit 810 derives merge candidates. Then, the merge candidate derivation unit 810 generates, for example, a merge candidate list in which each derived merge candidate is associated with an index (merge index) for specifying the merge candidate.
- the merge candidate derivation unit 810 includes a determination unit 811, a first derivation unit 812, a specification unit 813, a determination unit 814, and a second derivation unit 815.
- the determination unit 811 determines the maximum number of merge candidates. That is, the determining unit 811 determines the maximum value N of the number of merging block candidates.
- the determination unit 811 may determine the maximum number of merge candidates in the same manner as the determination unit 611 of the sixth embodiment. Also, for example, the determination unit 811 may determine the maximum number based on the information indicating the maximum number added to the bit stream. As a result, the image decoding apparatus 800 can switch the maximum number in an appropriate unit and decode the encoded image.
- the determination unit 811 is included in the merge candidate derivation unit 810, but may be included in the decoding unit 820.
- the first derivation unit 812 derives the first merge candidate. Specifically, the first derivation unit 812 derives the first merge candidate based on the prediction direction, the motion vector, and the reference picture index used for decoding the block spatially or temporally adjacent to the current block to be decoded . Then, for example, the first derivation unit 812 associates the first merge candidate derived in this manner with the merge index and registers the first merge candidate in the merge candidate list.
- the first derivation unit 812 performs, as a first merge, the prediction direction, the motion vector, and the reference picture index used for decoding a block other than the non-mergeable block among the blocks spatially adjacent to the decoding target block. It may be derived as a candidate. Thereby, the first derivation unit 812 can derive the first merge candidate from the block suitable for obtaining the merge candidate.
- the identifying unit 813 identifies, when a plurality of first merge candidates are derived, a first merge candidate (overlap candidate) in which the prediction direction, the motion vector, and the reference picture index overlap with other first merge candidates. Then, the identifying unit 813 deletes the identified duplicate candidate from the merge candidate list.
- the determining unit 814 determines whether the number of first merge candidates is smaller than the determined maximum number. Here, the determination unit 814 determines whether the number of first merge candidates excluding the identified overlapping first merge candidate is smaller than the determined maximum number.
- the second derivation unit 815 When it is determined that the number of first merge candidates is smaller than the determined maximum number, the second derivation unit 815 derives a merge candidate having a predetermined vector as a motion vector as a second merge candidate. Specifically, the second derivation unit 815 derives the second merge candidate such that the sum of the number of first merge candidates and the number of second merge candidates does not exceed the maximum number. Here, the second derivation unit 815 derives the second merge candidate such that the sum of the number of first merge candidates excluding the duplication candidate and the number of second merge candidates does not exceed the maximum number.
- the predetermined vector may be, for example, a zero vector as in the seventh embodiment.
- the second derivation unit 815 can derive a merge candidate having a motion vector for a still area. Therefore, the image decoding apparatus 800 can appropriately decode a bitstream with improved coding efficiency.
- the predetermined vector does not have to be a zero vector.
- the second derivation unit 815 associates the second merge candidate derived in this way with the merge index and registers the second merge candidate in the merge candidate list.
- the second derivation unit 815 may register the second merge candidate in the merge candidate list such that a merge index having a smaller value than the second merge candidate is assigned to the first merge candidate.
- the second derivation unit 815 does not necessarily have to derive the second merge candidate so that the sum of the number of first merge candidates and the number of second merge candidates matches the determined maximum number. If the sum of the number of first merge candidates and the number of second merge candidates is smaller than the determined maximum number, for example, there may be a value of a merge index to which no merge candidate is associated.
- the decoding unit 820 decodes the encoded index added to the bitstream and the index for identifying a merge candidate using the determined maximum number.
- the prediction control unit 830 selects a merge candidate to be used for decoding the current block from among the first merge candidate and the second merge candidate based on the decoded index. That is, the prediction control unit 830 selects, from the merge candidate list, merge candidates to be used for decoding of the current block.
- FIG. 39 is a flowchart showing the processing operation of the image decoding apparatus 800 according to Embodiment 8.
- the determination unit 811 determines the maximum number of merge candidates (S801).
- the first derivation unit 812 derives the first merge candidate (S802).
- the identifying unit 813 identifies a first merge candidate (overlap candidate) in which the prediction direction, the motion vector, and the reference picture index overlap with another first merge candidate (S803). ).
- the determination unit 814 determines whether the number of first merge candidates excluding the duplication candidate is smaller than the determined maximum number (S804). Here, if it is determined that the number of first merge candidates excluding the overlap candidate is smaller than the determined maximum number (Yes in S804), the second derivation unit 815 derives a second merge candidate (S805) . On the other hand, when it is not determined that the number of first merge candidates excluding the duplication candidate is smaller than the determined maximum number (No in S804), the second derivation unit 815 does not derive the second merge candidate.
- the decoding unit 820 decodes the encoded index added to the bitstream and the index for specifying a merge candidate using the determined maximum number (S806).
- the prediction control unit 830 selects a merge candidate to be used for decoding the decoding target block from the first merge candidate and the second merge candidate based on the decoded index (S807). For example, as in the first embodiment, the prediction control unit 830 selects, from the merge candidate list, a merge candidate with the minimum cost shown in Expression 1.
- the index decoding process (S806) is performed after the merge candidate is derived, but it is not necessary to be performed in this order.
- merge candidate derivation processes (S802 to S805) may be performed after the index decoding process (S806).
- the index decoding process (S 806) and the merge candidate derivation process (S 802 to S 805) may be performed in parallel. Thereby, the processing speed of decoding can be improved.
- a merge candidate having a predetermined vector as a motion vector can be derived as a second merge candidate. Therefore, the image decoding apparatus 800 can derive, for example, a merge candidate having a motion vector for a still area or the like as a second merge candidate. That is, the image decoding apparatus 800 can appropriately decode a bitstream in which a block having a predetermined motion is efficiently encoded, and appropriately decode a bitstream with improved encoding efficiency. Is possible.
- an index for specifying a merge candidate can be decoded using the determined maximum number. That is, the index can be decoded independently of the number of merge candidates actually derived. Therefore, even when information necessary for deriving a merge candidate (for example, information such as a co-located block) is lost, the image decoding apparatus 800 can decode the index, and can improve error resistance. It becomes. Furthermore, the image decoding apparatus 800 can perform the index decoding process without waiting for the merge candidate derivation process, and can also perform the merge candidate derivation process and the index decoding process in parallel.
- image decoding apparatus 800 when it is determined that the number of first merge candidates is smaller than the maximum number, second merge candidates can be derived. Therefore, the image decoding apparatus 800 can increase the number of merge candidates without exceeding the maximum number, and can appropriately decode a bitstream with improved coding efficiency.
- the image decoding apparatus 800 it is possible to derive the second merge candidate according to the number of first merge candidates excluding the overlapping first merge candidate.
- the image decoding apparatus 800 can increase the number of second merge candidates, and can increase the types of combinations of prediction directions, motion vectors, and reference picture indexes that can be selected as merge candidates. Therefore, the image decoding apparatus 800 can appropriately decode a bit stream with further improved coding efficiency.
- the image decoding apparatus 800 includes the specifying unit 813.
- the image decoding apparatus 800 need not necessarily include the specifying unit 813. That is, step S 803 need not necessarily be included in the flowchart shown in FIG. 39. Even in such a case, the image decoding apparatus 800 can decode an index for specifying a merge candidate using the determined maximum number, so that error tolerance can be improved. .
- the specification unit 813 specifies the duplication candidate, but this is not necessarily the case.
- the first derivation unit 812 may derive, as a first merge candidate, a merge candidate in which the combination of the prediction direction, the motion vector, and the reference picture index does not overlap with the already derived first merge candidate.
- the first derivation unit 812 can exclude, from the first merge candidates, merge candidates in which the combination of the prediction direction, the motion vector, and the reference picture index overlaps the already derived first merge candidate.
- the image decoding apparatus 800 can increase the number of second merge candidates, and can increase the types of combinations of prediction directions, motion vectors, and reference picture indexes that can be selected as merge candidates. Therefore, the image decoding apparatus 800 can appropriately decode a bit stream with further improved coding efficiency.
- the image decoding apparatus 800 may first derive a second merge candidate, and register the derived second merge candidate in the merge candidate list. After that, the image decoding apparatus 800 may derive the first merge candidate, and overwrite the second merge candidate registered in the merge candidate list with the derived first merge candidate.
- each component may be configured by dedicated hardware or may be realized by executing a software program suitable for each component.
- Each component may be realized by a program execution unit such as a CPU or a processor reading and executing a software program recorded in a recording medium such as a hard disk or a semiconductor memory.
- software for realizing the image coding apparatus or the image decoding apparatus according to each of the above-described embodiments is a program as follows.
- this program is an image coding method for generating a bit stream by coding an image block by block in a computer, and a prediction direction, motion vector, and reference picture used for coding a block to be coded
- a selection step of selecting a merge candidate used for encoding the encoding target block from the first merge candidate and the second merge candidate, and an index for specifying the selected merge candidate Execute an image coding method including a coding step to be added to the bit stream To.
- this program is an image decoding method for decoding, on a block-by-block basis, a coded image included in a bit stream in a computer, which is a candidate for a prediction direction, motion vector and reference picture index used for decoding a decoding target block.
- a first derivation step of deriving a merge candidate as a first merge candidate, a second derivation step of deriving a merge candidate having a predetermined vector as a motion vector as a second merge candidate, and merging from the bit stream An acquisition step of acquiring an index for specifying a candidate, and a merge candidate used for decoding the decoding target block out of the first merge candidate and the second merge candidate based on the acquired index
- an image decoding method including a selection step to select Make.
- Each of the above-described embodiments can be implemented by recording a program for realizing the configuration of the moving picture coding method (image coding method) or the moving picture decoding method (image decoding method) described in each of the above embodiments on a storage medium. It is possible to easily carry out the processing shown in the form in an independent computer system.
- the storage medium may be a magnetic disk, an optical disk, a magneto-optical disk, an IC card, a semiconductor memory, or the like as long as the program can be recorded.
- the system is characterized by having an image coding / decoding device including an image coding device using an image coding method and an image decoding device using an image decoding method.
- Other configurations in the system can be suitably modified as the case may be.
- FIG. 40 is a diagram showing an overall configuration of a content supply system ex100 for realizing content distribution service.
- the area for providing communication service is divided into desired sizes, and base stations ex106, ex107, ex108, ex109 and ex110, which are fixed wireless stations, are installed in each cell.
- This content supply system ex100 includes a computer ex111, a personal digital assistant (PDA) ex112, a camera ex113, a mobile phone ex114, and a game machine ex115 via the Internet service provider ex102 and the telephone network ex104 and the base stations ex106 to the Internet ex101. Each device such as is connected.
- PDA personal digital assistant
- each device may be directly connected to the telephone network ex104 without going through the base stations ex106 to ex110, which are fixed wireless stations.
- the devices may be directly connected to each other via near field communication or the like.
- the camera ex113 is a device capable of shooting moving images such as a digital video camera
- the camera ex116 is a device capable of shooting still images and moving images such as a digital camera.
- the mobile phone ex114 is a GSM (registered trademark) (Global System for Mobile Communications) system, a CDMA (Code Division Multiple Access) system, a W-CDMA (Wideband-Code Division Multiple Access) system, or an LTE (Long Term Evolution) system.
- the method may be any of HSPA (High Speed Packet Access) mobile phone, PHS (Personal Handyphone System), etc.
- live distribution and the like become possible by connecting the camera ex113 and the like to the streaming server ex103 through the base station ex109 and the telephone network ex104.
- live distribution encoding processing is performed on content (for example, a video of a music live, etc.) captured by the user using camera ex113 as described in the above embodiments (that is, according to one aspect of the present invention) Function as the image coding apparatus), and transmits to the streaming server ex103.
- the streaming server ex 103 streams the content data transmitted to the requested client.
- the clients include the computer ex 111, the PDA ex 112, the camera ex 113, the mobile phone ex 114, the game machine ex 115 and the like capable of decoding the above-mentioned encoded data.
- Each device that has received the distributed data decodes and reproduces the received data (that is, it functions as an image decoding apparatus according to an aspect of the present invention).
- encoding processing of captured data may be performed by the camera ex 113, may be performed by the streaming server ex 103 that performs data transmission processing, or may be performed sharing each other.
- the decryption processing of the data distributed may be performed by the client, may be performed by the streaming server ex 103, or may be performed sharing each other.
- not only the camera ex113 but also still images and / or moving image data captured by the camera ex116 may be transmitted to the streaming server ex103 via the computer ex111.
- the encoding process in this case may be performed by any of the camera ex 116, the computer ex 111, and the streaming server ex 103, or may be performed sharing each other.
- these encoding / decoding processes are generally processed by the LSI ex 500 that the computer ex 111 or each device has.
- the LSI ex 500 may be a single chip or a plurality of chips.
- Software for moving image encoding / decoding is incorporated in any recording medium (CD-ROM, flexible disk, hard disk, etc.) readable by computer ex111 etc., and encoding / decoding processing is performed using the software. May be Furthermore, when the mobile phone ex114 is equipped with a camera, moving image data acquired by the camera may be transmitted. The moving image data at this time is data encoded by the LSI ex 500 included in the mobile phone ex 114.
- the streaming server ex103 may be a plurality of servers or a plurality of computers, and may process, record, or distribute data in a distributed manner.
- the client can receive and reproduce the encoded data.
- the client can receive, decrypt, and reproduce the information transmitted by the user in real time, and even a user who does not have special rights or facilities can realize personal broadcasting.
- At least the moving picture coding apparatus (picture coding apparatus) or the moving picture decoding according to each of the above embodiments is also applied to the digital broadcasting system ex200.
- Any of the devices (image decoding devices) can be incorporated.
- multiplexed data in which music data and the like are multiplexed with video data is transmitted to the communication or satellite ex202 via radio waves.
- This video data is data encoded by the moving picture encoding method described in each of the above embodiments (that is, data encoded by the image encoding apparatus according to one aspect of the present invention).
- the broadcast satellite ex202 receiving this transmits a radio wave for broadcasting, and this radio wave is received by a home antenna ex204 capable of receiving satellite broadcasting.
- a device such as a television (receiver) ex300 or a set top box (STB) ex217 decodes and reproduces the received multiplexed data (that is, it functions as an image decoding device according to an aspect of the present invention).
- the reader / recorder ex218 reads and decodes multiplexed data recorded on a recording medium ex215 such as a DVD or BD, or encodes a video signal on the recording medium ex215 and, in some cases, multiplexes it with a music signal and writes it. It is possible to implement the moving picture decoding apparatus or the moving picture coding apparatus described in each of the above embodiments. In this case, the reproduced video signal is displayed on the monitor ex 219, and the video signal can be reproduced in another apparatus or system by the recording medium ex 215 on which the multiplexed data is recorded.
- the moving picture decoding apparatus may be mounted in the set top box ex217 connected to the cable ex203 for cable television or the antenna ex204 for satellite / terrestrial broadcast, and this may be displayed on the monitor ex219 of the television. At this time, the moving picture decoding apparatus may be incorporated in the television instead of the set top box.
- FIG. 42 is a diagram showing a television (receiver) ex300 that uses the moving picture decoding method and the moving picture coding method described in each of the above embodiments.
- the television ex300 acquires a tuner ex301 that acquires or outputs multiplexed data in which audio data is multiplexed into video data via the antenna ex204 that receives the broadcast, the cable ex203, or the like, and demodulates the received multiplexed data.
- the modulation / demodulation unit ex302 that modulates multiplexed data to be transmitted to the outside, the demodulated multiplexed data is separated into video data and audio data, or the video data and audio data encoded by the signal processing unit ex306 And a multiplexing / demultiplexing unit ex303 that multiplexes
- the television ex300 decodes the audio data and the video data, or encodes the respective information.
- the audio signal processing unit ex304, the video signal processing unit ex305 (an image coding apparatus or an image according to an aspect of the present invention And a speaker ex307 for outputting a decoded audio signal, and an output unit ex309 having a display unit ex308 such as a display for displaying a decoded video signal.
- the television ex300 includes an interface unit ex317 including an operation input unit ex312 and the like that receive an input of a user operation.
- the television ex300 includes a control unit ex310 that centrally controls each unit, and a power supply circuit unit ex311 that supplies power to each unit.
- the interface unit ex317 is, besides the operation input unit ex312, a bridge ex313 connected to an external device such as a reader / recorder ex218, a slot unit ex314 for enabling attachment of a recording medium ex216 such as an SD card, external recording such as a hard disk It may have a driver ex 315 for connecting to a medium, a modem ex 316 connected to a telephone network, and the like. Note that the recording medium ex216 can electrically record information by a nonvolatile / volatile semiconductor memory element to be stored.
- the components of the television ex300 are connected to one another via a synchronization bus.
- television ex300 decodes multiplexed data acquired from the outside by antenna ex204 and the like and reproduces the multiplexed data.
- the television ex300 receives the user operation from the remote controller ex220 and the like, and demultiplexes the multiplexed data demodulated by the modulation / demodulation unit ex302 by the multiplexing / demultiplexing unit ex303 based on the control of the control unit ex310 having a CPU or the like. Further, the television ex300 decodes the separated audio data in the audio signal processing unit ex304, and decodes the separated video data in the video signal processing unit ex305 using the decoding method described in each of the above embodiments.
- the decoded audio signal and video signal are output from the output unit ex309 to the outside. At the time of output, these signals may be temporarily stored in the buffers ex318, ex319, etc. so that the audio signal and the video signal are reproduced synchronously. Also, the television ex300 may read multiplexed data not from broadcast or the like, but from the recording media ex215 and ex216 such as a magnetic / optical disk and an SD card. Next, a configuration will be described in which the television ex300 encodes an audio signal or a video signal and externally transmits the signal or writes the signal to a recording medium or the like.
- the television ex300 receives the user operation from the remote controller ex220 and the like, and based on the control of the control unit ex310, encodes the audio signal by the audio signal processing unit ex304, and the video signal processing unit ex305 executes the video signal in each of the above embodiments. Coding is performed using the coding method described above.
- the encoded audio signal and video signal are multiplexed by multiplexer / demultiplexer ex303 and output to the outside. At the time of multiplexing, these signals may be temporarily stored in the buffers ex320, ex321, etc. so that the audio signal and the video signal are synchronized.
- the buffers ex318, ex319, ex320, and ex321 may have a plurality of buffers as illustrated, or one or more buffers may be shared. Furthermore, besides being illustrated, data may be stored in a buffer as a buffer material to avoid system overflow and underflow, for example, between the modulation / demodulation unit ex302 and the multiplexing / demultiplexing unit ex303.
- television ex300 In addition to acquiring audio data and video data from broadcasts and recording media, etc., television ex300 is also configured to receive AV input from a microphone or a camera, and performs encoding processing on data acquired from them. It is also good. Although television ex300 is described here as a configuration capable of the above encoding processing, multiplexing, and external output, these processing can not be performed, and only the above reception, decoding processing, and external output are possible. It may be a configuration.
- the decoding process or the encoding process may be performed by any of the television ex300 and the reader / recorder ex218, or with the television ex300.
- the reader / recorder ex 218 may share each other.
- FIG. 43 shows a configuration of an information reproducing / recording unit ex400 in the case of reading or writing data from an optical disc.
- the information reproducing / recording unit ex400 includes elements ex401, ex402, ex403, ex404, ex405, ex406, and ex407 described below.
- the optical head ex401 irradiates a laser spot on the recording surface of the recording medium ex215 which is an optical disk to write information, detects reflected light from the recording surface of the recording medium ex215, and reads the information.
- the modulation recording unit ex402 electrically drives the semiconductor laser incorporated in the optical head ex401 and modulates the laser light according to the recording data.
- the reproduction / demodulation unit ex403 amplifies the reproduction signal obtained by electrically detecting the reflected light from the recording surface by the photodetector incorporated in the optical head ex401, separates and demodulates the signal component recorded in the recording medium ex215, and Play back information.
- the buffer ex 404 temporarily holds information to be recorded on the recording medium ex 215 and information reproduced from the recording medium ex 215.
- the disk motor ex405 rotates the recording medium ex215.
- the servo control unit ex406 moves the optical head ex401 to a predetermined information track while controlling the rotational drive of the disk motor ex405, and performs the laser spot tracking process.
- the system control unit ex407 controls the entire information reproducing / recording unit ex400.
- the system control unit ex407 uses various information held in the buffer ex404, and generates / adds new information as necessary.
- the modulation recording unit ex402 and the reproduction / demodulation unit This is realized by performing recording and reproduction of information through the optical head ex401 while cooperatively operating the servo control unit ex406.
- the system control unit ex 407 is configured by, for example, a microprocessor, and executes the processing of reading and writing by executing the program.
- the optical head ex401 may be configured to perform higher-density recording using near-field light.
- FIG. 44 shows a schematic view of the recording medium ex 215 which is an optical disc.
- a guide groove (groove) is formed in a spiral shape on the recording surface of the recording medium ex215, and in the information track ex230, address information indicating the absolute position on the disc is recorded in advance by the change of the groove shape.
- the address information includes information for specifying the position of the recording block ex231, which is a unit for recording data, and the apparatus for recording and reproduction reproduces the information track ex230 and reads the address information to specify the recording block.
- the recording medium ex215 includes a data recording area ex233, an inner circumference area ex232, and an outer circumference area ex234.
- An area used to record user data is data recording area ex233, and inner circumference area ex232 and outer circumference area ex234 arranged on the inner circumference or the outer circumference of data recording area ex233 are used for specific applications other than user data recording. Used.
- the information reproducing / recording unit ex400 reads / writes encoded audio data, video data, or multiplexed data obtained by multiplexing those data from / to the data recording area ex233 of such a recording medium ex215.
- an optical disc such as a single layer DVD or BD has been described as an example, but the optical disc is not limited to these, and may be an optical disc having a multilayer structure and capable of recording other than the surface.
- an optical disc with multi-dimensional recording / reproduction such as recording information in the same place of the disc using light of colors of different wavelengths, recording layers of different information from various angles, etc. It may be
- the digital broadcasting system ex200 it is possible to receive data from the satellite ex202 and the like by the car ex210 having the antenna ex205 and reproduce a moving image on a display device such as a car navigation system ex211 which the car ex210 has.
- a display device such as a car navigation system ex211 which the car ex210 has.
- the configuration of the car navigation system ex211 may be, for example, a configuration in which a GPS reception unit is added, and the same may be considered in the computer ex111, the mobile phone ex114, and the like.
- FIG. 45A is a diagram showing a mobile phone ex114 using the moving picture decoding method and the moving picture coding method described in the above embodiment.
- the mobile phone ex114 is an antenna ex350 for transmitting and receiving radio waves to and from the base station ex110, a video, a camera unit ex365 capable of taking a still image, a video taken by the camera unit ex365, a video received by the antenna ex350, etc.
- a display unit ex 358 such as a liquid crystal display that displays the decoded data.
- the cellular phone ex114 further includes a main unit including an operation key unit ex366, an audio output unit ex357 which is a speaker for outputting audio, an audio input unit ex356 which is a microphone for inputting audio, a photographed image, A memory unit ex367 that stores still images, recorded voices, or encoded data such as received images, still images, and mails or decoded data, or an interface unit with a recording medium that similarly stores data A certain slot portion ex364 is provided.
- the mobile phone ex114 controls the main control unit ex360 that integrally controls each unit of the main body unit including the display unit ex358 and the operation key unit ex366, while the power supply circuit unit ex361, the operation input control unit ex362, and the video signal processing unit ex355 , Camera interface unit ex363, LCD (Liquid Crystal Display) control unit ex359, modulation / demodulation unit ex352, multiplexing / demultiplexing unit ex353, audio signal processing unit ex354, slot unit ex364, and memory unit ex367 are mutually connected via bus ex370 ing.
- the main control unit ex360 that integrally controls each unit of the main body unit including the display unit ex358 and the operation key unit ex366, while the power supply circuit unit ex361, the operation input control unit ex362, and the video signal processing unit ex355 , Camera interface unit ex363, LCD (Liquid Crystal Display) control unit ex359, modulation / demodulation unit ex352, multiplexing / demultiplexing unit ex353, audio signal processing unit ex354,
- power supply circuit unit ex361 starts up cellular phone ex114 to an operable state by supplying power from the battery pack to each unit.
- the cellular phone ex114 converts the audio signal collected by the audio input unit ex356 into a digital audio signal by the audio signal processing unit ex354 in the voice communication mode. This is spread spectrum processed by the modulation / demodulation unit ex 352, subjected to digital-to-analog conversion processing and frequency conversion processing by the transmission / reception unit ex 351, and then transmitted through the antenna ex 350.
- the cellular phone ex114 In the voice communication mode, the cellular phone ex114 amplifies received data received via the antenna ex350, performs frequency conversion processing and analog-to-digital conversion processing, performs spectrum despreading processing in the modulation / demodulation unit ex352, and performs audio signal processing unit After converting into an analog voice signal by ex 354, this is output from the voice output unit ex 357.
- main control unit ex360 performs spread spectrum processing on text data in modulation / demodulation unit ex352, performs digital / analog conversion processing and frequency conversion processing in transmission / reception unit ex351, and transmits it to base station ex110 via antenna ex350.
- substantially the reverse processing is performed on the received data, and the result is output to display unit ex 358.
- the video signal processing unit ex 355 compresses the video signal supplied from the camera unit ex365 according to the moving picture coding method described in each of the above embodiments.
- the encoded that is, it functions as an image encoding device according to an aspect of the present invention
- encoded video data is sent to the multiplexing / demultiplexing unit ex353.
- the audio signal processing unit ex354 encodes an audio signal collected by the audio input unit ex356 while capturing a video, a still image and the like with the camera unit ex365, and sends the encoded audio data to the multiplexing / demultiplexing unit ex353 Do.
- the multiplexing / demultiplexing unit ex353 multiplexes the encoded video data supplied from the video signal processing unit ex355 and the encoded audio data supplied from the audio signal processing unit ex354 according to a predetermined method, and the result is obtained.
- the multiplexed data is subjected to spread spectrum processing by the modulation / demodulation unit (modulation / demodulation circuit unit) ex352, subjected to digital / analog conversion processing and frequency conversion processing by the transmission / reception unit ex351, and then transmitted via the antenna ex350.
- multiplexed data received via antenna ex350 is decoded
- the multiplexing / demultiplexing unit ex353 separates the multiplexed data into a bit stream of video data and a bit stream of audio data, and processes the video signal encoded through the synchronization bus ex370 into video signal processing.
- the encoded audio data is supplied to the unit ex 355 and is supplied to the audio signal processing unit ex 354.
- the video signal processing unit ex 355 decodes a video signal by decoding according to the moving picture decoding method corresponding to the moving picture coding method described in each of the above embodiments (that is, an image according to one aspect of the present invention) For example, the display unit ex358 displays a video and a still image included in a moving image file linked to a home page via the LCD control unit ex359.
- the audio signal processing unit ex 354 decodes the audio signal, and the audio output unit ex 357 outputs the audio.
- the terminal such as the mobile phone ex114 or the like is, like the television ex300, a transmitting terminal of only an encoder and a receiving terminal of only a decoder, in addition to a transmitting / receiving terminal having both an encoder and a decoder.
- a transmitting terminal of only an encoder and a receiving terminal of only a decoder in addition to a transmitting / receiving terminal having both an encoder and a decoder.
- reception and transmission of multiplexed data in which music data and the like are multiplexed in the video data in the digital broadcasting system ex200
- data in which text data related to the video and the like are multiplexed besides audio data It may be video data itself instead of multiplexed data.
- the moving picture coding method or apparatus shown in each of the above embodiments and the moving picture coding method or apparatus conforming to different standards such as MPEG-2, MPEG4-AVC, VC-1 are switched as appropriate. It is also possible to generate video data.
- multiplexed data in which audio data and the like are multiplexed with video data is configured to include identification information indicating which standard the video data conforms to.
- identification information indicating which standard the video data conforms to.
- the specific configuration of multiplexed data including video data generated by the moving picture coding method or apparatus shown in each of the above embodiments will be described below.
- the multiplexed data is a digital stream in the MPEG-2 transport stream format.
- FIG. 46 shows a structure of multiplexed data.
- multiplexed data can be obtained by multiplexing one or more of a video stream, an audio stream, a presentation graphics stream (PG), and an interactive graphics stream.
- the video stream indicates the main video and subvideo of the movie
- the audio stream (IG) indicates the subaudio mixing the main audio portion of the movie with the main audio
- the presentation graphics stream indicates the subtitles of the movie.
- the main video refers to a normal video displayed on the screen
- the sub video refers to a video displayed on a small screen in the main video.
- the interactive graphics stream also shows an interactive screen created by arranging GUI parts on the screen.
- the video stream is encoded by the moving picture coding method or apparatus shown in each of the above embodiments, or the moving picture coding method or apparatus complying with the conventional standards such as MPEG-2, MPEG4-AVC, VC-1 etc. ing.
- the audio stream is encoded by a method such as Dolby AC-3, Dolby Digital Plus, MLP, DTS, DTS-HD, or linear PCM.
- Each stream included in multiplexed data is identified by PID. For example, 0x1011 for video streams used for movie images, 0x1100 to 0x111F for audio streams, 0x1200 to 0x121F for presentation graphics, 0x1400 to 0x141F for interactive graphics streams, movie 0x1B00 to 0x1B1F are assigned to the video stream used for the sub video, and 0x1A00 to 0x1A1F are assigned to the audio stream used for the sub audio to be mixed with the main audio.
- FIG. 47 is a view schematically showing how multiplexed data is multiplexed.
- a video stream ex235 composed of a plurality of video frames and an audio stream ex238 composed of a plurality of audio frames are converted into PES packet sequences ex236 and ex239, respectively, and converted into TS packets ex237 and ex240.
- the data of presentation graphics stream ex241 and interactive graphics ex244 are converted to PES packet sequences ex242 and ex245, respectively, and further converted to TS packets ex243 and ex246.
- the multiplexed data ex247 is configured by multiplexing these TS packets into one stream.
- FIG. 48 shows in more detail how the video stream is stored in the PES packet sequence.
- the first row in FIG. 48 shows a video frame sequence of a video stream.
- the second row shows a PES packet sequence.
- I picture, B picture and P picture which are a plurality of Video Presentation Units in the video stream are divided for each picture and stored in the payload of the PES packet .
- Each PES packet has a PES header, and in the PES header, PTS (Presentation Time-Stamp) which is a picture display time and DTS (Decoding Time-Stamp) which is a picture decoding time are stored.
- PTS Presentation Time-Stamp
- DTS Decoding Time-Stamp
- FIG. 49 shows the format of a TS packet to be finally written to multiplexed data.
- the TS packet is a 188-byte fixed-length packet composed of a 4-byte TS header having information such as PID identifying a stream and a 184-byte TS payload storing data, and the PES packet is divided and stored in the TS payload. Ru.
- 4 bytes of TP_Extra_Header are attached to the TS packet, and a 192 byte source packet is configured and written to multiplexed data.
- TP_Extra_Header describes information such as ATS (Arrival_Time_Stamp).
- ATS indicates the transfer start time of the TS packet to the PID filter of the decoder.
- the source packets are arranged in the multiplexed data as shown in the lower part of FIG. 49, and the number incremented from the head of the multiplexed data is called SPN (source packet number).
- TS packets included in multiplexed data there are PAT (Program Association Table), PMT (Program Map Table), PCR (Program Clock Reference), etc. in addition to each stream such as video, audio and subtitles.
- the PAT indicates what is the PID of the PMT used in multiplexed data, and the PID of the PAT itself is registered at 0.
- the PMT has PIDs of respective streams such as video, audio and subtitles included in multiplexed data and attribute information of streams corresponding to the PIDs, and also has various descriptors relating to multiplexed data.
- the descriptor includes copy control information for instructing permission or non-permission of copying of multiplexed data.
- the PCR corresponds to an ATS to which the PCR packet is transferred to the decoder in order to synchronize ATC (Arrival Time Clock), which is the ATS time axis, and STC (System Time Clock), which is the PTS ⁇ DTS time axis. It has STC time information.
- ATC Arriv Time Clock
- STC System Time Clock
- FIG. 50 is a diagram for explaining in detail the data structure of the PMT.
- a PMT header in which the length of data included in the PMT, etc. is described is placed.
- a plurality of descriptors related to multiplexed data are arranged.
- the copy control information etc. is described as a descriptor.
- a plurality of stream information related to each stream included in the multiplexed data is disposed after the descriptor.
- the stream information is composed of a stream descriptor in which a stream type, a stream PID, and stream attribute information (frame rate, aspect ratio, etc.) are described in order to identify a stream compression codec and the like.
- the multiplexed data is recorded together with the multiplexed data information file.
- the multiplexed data information file is management information of multiplexed data as shown in FIG. 51, has a one-to-one correspondence with multiplexed data, and is composed of multiplexed data information, stream attribute information and an entry map.
- multiplexed data information is composed of a system rate, a reproduction start time, and a reproduction end time.
- the system rate indicates the maximum transfer rate of multiplexed data to the PID filter of the system target decoder described later.
- the interval of ATS included in multiplexed data is set to be equal to or less than the system rate.
- the playback start time is the PTS of the leading video frame of multiplexed data
- the playback end time is set to the PTS of the video frame at the end of multiplexed data plus the playback interval of one frame.
- attribute information on each stream included in multiplexed data is registered for each PID. Attribute information has different information for each video stream, audio stream, presentation graphics stream, and interactive graphics stream.
- the frame rate is determined by what compression codec the video stream is compressed, the resolution of the individual picture data making up the video stream, the aspect ratio, It has information such as how much it is.
- the audio stream attribute information is such as what compression codec the audio stream is compressed, what number of channels is included in the audio stream, what language it corresponds to, what sampling frequency is, etc. With the information of These pieces of information are used, for example, to initialize the decoder before the player reproduces.
- the stream type included in the PMT among the multiplexed data is used.
- video stream attribute information included in the multiplexed data information is used.
- the moving picture coding method or apparatus shown in each of the above embodiments for the stream type or video stream attribute information included in PMT.
- Providing a step or means for setting unique information indicating that the data is video data generated by the method or apparatus. With this configuration, it is possible to distinguish between video data generated by the moving picture coding method or apparatus described in each of the above embodiments and video data conforming to another standard.
- FIG. 53 shows steps of the moving picture decoding method according to the present embodiment.
- step exS100 the stream type included in the PMT or the video stream attribute information included in the multiplexed data information is acquired from the multiplexed data.
- step exS101 it is determined whether the stream type or the video stream attribute information indicates that it is multiplexed data generated by the moving picture coding method or apparatus shown in the above embodiments. Do.
- step exS102 each of the above implementations is performed. Decoding is performed by the moving picture decoding method shown in the form.
- the conventional Decoding is performed by a moving image decoding method conforming to the standard.
- FIG. 54 shows a configuration of an LSI ex 500 formed into one chip.
- the LSI ex500 includes elements ex501, ex502, ex503, ex504, ex505, ex506, ex507, ex508, and ex509 described below, and the elements are connected via a bus ex510.
- the power supply circuit unit ex505 starts up to an operable state by supplying power to each unit when the power is on.
- the LSI ex500 controls the microphone ex117 or the camera ex113 by the AV I / O ex509 based on the control of the control unit ex501 including the CPU ex502, the memory controller ex503, the stream controller ex504, and the drive frequency control unit ex512.
- the input AV signal is temporarily stored in an external memory ex 511 such as an SDRAM.
- the accumulated data is divided into plural times according to the processing amount and the processing speed, etc. and sent to the signal processing unit ex507, and the signal processing unit ex507 encodes and / or Signal encoding is performed.
- the coding process of the video signal is the coding process described in each of the above embodiments.
- the signal processing unit ex 507 further performs processing such as multiplexing of encoded audio data and encoded video data as needed, and outputs the multiplexed data from the stream I / O ex 506 to the outside.
- the output multiplexed data is transmitted toward the base station ex 107 or written to the recording medium ex 215. Note that data may be temporarily stored in the buffer ex 508 so as to be synchronized when multiplexing.
- the memory ex 511 has been described as an external configuration of the LSI ex 500, but may be included in the LSI ex 500.
- the buffer ex 508 is not limited to one, and may have a plurality of buffers.
- the LSI ex 500 may be integrated into one chip or a plurality of chips.
- control unit ex501 includes the CPU ex502, the memory controller ex503, the stream controller ex504, the drive frequency control unit ex512, and the like
- the configuration of the control unit ex501 is not limited to this.
- the signal processing unit ex507 may further include a CPU.
- the processing speed can be further improved by providing the CPU also inside the signal processing unit ex507.
- the CPU ex 502 may be configured to include the signal processing unit ex 507 or, for example, an audio signal processing unit which is a part of the signal processing unit ex 507.
- the control unit ex501 includes the signal processing unit ex507 or the CPU ex502 including a part of the signal processing unit ex507.
- LSI LSI
- IC system LSI
- super LSI ultra LSI
- the method of circuit integration is not limited to LSI's, and implementation using dedicated circuitry or general purpose processors is also possible.
- a programmable field programmable gate array FPGA
- a reconfigurable processor that can reconfigure connection and setting of circuit cells in the LSI may be used.
- FIG. 55 shows a configuration ex800 in the present embodiment.
- the drive frequency switching unit ex803 sets the drive frequency high. Then, it instructs a decoding processing unit ex801 that executes the moving picture decoding method described in each of the above embodiments to decode video data.
- the video data is video data conforming to the conventional standard, as compared with the case where the video data is generated by the moving picture coding method or apparatus described in each of the above embodiments, Set the drive frequency low. Then, it instructs the decoding processing unit ex802 conforming to the conventional standard to decode the video data.
- drive frequency switching unit ex803 includes CPU ex502 and drive frequency control unit ex512 shown in FIG.
- the decoding processing unit ex801 that executes the moving picture decoding method described in each of the above embodiments and the decoding processing unit ex802 that conforms to the conventional standard correspond to the signal processing unit ex507 in FIG.
- the CPU ex 502 identifies which standard the video data conforms to.
- drive frequency control unit ex512 sets the drive frequency.
- the signal processing unit ex 507 decodes the video data.
- the identification information is not limited to that described in the tenth embodiment, and may be any information that can identify which standard the video data conforms to. For example, it is possible to identify which standard the video data conforms to, based on an external signal identifying whether the video data is to be used for a television or to be used for a disc, etc. In this case, identification may be made based on such an external signal. Further, it is conceivable that the selection of the drive frequency in the CPU ex 502 is performed based on, for example, a look-up table in which the standard of video data as shown in FIG. 57 is associated with the drive frequency. The look-up table is stored in the buffer ex508 or the internal memory of the LSI, and the CPU ex 502 can select the drive frequency by referring to the look-up table.
- FIG. 56 shows the steps for implementing the method of the present embodiment.
- the signal processing unit ex507 acquires identification information from multiplexed data.
- the CPU ex502 determines, based on the identification information, whether the video data is generated by the encoding method or apparatus described in each of the above embodiments.
- the CPU ex 502 sends a signal for setting the drive frequency high to the drive frequency control unit ex 512 in step exS 202.
- the drive frequency control unit ex512 sets the drive frequency to a high drive frequency.
- the CPU ex 502 drives a signal for setting the drive frequency low in step exS203. It sends to the frequency control unit ex512.
- the drive frequency control unit ex512 sets the drive frequency lower than that in the case where the video data is generated by the encoding method or apparatus described in each of the above embodiments.
- the power saving effect can be further enhanced by changing the voltage to be applied to the LSI ex 500 or the device including the LSI ex 500 in conjunction with the switching of the driving frequency. For example, when setting the driving frequency low, it is conceivable to set the voltage to be applied to the device including the LSI ex 500 or the LSI ex 500 lower than when setting the driving frequency high accordingly.
- the method of setting the drive frequency may set the drive frequency high when the processing amount at the time of decoding is large, and may set the drive frequency low when the processing amount at the time of decoding is small. It is not limited to the method. For example, when the processing amount of decoding video data compliant with the MPEG4-AVC standard is larger than the processing amount of decoding video data generated by the moving picture coding method or apparatus described in each of the above embodiments. It is conceivable that the setting of the driving frequency is reversed to the above.
- the method of setting the drive frequency is not limited to the configuration in which the drive frequency is lowered.
- the voltage applied to the LSI ex500 or a device including the LSI ex500 is set high. If it is indicated that the video data conforms to the conventional MPEG-2, MPEG4-AVC, VC-1, etc., it may be considered to set a low voltage to a device including the LSI ex500 or the LSI ex500.
- the CPU ex502 is stopped.
- the processing of the CPU ex 502 is temporarily stopped because there is room for processing.
- the identification information indicates that the video data is generated by the moving picture coding method or apparatus described in each of the above embodiments
- the CPU ex 502 is temporarily driven if there is an allowance in processing. It is also conceivable to stop it. In this case, it is conceivable to set the stop time shorter than in the case where it is shown that the video data conforms to the conventional standards such as MPEG-2, MPEG4-AVC, VC-1.
- power saving can be achieved by switching the drive frequency in accordance with the standard to which the video data conforms. Further, in the case where a battery is used to drive the LSI ex500 or a device including the LSI ex500, it is possible to extend the life of the battery with power saving.
- a plurality of video data conforming to different standards may be input to the devices and systems described above such as a television and a mobile phone.
- the signal processing unit ex 507 of the LSI ex 500 needs to correspond to a plurality of standards.
- the circuit scale of the LSI ex500 becomes large, and the cost increases.
- a decoding processing unit for executing the moving picture decoding method described in each of the above embodiments and a decoding conforming to the conventional standards such as MPEG-2, MPEG4-AVC, VC-1 etc.
- the configuration is such that a part of the processing unit is shared.
- An example of this configuration is shown in ex 900 of FIG. 58A.
- the moving picture decoding method described in each of the above embodiments and the moving picture decoding method conforming to the MPEG4-AVC standard are processed in processing such as entropy coding, dequantization, deblocking filter, motion compensation, etc. Some content is common.
- the decoding processing unit ex902 corresponding to the MPEG4-AVC standard is shared, and for the other processing content specific to one aspect of the present invention not corresponding to the MPEG4-AVC standard, a dedicated decoding processing unit A configuration in which ex901 is used can be considered.
- a dedicated decoding processing unit ex901 is used for motion compensation, and other entropy decoding, deblocking filter, dequantization, etc.
- the common processing content shares the decoding processing unit for executing the moving picture decoding method described in each of the above embodiments, and processing content specific to the MPEG4-AVC standard
- the configuration may use a dedicated decoding processing unit.
- ex1000 of FIG. 58B another example of partially sharing the process is illustrated in ex1000 of FIG. 58B.
- a dedicated decoding processing unit ex1001 corresponding to processing specific to one aspect of the present invention
- a dedicated decoding processing unit ex1002 corresponding to processing specific to another conventional standard
- a common decoding processing unit ex1003 corresponding to the processing content common to the moving picture decoding method according to and the moving picture decoding method according to another conventional standard is used.
- the dedicated decoding processing units ex1001 and ex1002 are not necessarily specialized to processing contents specific to one aspect of the present invention or other conventional standards, and can execute other general-purpose processing, It is also good.
- the configuration of the present embodiment can be implemented by the LSI ex500.
- the circuit size of the LSI is reduced by sharing the decoding processing unit with respect to the processing content common to the moving picture decoding method according to one aspect of the present invention and the moving picture decoding method according to the conventional standard. And, it is possible to reduce the cost.
- the image coding method and the image decoding method according to an aspect of the present invention are advantageously used for a moving image coding method and a decoding method.
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
- Computing Systems (AREA)
- Theoretical Computer Science (AREA)
Abstract
Description
既に標準化されている、H.264と呼ばれる動画像符号化方式では、情報量の圧縮のために、Iピクチャ、Pピクチャ、Bピクチャという3種類のピクチャタイプが用いられている。
図9は、実施の形態1に係る画像符号化装置の構成を示すブロック図である。画像符号化装置100は、画像をブロック毎に符号化することでビットストリームを生成する。
Cost=D+λR
scaledMV_Merge=MV_Merge×(POC(RefIdx_ME)-curPOC)/(POC(RefIdx_Merge)-curPOC)
上記実施の形態1では、マージブロック候補算出部114は、図15のステップS145において、zeroマージブロック候補が重複候補であるかどうかを判定したが、必ずしもこのように判定する必要はない。例えば、ステップS145の判定は省略されてもよい。これにより、画像符号化装置100は、マージブロック候補の導出の処理量を削減することができる。
図20は、実施の形態3に係る画像復号装置300の構成を示すブロック図である。この画像復号装置300は、実施の形態1に係る画像符号化装置100に対応する装置である。画像復号装置300は、例えば、実施の形態1に係る画像符号化装置100によって生成されたビットストリームに含まれる符号化画像をブロック毎に復号する。
上記実施の形態3に係る画像復号装置は、図20に示すような構成要素を備えていたが、必ずしもすべての構成要素を備える必要はない。以下に、実施の形態3に係る画像復号装置の変形例として、実施の形態4に係る画像復号装置を具体的に説明する。
実施の形態5では、マージブロック候補リストサイズの導出方法が実施の形態1と異なる。本実施の形態におけるマージブロック候補リストサイズの導出方法について詳細に説明する。
上記実施の形態5では、画像符号化装置は、co-locatedマージブロックがマージ可能候補かどうかに関らず、マージブロック候補がco-locatedマージブロックであれば常に1を加算するようにして算出したマージ可能候補数を用いて、マージブロックインデックスに割り当てるビット列を決定した。しかしながら、画像符号化装置は、例えば、図28のステップS524において、co-locatedマージブロック以外のマージブロック候補に対しても、必ず常に1を加算するようにして算出したマージ可能候補数を用いて、マージブロックインデックスに割り当てるビット列を決定してもよい。すなわち、画像符号化装置は、マージブロック候補数の最大値Nに固定されたマージブロック候補リストサイズを用いて、マージブロックインデックスにビット列を割り当てても構わない。つまり、画像符号化装置は、全てのマージブロック候補をマージ可能候補とみなし、マージブロック候補リストサイズを、マージブロック候補数の最大値Nに固定して、マージブロックインデックスを符号化しても構わない。
実施の形態7では、マージブロック候補リストサイズの導出方法が実施の形態3と異なる。本実施の形態におけるマージブロック候補リストサイズの導出方法について詳細に説明する。
上記実施の形態7では、画像復号装置は、co-locatedマージブロックがマージ可能候補かどうかに関らず、マージブロック候補がco-locatedマージブロックであれば常に1を加算するようにして算出したマージ可能候補数を用いて、マージブロックインデックスに割り当てるビット列を決定した。しかしながら、画像復号装置は、例えば、図34のステップS714において、co-locatedマージブロック以外のマージブロック候補に対しても、必ず常に1を加算するようにして算出したマージ可能候補数を用いて、マージブロックインデックスに割り当てるビット列を決定してもよい。すなわち、画像復号装置は、マージブロック候補数の最大値Nに固定されたマージブロック候補リストサイズを用いて、マージブロックインデックスにビット列を割り当てても構わない。つまり、画像復号装置は、全てのマージブロック候補をマージ可能候補とみなし、マージブロック候補リストサイズを、マージブロック候補数の最大値Nに固定して、マージブロックインデックスを復号しても構わない。
上記各実施の形態で示した動画像符号化方法(画像符号化方法)または動画像復号化方法(画像復号方法)の構成を実現するためのプログラムを記憶メディアに記録することにより、上記各実施の形態で示した処理を独立したコンピュータシステムにおいて簡単に実施することが可能となる。記憶メディアは、磁気ディスク、光ディスク、光磁気ディスク、ICカード、半導体メモリ等、プログラムを記録できるものであればよい。
上記各実施の形態で示した動画像符号化方法または装置と、MPEG-2、MPEG4-AVC、VC-1など異なる規格に準拠した動画像符号化方法または装置とを、必要に応じて適宜切替えることにより、映像データを生成することも可能である。
上記各実施の形態で示した動画像符号化方法および装置、動画像復号化方法および装置は、典型的には集積回路であるLSIで実現される。一例として、図54に1チップ化されたLSIex500の構成を示す。LSIex500は、以下に説明する要素ex501、ex502、ex503、ex504、ex505、ex506、ex507、ex508、ex509を備え、各要素はバスex510を介して接続している。電源回路部ex505は電源がオン状態の場合に各部に対して電力を供給することで動作可能な状態に起動する。
上記各実施の形態で示した動画像符号化方法または装置によって生成された映像データを復号する場合、従来のMPEG-2、MPEG4-AVC、VC-1などの規格に準拠する映像データを復号する場合に比べ、処理量が増加することが考えられる。そのため、LSIex500において、従来の規格に準拠する映像データを復号する際のCPUex502の駆動周波数よりも高い駆動周波数に設定する必要がある。しかし、駆動周波数を高くすると、消費電力が高くなるという課題が生じる。
テレビや、携帯電話など、上述した機器・システムには、異なる規格に準拠する複数の映像データが入力される場合がある。このように、異なる規格に準拠する複数の映像データが入力された場合にも復号できるようにするために、LSIex500の信号処理部ex507が複数の規格に対応している必要がある。しかし、それぞれの規格に対応する信号処理部ex507を個別に用いると、LSIex500の回路規模が大きくなり、また、コストが増加するという課題が生じる。
101 減算部
102 直交変換部
103 量子化部
104、302 逆量子化部
105、303 逆直交変換部
106、304 加算部
107、305 ブロックメモリ
108、306 フレームメモリ
109、307 イントラ予測部
110、308 インター予測部
111、309 インター予測制御部
112 ピクチャタイプ決定部
113、310 スイッチ
114、311、514、711 マージブロック候補算出部
115、312 colPicメモリ
116、516 可変長符号化部
210、410、610、810 マージ候補導出部
211、411、612、812 第1導出部
212、412、615、815 第2導出部
220、430、620、830 予測制御部
230、630 符号化部
300、400、700、800 画像復号装置
301、701 可変長復号部
420、820 復号部
611、811 決定部
613、813 特定部
614、814 判定部
Claims (19)
- 画像をブロック毎に符号化することでビットストリームを生成する画像符号化方法であって、
符号化対象ブロックに空間的または時間的に隣接するブロックの符号化に用いられた予測方向、動きベクトルおよび参照ピクチャインデックスに基づいて、前記符号化対象ブロックの符号化に用いられる予測方向、動きベクトルおよび参照ピクチャインデックスの候補であるマージ候補を第1マージ候補として導出する第1導出ステップと、
予め定められたベクトルを動きベクトルとして持つマージ候補を第2マージ候補として導出する第2導出ステップと、
導出された前記第1マージ候補および前記第2マージ候補の中から、前記符号化対象ブロックの符号化に用いられるマージ候補を選択する選択ステップと、
選択された前記マージ候補を特定するためのインデックスを前記ビットストリームに付加する符号化ステップとを含む
画像符号化方法。 - 前記第2導出ステップでは、参照可能な参照ピクチャ毎に前記第2マージ候補を導出する
請求項1に記載の画像符号化方法。 - 前記予め定められたベクトルは、零ベクトルである
請求項1または2に記載の画像符号化方法。 - 前記画像符号化方法は、さらに、
マージ候補の最大数を決定する決定ステップと、
導出された前記第1マージ候補の数が前記最大数より小さいか否かを判定する判定ステップとを含み、
前記第2導出ステップでは、前記第1マージ候補の数が前記最大数より小さいと判定された場合に、前記第2マージ候補を導出する
請求項1~3のいずれか1項に記載の画像符号化方法。 - 前記符号化ステップでは、決定された前記最大数を用いて前記インデックスを符号化し、符号化された前記インデックスを前記ビットストリームに付加する
請求項4に記載の画像符号化方法。 - 前記符号化ステップでは、さらに、決定された前記最大数を示す情報を前記ビットストリームに付加する
請求項4または5に記載の画像符号化方法。 - 前記第1導出ステップでは、予測方向、動きベクトルおよび参照ピクチャインデックスの組合せが既に導出された第1マージ候補と重複しないマージ候補を前記第1マージ候補として導出する
請求項1~6のいずれか1項に記載の画像符号化方法。 - 前記画像符号化方法は、さらに、
第1規格に準拠する第1符号化処理、または第2規格に準拠する第2符号化処理に、符号化処理を切り替える切り替えステップと、
切り替えられた前記符号化処理が準拠する前記第1規格または前記第2規格を示す識別情報を前記ビットストリームに付加する付加ステップとを含み、
前記符号化処理が前記第1符号化処理に切り替えられた場合に、前記第1符号化処理として、前記第1導出ステップと、前記第2導出ステップと、前記選択ステップと、前記符号化ステップとが行われる
請求項1に記載の画像符号化方法。 - 画像をブロック毎に符号化することでビットストリームを生成する画像符号化装置であって、
符号化対象ブロックに空間的または時間的に隣接するブロックの符号化に用いられた予測方向、動きベクトルおよび参照ピクチャインデックスに基づいて、前記符号化対象ブロックの符号化に用いられる予測方向、動きベクトルおよび参照ピクチャインデックスの候補であるマージ候補を第1マージ候補として導出する第1導出部と、
予め定められたベクトルを動きベクトルとして持つマージ候補を第2マージ候補として導出する第2導出部と、
導出された前記第1マージ候補および前記第2マージ候補の中から、前記符号化対象ブロックの符号化に用いられるマージ候補を選択する予測制御部と、
選択された前記マージ候補を特定するためのインデックスを前記ビットストリームに付加する符号化部とを備える
画像符号化装置。 - ビットストリームに含まれる符号化画像をブロック毎に復号する画像復号方法であって、
復号対象ブロックに空間的または時間的に隣接するブロックの復号に用いられた予測方向、動きベクトルおよび参照ピクチャインデックスに基づいて、前記復号対象ブロックの復号に用いられる予測方向、動きベクトルおよび参照ピクチャインデックスの候補であるマージ候補を第1マージ候補として導出する第1導出ステップと、
予め定められたベクトルを動きベクトルとして持つマージ候補を第2マージ候補として導出する第2導出ステップと、
前記ビットストリームから、マージ候補を特定するためのインデックスを取得する取得ステップと、
取得された前記インデックスに基づいて、前記第1マージ候補および前記第2マージ候補の中から、前記復号対象ブロックの復号に用いられるマージ候補を選択する選択ステップとを含む
画像復号方法。 - 前記第2導出ステップでは、参照可能な参照ピクチャ毎に前記第2マージ候補を導出する
請求項10に記載の画像復号方法。 - 前記予め定められたベクトルは、零ベクトルである
請求項10または11に記載の画像復号方法。 - 前記画像復号方法は、さらに、
マージ候補の最大数を決定する決定ステップと、
導出された前記第1マージ候補の数が前記最大数より小さいか否かを判定する判定ステップとを含み、
前記第2導出ステップでは、導出された前記第1マージ候補の数が前記最大数より小さいと判定された場合に、前記第2マージ候補を導出する
請求項10~12のいずれか1項に記載の画像復号方法。 - 前記取得ステップでは、前記ビットストリームに付加された符号化された前記インデックスを、決定された前記最大数を用いて復号することにより、前記インデックスを取得する
請求項13に記載の画像復号方法。 - 前記決定ステップでは、前記ビットストリームに付加された最大数を示す情報に基づいて、前記最大数を決定する
請求項13または14に記載の画像復号方法。 - 前記第1導出ステップでは、予測方向、動きベクトルおよび参照ピクチャインデックスの組合せが既に導出された第1マージ候補と重複しないマージ候補を前記第1マージ候補として導出する
請求項10~15のいずれか1項に記載の画像復号方法。 - 前記画像復号方法は、さらに、
前記ビットストリームに付加された第1規格または第2規格を示す識別情報に応じて、前記第1規格に準拠する第1復号処理、または前記第2規格に準拠する第2復号処理に、復号処理を切り替える切り替えステップを含み、
前記復号処理が第1復号処理に切り替えられた場合に、前記第1復号処理として、前記第1導出ステップと、前記第2導出ステップと、前記取得ステップと、前記選択ステップとが行われる
請求項10に記載の画像復号方法。 - ビットストリームに含まれる符号化画像をブロック毎に復号する画像復号装置であって、
復号対象ブロックに空間的または時間的に隣接するブロックの復号に用いられた予測方向、動きベクトルおよび参照ピクチャインデックスに基づいて、前記復号対象ブロックの復号に用いられる予測方向、動きベクトルおよび参照ピクチャインデックスの候補であるマージ候補を第1マージ候補として導出する第1導出部と、
予め定められたベクトルを動きベクトルとして持つマージ候補を第2マージ候補として導出する第2導出部と、
前記ビットストリームから、マージ候補を特定するためのインデックスを取得する復号部と、
取得された前記インデックスに基づいて、前記第1マージ候補および前記第2マージ候補の中から、前記復号対象ブロックの復号に用いられるマージ候補を選択する予測制御部とを備える
画像復号装置。 - 請求項9に記載の画像符号化装置と、
請求項18に記載の画像復号装置とを備える
画像符号化復号装置。
Priority Applications (16)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201280022673.6A CN103518376B (zh) | 2011-05-27 | 2012-05-24 | 图像编码方法、图像编码装置、图像解码方法、图像解码装置及图像编码解码装置 |
EP19203347.0A EP3614665B1 (en) | 2011-05-27 | 2012-05-24 | Apparatus, method and program for decoding moving pictures |
PL12792164T PL2717575T3 (pl) | 2011-05-27 | 2012-05-24 | Sposób dekodowania obrazów i urządzenie do dekodowania obrazów |
PL19203347T PL3614665T3 (pl) | 2011-05-27 | 2012-05-24 | Sposób kodowania obrazów, urządzenie do kodowania obrazów, sposób dekodowania obrazów, urządzenie do dekodowania obrazów, i urządzenie do kodowania i dekodowania obrazów |
MX2013012132A MX2013012132A (es) | 2011-05-27 | 2012-05-24 | Metodo de codificacion de imagen, aparato de codificacion de imagen, metodo de decodificacion de imagen, aparato de decodificacion de imagen y aparato de codificacion/decodificacion de imagen. |
CA2834123A CA2834123C (en) | 2011-05-27 | 2012-05-24 | Image coding method, image coding apparatus, image decoding method, image decoding apparatus, and image coding and decoding apparatus |
PL18185426T PL3410718T3 (pl) | 2011-05-27 | 2012-05-24 | Sposób kodowania obrazów i urządzenie do kodowania obrazów |
EP22152651.0A EP4007276B1 (en) | 2011-05-27 | 2012-05-24 | Apparatus, method and program for coding moving pictures |
BR112013027344-5A BR112013027344B1 (pt) | 2011-05-27 | 2012-05-24 | Método de codificação de imagem, aparelho de codificação de imagem, método de decodificação de imagem, aparelho de decodificação de imagem, e aparelho de codificação e decodificação de imagem |
KR1020137028245A KR101896734B1 (ko) | 2011-05-27 | 2012-05-24 | 화상 부호화 방법, 화상 부호화 장치, 화상 복호 방법, 화상 복호 장치, 및, 화상 부호화 복호 장치 |
EP23160314.3A EP4213483A1 (en) | 2011-05-27 | 2012-05-24 | Image coding method, image coding apparatus, image decoding method, image decoding apparatus, and image coding and decoding apparatus |
JP2013517853A JP5865366B2 (ja) | 2011-05-27 | 2012-05-24 | 画像符号化方法、画像符号化装置、画像復号方法、画像復号装置、および、画像符号化復号装置 |
EP18185426.6A EP3410718B8 (en) | 2011-05-27 | 2012-05-24 | Image coding method and image coding apparatus, |
ES12792164T ES2703799T3 (es) | 2011-05-27 | 2012-05-24 | Procedimiento de decodificación de imágenes y dispositivo de decodificación de imágenes |
EP12792164.1A EP2717575B1 (en) | 2011-05-27 | 2012-05-24 | Image decoding method and image decoding device |
DK12792164.1T DK2717575T3 (en) | 2011-05-27 | 2012-05-24 | PICTURE CODING PROCEDURE AND PICTURE CODES |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US201161490777P | 2011-05-27 | 2011-05-27 | |
US61/490,777 | 2011-05-27 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2012164880A1 true WO2012164880A1 (ja) | 2012-12-06 |
Family
ID=47258757
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2012/003386 WO2012164880A1 (ja) | 2011-05-27 | 2012-05-24 | 画像符号化方法、画像符号化装置、画像復号方法、画像復号装置、および、画像符号化復号装置 |
Country Status (15)
Country | Link |
---|---|
US (9) | US9615107B2 (ja) |
EP (5) | EP4213483A1 (ja) |
JP (2) | JP5865366B2 (ja) |
KR (1) | KR101896734B1 (ja) |
CN (1) | CN103518376B (ja) |
BR (1) | BR112013027344B1 (ja) |
CA (3) | CA3062382C (ja) |
DK (1) | DK2717575T3 (ja) |
ES (4) | ES2769378T3 (ja) |
MX (1) | MX2013012132A (ja) |
MY (1) | MY173463A (ja) |
PL (4) | PL3614665T3 (ja) |
TR (1) | TR201819396T4 (ja) |
TW (1) | TW201311008A (ja) |
WO (1) | WO2012164880A1 (ja) |
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2013168929A (ja) * | 2012-01-18 | 2013-08-29 | Jvc Kenwood Corp | 動画像符号化装置、動画像符号化方法及び動画像符号化プログラム |
JP2013168930A (ja) * | 2012-01-18 | 2013-08-29 | Jvc Kenwood Corp | 動画像復号装置、動画像復号方法及び動画像復号プログラム |
JP2013236366A (ja) * | 2012-04-12 | 2013-11-21 | Jvc Kenwood Corp | 動画像符号化装置、動画像符号化方法、動画像符号化プログラム、送信装置、送信方法及び送信プログラム |
JP2013236367A (ja) * | 2012-04-12 | 2013-11-21 | Jvc Kenwood Corp | 動画像復号装置、動画像復号方法、動画像復号プログラム、受信装置、受信方法及び受信プログラム |
JP2014520453A (ja) * | 2011-06-14 | 2014-08-21 | サムスン エレクトロニクス カンパニー リミテッド | 動き情報の符号化方法及びその装置、その復号化方法及びその装置 |
JP2016195441A (ja) * | 2011-10-31 | 2016-11-17 | 株式会社Jvcケンウッド | 動画像復号装置、動画像復号方法、動画像復号プログラム、受信装置、受信方法及び受信プログラム |
US9872038B2 (en) | 2012-04-12 | 2018-01-16 | JVC Kenwood Corporation | Moving picture coding device, moving picture coding method, and moving picture coding program |
Families Citing this family (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9066110B2 (en) | 2011-03-08 | 2015-06-23 | Texas Instruments Incorporated | Parsing friendly and error resilient merge flag coding in video coding |
EP2698999B1 (en) | 2011-04-12 | 2017-01-04 | Sun Patent Trust | Motion-video encoding method, motion-video encoding apparatus, motion-video decoding method, motion-video decoding apparatus, and motion-video encoding/decoding apparatus |
JP5865366B2 (ja) * | 2011-05-27 | 2016-02-17 | パナソニック インテレクチュアル プロパティ コーポレーション オブアメリカPanasonic Intellectual Property Corporation of America | 画像符号化方法、画像符号化装置、画像復号方法、画像復号装置、および、画像符号化復号装置 |
US9866859B2 (en) * | 2011-06-14 | 2018-01-09 | Texas Instruments Incorporated | Inter-prediction candidate index coding independent of inter-prediction candidate list construction in video coding |
PL2728878T3 (pl) | 2011-06-30 | 2020-06-15 | Sun Patent Trust | Sposób dekodowania obrazów, sposób kodowania obrazów, urządzenie do dekodowania obrazów, urządzenie do kodowania obrazów oraz urządzenie do kodowania/dekodowania obrazów |
WO2013011640A1 (ja) | 2011-07-18 | 2013-01-24 | パナソニック株式会社 | 画像符号化方法、画像復号方法、画像符号化装置、画像復号装置および画像符号化復号装置 |
MX2013010003A (es) | 2011-08-11 | 2013-12-06 | Panasonic Corp | Metodo de codificacion de imagenes, metodo de decodificacion de imagenes, aparato de codificacion de imagenes, aparato de decodificacion de imagenes y aparato de codificacion y decodificacion de imagenes. |
BR112014008403B1 (pt) | 2011-10-19 | 2022-05-10 | Sun Patent Trust | Método de codificação de imagem, aparelho de codificação de imagem, método de decodificação de imagem, e aparelho de decodificação de imagem |
JP6569677B2 (ja) * | 2014-08-28 | 2019-09-04 | 日本電気株式会社 | ブロックサイズ決定方法及びプログラム |
EP3202143B8 (en) * | 2014-11-18 | 2019-09-25 | MediaTek Inc. | Method of bi-prediction video coding based on motion vectors from uni-prediction and merge candidate |
MA41611A (fr) * | 2015-02-23 | 2018-01-02 | Omthera Pharmaceuticals Inc | Préparations en milli-capsules comprenant des acides gras polyinsaturés libres |
KR20190044533A (ko) | 2017-10-20 | 2019-04-30 | 주식회사 케이티 | 비디오 신호 처리 방법 및 장치 |
CN112166612A (zh) * | 2018-05-23 | 2021-01-01 | 株式会社Kt | 用于处理视频信号的方法和设备 |
US11394959B2 (en) * | 2018-06-29 | 2022-07-19 | Kt Corporation | Method and apparatus for processing video signal |
KR20230008900A (ko) * | 2019-03-12 | 2023-01-16 | 베이징 다지아 인터넷 인포메이션 테크놀로지 컴퍼니 리미티드 | 삼각형 예측을 위한 비디오 코딩 방법 및 장치 |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2006019093A1 (ja) * | 2004-08-16 | 2006-02-23 | Nippon Telegraph And Telephone Corporation | 画像符号化方法,画像復号方法,画像符号化装置,画像復号装置,画像符号化プログラムおよび画像復号プログラム |
Family Cites Families (149)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0314018B1 (en) | 1987-10-30 | 1993-09-01 | Nippon Telegraph And Telephone Corporation | Method and apparatus for multiplexed vector quantization |
FR2725577B1 (fr) | 1994-10-10 | 1996-11-29 | Thomson Consumer Electronics | Procede de codage ou de decodage de vecteurs mouvement et dispositif de codage ou de decodage mettant en oeuvre ledit procede |
US5995080A (en) | 1996-06-21 | 1999-11-30 | Digital Equipment Corporation | Method and apparatus for interleaving and de-interleaving YUV pixel data |
JP3263807B2 (ja) | 1996-09-09 | 2002-03-11 | ソニー株式会社 | 画像符号化装置および画像符号化方法 |
US6148026A (en) | 1997-01-08 | 2000-11-14 | At&T Corp. | Mesh node coding to enable object based functionalities within a motion compensated transform video coder |
JPH10224800A (ja) | 1997-02-07 | 1998-08-21 | Matsushita Electric Ind Co Ltd | 動きベクトル符号化方法および復号化方法 |
US6043838A (en) * | 1997-11-07 | 2000-03-28 | General Instrument Corporation | View offset estimation for stereoscopic video coding |
JP4004653B2 (ja) | 1998-08-03 | 2007-11-07 | カスタム・テクノロジー株式会社 | 動きベクトル検出方法および装置、記録媒体 |
US6192148B1 (en) | 1998-11-05 | 2001-02-20 | Winbond Electronics Corp. | Method for determining to skip macroblocks in encoding video |
US6192080B1 (en) | 1998-12-04 | 2001-02-20 | Mitsubishi Electric Research Laboratories, Inc. | Motion compensated digital video signal processing |
US6594313B1 (en) | 1998-12-23 | 2003-07-15 | Intel Corporation | Increased video playback framerate in low bit-rate video applications |
JP4487374B2 (ja) | 1999-06-01 | 2010-06-23 | ソニー株式会社 | 符号化装置及び符号化方法並びに多重化装置及び多重化方法 |
US6842483B1 (en) | 2000-09-11 | 2005-01-11 | The Hong Kong University Of Science And Technology | Device, method and digital video encoder for block-matching motion estimation |
JP2002152750A (ja) | 2000-11-10 | 2002-05-24 | Matsushita Electric Ind Co Ltd | 動きベクトル検出方法および装置 |
CN1913633B (zh) | 2001-11-06 | 2011-06-01 | 松下电器产业株式会社 | 运动图像编码方法 |
ES2665693T3 (es) * | 2001-11-06 | 2018-04-26 | Panasonic Intellectual Property Corporation Of America | Método de codificación de imágenes en movimiento y método de decodificación de imágenes en movimiento |
JP4015934B2 (ja) | 2002-04-18 | 2007-11-28 | 株式会社東芝 | 動画像符号化方法及び装置 |
JP2004088722A (ja) | 2002-03-04 | 2004-03-18 | Matsushita Electric Ind Co Ltd | 動画像符号化方法および動画像復号化方法 |
KR100931746B1 (ko) | 2002-04-19 | 2009-12-14 | 파나소닉 주식회사 | 움직임 벡터 계산방법 |
US20040146109A1 (en) * | 2002-04-19 | 2004-07-29 | Satoshi Kondo | Method for calculation motion vector |
TWI259726B (en) | 2002-04-19 | 2006-08-01 | Matsushita Electric Ind Co Ltd | Motion vector derivation method |
US20040001546A1 (en) | 2002-06-03 | 2004-01-01 | Alexandros Tourapis | Spatiotemporal prediction for bidirectionally predictive (B) pictures and motion vector prediction for multi-picture reference motion compensation |
CN1666532A (zh) * | 2002-07-02 | 2005-09-07 | 松下电器产业株式会社 | 图像编码方法和图像解码方法 |
US8406301B2 (en) | 2002-07-15 | 2013-03-26 | Thomson Licensing | Adaptive weighting of reference pictures in video encoding |
WO2004008773A1 (ja) | 2002-07-11 | 2004-01-22 | Matsushita Electric Industrial Co., Ltd. | フィルタリング強度の決定方法、動画像符号化方法、および動画像復号化方法 |
AU2003281133A1 (en) | 2002-07-15 | 2004-02-02 | Hitachi, Ltd. | Moving picture encoding method and decoding method |
US7154952B2 (en) | 2002-07-19 | 2006-12-26 | Microsoft Corporation | Timestamp-independent motion vector prediction for predictive (P) and bidirectionally predictive (B) pictures |
US7023921B2 (en) | 2002-08-06 | 2006-04-04 | Motorola, Inc. | Method and apparatus for determining block match quality |
KR100976017B1 (ko) * | 2002-08-08 | 2010-08-17 | 파나소닉 주식회사 | 동화상의 부호화 방법 및 복호화 방법 |
KR100506864B1 (ko) * | 2002-10-04 | 2005-08-05 | 엘지전자 주식회사 | 모션벡터 결정방법 |
EP1562385B1 (en) | 2002-11-01 | 2014-07-02 | Panasonic Corporation | Motion picture encoding method and motion picture decoding method |
KR100985236B1 (ko) | 2002-11-25 | 2010-10-04 | 파나소닉 주식회사 | 움직임 보상 방법, 화상 부호화 방법 및 화상 복호화 방법 |
MXPA05008404A (es) | 2003-02-18 | 2005-10-05 | Nokia Corp | Metodo de codificacion de imagen. |
KR100693669B1 (ko) | 2003-03-03 | 2007-03-09 | 엘지전자 주식회사 | 피일드 매크로 블록의 레퍼런스 픽쳐 결정 방법 |
US7266147B2 (en) | 2003-03-31 | 2007-09-04 | Sharp Laboratories Of America, Inc. | Hypothetical reference decoder |
EP1644835A4 (en) | 2003-07-15 | 2011-12-07 | Thomson Licensing | MOTION ESTIMATION WITH FAST SEARCH BLOCK COMPARISON |
US7426308B2 (en) | 2003-07-18 | 2008-09-16 | Microsoft Corporation | Intraframe and interframe interlace coding and decoding |
KR100579542B1 (ko) | 2003-07-29 | 2006-05-15 | 삼성전자주식회사 | 블럭 간의 상관성을 고려한 움직임 추정 장치 및 방법 |
US7746929B2 (en) | 2003-08-05 | 2010-06-29 | Trident Microsystems (Far East) Ltd. | Video encoding and decoding methods and corresponding devices |
US8064520B2 (en) | 2003-09-07 | 2011-11-22 | Microsoft Corporation | Advanced bi-directional predictive coding of interlaced video |
CN1225127C (zh) | 2003-09-12 | 2005-10-26 | 中国科学院计算技术研究所 | 一种用于视频编码的编码端/解码端双向预测方法 |
FR2860678A1 (fr) | 2003-10-01 | 2005-04-08 | Thomson Licensing Sa | Procede de codage differentiel |
GB2407006A (en) | 2003-10-08 | 2005-04-13 | Sony Uk Ltd | Communicating streamed payload data and packet based auxiliary data |
JP3675464B2 (ja) | 2003-10-29 | 2005-07-27 | ソニー株式会社 | 動画像符号化装置および動画像符号化制御方法 |
TWI330976B (en) | 2003-12-05 | 2010-09-21 | Trident Microsystems Far East | Method and apparatus for encoding/decoding dynamic graphic content |
US7301482B1 (en) | 2003-12-12 | 2007-11-27 | Marvell International Ltd. | Circuits, architectures, systems, methods, algorithms and software for conditional modulation coding |
JP2005184042A (ja) | 2003-12-15 | 2005-07-07 | Sony Corp | 画像復号装置及び画像復号方法並びに画像復号プログラム |
US8175444B2 (en) | 2004-01-14 | 2012-05-08 | Samsung Electronics Co., Ltd. | Method of reproducing from storage medium storing interactive graphics stream activated in response to user's command |
KR100608050B1 (ko) | 2004-01-14 | 2006-08-02 | 삼성전자주식회사 | 사용자의 요구에 의해 활성화되는 인터랙티브 그래픽스트림을 저장한 저장 매체, 재생 장치 및 그 재생 방법 |
EP1583367A1 (en) | 2004-03-30 | 2005-10-05 | Matsushita Electric Industrial Co., Ltd. | Motion estimation employing line and column vectors |
DE602004030993D1 (de) | 2004-04-30 | 2011-02-24 | Panasonic Corp | Bewegungsschätzung unter Verwendung von adaptiven räumlichen Verfeinerungsvektoren |
JP4145275B2 (ja) | 2004-07-27 | 2008-09-03 | 富士通株式会社 | 動きベクトル検出・補償装置 |
TWI250423B (en) | 2004-07-30 | 2006-03-01 | Ind Tech Res Inst | Method for processing video images |
EP1638333A1 (en) | 2004-09-17 | 2006-03-22 | Mitsubishi Electric Information Technology Centre Europe B.V. | Rate adaptive video coding |
JP4375305B2 (ja) | 2004-10-26 | 2009-12-02 | ソニー株式会社 | 情報処理装置および情報処理方法、記録媒体、並びに、プログラム |
JP4148228B2 (ja) | 2005-02-10 | 2008-09-10 | ソニー株式会社 | 画像記録装置、画像再生制御装置、画像記録再生制御装置、これらの装置の処理方法およびその方法をコンピュータに実行させるプログラム |
US7660354B2 (en) | 2005-05-11 | 2010-02-09 | Fang Shi | Temporal error concealment for bi-directionally predicted frames |
US8761258B2 (en) | 2005-06-17 | 2014-06-24 | The Hong Kong University Of Science And Technology | Enhanced block-based motion estimation algorithms for video compression |
US9661376B2 (en) | 2005-07-13 | 2017-05-23 | Polycom, Inc. | Video error concealment method |
EP1753242A2 (en) | 2005-07-18 | 2007-02-14 | Matsushita Electric Industrial Co., Ltd. | Switchable mode and prediction information coding |
US7697783B2 (en) | 2005-07-26 | 2010-04-13 | Sony Corporation | Coding device, coding method, decoding device, decoding method, and programs of same |
US20070025444A1 (en) | 2005-07-28 | 2007-02-01 | Shigeyuki Okada | Coding Method |
JP2008011455A (ja) | 2006-06-30 | 2008-01-17 | Sanyo Electric Co Ltd | 符号化方法 |
JP4401336B2 (ja) | 2005-08-31 | 2010-01-20 | 三洋電機株式会社 | 符号化方法 |
JP4570532B2 (ja) | 2005-08-02 | 2010-10-27 | パナソニック株式会社 | 動き検出装置、動き検出方法、集積回路およびプログラム |
US20070030894A1 (en) | 2005-08-03 | 2007-02-08 | Nokia Corporation | Method, device, and module for improved encoding mode control in video encoding |
JP2007142637A (ja) | 2005-11-16 | 2007-06-07 | Matsushita Electric Ind Co Ltd | 画像情報符号化装置 |
EP1980112B1 (en) | 2006-02-02 | 2012-10-24 | Thomson Licensing | Method and apparatus for adaptive weight selection for motion compensated prediction |
WO2007092192A2 (en) | 2006-02-02 | 2007-08-16 | Thomson Licensing | Method and apparatus for motion estimation using combined reference bi-prediction |
US20070200949A1 (en) | 2006-02-21 | 2007-08-30 | Qualcomm Incorporated | Rapid tuning in multimedia applications |
JP4757080B2 (ja) | 2006-04-03 | 2011-08-24 | パナソニック株式会社 | 動き検出装置、動き検出方法、動き検出集積回路および画像符号化装置 |
WO2007124491A2 (en) | 2006-04-21 | 2007-11-01 | Dilithium Networks Pty Ltd. | Method and system for video encoding and transcoding |
CN101090491B (zh) | 2006-06-16 | 2016-05-18 | 香港科技大学 | 用于视频压缩的增强的基于块的运动估计算法 |
KR20070120416A (ko) | 2006-06-19 | 2007-12-24 | 엘지전자 주식회사 | 비디오 신호 디코딩 방법 및 장치, 비디오 신호 인코딩방법 및 장치 |
EP2030450B1 (en) | 2006-06-19 | 2015-01-07 | LG Electronics Inc. | Method and apparatus for processing a video signal |
DE102006043707A1 (de) * | 2006-09-18 | 2008-03-27 | Robert Bosch Gmbh | Verfahren zur Datenkompression in einer Videosequenz |
US8250618B2 (en) | 2006-09-18 | 2012-08-21 | Elemental Technologies, Inc. | Real-time network adaptive digital video encoding/decoding |
US8213509B2 (en) | 2006-10-06 | 2012-07-03 | Calos Fund Limited Liability Company | Video coding on parallel processing systems |
US9319700B2 (en) | 2006-10-12 | 2016-04-19 | Qualcomm Incorporated | Refinement coefficient coding based on history of corresponding transform coefficient values |
US8599926B2 (en) | 2006-10-12 | 2013-12-03 | Qualcomm Incorporated | Combined run-length coding of refinement and significant coefficients in scalable video coding enhancement layers |
US8565314B2 (en) | 2006-10-12 | 2013-10-22 | Qualcomm Incorporated | Variable length coding table selection based on block type statistics for refinement coefficient coding |
US8325819B2 (en) | 2006-10-12 | 2012-12-04 | Qualcomm Incorporated | Variable length coding table selection based on video block type for refinement coefficient coding |
KR101023263B1 (ko) | 2006-10-30 | 2011-03-21 | 니폰덴신뎅와 가부시키가이샤 | 예측 참조 정보 생성방법, 동영상 부호화 및 복호방법, 그들의 장치 및 그들의 프로그램을 기록한 기억매체 |
JP2008199587A (ja) | 2007-01-18 | 2008-08-28 | Matsushita Electric Ind Co Ltd | 画像符号化装置、画像復号化装置および方法 |
JP5025286B2 (ja) | 2007-02-28 | 2012-09-12 | シャープ株式会社 | 符号化装置及び復号装置 |
TW200845758A (en) | 2007-05-03 | 2008-11-16 | Nat Univ Chung Cheng | Fast intra coding algorithms for dynamic definition adjustment |
KR101403341B1 (ko) | 2007-03-28 | 2014-06-09 | 삼성전자주식회사 | 영상의 부호화, 복호화 방법 및 장치 |
WO2008127597A2 (en) | 2007-04-12 | 2008-10-23 | Thomson Licensing | Method and apparatus for context dependent merging for skip-direct modes for video encoding and decoding |
WO2008136178A1 (ja) | 2007-04-26 | 2008-11-13 | Panasonic Corporation | 動き検出装置、動き検出方法、及び動き検出プログラム |
JP2008283490A (ja) | 2007-05-10 | 2008-11-20 | Ntt Docomo Inc | 動画像符号化装置、方法及びプログラム、並びに動画像復号化装置、方法及びプログラム |
WO2008156548A1 (en) | 2007-06-12 | 2008-12-24 | Thomson Licensing | Methods and apparatus supporting multi-pass video syntax structure for slice data |
KR101495886B1 (ko) * | 2007-07-19 | 2015-02-26 | 한국전자통신연구원 | 하향링크 프레임 생성 방법 및 셀 탐색 방법 |
EP2210421A4 (en) | 2007-10-16 | 2013-12-04 | Lg Electronics Inc | METHOD AND APPARATUS FOR PROCESSING A VIDEO SIGNAL |
KR101228020B1 (ko) | 2007-12-05 | 2013-01-30 | 삼성전자주식회사 | 사이드 매칭을 이용한 영상의 부호화 방법 및 장치, 그복호화 방법 및 장치 |
CN101198064A (zh) | 2007-12-10 | 2008-06-11 | 武汉大学 | 一种分辨率分层技术中的运动矢量预测方法 |
KR20090095012A (ko) | 2008-03-04 | 2009-09-09 | 삼성전자주식회사 | 연속적인 움직임 추정을 이용한 영상 부호화, 복호화 방법및 장치 |
JP2009218873A (ja) | 2008-03-11 | 2009-09-24 | Nec Personal Products Co Ltd | デジタル放送受信機、および、プログラム |
WO2009115901A2 (en) * | 2008-03-19 | 2009-09-24 | Nokia Corporation | Combined motion vector and reference index prediction for video coding |
CN102067601B (zh) | 2008-04-11 | 2014-03-12 | 汤姆森特许公司 | 视频编码和解码中模板匹配预测(tmp)的方法和装置 |
PL2288163T3 (pl) | 2008-05-07 | 2015-11-30 | Lg Electronics Inc | Sposób i urządzenie do dekodowania sygnału wideo |
PT104083A (pt) | 2008-06-02 | 2009-12-02 | Inst Politecnico De Leiria | Método para transcodificar imagens de vídeo h.264/avc em mpeg-2 |
CN102308580B (zh) | 2009-02-05 | 2016-05-04 | 汤姆森特许公司 | 用于自适应模式视频编码和解码的方法和装置 |
CN101931803B (zh) | 2009-06-26 | 2013-01-09 | 华为技术有限公司 | 视频图像运动信息获取方法、装置及设备、模板构造方法 |
KR101452859B1 (ko) | 2009-08-13 | 2014-10-23 | 삼성전자주식회사 | 움직임 벡터를 부호화 및 복호화하는 방법 및 장치 |
US9060176B2 (en) | 2009-10-01 | 2015-06-16 | Ntt Docomo, Inc. | Motion vector prediction in video coding |
EP2490449A1 (en) | 2009-10-16 | 2012-08-22 | Sharp Kabushiki Kaisha | Video coding device and video decoding device |
TWI566586B (zh) | 2009-10-20 | 2017-01-11 | 湯姆生特許公司 | 一序列形象的現時區塊之寫碼方法和重建方法 |
KR101459714B1 (ko) | 2009-10-28 | 2014-11-13 | 에스케이텔레콤 주식회사 | 공간 분할을 이용한 움직임 벡터 부호화/복호화 방법 및 장치와 그를 이용한 영상 부호화/복호화 방법 및 장치 |
KR101441905B1 (ko) | 2009-11-18 | 2014-09-24 | 에스케이텔레콤 주식회사 | 후보 예측 움직임 벡터 집합 선택을 이용한 움직임 벡터 부호화/복호화 방법 및 장치와 그를 이용한 영상 부호화/복호화 방법 및 장치 |
JPWO2011061880A1 (ja) | 2009-11-19 | 2013-04-04 | 三菱電機株式会社 | 画像符号化装置、画像復号装置、画像符号化方法及び画像復号方法 |
US9288495B2 (en) | 2009-11-24 | 2016-03-15 | Sk Telecom Co., Ltd. | Adaptive secondary prediction-based image encoding/decoding method, device and recording medium |
WO2011064673A1 (en) | 2009-11-30 | 2011-06-03 | France Telecom | Method of and apparatus for encoding video frames, method of and apparatus for decoding video frames |
CN101860754B (zh) | 2009-12-16 | 2013-11-13 | 香港应用科技研究院有限公司 | 运动矢量编码和解码的方法和装置 |
EP2514209A4 (en) | 2009-12-17 | 2014-03-26 | Ericsson Telefon Ab L M | METHOD AND DEVICE FOR VIDEO CODING |
US9036692B2 (en) | 2010-01-18 | 2015-05-19 | Mediatek Inc. | Motion prediction method |
BR112012019560B1 (pt) | 2010-02-05 | 2021-08-24 | Telefonaktiebolaget Lm Ericsson | Método para gerenciar candidatos a vetor de movimento predito, e, aparelhos de codificação e de decodificação de vídeo |
KR20120129944A (ko) | 2010-02-10 | 2012-11-28 | 엘지전자 주식회사 | 비디오 신호의 처리 방법 및 장치 |
US8995527B2 (en) | 2010-02-19 | 2015-03-31 | Qualcomm Incorporated | Block type signalling in video coding |
CN102439978A (zh) | 2010-03-12 | 2012-05-02 | 联发科技(新加坡)私人有限公司 | 运动预测方法 |
CN102210910B (zh) | 2010-04-02 | 2013-02-13 | 重庆融海超声医学工程研究中心有限公司 | 一种超声换能器 |
KR101752418B1 (ko) | 2010-04-09 | 2017-06-29 | 엘지전자 주식회사 | 비디오 신호 처리 방법 및 장치 |
KR102415787B1 (ko) * | 2010-05-04 | 2022-06-30 | 엘지전자 주식회사 | 비디오 신호의 처리 방법 및 장치 |
US9124898B2 (en) * | 2010-07-12 | 2015-09-01 | Mediatek Inc. | Method and apparatus of temporal motion vector prediction |
KR101861714B1 (ko) | 2010-09-02 | 2018-05-28 | 엘지전자 주식회사 | 영상 부호화 및 복호화 방법과 이를 이용한 장치 |
US10104391B2 (en) | 2010-10-01 | 2018-10-16 | Dolby International Ab | System for nested entropy encoding |
US20120082228A1 (en) | 2010-10-01 | 2012-04-05 | Yeping Su | Nested entropy encoding |
JP2012109720A (ja) | 2010-11-16 | 2012-06-07 | Panasonic Corp | 画像変換装置、画像再生装置及び画像変換方法 |
US8824558B2 (en) | 2010-11-23 | 2014-09-02 | Mediatek Inc. | Method and apparatus of spatial motion vector prediction |
US8976873B2 (en) | 2010-11-24 | 2015-03-10 | Stmicroelectronics S.R.L. | Apparatus and method for performing error concealment of inter-coded video frames |
US8711940B2 (en) | 2010-11-29 | 2014-04-29 | Mediatek Inc. | Method and apparatus of motion vector prediction with extended motion vector predictor |
US9509995B2 (en) | 2010-12-21 | 2016-11-29 | Intel Corporation | System and method for enhanced DMVD processing |
US9049455B2 (en) | 2010-12-28 | 2015-06-02 | Panasonic Intellectual Property Corporation Of America | Image coding method of coding a current picture with prediction using one or both of a first reference picture list including a first current reference picture for a current block and a second reference picture list including a second current reference picture for the current block |
KR102390352B1 (ko) * | 2011-01-07 | 2022-04-25 | 엘지전자 주식회사 | 영상 정보 부호화 방법 및 복호화 방법과 이를 이용한 장치 |
WO2012095467A1 (en) * | 2011-01-12 | 2012-07-19 | Canon Kabushiki Kaisha | Video encoding and decoding with low complexity |
US9319716B2 (en) | 2011-01-27 | 2016-04-19 | Qualcomm Incorporated | Performing motion vector prediction for video coding |
US9066110B2 (en) * | 2011-03-08 | 2015-06-23 | Texas Instruments Incorporated | Parsing friendly and error resilient merge flag coding in video coding |
EP3139611A1 (en) | 2011-03-14 | 2017-03-08 | HFI Innovation Inc. | Method and apparatus for deriving temporal motion vector prediction |
US9648334B2 (en) | 2011-03-21 | 2017-05-09 | Qualcomm Incorporated | Bi-predictive merge mode based on uni-predictive neighbors in video coding |
US9143795B2 (en) | 2011-04-11 | 2015-09-22 | Texas Instruments Incorporated | Parallel motion estimation in video coding |
EP2698999B1 (en) | 2011-04-12 | 2017-01-04 | Sun Patent Trust | Motion-video encoding method, motion-video encoding apparatus, motion-video decoding method, motion-video decoding apparatus, and motion-video encoding/decoding apparatus |
HUE037619T2 (hu) | 2011-05-24 | 2018-09-28 | Velos Media Int Ltd | Képkódoló eljárás, képkódoló berendezés, képdekódoló eljárás, képdekódoló berendezés és képkódoló/dekódoló berendezés |
JP5865366B2 (ja) * | 2011-05-27 | 2016-02-17 | パナソニック インテレクチュアル プロパティ コーポレーション オブアメリカPanasonic Intellectual Property Corporation of America | 画像符号化方法、画像符号化装置、画像復号方法、画像復号装置、および、画像符号化復号装置 |
US10264276B2 (en) | 2011-06-14 | 2019-04-16 | Samsung Electronics Co., Ltd. | Method and apparatus for encoding motion information and method and apparatus for decoding same |
US9866859B2 (en) | 2011-06-14 | 2018-01-09 | Texas Instruments Incorporated | Inter-prediction candidate index coding independent of inter-prediction candidate list construction in video coding |
US9282338B2 (en) | 2011-06-20 | 2016-03-08 | Qualcomm Incorporated | Unified merge mode and adaptive motion vector prediction mode candidates selection |
CN103636218B (zh) | 2011-06-30 | 2017-07-28 | Jvc建伍株式会社 | 图像解码装置和图像解码方法 |
KR102464103B1 (ko) | 2011-06-30 | 2022-11-04 | 가부시키가이샤 제이브이씨 켄우드 | 화상 부호화 장치, 화상 부호화 방법, 화상 부호화 프로그램, 화상 복호 장치, 화상 복호 방법 및 화상 복호 프로그램 |
US20140241434A1 (en) | 2011-10-11 | 2014-08-28 | Mediatek Inc | Method and apparatus of motion and disparity vector derivation for 3d video coding and hevc |
JP5870047B2 (ja) * | 2013-01-08 | 2016-02-24 | 住友ゴム工業株式会社 | 空気入りタイヤ |
-
2012
- 2012-05-24 JP JP2013517853A patent/JP5865366B2/ja active Active
- 2012-05-24 PL PL19203347T patent/PL3614665T3/pl unknown
- 2012-05-24 CA CA3062382A patent/CA3062382C/en active Active
- 2012-05-24 MY MYPI2013702009A patent/MY173463A/en unknown
- 2012-05-24 DK DK12792164.1T patent/DK2717575T3/en active
- 2012-05-24 BR BR112013027344-5A patent/BR112013027344B1/pt active IP Right Grant
- 2012-05-24 EP EP23160314.3A patent/EP4213483A1/en active Pending
- 2012-05-24 PL PL18185426T patent/PL3410718T3/pl unknown
- 2012-05-24 EP EP18185426.6A patent/EP3410718B8/en active Active
- 2012-05-24 EP EP12792164.1A patent/EP2717575B1/en active Active
- 2012-05-24 PL PL22152651.0T patent/PL4007276T3/pl unknown
- 2012-05-24 MX MX2013012132A patent/MX2013012132A/es active IP Right Grant
- 2012-05-24 ES ES18185426T patent/ES2769378T3/es active Active
- 2012-05-24 WO PCT/JP2012/003386 patent/WO2012164880A1/ja active Application Filing
- 2012-05-24 US US13/479,669 patent/US9615107B2/en active Active
- 2012-05-24 TR TR2018/19396T patent/TR201819396T4/tr unknown
- 2012-05-24 ES ES22152651T patent/ES2959039T3/es active Active
- 2012-05-24 PL PL12792164T patent/PL2717575T3/pl unknown
- 2012-05-24 ES ES19203347T patent/ES2911670T3/es active Active
- 2012-05-24 CA CA2834123A patent/CA2834123C/en active Active
- 2012-05-24 KR KR1020137028245A patent/KR101896734B1/ko active IP Right Grant
- 2012-05-24 CN CN201280022673.6A patent/CN103518376B/zh active Active
- 2012-05-24 EP EP19203347.0A patent/EP3614665B1/en active Active
- 2012-05-24 ES ES12792164T patent/ES2703799T3/es active Active
- 2012-05-24 EP EP22152651.0A patent/EP4007276B1/en active Active
- 2012-05-24 CA CA3197949A patent/CA3197949A1/en active Pending
- 2012-05-25 TW TW101118749A patent/TW201311008A/zh unknown
-
2015
- 2015-12-25 JP JP2015255441A patent/JP6089312B2/ja active Active
-
2017
- 2017-02-16 US US15/434,094 patent/US9838695B2/en active Active
- 2017-10-31 US US15/798,618 patent/US10034001B2/en active Active
-
2018
- 2018-06-14 US US16/008,533 patent/US10595023B2/en active Active
- 2018-12-18 US US16/224,059 patent/US10708598B2/en active Active
- 2018-12-18 US US16/223,998 patent/US10721474B2/en active Active
-
2020
- 2020-05-26 US US16/882,872 patent/US11115664B2/en active Active
-
2021
- 2021-07-30 US US17/389,892 patent/US11570444B2/en active Active
-
2022
- 2022-12-21 US US18/086,228 patent/US11979582B2/en active Active
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2006019093A1 (ja) * | 2004-08-16 | 2006-02-23 | Nippon Telegraph And Telephone Corporation | 画像符号化方法,画像復号方法,画像符号化装置,画像復号装置,画像符号化プログラムおよび画像復号プログラム |
Non-Patent Citations (6)
Title |
---|
"Advanced video coding for generic audiovisual services", ITU-T RECOMMENDATION H.264, March 2010 (2010-03-01) |
"WD3: Working Draft 3 of High-Efficiency Video Coding", JCTVC-E603, March 2011 (2011-03-01) |
BIN LI ET AL.: "On merge candidate construction", JOINT COLLABORATIVE TEAM ON VIDEO CODING (JCT-VC) OF ITU-T SG16 WP3 AND ISO/IEC JTC1/SC29/WG11 5TH MEETING, 16 March 2011 (2011-03-16), GENEVA, CH, XP008171154 * |
MINHUA ZHOU ET AL.: "A study on HM2.0 bitstream parsing and error resiliency issue", JOINT COLLABORATIVE TEAM ON VIDEO CODING (JCT- VC) OF ITU-T SG16 WP3 AND ISO/IEC JTC1/SC29/ WG11 5TH MEETING, 16 March 2011 (2011-03-16), GENEVA, CH, XP030048200 * |
See also references of EP2717575A4 |
THOMAS WIEGAND ET AL.: "WD3: Working Draft 3 of High-Efficiency Video Coding", JOINT COLLABORATIVE TEAM ON VIDEO CODING (JCT-VC) OF ITU-T SG16 WP3 AND ISO/IEC JTC1/SC29/WG11 5TH MEETING, 6 April 2011 (2011-04-06), GENEVA, CH, XP055114677 * |
Cited By (40)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10623766B2 (en) | 2011-06-14 | 2020-04-14 | Samsung Electronics Co., Ltd. | Method and apparatus for encoding motion information and method and apparatus for decoding same |
JP2017073807A (ja) * | 2011-06-14 | 2017-04-13 | サムスン エレクトロニクス カンパニー リミテッド | 映像の復号化方法 |
US11595684B2 (en) | 2011-06-14 | 2023-02-28 | Samsung Electronics Co., Ltd. | Method and apparatus for encoding motion information and method and apparatus for decoding same |
US10972748B2 (en) | 2011-06-14 | 2021-04-06 | Samsung Electronics Co., Ltd. | Method and apparatus for encoding motion information and method and apparatus for decoding same |
JP2016086447A (ja) * | 2011-06-14 | 2016-05-19 | サムスン エレクトロニクス カンパニー リミテッド | 動き情報の符号化方法及びその装置、その復号化方法及びその装置 |
JP2018129809A (ja) * | 2011-06-14 | 2018-08-16 | サムスン エレクトロニクス カンパニー リミテッド | 映像復号化方法、映像符号化方法及び記録媒体 |
US10264276B2 (en) | 2011-06-14 | 2019-04-16 | Samsung Electronics Co., Ltd. | Method and apparatus for encoding motion information and method and apparatus for decoding same |
JP2014520453A (ja) * | 2011-06-14 | 2014-08-21 | サムスン エレクトロニクス カンパニー リミテッド | 動き情報の符号化方法及びその装置、その復号化方法及びその装置 |
JP2016195441A (ja) * | 2011-10-31 | 2016-11-17 | 株式会社Jvcケンウッド | 動画像復号装置、動画像復号方法、動画像復号プログラム、受信装置、受信方法及び受信プログラム |
JP2013168929A (ja) * | 2012-01-18 | 2013-08-29 | Jvc Kenwood Corp | 動画像符号化装置、動画像符号化方法及び動画像符号化プログラム |
JP2014112864A (ja) * | 2012-01-18 | 2014-06-19 | Jvc Kenwood Corp | 動画像復号装置、動画像復号方法、及び動画像復号プログラム、並びに、受信装置、受信方法、及び受信プログラム |
JP2014112865A (ja) * | 2012-01-18 | 2014-06-19 | Jvc Kenwood Corp | 動画像復号装置、動画像復号方法、及び動画像復号プログラム、並びに、受信装置、受信方法、及び受信プログラム |
JP2014112862A (ja) * | 2012-01-18 | 2014-06-19 | Jvc Kenwood Corp | 動画像復号装置、動画像復号方法、及び動画像復号プログラム、並びに、受信装置、受信方法、及び受信プログラム |
JP5846330B1 (ja) * | 2012-01-18 | 2016-01-20 | 株式会社Jvcケンウッド | 動画像復号装置、動画像復号方法、及び動画像復号プログラム、並びに、受信装置、受信方法、及び受信プログラム |
JP5846327B1 (ja) * | 2012-01-18 | 2016-01-20 | 株式会社Jvcケンウッド | 動画像復号装置、動画像復号方法、及び動画像復号プログラム、並びに、受信装置、受信方法、及び受信プログラム |
JP5846329B1 (ja) * | 2012-01-18 | 2016-01-20 | 株式会社Jvcケンウッド | 動画像復号装置、動画像復号方法、及び動画像復号プログラム、並びに、受信装置、受信方法、及び受信プログラム |
JP5846328B1 (ja) * | 2012-01-18 | 2016-01-20 | 株式会社Jvcケンウッド | 動画像復号装置、動画像復号方法、及び動画像復号プログラム、並びに、受信装置、受信方法、及び受信プログラム |
JP2016048953A (ja) * | 2012-01-18 | 2016-04-07 | 株式会社Jvcケンウッド | 動画像復号装置、動画像復号方法、及び動画像復号プログラム、並びに、受信装置、受信方法、及び受信プログラム |
JP2014112863A (ja) * | 2012-01-18 | 2014-06-19 | Jvc Kenwood Corp | 動画像復号装置、動画像復号方法、及び動画像復号プログラム、並びに、受信装置、受信方法、及び受信プログラム |
JP2013168930A (ja) * | 2012-01-18 | 2013-08-29 | Jvc Kenwood Corp | 動画像復号装置、動画像復号方法及び動画像復号プログラム |
JP2014220847A (ja) * | 2012-04-12 | 2014-11-20 | 株式会社Jvcケンウッド | 動画像復号装置、動画像復号方法、動画像復号プログラム、受信装置、受信方法及び受信プログラム |
JP6020763B1 (ja) * | 2012-04-12 | 2016-11-02 | 株式会社Jvcケンウッド | 動画像符号化装置、動画像符号化方法、動画像符号化プログラム、送信装置、送信方法及び送信プログラム |
JP6020761B1 (ja) * | 2012-04-12 | 2016-11-02 | 株式会社Jvcケンウッド | 動画像符号化装置、動画像符号化方法、動画像符号化プログラム、送信装置、送信方法及び送信プログラム |
JP6020760B1 (ja) * | 2012-04-12 | 2016-11-02 | 株式会社Jvcケンウッド | 動画像符号化装置、動画像符号化方法、動画像符号化プログラム、送信装置、送信方法及び送信プログラム |
JP2017005724A (ja) * | 2012-04-12 | 2017-01-05 | 株式会社Jvcケンウッド | 受信装置、受信方法及び受信プログラム |
JP2017028720A (ja) * | 2012-04-12 | 2017-02-02 | 株式会社Jvcケンウッド | 動画像符号化装置、動画像符号化方法、動画像符号化プログラム、送信装置、送信方法及び送信プログラム |
JP6020762B1 (ja) * | 2012-04-12 | 2016-11-02 | 株式会社Jvcケンウッド | 動画像符号化装置、動画像符号化方法、動画像符号化プログラム、送信装置、送信方法及び送信プログラム |
US9872038B2 (en) | 2012-04-12 | 2018-01-16 | JVC Kenwood Corporation | Moving picture coding device, moving picture coding method, and moving picture coding program |
US9872037B2 (en) | 2012-04-12 | 2018-01-16 | JVC Kenwood Corporation | Moving picture decoding device, moving picture decoding method, and moving picture decoding program |
US9918103B2 (en) | 2012-04-12 | 2018-03-13 | JVC Kenwood Corporation | Moving picture decoding device, moving picture decoding method, and moving picture decoding program |
JP2014220846A (ja) * | 2012-04-12 | 2014-11-20 | 株式会社Jvcケンウッド | 動画像復号装置、動画像復号方法、動画像復号プログラム、受信装置、受信方法及び受信プログラム |
US10230975B2 (en) | 2012-04-12 | 2019-03-12 | JVC Kenwood Corporation | Moving picture decoding device, moving picture decoding method, and moving picture decoding program |
JP2014220844A (ja) * | 2012-04-12 | 2014-11-20 | 株式会社Jvcケンウッド | 動画像復号装置、動画像復号方法、動画像復号プログラム、受信装置、受信方法及び受信プログラム |
US10523962B2 (en) | 2012-04-12 | 2019-12-31 | JVC Kenwood Corporation | Moving picture coding device, moving picture coding method, moving picture coding program, moving picture decoding device, moving picture decoding method, and moving picture decoding program |
JP2014220845A (ja) * | 2012-04-12 | 2014-11-20 | 株式会社Jvcケンウッド | 動画像復号装置、動画像復号方法、動画像復号プログラム、受信装置、受信方法及び受信プログラム |
US10791336B2 (en) | 2012-04-12 | 2020-09-29 | Jvckenwood Corporation | Moving picture coding device, moving picture coding method, moving picture coding program, moving picture decoding device, moving picture decoding method, and moving picture decoding program |
JP2013236367A (ja) * | 2012-04-12 | 2013-11-21 | Jvc Kenwood Corp | 動画像復号装置、動画像復号方法、動画像復号プログラム、受信装置、受信方法及び受信プログラム |
US11206421B2 (en) | 2012-04-12 | 2021-12-21 | Jvckenwood Corporation | Moving picture coding device, moving picture coding method, moving picture coding program, moving picture decoding device, moving picture decoding method, and moving picture decoding program |
JP2013236366A (ja) * | 2012-04-12 | 2013-11-21 | Jvc Kenwood Corp | 動画像符号化装置、動画像符号化方法、動画像符号化プログラム、送信装置、送信方法及び送信プログラム |
US11831898B2 (en) | 2012-04-12 | 2023-11-28 | Jvckenwood Corporation | Moving picture coding device, moving picture coding method, moving picture coding program, moving picture decoding device, moving picture decoding method, and moving picture decoding program |
Also Published As
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP6754978B2 (ja) | 動画像復号化方法、および動画像復号化装置 | |
JP6384691B2 (ja) | 動画像符号化方法および動画像符号化装置 | |
JP6436404B2 (ja) | 動画像復号化方法、および動画像復号化装置 | |
JP6340707B2 (ja) | 画像符号化方法および画像符号化装置 | |
JP6150090B2 (ja) | 画像符号化方法、および画像符号化装置 | |
JP6094983B2 (ja) | 画像処理装置 | |
JP6089312B2 (ja) | 画像処理装置、画像符号化装置及び方法、並びに、画像復号装置及び方法 | |
JP6008211B2 (ja) | 符号化復号装置 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 12792164 Country of ref document: EP Kind code of ref document: A1 |
|
DPE1 | Request for preliminary examination filed after expiration of 19th month from priority date (pct application filed from 20040101) | ||
ENP | Entry into the national phase |
Ref document number: 2013517853 Country of ref document: JP Kind code of ref document: A |
|
WWE | Wipo information: entry into national phase |
Ref document number: MX/A/2013/012132 Country of ref document: MX |
|
ENP | Entry into the national phase |
Ref document number: 2834123 Country of ref document: CA |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2012792164 Country of ref document: EP |
|
ENP | Entry into the national phase |
Ref document number: 20137028245 Country of ref document: KR Kind code of ref document: A |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
REG | Reference to national code |
Ref country code: BR Ref legal event code: B01A Ref document number: 112013027344 Country of ref document: BR |
|
ENP | Entry into the national phase |
Ref document number: 112013027344 Country of ref document: BR Kind code of ref document: A2 Effective date: 20131023 |