US20130279596A1 - Video encoding and decoding with improved error resilience - Google Patents

Video encoding and decoding with improved error resilience Download PDF

Info

Publication number
US20130279596A1
US20130279596A1 US13/978,941 US201213978941A US2013279596A1 US 20130279596 A1 US20130279596 A1 US 20130279596A1 US 201213978941 A US201213978941 A US 201213978941A US 2013279596 A1 US2013279596 A1 US 2013279596A1
Authority
US
United States
Prior art keywords
motion information
predictors
information predictors
motion
predictor
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US13/978,941
Other languages
English (en)
Inventor
Christophe Gisquet
Guillaume Laroche
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Canon Inc
Original Assignee
Canon Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Canon Inc filed Critical Canon Inc
Assigned to CANON KABUSHIKI KAISHA reassignment CANON KABUSHIKI KAISHA ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: GISQUET, CHRISTOPHE, LAROCHE, GUILLAUME
Publication of US20130279596A1 publication Critical patent/US20130279596A1/en
Abandoned legal-status Critical Current

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/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/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
    • H04N19/00587—
    • 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T9/00—Image 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
    • 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/115—Selection of the code volume for a coding unit prior to 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/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/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/146—Data rate or code amount at the encoder output
    • H04N19/147—Data rate or code amount at the encoder output according to rate distortion criteria
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
    • H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/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/192—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 the adaptation method, adaptation tool or adaptation type being iterative or recursive
    • 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/42—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation
    • H04N19/43—Hardware specially adapted for motion estimation or 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/46—Embedding additional information in the video signal during the compression process
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/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/573—Motion compensation with multiple frame prediction using two or more reference frames in a given prediction direction
    • 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/65—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using error resilience
    • 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/85—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using pre-processing or post-processing specially adapted for video compression
    • H04N19/89—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using pre-processing or post-processing specially adapted for video compression involving methods or arrangements for detection of transmission errors at the decoder
    • 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/85—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using pre-processing or post-processing specially adapted for video compression
    • H04N19/89—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using pre-processing or post-processing specially adapted for video compression involving methods or arrangements for detection of transmission errors at the decoder
    • H04N19/895—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using pre-processing or post-processing specially adapted for video compression involving methods or arrangements for detection of transmission errors at the decoder in combination with error concealment
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H04N19/91—Entropy coding, e.g. variable length coding [VLC] or arithmetic coding

Definitions

  • the invention relates to a method and device for encoding a sequence of digital images and a method and device for decoding a corresponding bitstream.
  • the invention belongs to the field of digital signal processing, and in particular to the field of video compression using motion compensation to reduce spatial and temporal redundancies in video streams.
  • motion vectors are encoded with respect to a median predictor computed from the motion vectors situated in a causal neighbourhood of the block to encode, for example from the blocks situated above and to the left of the block to encode. Only the difference, also called residual motion vector, between the median predictor and the current block motion vector is encoded.
  • the encoding using residual motion vectors saves some bitrate, but necessitates that the decoder performs the same computation of the motion vector predictor in order to decode the value of the motion vector of a block to decode.
  • the residual motion information comprises the residual motion vector, i.e. the difference between the actual motion vector of the block to encode and the selected motion vector predictor, and an item of information indicating the selected motion vector predictor, such as for example an encoded value of the index of the selected motion vector predictor.
  • HEVC High Efficiency Video Coding
  • the set of motion vector predictors is reduced by eliminating the duplicated motion vectors, i.e. the motion vectors which have the same value.
  • V 1 and V 2 are equal, and V 0 and V 3 are also equal, so only two of them should be kept as motion vector prediction candidates, for example V 0 and V 1 . In this case, only one bit is necessary to indicate the index of the motion vector predictor to the decoder.
  • a further reduction of the set of motion vector predictors, based on the values of the predictors, is possible. Once the best motion vector predictor is selected and the motion vector residual is computed, it is possible to further eliminate from the prediction set the candidates which would have not been selected, knowing the motion vector residual and the cost optimization criterion of the encoder. A sufficient reduction of the set of predictors leads to a gain in the signaling overhead, since the indication of the selected motion vector predictor can be encoded using fewer bits. At the limit, the set of candidates can be reduced to 1, for example if all motion vector predictors are equal, and therefore it is not necessary to insert any information relative to the selected motion vector predictor in the bitstream.
  • the encoding of motion vectors by difference with a motion vector predictor along with the reduction of the number of motion vector predictor candidates leads to a compression gain.
  • the reduction of the number of motion vector predictor candidates is based on the values taken by the motion vector predictors of the set, in particular the values of the motion vectors of the neighbouring blocks and of the motion vector of the co-located block.
  • the decoder needs to be able to apply the same analysis of the set of possible motion vector predictors as the encoder, in order to deduce the amount of bits used for indicating the selected motion vector predictor and to be able to decode the index of the motion vector predictor and finally to decode the motion vector using the motion vector residual received.
  • the set of motion vector predictors of the block ‘being coded’ is reduced by the encoder to V 0 and V 1 , so the index is encoded on one single bit. If the block ‘Co-located’ of image N ⁇ 1 is lost during transmission, the decoder cannot obtain the value of V 0 , and therefore cannot find out that V 0 and V 3 are equal. Therefore, the decoder cannot find how many bits were used for encoding the index of the motion vector predictor for the block ‘Being coded’, and consequently the decoder cannot correctly parse the data for the slice because it cannot find where the index encoding stops and the encoding of video data starts.
  • a method of encoding a sequence of digital images into a bitstream, at least one portion of an image being encoded by motion compensation with respect to a reference image portion comprising generating for an image portion to encode a set of motion information predictors and selecting a motion information predictor for said image portion to encode from said generated set of motion information predictors, wherein generating said set of motion information predictors comprises:
  • a method of decoding a bitstream comprising an encoded sequence of digital images, at least one portion of an image being encoded by motion compensation with respect to a reference image, the method comprising generating, for an image portion to decode, a set of motion information predictors and determining a motion information predictor for said image portion to decode using said generated set of motion information predictors, wherein generating said set of motion information predictors comprises:
  • a device for encoding a sequence of digital images into a bitstream, at least one portion of an image being encoded by motion compensation with respect to a reference image portion comprising:
  • said generating means comprises:
  • a device for decoding a bitstream comprising an encoded sequence of digital images, at least one portion of an image being encoded by motion compensation with respect to a reference image, the device comprising:
  • the invention relates to method of encoding a sequence of digital images into a bitstream, at least one portion of an image being encoded by motion compensation with respect to a reference image portion.
  • the method comprises, for at least one image portion to encode, the steps of:
  • the method of the invention allows the systematic determination of a target number of motion information predictors to be used for encoding motion information, such as a motion vector, associated with an image portion, and the compression is advantageously improved by generating a set of motion information predictors which are all different from one another.
  • the potential overhead of using a fixed target number of motion information predictors is compensated by the variety of predictors selected which helps improving the compression rate.
  • the target number of different motion information predictors is determined and fixed independently of the actual values of the items of motion information, such as motion vectors, selected as motion information predictors for the current image portion to encode.
  • An embodiment of the present invention is effective when the number of motion information predictors that is initially generated is a priori unknown, for example as when AMVP is used. For example, if reduction of an initial set is carried out, and the number of initial predictors removed by the reduction process is a priori unknown, an embodiment of the present invention can be used to ensure that the final set of motion information predictors consists of the target number of motion information predictors.
  • the encoding method further comprises the steps of:
  • a motion information predictor can be selected for a current block to encode and the selected motion vector predictor can be encoded depending on the number of motion information predictors determined.
  • the number of motion information predictors can be systematically retrieved by the decoder, so that the encoded bitstream can be systematically parsed at a decoder even in case of losses.
  • the item of information representative of said selected motion vector predictor is an index of the selected motion vector predictor in the generated set of motion information predictors, and the index is encoded on a number of bits dependent upon said target number obtained.
  • said target number is set equal to a predetermined value for any image portion to encode of the sequence of digital images.
  • the advantage of this embodiment is that the target number of motion information predictors can be easily obtained, without any supplementary computation or signaling overhead, at both the encoder or the decoder.
  • said target number is determined, for a given image portion to encode, depending upon an encoding information of said given image portion to encode.
  • such an encoding information can be an encoding parameter, such as for example, if the images are divided into variable size macroblocks for processing, the size of the macroblock to which the image portion to encode belongs.
  • Such an encoding information may also be for example an encoding mode associated with the image portion to encode.
  • the invention relates to a device for encoding a sequence of digital images into a bitstream, at least one portion of an image being encoded by motion compensation with respect to a reference image portion.
  • the device comprises, for at least one image portion to encode:
  • the invention also relates to a computer program product that can be loaded into a programmable apparatus, comprising sequences of instructions for implementing a method for encoding a sequence of digital images as briefly described above, when the program is loaded into and executed by the programmable apparatus.
  • a computer program may be transitory or non transitory.
  • the computer program can be stored on a non-transitory computer-readable carrier medium.
  • the invention also relates to a method for decoding a bitstream comprising an encoded sequence of digital images, at least one portion of an image being encoded by motion compensation with respect to a reference image.
  • the method comprises the steps of:
  • the method for decoding a bitstream has the advantage of allowing determining a target number of motion information predictors and using such a number of different motion information predictors.
  • the target number of motion information predictors can be systematically retrieved, and consequently the bitstream can be parsed systematically, even in case of transmission errors.
  • a further advantage is that in all cases, the parsing of the bitstream is simple, and in particular simpler than with prior art methods which adaptively reduce the number of motion information predictors instead of using a predetermined target number that can be obtained by the decoder.
  • the method further comprises a step of decoding an item of information representative of a selected motion information predictor for said image portion to decode based upon said target number obtained.
  • the item of information representative of the selected motion information predictor for said image portion to decode can be systematically decoded, even in case of transmission errors.
  • the invention also relates to a device for decoding a bitstream comprising an encoded sequence of digital images, at least one portion of an image being encoded by motion compensation with respect to a reference image portion.
  • the device comprises, for at least one said image portion to decode:
  • the invention also relates to an information storage means that can be read by a computer or a microprocessor, this storage means being removable, and storing instructions of a computer program for the implementation of the method for decoding a bitstream as briefly described above.
  • the invention also relates to a computer program product that can be loaded into a programmable apparatus, comprising sequences of instructions for implementing a method for decoding a bitstream as briefly described above, when the program is loaded into and executed by the programmable apparatus.
  • a computer program may be transitory or non transitory.
  • the computer program can be stored on a non-transitory computer-readable carrier medium.
  • a method of encoding a sequence of digital images into a bitstream, at least one portion of an image being encoded by motion compensation with respect to a reference image portion comprising generating a set of motion information predictors having controlled diversity and selecting a motion information predictor for said image portion to encode from said generated set of motion information predictors.
  • Controlled diversity means that the motion information predictors of the set are different from one another but one or more of them are statistically likely to be close to the actual motion information so that a residual (difference between the actual motion information and the predictor concerned) is small and hence efficiently compressible.
  • the method may comprise:
  • the first motion information predictors can be predictors expected statistically to give good results in terms of compression efficiency.
  • the second motion information predictors being based on the first predictors, can then be used to explore in an organized or systematic way other predictors in the predictor space neighbouring the first predictors. Such predictors may also be expected to give good results and the more the predictors that are examined the greater the chance of finding a good match to the actual motion information.
  • At least one first motion information predictors is identified as such a seed predictor based on an importance of the first motion information predictor concerned.
  • the importance may be dependent on a number of times the first motion information predictor concerned appears among the first motion information predictors. The greater the number of times the more important the predictor is considered to be and the more likely it is to be used in the set. As well as looking for identical predictors (duplicates) it can also be effective to look for close matches, too.
  • the importance may be dependent on a measure of how representative the first motion information predictor concerned is of the first motion information predictors as a whole. For example, if the first motion information predictors are averaged, the difference or distance between the average predictor and a given first motion information predictor is a measure of how representative the given predictor is of the first motion information predictors as a whole.
  • One way of controlling the diversity is to generate at least one said second motion information predictor by adding or subtracting an offset from one of said seed predictors.
  • the offset may be fixed. It could also be a pseudo-random value as long as the same seed value is available to the decoder as to the encoder.
  • the seed predictors are vectors, it is also possible to control the diversity by adding to the seed predictor another vector, e.g. of fixed magnitude and predetermined direction relative to the direction of the seed predictor.
  • a plurality of said second motion information predictors may be generated based on the same said seed predictor. If the motion information predictors are vectors each having X and Y components, the plurality of second motion information predictors can be obtained by adding and/or subtracting offsets to/from one or both said components of the same said seed predictor. For example, the same offset can be added to and subtracted from the same seed predictor. If the seed predictor is a vector having X and Y components, there are a number of permutations of adding/subtracting offsets to/from one or both of the X and Y components of the same seed predictor. This is an efficient way of generating controlled diversity without a large processing burden.
  • Another way of controlling the diversity is to generate a plurality of second motion information predictors by forming average of different pairs (or other combinations) of first motion information predictors.
  • first motion information predictors are V 1 , V 2 and V 3
  • three second motion information predictors could be formed from the averages of V 1 & V 2 , V 2 & V 3 and V 3 & V 1 . It would also be possible to form different weighted combinations of the same first motion information predictors as different second motion information predictors.
  • the first motion information predictors may be or include motion information predictors each associated with an image portion having a predetermined spatial and/or temporal relationship with the image portion being encoded.
  • the motion information predictors used in AMVP may be first motion information predictors. These are a good source of seed predictors.
  • first motion information predictors By taking into account the differences between the first motion information predictors it is possible to control the diversity of the motion information predictors of the set. It is not necessary in this case to identify seed predictors among the first motion information predictors and generate second motion information predictors based on the seed predictors. This can be effective, for example, if a sufficiently high number of first motion information predictors are initially available.
  • a first motion information predictor having the smallest difference from another first motion information predictor can be removed, as a way of controlling the diversity.
  • the process can be repeated again, as necessary, to successively remove the less diverse predictors.
  • a number of motion information predictors in said set can be variable.
  • the number of motion information predictors in said set can be predetermined at least for a given image portion to encode or even for all image portions (a target number). This makes it possible not only to achieve controlled diversity among the predictors of the set but also to solve the parsing problem noted in the introduction.
  • This aspect of the invention also provides a corresponding decoding method and corresponding encoding and decoding devices, as well as programs which cause the encoding and decoding.
  • the invention relates to a method of encoding a sequence of digital images into a bitstream, at least one portion of an image being encoded by motion compensation with respect to a reference image portion.
  • the method comprises, for at least one image portion to encode, the steps of:
  • the second set of motion vector predictors generated is used for encoding the motion vector associated with the portion of image to encode.
  • the second set of motion vector predictors comprises a variety of different motion vector predictors, which are generated (and possibly selected) so as to enhance the compression efficiency.
  • a motion vector predictor of the first set is selected in a selecting step according to an importance value.
  • the encoding method comprises a step of computing an importance value associated with each motion vector predictor of the first set.
  • a motion vector predictor of the first set is selected in a selecting step according to a distance among the motion vector predictors of the first set.
  • the various embodiments for selecting a motion vector predictor to generate further additional or virtual motion vector predictors allow applying a controlled diversity selection, which has the advantage of improving the compression efficiency. Indeed, the use of motion vector predictors computed from important motion vector predictors of the initial set allows to more accurately represent the motion vector of the current image portion to encode. Again, it is not essential to have a fixed or target number of predictors in the final set.
  • the motion vector predictors of the first set of motion vector predictors are motion vectors associated with image portions to encode of the image being encoded and/or of a reference image.
  • the first set may be made up of, or include, the predictors used in AMVP.
  • FIG. 1 already described, illustrates schematically a set of motion vector predictors used in a motion vector prediction scheme
  • FIG. 2 is a diagram of a processing device adapted to implement an embodiment of the present invention
  • FIG. 3 is a block diagram of an encoder according to an embodiment of the invention.
  • FIG. 4 illustrates a block diagram of a decoder according to an embodiment of the invention
  • FIG. 5 details the determination of a set of motion vector predictors according to a first embodiment
  • FIG. 8 illustrates schematically motion vectors in a coordinates system.
  • FIG. 2 illustrates a diagram of a processing device 1000 adapted to implement one embodiment of the present invention.
  • the apparatus 1000 is for example a micro-computer, a workstation or a light portable device.
  • the apparatus 1000 comprises a communication bus 1113 to which there are preferably connected:
  • the apparatus 1000 may also have the following components:
  • the apparatus 1000 can be connected to various peripherals, such as for example a digital camera 1100 or a microphone 1108 , each being connected to an input/output card (not shown) so as to supply multimedia data to the apparatus 1000 .
  • peripherals such as for example a digital camera 1100 or a microphone 1108 , each being connected to an input/output card (not shown) so as to supply multimedia data to the apparatus 1000 .
  • the disk 1106 can be replaced by any information medium such as for example a compact disk (CD-ROM), rewritable or not, a ZIP disk or a memory card and, in general terms, by an information storage means that can be read by a microcomputer or by a microprocessor, integrated or not into the apparatus, possibly removable and adapted to store one or more programs whose execution enables the method of encoding a sequence of digital images and/or the method of decoding a bitstream according to the invention to be implemented.
  • CD-ROM compact disk
  • ZIP disk or a memory card
  • an information storage means that can be read by a microcomputer or by a microprocessor, integrated or not into the apparatus, possibly removable and adapted to store one or more programs whose execution enables the method of encoding a sequence of digital images and/or the method of decoding a bitstream according to the invention to be implemented.
  • the executable code may be stored either in read only memory 1107 , on the hard disk 1104 or on a removable digital medium such as for example a disk 1106 as described previously.
  • the executable code of the programs can be received by means of the communication network 1103 , via the interface 1102 , in order to be stored in one of the storage means of the apparatus 1000 before being executed, such as the hard disk 1104 .
  • the central processing unit 1111 is adapted to control and direct the execution of the instructions or portions of software code of the program or programs according to the invention, instructions that are stored in one of the aforementioned storage means.
  • the program or programs that are stored in a non-volatile memory for example on the hard disk 1104 or in the read only memory 1107 , are transferred into the random access memory 1112 , which then contains the executable code of the program or programs, as well as registers for storing the variables and parameters necessary for implementing the invention.
  • FIG. 3 illustrates a block diagram of an encoder according to an embodiment of the invention.
  • the encoder is represented by connected modules, each module being adapted to implement, for example in the form of programming instructions to be executed by the CPU 1111 of device 1000 , a corresponding step of a method implementing an embodiment of the invention.
  • a bitstream 310 is output by the encoder 30 .
  • the bitstream 310 comprises a plurality of encoding units or slices, each slice comprising a slice header for encoding values of encoding parameters used to encode the slice and a slice body, comprising encoded video data.
  • the input digital images are divided into blocks ( 302 ), which blocks are image portions and may be of variable sizes (e.g. 4 ⁇ 4, 8 ⁇ 8, 16 ⁇ 16, 32 ⁇ 32).
  • a coding mode is selected for each input block.
  • Module 303 implements Intra prediction, in which the given block to encode is predicted by a predictor computed from pixels of the neighbourhood of said block to encode. An indication of the Intra predictor selected and the difference between the given block and its predictor is encoded if the Intra coding is selected.
  • Temporal prediction is implemented by modules 304 and 305 .
  • a reference image among a set of reference images 316 is selected, and a portion of the reference image, also called reference area, which is the closest area to the given block to encode, is selected by the motion estimation module 304 .
  • the difference between the selected reference area and the given block, also called a residual block, is computed by the motion compensation module 305 .
  • the selected reference area is indicated by a motion vector.
  • An information relative to the motion vector and the residual block is encoded if the Inter prediction is selected.
  • the motion vector is encoded by difference with respect to a motion vector predictor.
  • a set of motion vector predictors also called motion information predictors, is obtained from the motion vectors field 318 by a motion vector prediction and coding module 317 .
  • the set of motion vector predictors used to select a best motion vector predictor to encode a current motion vector is generated as explained in more detail hereafter with respect to FIGS. 5 and 6 .
  • a predetermined number N max of motion vector predictors is set, and consequently the index of the selected motion vector predictor, which is an item of information representative of the selected motion vector predictor, can be encoded using a predetermined number of bits.
  • This predetermined number of bits can be also retrieved by the decoder even in case of losses, therefore it is ensured that the decoder will be able to parse the bitstream even in case of errors or losses.
  • the N max motion vector predictors are selected according to various embodiments to be all different from one another so as to enhance the compression efficiency.
  • the selection of the predetermined number N max of motion vector predictors and of the corresponding number of bits to encode the index of the motion vector predictor can be applied either for the entire sequence, or for a group of images of the sequence, or at the block level depending on an encoding parameters such as the block size or the encoding mode.
  • a first predetermined number of motion vector predictors N max1 can be used for the blocks encoded using Inter prediction for which a residual block is encoded
  • a second predetermined number motion vector predictors N max2 can be used for the blocks encoded using the SKIP mode, for which only a motion vector is encoded, but no residual block.
  • the respective numbers of motion vector predictors N max1 and N max2 can be for example signaled in the bitstream by inserting them in a header, such as the slice header, or in any appropriate metadata field.
  • the encoder 30 further comprises a module of selection of the coding mode 306 , which uses an encoding cost criterion, such as a rate-distortion criterion, to determine which is the best mode among the spatial prediction mode and the temporal prediction mode.
  • a transform 307 is applied to the residual block, the transformed data obtained is then quantized by module 308 and entropy encoded by module 309 .
  • the encoded residual block of the current block to encode is inserted in the bitstream 310 , along with the information relative to the predictor used. For the blocks encoded in ‘SKIP’ mode, only a reference to the predictor is encoded in the bitstream, without any residual block.
  • the encoder 30 further performs the decoding of the encoded image in order to produce a reference image for the motion estimation of the subsequent images.
  • the module 311 performs inverse quantization of the quantized data, followed by an inverse transform 312 .
  • the reverse motion prediction module 313 uses the prediction information to determine which predictor to use for a given block and the reverse motion compensation module 314 actually adds the residual obtained by module 312 to the reference area obtained from the set of reference images 316 .
  • a deblocking filter 315 is applied to remove the blocking effects and enhance the visual quality of the decoded image. The same deblocking filter is applied at the decoder, so that, if there is no transmission loss, the encoder and the decoder apply the same processing.
  • FIG. 4 illustrates a block diagram of a decoder according to an embodiment of the invention.
  • the decoder is represented by connected modules, each module being adapted to implement, for example in the form of programming instructions to be executed by the CPU 1111 of device 1000 , a corresponding step of a method implementing an embodiment of the invention.
  • the decoder 40 receives a bitstream 401 comprising encoding units, each one being composed of a header containing information on encoding parameters and a body containing the encoded video data.
  • the encoded video data is entropy encoded, and the motion vector predictors' indexes are encoded, for a given block, on a predetermined number of bits.
  • the received encoded video data is entropy decoded ( 402 ), dequantized ( 403 ) and then a reverse transform ( 404 ) is applied.
  • the decoder when the received encoded video data corresponds to a residual block of a current block to decode, the decoder also decodes motion prediction information from the bitstream, so as to find the reference area used by the encoder.
  • the module 410 applies the motion vector decoding for each current block encoded by motion prediction, comprising determining the number N max of motion vector predictors used and retrieving the motion vector predictor index encoded on a number of bits dependent on N max .
  • motion vector decoding module 410 generates a set of N max motion vector predictors.
  • the embodiments explained hereafter with respect to FIGS. 5 and 6 apply similarly. If the bitstream is received without losses, the decoder generates exactly the same set of motion vector predictors as the encoder. In case of losses, it may not be possible to generate the set of motion vector predictors and therefore to correctly decode the motion vector associated with the current block. However, the parsing of the bitstream is always possible, even in case of losses, since the number of bits used to encode the index of the motion vectors predictor can be systematically retrieved by the decoder.
  • the actual value of the motion vector associated with the current block can be decoded and used to apply reverse motion compensation ( 406 ).
  • the reference area indicated by the decoded motion vector is extracted from a reference image ( 408 ) to finally apply the reverse motion compensation 406 .
  • an inverse Intra prediction is applied by module 405 .
  • a decoded block is obtained.
  • a deblocking filter 407 is applied, similarly to the deblocking filter 315 applied at the encoder.
  • a decoded video signal 409 is finally provided by the decoder 40 .
  • FIG. 5 details the generation of the set of motion vector predictors or motion vector candidates in a first embodiment of the present invention. All the steps of the algorithm represented in FIG. 5 can be implemented in software and executed by the central processing unit 1111 of the device 1000 .
  • FIG. 5 represents a flowchart applied for a given current block to encode, which has an associated motion vector designating a reference area in a reference image.
  • An initial set of motion vector predictors L 1 is firstly obtained in step S 500 .
  • the set L 1 is composed of N candidates.
  • the initial set of motion vector predictors comprises the motion vector candidates selected according to the motion vector prediction scheme AMVP already described with reference to FIG. 1 , for example vectors V 0 to V 3 of FIG. 1 and the median vector computed from V 1 , V 2 and V 3 . Accordingly, N is a maximum of 5.
  • any other scheme for selecting motion vectors already computed and computing other motion vectors from available ones (i.e. average, median etc) to form the initial set of motion vector predictors L 1 can be applied.
  • N max should be a power of 2
  • N max 2 k , so as to use all the indexes that can be encoded on k bits.
  • all the bits used for signaling are used so as to be able to designate a variety of motion vector predictors and to improve the compression.
  • any type of encoding of the indexes representative of the motion vector predictors can be used, after the number of different motion vector predictors N max has been determined.
  • any type of entropy encoding such as Huffman encoding or arithmetic encoding can be used.
  • the indexes may be also encoded using a prefix type code, such as a Rice-Golomb or a unary code.
  • step S 503 it is tested in step S 503 whether the number N of motion vector predictors of set L 1 is higher than N max .
  • test S 503 is followed by step S 504 of selection of a motion vector predictor candidate from L 1 , followed by the removal of the selected motion vector predictor candidate from L 1 in step S 506 to form a modified set of motion vector predictors L 2 .
  • step S 504 is applied according to a removal criterion, for example a distance criterion.
  • the set L 1 comprises motion vectors predictors ⁇ V 1 , . . . , V N ⁇ , wherein each motion vector predictor is a vector represented by its components or coordinates on the X-axis and the Y-axis in a coordinate system, as represented in FIG. 8 .
  • vector V has the coordinates (3,2)
  • vector V′ has the coordinates (4,2)
  • V′′ has the coordinates (3,3).
  • the minimal distance found d(V p ,V q ) indicates the two closest vectors V p , V q , among the set L 1 , and therefore one of these two vectors is selected for removal.
  • the selection of one of these two vector can be based on the distance of each one of them to the remaining motion prediction vectors in the modified set L 1 : the vector between V p and V q which has the smallest distance to another vector of the set L 1 is selected for removal.
  • step S 510 After the removal of the selected vector, the value of N is decreased (S 508 ), and then N is compared to N max (S 510 ). If the value of N has not reached yet N max (answer ‘no’ to test S 510 ) steps S 504 to S 510 are repeated. Otherwise, if N has reached N max , step S 510 is followed by step S 522 described hereafter.
  • test S 512 is followed by step S 514 of obtaining or generating an additional motion vector predictor candidate.
  • step S 514 of obtaining or generating an additional motion vector predictor candidate.
  • the motion vectors of blocks 710 , 720 , 730 and 740 can be added as possible motion vector predictors.
  • the 2 predictors among 770 , 760 , 750 which were not selected in S 500 can be added as possible motion vector predictors.
  • each potential motion vector predictor candidate MV For each potential motion vector predictor candidate MV, it is checked whether the motion vector predictor MV is different from all the motion vector predictor candidates already stored in the set L 2 .
  • each potential motion vector candidate considered is equal to a motion vector predictor of set L 2 .
  • new ‘virtual’ motion vector predictor candidates are computed in step S 514 .
  • Such motion vector predictor candidates are called virtual because they are not motion vectors of other blocks of the current image or of the reference image.
  • the virtual motion vector predictors are computed from existing motion vector predictors, for example by adding offsets. For example, from a motion vector MV of set L 2 of coordinates (MV x , MV y ), it is possible to compute four virtual motion vector predictors by adding/subtracting an offset off to its coordinates: MV′(MV x ⁇ off, MV y ⁇ off). Typically, off may be set equal to 1 or 2.
  • the components of the motion vector MV may be modified independently, using respectively two values offx and offy, and either offx or offy may be set to 0.
  • a supplementary motion vector of predetermined norm, is added to the vector MV, the supplementary vector having the same direction as motion vector MV, as represented in FIG. 8 : supplemental vector 850 is added to vector 820 .
  • a variance of the motion vectors of the set L 2 is computed:
  • the offset off is selected by comparing the calculated value var to a predetermined threshold T.
  • One motion vector predictor obtained in step S 514 is added to the set of motion vector predictors L 2 in step S 516 , and the number N is increased by 1 (step S 518 ).
  • step S 520 it is checked in step S 520 is N is equal to N max . In case of negative answer, steps S 514 to S 520 are repeated.
  • step S 520 is followed, at the encoder, by the step S 522 of selection of an optimal motion vector predictor for the current block from set L 2 .
  • a rate-distortion optimization criterion is applied to select the optimal motion vector predictor MV i to encode the motion vector of the current block.
  • the motion residual i.e. the difference between the motion vector of the current block and the selected motion vector predictor is encoded, as well as an indication of the motion vector predictor selected in step S 524 .
  • an entropy encoding of the index i may be applied.
  • the index i can be encoded using a prefix type code, such as the Rice-Golomb code, in which each value i is encoded using i ‘1’s followed by a ‘0’.
  • a prefix type code such as the Rice-Golomb code
  • the algorithm of FIG. 5 can also be implemented by a decoder to generate the set of motion vector predictor or motion vector candidates for a given block, without steps S 522 and S 524 .
  • the index i of the selected motion vector predictor MVi for the given block to decode is obtained from the bitstream, knowing N max and therefore the number of bits k on which the index i has been encoded.
  • the steps S 500 to S 518 are similarly implemented to obtain the set of motion vector predictors L 2 , so that the index i decoded from the bitstream designates the motion vector predictor actually used by the encoder.
  • the received bitstream can be systematically parsed to extract the index i designating the selected motion vector predictor, even if, depending on the packets lost, the complete set of motion vector predictors L 2 may not be obtained at the decoder.
  • FIG. 6 details the generation of the set of motion vector predictors or motion vector candidates in a second embodiment of the present invention. All the steps of the algorithm represented in FIG. 6 can be implemented in software and executed by the central processing unit 1111 of the device 1000 .
  • FIG. 6 represents a flowchart applied for a given current block to encode, which has an associated motion vector designating a reference area in a reference image.
  • step S 600 the target number N max of motion vector predictor candidates to use is determined in step S 600 .
  • N max is of the form 2 k , so that each index value that can be coded on k bits corresponds to a possible motion vector predictor.
  • An initial set of motion vector predictor candidates L 1 is obtained in step S 602 .
  • a reduction process is applied on the initial set of motion vector predictors to eliminate duplicates, so as to obtain a reduced set of motion vector predictors containing N1 elements.
  • the number of duplicates of each remaining vector after the reduction process is recorded and stored in a memory for a subsequent use in step S 612 described hereafter.
  • step S 606 it is next checked (test S 606 ) whether N1 is higher than or equal to N max , the target number of motion vector predictors. It may be pointed out that a positive outcome to this test only occurs if the algorithm starts with a first set of motion vector predictors a greater number of motion vectors than N max . In case of positive answer, step S 606 is followed by step S 630 of selection of the first N max motion vector predictor candidates of the set L 1 to form the set of motion vector predictors L 2 .
  • a second set of motion vector predictor candidates L 1 ′ is obtained in step S 608 .
  • the second set of motion vector predictors L 1 ′ is composed of the remaining motion vector predictors of the first set L 1 and of additional motion vectors, for example corresponding to the motion vectors of the block 710 , 720 , 730 and 740 of the reference image as represented on FIG. 7 . Further, the 2 predictors among 770 , 760 , 750 which were not selected in S 600 can be added as possible motion vector predictors. Each motion vector predictor of the set L 1 ′ has a corresponding index.
  • a reduction process is applied to the second set of motion vector predictors in step S 610 to obtain a reduced second set of motion vector predictors L 1 ′′ of N 2 vectors.
  • the reduction process eliminates the duplicates, so that all motion vector predictors of L 1 ′′ are different from one another.
  • the number of duplicates of each vector kept in L 1 ′′ is recorded and stored in a memory for a subsequent use in step S 612 described hereafter.
  • step S 628 It is then checked in step S 628 whether the number of motion vector predictors N 2 is higher than or equal to N max . In case of positive answer, step S 628 is followed by step S 630 already described.
  • step S 612 follows directly test S 606 , in case of negative answer to test S 606 .
  • the importance value is computed in this embodiment as the number of duplicates of a given motion vector predictor, using the number of duplicates of a given motion vector predictor computed and stored during steps S 604 and S 610 .
  • two vectors, V 0 and V 3 are equal, so vector V 0 has an importance value equal to 2.
  • the importance value can be computed as a function of the distance to a representative vector of the set of vectors considered, such as the average value of the vectors of the set or the median of the vectors of the set. Then, the importance may be computed as the inverse of the distance of a given vector of the set Vn to the representative vector: the closer a vector Vn is to the representative vector of the set, the higher the importance of Vn.
  • the N 2 remaining motion vector predictor candidates are ordered in step S 614 according to an order of decreasing importance value. If several motion vector predictors have the same importance value, they can be ordered according to the increasing order of their indexes.
  • the re-ordered motion vector predictors are re-assigned increasing indexes ⁇ V 0 , V 1 , . . . , V N2-1 ⁇ .
  • a variable n is initialized to 0 and a variable N is initialized to N 2 , which is the current number of motion vector predictors in the re-ordered set.
  • Vn x ⁇ off Vn y +off
  • Vn x +off Vn y +off
  • Vn x +off Vn y +off
  • Vn x ⁇ off Vn y +off
  • Vn x ⁇ off Vn y +off
  • Vn x , Vn y +off Vn x ⁇ off, Vn y +off
  • Vn x , Vn y +off Vn x ⁇ off, Vn y +off
  • Vn x , Vn y +off Vn x , Vn y +off
  • This list of virtual motion vector predictors is added to the current set of motion vector predictors.
  • step S 620 The duplicates are eliminated in step S 620 .
  • the value N is updated in step S 622 to the remaining number of motion vector predictors after the removal of potential duplicates.
  • step S 624 it is checked whether N is higher than or equal to N max in step S 624 .
  • step S 624 is followed by step S 634 of increasing of the value n by 1, and steps S 618 to S 624 are repeated.
  • step S 630 is followed by step S 632 , analogous to step S 522 of FIG. 5 , of selection of an optimal motion vector predictor MVi among the set of motion vector predictors for the current block, according to a predetermined criterion such as a rate-distortion criterion.
  • a predetermined criterion such as a rate-distortion criterion.
  • Step S 632 is followed by a step S 634 of encoding the motion vector of the current block using the motion vector predictor MVi, similar to step S 524 of FIG. 5 .
  • an entropy encoding of the index i may be applied.
  • the index i can be encoded using a prefix type code, such as the Rice-Golomb code, in which each value i is encoded using i ‘1’s followed by a ‘0’.
  • a prefix type code such as the Rice-Golomb code
  • the index i of the selected motion vector predictor MVi for the given block to decode is obtained from the bitstream, knowing N max and therefore the number of bits k on which the index i has been encoded.
  • the steps S 600 to S 630 are similarly implemented to obtain the set of motion vector predictors L 2 , so that the index i decoded from the bitstream designates the motion vector predictor actually used by the encoder.
  • the received bitstream can be systematically parsed to extract the index i designating the selected motion vector predictor, even if, depending on the packets lost, the complete set of motion vector predictors L 2 may not be obtained at the decoder.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
US13/978,941 2011-01-12 2012-01-11 Video encoding and decoding with improved error resilience Abandoned US20130279596A1 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
GB1100462.9A GB2487200A (en) 2011-01-12 2011-01-12 Video encoding and decoding with improved error resilience
GB1100462.9 2011-01-12
PCT/EP2012/050392 WO2013041244A1 (en) 2011-01-12 2012-01-11 Video encoding and decoding with improved error resilience

Publications (1)

Publication Number Publication Date
US20130279596A1 true US20130279596A1 (en) 2013-10-24

Family

ID=43664110

Family Applications (14)

Application Number Title Priority Date Filing Date
US13/978,941 Abandoned US20130279596A1 (en) 2011-01-12 2012-01-11 Video encoding and decoding with improved error resilience
US13/978,987 Active 2032-06-23 US9386312B2 (en) 2011-01-12 2012-01-11 Video encoding and decoding with improved error resilience
US13/979,008 Active 2034-07-25 US11146792B2 (en) 2011-01-12 2012-01-11 Video encoding and decoding with improved error resilience
US13/978,950 Active 2032-11-16 US10165279B2 (en) 2011-01-12 2012-01-11 Video encoding and decoding with improved error resilience
US15/170,195 Active US9979968B2 (en) 2011-01-12 2016-06-01 Method, a device, a medium for video decoding that includes adding and removing motion information predictors
US15/962,922 Active US10499060B2 (en) 2011-01-12 2018-04-25 Video encoding and decoding with improved error resilience
US15/962,940 Abandoned US20180242001A1 (en) 2011-01-12 2018-04-25 Video Encoding and Decoding with Improved Error Resilience
US15/962,919 Abandoned US20180241999A1 (en) 2011-01-12 2018-04-25 Video Encoding and Decoding with Improved Error Resilience
US16/027,901 Abandoned US20180316921A1 (en) 2011-01-12 2018-07-05 Video Encoding and Decoding with Improved Error Resilience
US16/058,396 Active US10609380B2 (en) 2011-01-12 2018-08-08 Video encoding and decoding with improved error resilience
US16/200,272 Abandoned US20190098313A1 (en) 2011-01-12 2018-11-26 Video encoding and decoding with improved error resilience
US16/200,335 Abandoned US20190098314A1 (en) 2011-01-12 2018-11-26 Video encoding and decoding with improved error resilience
US16/200,378 Active US10506236B2 (en) 2011-01-12 2018-11-26 Video encoding and decoding with improved error resilience
US17/155,984 Abandoned US20210144385A1 (en) 2011-01-12 2021-01-22 Video encoding and decoding with improved error resilience

Family Applications After (13)

Application Number Title Priority Date Filing Date
US13/978,987 Active 2032-06-23 US9386312B2 (en) 2011-01-12 2012-01-11 Video encoding and decoding with improved error resilience
US13/979,008 Active 2034-07-25 US11146792B2 (en) 2011-01-12 2012-01-11 Video encoding and decoding with improved error resilience
US13/978,950 Active 2032-11-16 US10165279B2 (en) 2011-01-12 2012-01-11 Video encoding and decoding with improved error resilience
US15/170,195 Active US9979968B2 (en) 2011-01-12 2016-06-01 Method, a device, a medium for video decoding that includes adding and removing motion information predictors
US15/962,922 Active US10499060B2 (en) 2011-01-12 2018-04-25 Video encoding and decoding with improved error resilience
US15/962,940 Abandoned US20180242001A1 (en) 2011-01-12 2018-04-25 Video Encoding and Decoding with Improved Error Resilience
US15/962,919 Abandoned US20180241999A1 (en) 2011-01-12 2018-04-25 Video Encoding and Decoding with Improved Error Resilience
US16/027,901 Abandoned US20180316921A1 (en) 2011-01-12 2018-07-05 Video Encoding and Decoding with Improved Error Resilience
US16/058,396 Active US10609380B2 (en) 2011-01-12 2018-08-08 Video encoding and decoding with improved error resilience
US16/200,272 Abandoned US20190098313A1 (en) 2011-01-12 2018-11-26 Video encoding and decoding with improved error resilience
US16/200,335 Abandoned US20190098314A1 (en) 2011-01-12 2018-11-26 Video encoding and decoding with improved error resilience
US16/200,378 Active US10506236B2 (en) 2011-01-12 2018-11-26 Video encoding and decoding with improved error resilience
US17/155,984 Abandoned US20210144385A1 (en) 2011-01-12 2021-01-22 Video encoding and decoding with improved error resilience

Country Status (13)

Country Link
US (14) US20130279596A1 (zh)
EP (10) EP2666294B1 (zh)
JP (12) JP5847843B2 (zh)
KR (15) KR20130105906A (zh)
CN (17) CN107454399A (zh)
BR (2) BR122019026393B1 (zh)
ES (7) ES2583407T3 (zh)
GB (3) GB2487200A (zh)
HU (5) HUE046362T2 (zh)
PL (5) PL3244613T3 (zh)
RU (6) RU2556386C2 (zh)
TR (1) TR201907405T4 (zh)
WO (4) WO2012095464A1 (zh)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120275522A1 (en) * 2009-10-28 2012-11-01 Sk Telecom Co., Ltd. Method and apparatus for motion vector encoding/decoding using spatial division, and method and apparatus for image encoding/decoding using same
US20170134649A1 (en) * 2015-11-05 2017-05-11 Canon Kabushiki Kaisha Imaging device and imaging method
US11277624B2 (en) 2018-11-12 2022-03-15 Beijing Bytedance Network Technology Co., Ltd. Bandwidth control methods for inter prediction
US11341654B2 (en) * 2016-11-23 2022-05-24 Robert Bosch Gmbh Correspondence search between matrix elements
US11509923B1 (en) * 2019-03-06 2022-11-22 Beijing Bytedance Network Technology Co., Ltd. Usage of converted uni-prediction candidate
US11838539B2 (en) 2018-10-22 2023-12-05 Beijing Bytedance Network Technology Co., Ltd Utilization of refined motion vector
US11880485B2 (en) 2018-12-19 2024-01-23 Canon Medical Systems Corporation Medical information anonymizing system and anonymizing method setting device
US11956465B2 (en) 2018-11-20 2024-04-09 Beijing Bytedance Network Technology Co., Ltd Difference calculation based on partial position

Families Citing this family (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101768207B1 (ko) 2010-01-19 2017-08-16 삼성전자주식회사 축소된 예측 움직임 벡터의 후보들에 기초해 움직임 벡터를 부호화, 복호화하는 방법 및 장치
GB2487200A (en) * 2011-01-12 2012-07-18 Canon Kk Video encoding and decoding with improved error resilience
GB2493755B (en) 2011-08-17 2016-10-19 Canon Kk Method and device for encoding a sequence of images and method and device for decoding a sequence of images
GB2511288A (en) * 2013-01-09 2014-09-03 Canon Kk Method, device, and computer program for motion vector prediction in scalable video encoder and decoder
GB2512829B (en) * 2013-04-05 2015-05-27 Canon Kk Method and apparatus for encoding or decoding an image with inter layer motion information prediction according to motion information compression scheme
CN103475883B (zh) * 2013-09-26 2016-07-06 北京航空航天大学 一种基于运动区域划分的hevc运动估计提前终止方法
CN104410864B (zh) * 2014-11-07 2018-08-14 太原科技大学 Hevc中基于残差能量的错误隐藏方法
US9955160B1 (en) * 2015-04-27 2018-04-24 Harmonic, Inc. Video encoding using adaptive pre-filtering
US9787987B2 (en) 2015-04-27 2017-10-10 Harmonic, Inc. Adaptive pre-filtering based on video complexity and output bit rate
US10271064B2 (en) 2015-06-11 2019-04-23 Qualcomm Incorporated Sub-prediction unit motion vector prediction using spatial and/or temporal motion information
CN111556323B (zh) 2016-02-06 2022-05-13 华为技术有限公司 图像编解码方法及装置
US10735761B2 (en) * 2017-05-19 2020-08-04 Mediatek Inc Method and apparatus of video coding
CN109495738B (zh) * 2017-09-12 2023-02-07 华为技术有限公司 一种运动信息的编解码方法和装置
JP7250781B2 (ja) 2017-10-06 2023-04-03 ソシエテ・デ・プロデュイ・ネスレ・エス・アー 容器、調製マシン及び調製情報を符号化するための２値コードを使用するシステム
KR102486879B1 (ko) 2018-04-12 2023-01-11 삼성디스플레이 주식회사 디스플레이 장치 및 그 제조방법
WO2020043000A1 (zh) * 2018-08-28 2020-03-05 华为技术有限公司 候选运动信息列表的构建方法、帧间预测方法及装置
KR102184913B1 (ko) * 2019-03-12 2020-12-01 한양대학교 산학협력단 원형의 직교 진폭 변조 신호 성상도를 생성하는 방법 및 장치
EP3989572A4 (en) * 2019-06-21 2023-04-12 Samsung Electronics Co., Ltd. APPARATUS AND METHOD FOR ENCODING AND DECODING MOTION INFORMATION USING PROXIMITY MOTION INFORMATION
EP3981157A4 (en) * 2019-07-11 2022-07-06 Huawei Technologies Co., Ltd. MOTION FIELD STORAGE OPTIMIZATION FOR LINE BUFFER
WO2023194603A1 (en) * 2022-04-08 2023-10-12 Interdigital Ce Patent Holdings, Sas Motion information candidates re-ordering

Family Cites Families (108)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB1100461A (en) 1963-10-02 1968-01-24 Automatic Telephone & Elect Improvements in or relating to magnetic core matrix data storage devices
JP3265590B2 (ja) * 1991-07-24 2002-03-11 松下電器産業株式会社 画像の動きベクトル検出装置及び画像揺れ補正装置
JPH0620050A (ja) * 1992-07-03 1994-01-28 Matsushita Electric Ind Co Ltd 動画像信号の復号化装置と推定動きベクトル算出方法
JPH0730896A (ja) 1993-06-25 1995-01-31 Matsushita Electric Ind Co Ltd 動きベクトル符号化及び復号化方法
US5552673A (en) 1994-10-04 1996-09-03 Kenwood; Michael Theft resistant compact fluorescent lighting system
US5675382A (en) 1996-04-08 1997-10-07 Connectix Corporation Spatial compression and decompression for video
JP3263807B2 (ja) 1996-09-09 2002-03-11 ソニー株式会社 画像符号化装置および画像符号化方法
US6122320A (en) 1997-03-14 2000-09-19 Cselt-Centro Studi E Laboratori Telecomunicazioni S.P.A. Circuit for motion estimation in digitized video sequence encoders
JP4573366B2 (ja) * 1997-09-25 2010-11-04 株式会社大宇エレクトロニクス 動きベクトル符号化方法及び符号化装置
JPH11112985A (ja) 1997-09-29 1999-04-23 Sony Corp 画像符号化装置、画像符号化方法、画像復号装置、画像復号方法、および、伝送媒体
JP3407287B2 (ja) * 1997-12-22 2003-05-19 日本電気株式会社 符号化復号システム
WO1999041912A2 (en) 1998-02-13 1999-08-19 Koninklijke Philips Electronics N.V. Method and arrangement for video coding
JP3841132B2 (ja) * 1998-06-01 2006-11-01 株式会社ソニー・コンピュータエンタテインメント 入力位置検出装置及びエンタテインメントシステム
CN1288641A (zh) 1998-09-22 2001-03-21 松下电器产业株式会社 视频信号编码方法、视频信号编码装置及程序记录媒体
US7327791B1 (en) 1999-02-22 2008-02-05 Mitsubishi Denki Kabushiki Kaisha Video decoding method performing selective error concealment and resynchronization
US6738423B1 (en) 2000-01-21 2004-05-18 Nokia Mobile Phones Ltd. Method for encoding and decoding video information, a motion compensated video encoder and a corresponding decoder
US6552673B2 (en) 2000-02-25 2003-04-22 Texas Instruments Incorporated Efficient table access for reversible variable length code decoding using a hash function
EP1152621A1 (en) * 2000-05-05 2001-11-07 STMicroelectronics S.r.l. Motion estimation process and system.
US20050207663A1 (en) * 2001-07-31 2005-09-22 Weimin Zeng Searching method and system for best matching motion vector
US7787746B2 (en) 2001-10-23 2010-08-31 Thomson Licensing Fast motion trick mode using non-progressive dummy bidirectional predictive pictures
US20040125204A1 (en) 2002-12-27 2004-07-01 Yoshihisa Yamada Moving picture coding apparatus and moving picture decoding apparatus
US7248741B2 (en) 2002-01-09 2007-07-24 Hiroshi Akimoto Video sequences correlation and static analysis and scene changing forecasting in motion estimation
BR0302719A (pt) 2002-01-18 2004-03-09 Toshiba Kk Toshiba Corp Método e aparelho de codificação de vìdeo e método e aparelho de decodificação de vìdeo
KR100492127B1 (ko) * 2002-02-23 2005-06-01 삼성전자주식회사 적응형 움직임 추정장치 및 추정 방법
KR100474285B1 (ko) * 2002-04-08 2005-03-08 엘지전자 주식회사 모션벡터결정방법
ES2351306T3 (es) 2002-04-18 2011-02-02 Kabushiki Kaisha Toshiba Procedimiento y dispositivo para la codificación de imágen en movimiento.
JP2004023458A (ja) 2002-06-17 2004-01-22 Toshiba Corp 動画像符号化／復号化方法及び装置
US6925123B2 (en) 2002-08-06 2005-08-02 Motorola, Inc. Method and apparatus for performing high quality fast predictive motion search
JP4617644B2 (ja) 2003-07-18 2011-01-26 ソニー株式会社 符号化装置及び方法
US7620106B2 (en) 2003-09-07 2009-11-17 Microsoft Corporation Joint coding and decoding of a reference field selection and differential motion vector information
US7577198B2 (en) 2003-09-07 2009-08-18 Microsoft Corporation Number of reference fields for an interlaced forward-predicted field
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 中国科学院计算技术研究所 一种用于视频编码的编码端/解码端双向预测方法
CN100353768C (zh) * 2003-11-26 2007-12-05 联发科技股份有限公司 在视频压缩系统中进行运动估测的方法及相关装置
WO2005055608A1 (en) 2003-12-01 2005-06-16 Samsung Electronics Co., Ltd. Method and apparatus for scalable video encoding and decoding
WO2005083637A1 (es) * 2004-02-27 2005-09-09 Td Vision Corporation, S.A. De C.V. Método y sistema de decodificación digital de imágenes de video 3d estereoscópicas
EP1578137A2 (en) * 2004-03-17 2005-09-21 Matsushita Electric Industrial Co., Ltd. Moving picture coding apparatus with multistep interpolation process
US7676722B2 (en) 2004-03-31 2010-03-09 Sony Corporation Multimedia content delivery using pre-stored multiple description coded video with restart
CA2574556A1 (en) 2004-07-20 2006-02-02 Qualcomm Incorporated Method and apparatus for motion vector processing
CN101005620B (zh) * 2004-09-03 2011-08-10 微软公司 为隔行扫描和逐行扫描视频编码和解码宏块和运动信息中的革新
CN1256686C (zh) 2004-09-15 2006-05-17 哈尔滨工业大学 一种运动估计方法和应用该方法的运动估计电路
JP4746550B2 (ja) 2004-09-22 2011-08-10 パナソニック株式会社 画像符号化装置
KR100679022B1 (ko) * 2004-10-18 2007-02-05 삼성전자주식회사 계층간 필터링을 이용한 비디오 코딩 및 디코딩방법과,비디오 인코더 및 디코더
US20060153300A1 (en) * 2005-01-12 2006-07-13 Nokia Corporation Method and system for motion vector prediction in scalable video coding
EP1703736A1 (en) * 2005-03-14 2006-09-20 BRITISH TELECOMMUNICATIONS public limited company Global motion estimation
US20080310510A1 (en) 2005-03-22 2008-12-18 Mitsubishi Electric Corporation Image Coding, Recording and Reading Apparatus
KR100736041B1 (ko) 2005-06-30 2007-07-06 삼성전자주식회사 에러 은닉 방법 및 장치
RU2368095C1 (ru) 2005-07-22 2009-09-20 Мицубиси Электрик Корпорейшн Кодер изображения и декодер изображения, способ кодирования изображения и способ декодирования изображения, программа кодирования изображения и программа декодирования изображения и компьютерно-считываемый носитель записи, на котором записана программа кодирования изображения, и компьютерно-считываемый носитель записи, на котором записана программа декодирования изображения
JP2007067731A (ja) 2005-08-30 2007-03-15 Sanyo Electric Co Ltd 符号化方法
JP2007074592A (ja) 2005-09-09 2007-03-22 Sony Corp 画像処理装置および方法、プログラム、並びに記録媒体
KR100712532B1 (ko) 2005-09-10 2007-04-30 삼성전자주식회사 단일표현과 다중표현 전환을 이용한 동영상 변환부호화장치 및 방법
US7620108B2 (en) * 2005-09-16 2009-11-17 Sony Corporation Integrated spatial-temporal prediction
US20070064805A1 (en) 2005-09-16 2007-03-22 Sony Corporation Motion vector selection
US8165205B2 (en) 2005-09-16 2012-04-24 Sony Corporation Natural shaped regions for motion compensation
US8879857B2 (en) 2005-09-27 2014-11-04 Qualcomm Incorporated Redundant data encoding methods and device
JP2007097028A (ja) * 2005-09-30 2007-04-12 Oki Electric Ind Co Ltd 動きベクトル検出方法および動きベクトル検出回路
US8325822B2 (en) 2006-01-20 2012-12-04 Qualcomm Incorporated Method and apparatus for determining an encoding method based on a distortion value related to error concealment
JP5004150B2 (ja) * 2006-02-24 2012-08-22 Ｋｄｄｉ株式会社 画像符号化装置
US8320450B2 (en) 2006-03-29 2012-11-27 Vidyo, Inc. System and method for transcoding between scalable and non-scalable video codecs
JP5188033B2 (ja) 2006-04-24 2013-04-24 株式会社日立製作所 記録再生装置、送出装置及び伝送システム。
CN101064849A (zh) 2006-04-29 2007-10-31 鲁海宁 动态图像编码方法、装置和计算机可读记录介质
US20080002770A1 (en) * 2006-06-30 2008-01-03 Nokia Corporation Methods, apparatus, and a computer program product for providing a fast inter mode decision for video encoding in resource constrained devices
CN100576919C (zh) * 2006-08-08 2009-12-30 佳能株式会社 运动矢量检测设备及运动矢量检测方法
DE102006043707A1 (de) * 2006-09-18 2008-03-27 Robert Bosch Gmbh Verfahren zur Datenkompression in einer Videosequenz
CN101155311B (zh) 2006-09-27 2012-09-05 中兴通讯股份有限公司 一种视频通信中的视频码流错误检测和处理方法
KR101383540B1 (ko) 2007-01-03 2014-04-09 삼성전자주식회사 복수의 움직임 벡터 프리딕터들을 사용하여 움직임 벡터를추정하는 방법, 장치, 인코더, 디코더 및 복호화 방법
JP2008193627A (ja) 2007-01-12 2008-08-21 Mitsubishi Electric Corp 画像符号化装置、画像復号装置、および画像符号化方法、画像復号方法
JP5026092B2 (ja) 2007-01-12 2012-09-12 三菱電機株式会社 動画像復号装置および動画像復号方法
TW200836130A (en) 2007-02-16 2008-09-01 Thomson Licensing Bitrate reduction method by requantization
JP5025286B2 (ja) 2007-02-28 2012-09-12 シャープ株式会社 符号化装置及び復号装置
CN101267567A (zh) 2007-03-12 2008-09-17 华为技术有限公司 帧内预测、编解码方法及装置
BRPI0809512A2 (pt) 2007-04-12 2016-03-15 Thomson Licensing método e aparelho para mesclagem dependente de contexto para modos salto-direto para codificação e decodificação de vídeo
JP2008283560A (ja) 2007-05-11 2008-11-20 Canon Inc 画像処理装置およびその方法
US8254450B2 (en) 2007-08-23 2012-08-28 Nokia Corporation System and method for providing improved intra-prediction in video coding
CN100542299C (zh) 2007-08-31 2009-09-16 广东威创视讯科技股份有限公司 视讯图像错误的掩盖方法
EP2048886A1 (en) * 2007-10-11 2009-04-15 Panasonic Corporation Coding of adaptive interpolation filter coefficients
CN100579231C (zh) * 2007-12-18 2010-01-06 北京中星微电子有限公司 一种运动矢量预测方法及装置
CN101466036A (zh) * 2007-12-21 2009-06-24 北京中电华大电子设计有限责任公司 基于avs的运动矢量预测流水并行设计方法
EP2266318B1 (en) 2008-03-19 2020-04-22 Nokia Technologies Oy Combined motion vector and reference index prediction for video coding
CN101252422B (zh) 2008-03-20 2013-06-05 中兴通讯股份有限公司 物理混合重传指示信道的分配方法
JP4990927B2 (ja) 2008-03-28 2012-08-01 三星電子株式会社 動きベクトル情報の符号化／復号化方法及び装置
US20090268821A1 (en) * 2008-04-29 2009-10-29 The Hong Kong University Of Science And Technology Block parallel and fast motion estimation in video coding
JP2010028221A (ja) * 2008-07-15 2010-02-04 Sony Corp 動きベクトル検出装置、動きベクトル検出方法、画像符号化装置及びプログラム
US20100020877A1 (en) 2008-07-23 2010-01-28 The Hong Kong University Of Science And Technology Multiple reference frame motion estimation in video coding
CN101350927B (zh) * 2008-07-29 2011-07-13 北京中星微电子有限公司 帧内预测选择最优预测模式的方法及装置
JP5422168B2 (ja) 2008-09-29 2014-02-19 株式会社日立製作所 動画像符号化方法および動画像復号化方法
JP5401071B2 (ja) 2008-10-09 2014-01-29 株式会社Ｎｔｔドコモ 動画像符号化装置、動画像復号装置、動画像符号化方法、動画像復号方法、動画像符号化プログラム、動画像復号プログラム、動画像処理システムおよび動画像処理方法
US8295623B2 (en) 2008-10-14 2012-10-23 France Telecom Encoding and decoding with elimination of one or more predetermined predictors
CN101939994B (zh) 2008-12-08 2013-07-17 松下电器产业株式会社 图像解码装置及图像解码方法
KR101590511B1 (ko) * 2009-01-23 2016-02-02 에스케이텔레콤 주식회사 움직임 벡터 부호화/복호화 장치 및 방법과 그를 이용한 영상 부호화/복호화 장치 및 방법
US8737475B2 (en) 2009-02-02 2014-05-27 Freescale Semiconductor, Inc. Video scene change detection and encoding complexity reduction in a video encoder system having multiple processing devices
EP2443835B1 (fr) * 2009-06-19 2017-04-05 Orange Codage de vecteurs mouvement par compétition de prédicteurs
CN101931803B (zh) 2009-06-26 2013-01-09 华为技术有限公司 视频图像运动信息获取方法、装置及设备、模板构造方法
KR20110008653A (ko) 2009-07-20 2011-01-27 삼성전자주식회사 움직임 벡터 예측 방법과 이를 이용한 영상 부호화/복호화 장치 및 방법
US9060176B2 (en) 2009-10-01 2015-06-16 Ntt Docomo, Inc. Motion vector prediction in video coding
US20110090965A1 (en) 2009-10-21 2011-04-21 Hong Kong Applied Science and Technology Research Institute Company Limited Generation of Synchronized Bidirectional Frames and Uses Thereof
CN101860754B (zh) * 2009-12-16 2013-11-13 香港应用科技研究院有限公司 运动矢量编码和解码的方法和装置
CN101777963B (zh) 2009-12-29 2013-12-11 电子科技大学 一种基于反馈模式的帧级别编码与译码方法
US9036692B2 (en) 2010-01-18 2015-05-19 Mediatek Inc. Motion prediction method
EP2532159A1 (en) 2010-02-05 2012-12-12 Telefonaktiebolaget L M Ericsson (PUBL) Selecting predicted motion vector candidates
CN101931821B (zh) * 2010-07-21 2014-12-10 中兴通讯股份有限公司 一种视频传输的差错控制方法及系统
US8736767B2 (en) 2010-09-29 2014-05-27 Sharp Laboratories Of America, Inc. Efficient motion vector field estimation
US20120082228A1 (en) 2010-10-01 2012-04-05 Yeping Su Nested entropy encoding
US10104391B2 (en) * 2010-10-01 2018-10-16 Dolby International Ab System for nested entropy encoding
US8976873B2 (en) 2010-11-24 2015-03-10 Stmicroelectronics S.R.L. Apparatus and method for performing error concealment of inter-coded video frames
JP5796289B2 (ja) 2010-11-26 2015-10-21 ソニー株式会社 二次電池セル、電池パック及び電力消費機器
GB2487200A (en) 2011-01-12 2012-07-18 Canon Kk Video encoding and decoding with improved error resilience
CA2834191C (en) 2011-05-31 2019-04-09 Panasonic Corporation Video encoding method, video encoding device, video decoding method, video decoding device, and video encoding/decoding device

Cited By (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10091526B2 (en) * 2009-10-28 2018-10-02 Sk Telecom Co., Ltd. Method and apparatus for motion vector encoding/decoding using spatial division, and method and apparatus for image encoding/decoding using same
US20120275522A1 (en) * 2009-10-28 2012-11-01 Sk Telecom Co., Ltd. Method and apparatus for motion vector encoding/decoding using spatial division, and method and apparatus for image encoding/decoding using same
US20170134649A1 (en) * 2015-11-05 2017-05-11 Canon Kabushiki Kaisha Imaging device and imaging method
US10277809B2 (en) * 2015-11-05 2019-04-30 Canon Kabushiki Kaisha Imaging device and imaging method
US11341654B2 (en) * 2016-11-23 2022-05-24 Robert Bosch Gmbh Correspondence search between matrix elements
US11838539B2 (en) 2018-10-22 2023-12-05 Beijing Bytedance Network Technology Co., Ltd Utilization of refined motion vector
US11889108B2 (en) 2018-10-22 2024-01-30 Beijing Bytedance Network Technology Co., Ltd Gradient computation in bi-directional optical flow
US11277624B2 (en) 2018-11-12 2022-03-15 Beijing Bytedance Network Technology Co., Ltd. Bandwidth control methods for inter prediction
US11516480B2 (en) 2018-11-12 2022-11-29 Beijing Bytedance Network Technology Co., Ltd. Simplification of combined inter-intra prediction
US11843725B2 (en) 2018-11-12 2023-12-12 Beijing Bytedance Network Technology Co., Ltd Using combined inter intra prediction in video processing
US11284088B2 (en) 2018-11-12 2022-03-22 Beijing Bytedance Network Technology Co., Ltd. Using combined inter intra prediction in video processing
US11956449B2 (en) 2018-11-12 2024-04-09 Beijing Bytedance Network Technology Co., Ltd. Simplification of combined inter-intra prediction
US11956465B2 (en) 2018-11-20 2024-04-09 Beijing Bytedance Network Technology Co., Ltd Difference calculation based on partial position
US11880485B2 (en) 2018-12-19 2024-01-23 Canon Medical Systems Corporation Medical information anonymizing system and anonymizing method setting device
US11509923B1 (en) * 2019-03-06 2022-11-22 Beijing Bytedance Network Technology Co., Ltd. Usage of converted uni-prediction candidate
US11930165B2 (en) 2019-03-06 2024-03-12 Beijing Bytedance Network Technology Co., Ltd Size dependent inter coding

Also Published As

Publication number Publication date
KR20150006021A (ko) 2015-01-15
CN106851310A (zh) 2017-06-13
BR112013016702A2 (pt) 2016-10-04
JP2017143556A (ja) 2017-08-17
EP2666294A1 (en) 2013-11-27
PL3518544T3 (pl) 2020-07-13
RU2600530C2 (ru) 2016-10-20
CN103314586B (zh) 2017-09-22
US10165279B2 (en) 2018-12-25
JP6513154B2 (ja) 2019-05-15
CN106210734A (zh) 2016-12-07
ES2786998T3 (es) 2020-10-14
RU2016136342A3 (zh) 2018-03-15
PL3244613T3 (pl) 2020-02-28
EP3070944A1 (en) 2016-09-21
KR20150006014A (ko) 2015-01-15
EP2664142B1 (en) 2016-12-28
EP3070944B1 (en) 2019-04-03
EP2664142A1 (en) 2013-11-20
KR101944289B1 (ko) 2019-01-31
ES2726048T3 (es) 2019-10-01
KR101798280B1 (ko) 2017-11-15
US20190098313A1 (en) 2019-03-28
US20180242000A1 (en) 2018-08-23
KR20170128613A (ko) 2017-11-22
GB201111866D0 (en) 2011-08-24
JP5847844B2 (ja) 2016-01-27
US9386312B2 (en) 2016-07-05
RU2013137437A (ru) 2015-02-20
CN103329528A (zh) 2013-09-25
KR101972030B1 (ko) 2019-04-24
KR20180123186A (ko) 2018-11-14
US10609380B2 (en) 2020-03-31
JP2018026826A (ja) 2018-02-15
CN107105284A (zh) 2017-08-29
US11146792B2 (en) 2021-10-12
RU2709158C1 (ru) 2019-12-16
JP2019024241A (ja) 2019-02-14
CN103314586A (zh) 2013-09-18
KR20190014111A (ko) 2019-02-11
KR20190021492A (ko) 2019-03-05
WO2012095464A1 (en) 2012-07-19
CN107483958A (zh) 2017-12-15
CN107529063A (zh) 2017-12-29
CN107454398A (zh) 2017-12-08
CN106851309A (zh) 2017-06-13
ES2834135T3 (es) 2021-06-16
KR101918437B1 (ko) 2018-11-13
CN103314593B (zh) 2016-12-21
KR101525341B1 (ko) 2015-06-02
US20160277744A1 (en) 2016-09-22
US9979968B2 (en) 2018-05-22
HUE046362T2 (hu) 2020-03-30
EP3518544B1 (en) 2020-03-11
KR20150006015A (ko) 2015-01-15
JP6545318B2 (ja) 2019-07-17
EP3174297B1 (en) 2020-10-21
CN106851307A (zh) 2017-06-13
CN103314593A (zh) 2013-09-18
JP2017201802A (ja) 2017-11-09
GB201100462D0 (en) 2011-02-23
US10506236B2 (en) 2019-12-10
EP3550841A1 (en) 2019-10-09
CN103314585A (zh) 2013-09-18
KR20130119467A (ko) 2013-10-31
KR20170128614A (ko) 2017-11-22
JP2014503158A (ja) 2014-02-06
HUE049745T2 (hu) 2020-10-28
CN106851308A (zh) 2017-06-13
WO2012095466A1 (en) 2012-07-19
EP3598756B1 (en) 2021-03-10
EP3244613B1 (en) 2019-09-25
CN107454398B (zh) 2020-03-03
KR20190044128A (ko) 2019-04-29
ES2583407T3 (es) 2016-09-20
JP2016054538A (ja) 2016-04-14
JP2014506439A (ja) 2014-03-13
EP3550841B1 (en) 2020-10-07
CN107454423A (zh) 2017-12-08
US20180241999A1 (en) 2018-08-23
TR201907405T4 (tr) 2019-06-21
EP3174297A1 (en) 2017-05-31
KR101943787B1 (ko) 2019-01-29
PL3070944T3 (pl) 2019-09-30
JP5847843B2 (ja) 2016-01-27
RU2762933C2 (ru) 2021-12-24
RU2556386C2 (ru) 2015-07-10
KR20130105907A (ko) 2013-09-26
KR101999091B1 (ko) 2019-07-10
JP2015164322A (ja) 2015-09-10
KR20170128610A (ko) 2017-11-22
US20180242001A1 (en) 2018-08-23
HUE052669T2 (hu) 2021-05-28
US20190098314A1 (en) 2019-03-28
US20130287113A1 (en) 2013-10-31
WO2013041244A1 (en) 2013-03-28
RU2651181C2 (ru) 2018-04-18
JP2014506440A (ja) 2014-03-13
CN107454399A (zh) 2017-12-08
JP2014503157A (ja) 2014-02-06
RU2015120774A (ru) 2015-11-20
US20180352236A1 (en) 2018-12-06
KR101837803B1 (ko) 2018-03-12
KR20130105906A (ko) 2013-09-26
RU2016136342A (ru) 2018-03-15
KR101953520B1 (ko) 2019-02-28
GB2487261A (en) 2012-07-18
GB201104032D0 (en) 2011-04-20
JP6336170B2 (ja) 2018-06-06
RU2019137968A3 (zh) 2021-05-25
ES2753760T3 (es) 2020-04-14
CN107105285A (zh) 2017-08-29
KR102019640B1 (ko) 2019-09-06
PL3550841T3 (pl) 2021-04-06
US20210144385A1 (en) 2021-05-13
JP6779954B2 (ja) 2020-11-04
HUE052346T2 (hu) 2021-04-28
CN107483958B (zh) 2020-03-03
BR122019026393B1 (pt) 2022-05-24
PL3174297T3 (pl) 2021-03-08
JP6207576B2 (ja) 2017-10-04
US20180316921A1 (en) 2018-11-01
EP2664152A1 (en) 2013-11-20
JP5847845B2 (ja) 2016-01-27
HUE043611T2 (hu) 2019-08-28
JP6165219B2 (ja) 2017-07-19
US20130294521A1 (en) 2013-11-07
CN103329528B (zh) 2016-12-21
EP3244613A1 (en) 2017-11-15
ES2835311T3 (es) 2021-06-22
US20190098315A1 (en) 2019-03-28
EP2666294B1 (en) 2016-05-18
EP3598756A1 (en) 2020-01-22
CN106210734B (zh) 2020-01-14
KR101524393B1 (ko) 2015-05-29
RU2688252C1 (ru) 2019-05-21
KR101524394B1 (ko) 2015-05-29
CN107105272A (zh) 2017-08-29
ES2615828T3 (es) 2017-06-08
CN107529063B (zh) 2020-03-31
US20130287112A1 (en) 2013-10-31
GB2487253A (en) 2012-07-18
JP2016054539A (ja) 2016-04-14
EP3518544A1 (en) 2019-07-31
WO2012095465A1 (en) 2012-07-19
KR20130119468A (ko) 2013-10-31
KR101797805B1 (ko) 2017-11-14
JP2018152878A (ja) 2018-09-27
BR112013016702B1 (pt) 2022-08-16
US10499060B2 (en) 2019-12-03
KR20180030223A (ko) 2018-03-21
GB2487200A (en) 2012-07-18
JP6120900B2 (ja) 2017-04-26
EP2664145A1 (en) 2013-11-20
RU2019137968A (ru) 2021-05-25

Similar Documents

Publication Publication Date Title
US20210144385A1 (en) Video encoding and decoding with improved error resilience
US20130301734A1 (en) Video encoding and decoding with low complexity
US20170208223A1 (en) Video encoding and decoding with improved error resilience

Legal Events

Date Code Title Description
AS Assignment

Owner name: CANON KABUSHIKI KAISHA, JAPAN

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:GISQUET, CHRISTOPHE;LAROCHE, GUILLAUME;REEL/FRAME:030766/0617

Effective date: 20130702

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION