US20120082228A1 - Nested entropy encoding - Google Patents

Nested entropy encoding Download PDF

Info

Publication number
US20120082228A1
US20120082228A1 US12/896,795 US89679510A US2012082228A1 US 20120082228 A1 US20120082228 A1 US 20120082228A1 US 89679510 A US89679510 A US 89679510A US 2012082228 A1 US2012082228 A1 US 2012082228A1
Authority
US
United States
Prior art keywords
motion vectors
symbols
data
flag
candidate
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
US12/896,795
Other languages
English (en)
Inventor
Yeping Su
Christopher A. Segall
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.)
Dolby International AB
Original Assignee
Individual
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 Individual filed Critical Individual
Priority to US12/896,795 priority Critical patent/US20120082228A1/en
Assigned to SHARP LABORATORIES OF AMERICA, INC. reassignment SHARP LABORATORIES OF AMERICA, INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: SEGALL, CHRISTOPHER A., SU, YEPING
Priority to MYPI2015002477A priority patent/MY190332A/en
Priority to MYPI2013000942A priority patent/MY180135A/en
Priority to PCT/JP2011/073153 priority patent/WO2012043884A1/fr
Priority to JP2013514448A priority patent/JP2013543285A/ja
Publication of US20120082228A1 publication Critical patent/US20120082228A1/en
Assigned to SHARP KABUSHIKI KAISHA reassignment SHARP KABUSHIKI KAISHA ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: SHARP LABORATORIES OF AMERICA, INC.
Priority to JP2015125233A priority patent/JP5996728B2/ja
Assigned to DOLBY INTERNATIONAL AB reassignment DOLBY INTERNATIONAL AB ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: SHARP KABUSHIKI KAISHA
Priority to US14/824,305 priority patent/US9414092B2/en
Priority to US15/189,433 priority patent/US9544605B2/en
Priority to US15/189,504 priority patent/US9584813B2/en
Priority to US15/189,307 priority patent/US9794570B2/en
Priority to JP2016163849A priority patent/JP6360528B2/ja
Priority to JP2016163850A priority patent/JP6280597B2/ja
Priority to US15/623,627 priority patent/US10057581B2/en
Priority to US15/906,582 priority patent/US10104376B2/en
Priority to JP2018090729A priority patent/JP6563557B2/ja
Priority to US16/130,875 priority patent/US10397578B2/en
Priority to JP2019135779A priority patent/JP6806855B2/ja
Priority to US16/522,232 priority patent/US10757413B2/en
Priority to US16/999,612 priority patent/US11457216B2/en
Priority to JP2020201890A priority patent/JP7025517B2/ja
Priority to JP2022019690A priority patent/JP2022069448A/ja
Priority to US17/952,725 priority patent/US11973949B2/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/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
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
    • H03M7/4031—Fixed length to variable length coding
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
    • H03M7/42—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code using table look-up for the coding or decoding process, e.g. using read-only memory
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/60—General implementation details not specific to a particular type of compression
    • H03M7/6064—Selection of Compressor
    • H03M7/6076—Selection between compressors of the same type
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/74—Address processing for routing
    • H04L45/745—Address table lookup; Address filtering
    • 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/15—Data rate or code amount at the encoder output by monitoring actual compressed data size at the memory before deciding storage at the transmission buffer
    • 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/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/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
    • H04N19/61—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding in combination with predictive coding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/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/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

  • Modern video transmission and display systems and particularly those systems that present high-definition content, require significant data compression in order to produce a visually acceptable motion picture, because transmission media simply cannot transmit an uncompressed sequence of video frames at a fast enough rate to appear as continuous motion to the human eye.
  • the compression technique used should not unduly sacrifice image quality by discarding too much frame data.
  • video compression and encoding standards such as MPEG and H.264 take advantage of temporal redundancy in the sequence of video frames.
  • adjacent frames typically show the same objects or features, which may move slightly from one frame to another due either to the movement of the object in the scene being shot (producing local motion in a frame), the movement of the camera shooting the scene (producing global motion), or both.
  • Video compression standards employ motion estimation to define regions in an image, which may correspond to objects, and associate with those regions a motion vector that describes the inter-frame movement of the content in each region so as to avoid redundant encoding and transmission of objects or patterns that appear in more than one sequential frame, despite appearing at slightly different locations in sequential frames.
  • Motion vectors may be represented by a translational model or many other models that approximate the motion of a real video camera, such as rotation, translation, or zoom. Accordingly, motion estimation is the process of calculating and encoding motion vectors as a substitute for duplicating the encoding of similar information in sequential frames.
  • motion vectors may relate to the whole image, more often they relate to small regions if the image, such as rectangular blocks, arbitrary shapes, boundaries of objects, or even individual pixels.
  • One of the popular methods is block-matching, in which the current image is subdivided into rectangular blocks of pixels, such as 4 ⁇ 4 pixels, 4 ⁇ 8 pixels, 8 ⁇ 8 pixels, 16 ⁇ 16 pixels, etc., and a motion vector (or displacement vector) is estimated for each block by searching for the closest-matching block in the reference image, within a pre-defined search region of a subsequent frame.
  • motion vectors improves coding efficiency for any particular block of an image by permitting a block to be encoded only in terms of a motion vector pointing to a corresponding block in another frame, and a “residual” or differential between the target and reference blocks.
  • the goal is therefore to determine a motion vector for a block in a way that minimizes the differential that needs to be encoded.
  • numerous variations of block matching exist, differing in the definition of the size and placement of blocks, the method of searching, the criterion for matching blocks in the current and reference frame, and several other aspects.
  • MVC motion vector competition
  • the coding of motion vectors can exploit redundancies in situations where motion vectors between sequential frames do not change drastically, by identifying an optimal predictor, from a limited set of previously-encoded candidates, so as to minimize the bit length of the differential.
  • the predictor set usually contains both spatial motion vector neighbors and temporally co-located motion vectors, and possibly spatiotemporal vectors.
  • FIGS. 1A and 1B generally illustrate motion vector competition.
  • FIG. 2 shows an exemplary system for encoding and decoding motion vectors.
  • FIG. 3 shows a nested entropy encoding structure.
  • FIG. 4 shows a system using the nested entropy encoding structure depicted in FIG. 3 .
  • FIG. 5A shows an exemplary encoder capable of trimming a candidate set of motion vectors.
  • FIG. 5B shows an exemplary method of trimming a candidate set of motion vectors used by the encoder of FIG. 5 .
  • FIG. 6 generally illustrates an alternate embodiment of encoding a temporally co-located motion vector in a candidate set of motion vectors.
  • This motion vector may be encoded with reference to a candidate set of motion vectors V a , V X , V y , and V.
  • FIG. 1A also shows the blocks A′, X′, Y′, and Z′ that the respective motion vectors would point to if used when encoding the candidate block.
  • motion vector V Z would be selected to minimize the code length of the differential V d , which in that instance, would only require a value of “1” in a single component (down) of the vector. All other differential motion vectors either would require encoding two components or would have a larger value for a single component.
  • MVC motion vector competition
  • each block may represent a single pixel, and many more motion vectors could be included in the candidate set. For example, all motion vectors previously calculated in the current frame could be included in the candidate set, as well as any motion vectors calculated for preceding frames.
  • the candidate set may include a desired number of arbitrary motion vectors useful to capture large and sudden motions in the scene.
  • the selected motion vector Vz will need to be encoded.
  • One straightforward approach is for an encoder 10 to assign a value to each candidate motion vector in a table 14 of symbols, which assuming a variable-length entropy encoding method such as Huffman or arithmetic encoding, might look something like:
  • Motion Vector Candidate Symbol V a 0 V x 10 V y 110 V z 1110 Note that none of the symbols are a prefix of another symbol, so that the decoder 12 can correctly parse the received bitstream by, in this example, stopping at a received zero and decode the received bitstream with reference to a corresponding table 16 .
  • the encoder and decoder will preferably collect statistics as the bitstream is encoded and decoded and rearrange the assignments of symbols to the motion vector candidates, in the respective tables 14 and 16 , so that at any given time the motion vector having the highest frequency receives the shortest symbol, etc. This process is generally referred to as entropy coding, and will usually result in significant, lossless compression of the bitstream.
  • the encoder 10 and the decoder 12 use the same methodology to construct and update the tables 14 and 16 initialized from the beginning of the bitstream, respectively, so that for every symbol, the table 16 used to encode that symbol is identical to the table used to decode the symbol.
  • the system shown in FIG. 2 can result in significant overhead when signaling which predictor is chosen from the set of candidate motion vectors. This is particularly true if the number of predictors is large. However, the more predictors used, the more efficiency is gained when encoding the differential motion vector. In order to further reduce the overhead of signaling which predictor is chosen, additional techniques may be employed.
  • the set of candidate motion vector predictors may be trimmed to eliminate duplicate vectors.
  • the vectors V x , V y are identical, hence one of the motion vectors cam be trimmed, and as a result, the largest symbol 1110 in the table above can be eliminated.
  • knowing the size of the trimmed motion predictor set means that the last bit of the last symbol in the trimmed set can be omitted, e.g. in the previous example where one of V X , V y was trimmed, leaving 110 as the last symbol, this symbol may simply be encoded as 11 give that this bit sequence distinguishes over all the previous symbols in the table, and the decoder knows from the size of the trimmed set that there are no further symbols.
  • coding efficiency gains could theoretically be achieved by signaling a selected one of a group of ordered candidate sets. This gain in coding efficiency could work, not only in tandem with techniques such as motion vector trimming and using truncated unary codes, but actually as a substitute for those techniques, i.e. preserving spatial and temporal independence when parsing the bitstream by not trimming duplicate candidate motion vectors and not truncating the highest-bit-length symbol.
  • an encoder or a decoder may utilize a nested entropy encoding structure where one of a plurality of coded symbols 18 is assigned to each of a plurality of entropy-coded candidate set of motion vectors, shown as separate VLC tables 20 .
  • any particular one of the VLC tables 20 may include a motion vector set that differs from that another VLC table 20 , meaning that a particular motion vector that appears in one VLC table 20 does not need to appear in all VLC tables 20 .
  • the encoder may signal one of the symbols 18 that corresponds to that one of the VLC tables 20 (candidate sets) for which the signaled motion vector has the highest frequency and therefore the smallest code length. Coded symbols 18 identifying a respective candidate set can themselves be entropy-coded, if desired, or may alternatively be encoded with a fixed length code, or any other appropriate coding technique.
  • Implicit in the foregoing discussion is the assumption that there is some non-random distribution among the plurality of all possible candidate sets of motion vectors. If, for example, the respective individual candidate sets simply comprise all permutations of the symbols included in each, randomly distributed with respect to each other, there would be no reason to expect a net gain in coding efficiency because the number of candidate sets of motion vectors, needed to guarantee that a sufficient number of candidate motion vectors appear in a candidate set high enough in the table to benefit from a reduced code length, would be too large. Essentially, what efficiency gained in coding the selected one of the candidate motion vector is lost in the overhead of coding the symbol associated with the particular candidate set.
  • the disclosed nested entropy encoding structure would be expected to further compress the bitstream only if some of the possible permutations of symbols in the candidate set are more likely than others, such that the higher-code-length candidate sets are not used as often as the lower-code-length candidate sets.
  • an encoder 10 may have access to syntax symbols from a syntax model 24 that defines a set of syntax elements in the encoded data to be used to differentiate multiple VLC tables of candidate sets of motion vectors, and therefore also defines a set of syntax elements used by the encoder and decoder to determine the VLC table with which to encode the selected ones of the candidate motion vectors with code symbols.
  • an encoder 10 (and hence a decoder 12 ) will include a learning agent that tries different combinations of syntax elements so as to intelligently maximize coding efficiency. Stated differently, the encoder 10 intelligently optimizes coding efficiency by iteratively choosing different combinations of available said syntax elements, measuring a change in coding efficiency following each chosen combination, and responding accordingly by replacing one or more syntax elements in the combination.
  • the encoder 10 may then use an applicable motion vector symbol for the selected motion vector for the current block from a VLC table 28 a , 28 b , 28 c , 28 d , etc, and encode the motion vector symbol in a bitstream to the decoder 12 .
  • the encoder 10 also updates the order of the motion vector symbols in the VLC table used based on the selected symbol. In one embodiment, any change in the frequency distribution of symbols in a table results in the symbols being reordered.
  • the encoder 10 (and the decoder 12 ) keeps track of the most frequently-occurring symbol in the un-reordered set and ensures that that symbol is at the top of the table, i.e.
  • the encoder need not encode the syntax symbol along with the motion vector symbol, so long as the decoder 12 uses the same syntax model to determine the particular VLC table 30 a , 30 b , 30 c , and 30 d , from which to extract the received motion vector symbol.
  • the encoder 10 uses the syntax of the previously-encoded data to differentiate the VLC tables, updating the order of symbols in those tables in the process, a very high degree of coding efficiency can be achieved.
  • the decoder 12 When the decoder 12 receives a coded bitstream from the encoder 10 , the decoder parses the bitstream to determine the relevant VLC table for a received symbol, using a syntax model 26 if available, to decode the received symbols to identify the selected motion vector from the candidate set. The decoder also updates the respective VLC tables in the same manner as does the encoder 10 .
  • the motion vector predictor set may contain candidate motion vectors spatially predictive of a selected motion vector (i.e. candidates in the same frame as the current block), candidate motion vectors temporally predictive of a selected motion vector (i.e. candidates at the co-located block in the frame preceding the current block), and candidate motion vectors spatiotemporally predictive of a selected motion vector (i.e. candidates in the frame preceding the current block spatially offset from the co-located block).
  • the disclosed nested entropy encoding structure permits a decoder to parse a bitstream without trimming candidate motion vectors or truncating code symbols, thereby preserving spatial and temporal independence in the parsing process, and preserving error resilience while at the same time achieving significant coding efficiencies.
  • the nested entropy encoding structure can be used in tandem with the techniques of trimming candidate motion vectors or truncating code symbols, while at least partially preserving error resilience.
  • an encoder 10 may include a candidate motion vector set construction module 40 that retrieves from one or more buffers 28 the full set of candidate motion vectors applicable to a current block being encoded.
  • a candidate motion vector set trimming module 42 then selectively trims the set of candidate motion vectors according to predefined rules, by applying a syntax model 24 to the set of candidate motion vectors, prior to encoding a selected motion vector with an encoding module 44 , which in turn selects a symbol based on the trimmed set of candidates.
  • One potential predefined rule may prevent the candidate motion vector set module 42 from trimming motion vector predictors derived from previously reconstructed/transmitted frames.
  • the two motion vector predictors are both included in the trimmed set. This preserves temporal independence.
  • a predefined rule may prevent the candidate motion vector set trimming module 42 from trimming motion vector predictors derived from regions that are located in different slices, so as to preserve spatial independence.
  • a predefined rule may prevent the candidate motion vector set trimming module 42 from trimming motion vector predictors derived from regions that are located in different entropy slices, where an entropy slice is a unit of the bit-stream that may be parsed without reference to other data in the current frame.
  • FIG. 5B shows a generalized technique for applying any one of a wide variety of trimming rule sets that are signaled using a novel flag.
  • an encoder 10 receives a candidate set of motion vector predictors from a buffer 28 , for example.
  • a flag is signaled by the encoder (or received by the decoder) that is used at decision step 53 to indicate whether trimming is applied, and optionally a trimming rule set as well that may be used to define which vectors will be trimmed. If the flag indicates that no trimming is to occur, the technique proceeds to step 60 and encodes the selected motion vector using the full set of candidate motion vectors.
  • the subset of duplicate motion vectors is identified in step 54 .
  • the subset of duplicate motion vectors can be considered in one embodiment as a maximized collection of motion vectors for which each member of the subset has an identical motion vector not included in the subset.
  • the subset may be seen as one that excludes from the subset any motion vector in the full set of candidates that has no duplicate an also excludes from the subset exactly one motion vector in a collection of identical duplicates.
  • selected candidate motion vectors may be selectively removed from the subset of duplicates. It is this step that enables spatial and/or temporal independence to be preserved.
  • candidate motion vectors can also be added to the subset of duplicate motion vectors, for reasons explained in more detail below.
  • the purpose of steps 54 and 56 is simply to apply a rule set to identify those motion vectors that will be trimmed from the full candidate set. Once this subset has been identified, the candidate motion vectors in this subset is trimmed at step 58 and the encoder then encodes the selected motion vector, from those remaining, based on the size of the trimmed set at step 60 .
  • temporal_mvp_flag used by the encoder to signal into the bitstream a true/false condition of whether the selected motion vector, from the candidate set, is a temporally-located motion vector.
  • the applicable rule set for this flag is intended to preserve temporal independence. If the temporal_mvp_flag indicates that a temporal predictor is selected by the encoder, the temporal predictor subset in the candidate set will not be trimmed, because to do so would create temporal dependency. However, the spatial predictor subset of the candidate set can be trimmed because the decoder 12 has foreknowledge of the size of the temporal predictor subset.
  • the candidate set can not only be trimmed of duplicates, but in some embodiments can also be trimmed of temporal predictors, resulting in a drastically diminished candidate set that needs to be encoded. It should also be recognized that, if an applicable rule set permits both temporal and spatial dependencies, the a temporal_mvp_flag can be used, regardless of its value, to trim duplicates of the temporal or spatial subset signaled by the flag and to trim the entire subset not signaled by the flag.
  • the inventors have determined that there is a reasonable correlation between the value of the disclosed temporal_mvp_flag and the value of a constrained_intra_pred_flag, associated with a frame, and often used in an encoded video bit stream. Specifically, the inventors have determined that there is a strong correlation between these two flags when the value of the constrained_intrapred_flag is 1, and a substantially less strong correlation when the value of the constrained_intra_pred_flag is 0.
  • the encoder may optionally be configured to not encode the disclosed temporal_mvp_flag when the constrained_intrapred_flag is set to 1 for the frame of a current pixel, such that the decoder will simply insert or assume an equal value for the temporal_mvp_flag in that instance, and to otherwise encode the temporal_mvp_flag.
  • the disclosed temporal_mvp_flag may simply be assigned a value equal to the constrained_intra_pred_flag, but preferably in this latter circumstance the value of a 0 should be associated in the defined rule set as causing the result of simply trimming duplicate vectors in the candidate set.
  • the disclosed nested entropy encoding structure can be additionally applied to this temporal_mvp_flag syntax.
  • top and left neighboring flags are used to determine the predictor set template used in the entropy coding of temporal_mvp_flag. This may be beneficial if, as is the usual case, the encoder and decoder exclusively assigns entropy symbols to coded values, and also where the temporal_mvp_flag may take on many values.
  • the predictor set template for the coding of the selected motion vector for the candidate set is made depending on the temporal_mvp_flag of the current block.
  • another embodiment of the invention signals if the motion vector predictor is equal to motion vectors derived from the current frame or motion vectors derived from a previously reconstructed/transmitted frame, as was previously described with respect to the temporal_mvp_flag.
  • the flag is sent indexed by the number of unique motion vector predictors derived from the current frame.
  • a predictor set template in this embodiment could distinguish all possible combinations of a first code value that reflects the combination of flags in the two blocks to the left and above the current block, e.g. 00, 01, 10, 11 (entropy coded as 0, 10, 110, and 1110) as indexed by a second code value reflective of the number of unique motion vectors in the candidate set.
  • a context template in this embodiment could identify all possible combinations of a first code value that reflects whether the flags in the two blocks to the left and above the current block are identical or not, e.g. 00 and 11 entropy coded as 0 and 01 and 10 entropy coded as 10, for example, and a second code value reflective of the number of unique motion vectors in the candidate set.
  • An encoding scheme may include a candidate set of motion vectors that includes a large number of temporally co-located motion vectors from each of a plurality of frames, such as the one illustrated in FIG. 6 .
  • the smallest-sized block of pixels used in the encoding scheme e.g.
  • a 2 ⁇ 2 block may be grouped in larger blocks 62 , where the motion vectors stored in the buffer, and later used as co-located motion vectors when encoding subsequent blocks, may instead be the average motion vector 66 of all the selected vectors in the respective group.
  • a vector median operation or a component-wise medial operation may be used, as can any other standard operation such as maximum, minimum, or a combination of maximum and minimum operations, commonly called a dilate, erode, open, or close operation.
  • the operation used to group smaller-sized blocks of pixels into larger blocks may be signaled in a bit-stream from an encoder to a decoder.
  • the operation may be signaled in a sequence parameter set, or alternatively, the operation may be signaled in the picture parameter set, slice header, or for any defined group of pixels.
  • the operation can be determined from a level or profile identifier that is signaled in the bit-stream.
  • the number of smallest sized blocks that are grouped to larger blocks may be signaled in a bit-stream from an encoder to a decoder.
  • said number may signaled in the sequence parameter set, or alternatively the number may be signaled in the picture parameter set, slice header, or for any defined group of pixels.
  • the number may be determined from a level or profile identifier that is signaled in the bit-stream.
  • the number may be expressed as a number of rows of smallest-sized blocks and a number of column of smallest-sized blocks
  • an encoder and/or a decoder may be used in any one of a number of hardware, firmware, or software implementations.
  • an encoder may be used in a set-top recorder, a server, desktop computer, etc.
  • a decoder may be implemented in a display device, a set-top cable box, a set-top recorder, a server, desktop computer, etc.
  • firmware and/or software the various components of the disclosed encoder and decoder may access any available processing device and storage to perform the described techniques.

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Multimedia (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
US12/896,795 2010-10-01 2010-10-01 Nested entropy encoding Abandoned US20120082228A1 (en)

Priority Applications (22)

Application Number Priority Date Filing Date Title
US12/896,795 US20120082228A1 (en) 2010-10-01 2010-10-01 Nested entropy encoding
MYPI2015002477A MY190332A (en) 2010-10-01 2011-09-30 Nested entropy encoding
MYPI2013000942A MY180135A (en) 2010-10-01 2011-09-30 Nested entropy encoding
PCT/JP2011/073153 WO2012043884A1 (fr) 2010-10-01 2011-09-30 Codage entropique imbriqué
JP2013514448A JP2013543285A (ja) 2010-10-01 2011-09-30 ネスト型エントロピー符号化
JP2015125233A JP5996728B2 (ja) 2010-10-01 2015-06-23 動きベクトル候補セットを生成する方法
US14/824,305 US9414092B2 (en) 2010-10-01 2015-08-12 Nested entropy encoding
US15/189,433 US9544605B2 (en) 2010-10-01 2016-06-22 Nested entropy encoding
US15/189,307 US9794570B2 (en) 2010-10-01 2016-06-22 Nested entropy encoding
US15/189,504 US9584813B2 (en) 2010-10-01 2016-06-22 Nested entropy encoding
JP2016163850A JP6280597B2 (ja) 2010-10-01 2016-08-24 動きベクトル候補セットを生成する方法
JP2016163849A JP6360528B2 (ja) 2010-10-01 2016-08-24 動きベクトル候補セットを生成する方法
US15/623,627 US10057581B2 (en) 2010-10-01 2017-06-15 Nested entropy encoding
US15/906,582 US10104376B2 (en) 2010-10-01 2018-02-27 Nested entropy encoding
JP2018090729A JP6563557B2 (ja) 2010-10-01 2018-05-09 動きベクトル候補セットを生成する方法
US16/130,875 US10397578B2 (en) 2010-10-01 2018-09-13 Nested entropy encoding
JP2019135779A JP6806855B2 (ja) 2010-10-01 2019-07-24 装置
US16/522,232 US10757413B2 (en) 2010-10-01 2019-07-25 Nested entropy encoding
US16/999,612 US11457216B2 (en) 2010-10-01 2020-08-21 Nested entropy encoding
JP2020201890A JP7025517B2 (ja) 2010-10-01 2020-12-04 復号方法
JP2022019690A JP2022069448A (ja) 2010-10-01 2022-02-10 符号化装置およびビットストリーム
US17/952,725 US11973949B2 (en) 2010-10-01 2022-09-26 Nested entropy encoding

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US12/896,795 US20120082228A1 (en) 2010-10-01 2010-10-01 Nested entropy encoding

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US14/824,305 Continuation US9414092B2 (en) 2010-10-01 2015-08-12 Nested entropy encoding

Publications (1)

Publication Number Publication Date
US20120082228A1 true US20120082228A1 (en) 2012-04-05

Family

ID=45889820

Family Applications (11)

Application Number Title Priority Date Filing Date
US12/896,795 Abandoned US20120082228A1 (en) 2010-10-01 2010-10-01 Nested entropy encoding
US14/824,305 Active US9414092B2 (en) 2010-10-01 2015-08-12 Nested entropy encoding
US15/189,433 Active US9544605B2 (en) 2010-10-01 2016-06-22 Nested entropy encoding
US15/189,307 Active 2030-10-03 US9794570B2 (en) 2010-10-01 2016-06-22 Nested entropy encoding
US15/189,504 Active US9584813B2 (en) 2010-10-01 2016-06-22 Nested entropy encoding
US15/623,627 Active US10057581B2 (en) 2010-10-01 2017-06-15 Nested entropy encoding
US15/906,582 Active US10104376B2 (en) 2010-10-01 2018-02-27 Nested entropy encoding
US16/130,875 Active US10397578B2 (en) 2010-10-01 2018-09-13 Nested entropy encoding
US16/522,232 Active US10757413B2 (en) 2010-10-01 2019-07-25 Nested entropy encoding
US16/999,612 Active US11457216B2 (en) 2010-10-01 2020-08-21 Nested entropy encoding
US17/952,725 Active US11973949B2 (en) 2010-10-01 2022-09-26 Nested entropy encoding

Family Applications After (10)

Application Number Title Priority Date Filing Date
US14/824,305 Active US9414092B2 (en) 2010-10-01 2015-08-12 Nested entropy encoding
US15/189,433 Active US9544605B2 (en) 2010-10-01 2016-06-22 Nested entropy encoding
US15/189,307 Active 2030-10-03 US9794570B2 (en) 2010-10-01 2016-06-22 Nested entropy encoding
US15/189,504 Active US9584813B2 (en) 2010-10-01 2016-06-22 Nested entropy encoding
US15/623,627 Active US10057581B2 (en) 2010-10-01 2017-06-15 Nested entropy encoding
US15/906,582 Active US10104376B2 (en) 2010-10-01 2018-02-27 Nested entropy encoding
US16/130,875 Active US10397578B2 (en) 2010-10-01 2018-09-13 Nested entropy encoding
US16/522,232 Active US10757413B2 (en) 2010-10-01 2019-07-25 Nested entropy encoding
US16/999,612 Active US11457216B2 (en) 2010-10-01 2020-08-21 Nested entropy encoding
US17/952,725 Active US11973949B2 (en) 2010-10-01 2022-09-26 Nested entropy encoding

Country Status (4)

Country Link
US (11) US20120082228A1 (fr)
JP (8) JP2013543285A (fr)
MY (2) MY180135A (fr)
WO (1) WO2012043884A1 (fr)

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130208804A1 (en) * 2011-01-19 2013-08-15 Media Tek Inc. Method and Apparatus for Parsing Error Robustness of Temporal Motion Vector Prediction
US20130272420A1 (en) * 2010-12-29 2013-10-17 Canon Kabushiki Kaisha Video encoding and decoding with improved error resilience
US20130287112A1 (en) * 2011-01-12 2013-10-31 Canon Kabushiki Kaisha Video encoding and decoding with improved error resilience
US20130294512A1 (en) * 2011-01-21 2013-11-07 Sk Telecom Co Ltd Apparatus and method for generating/recovering motion information based on predictive motion vector index encoding, and apparatus and method for image encoding/decoding using same
US20130301737A1 (en) * 2011-02-07 2013-11-14 Sony Corporation Image processing device and method
CN109889833A (zh) * 2019-03-04 2019-06-14 中科院成都信息技术股份有限公司 一种基于改进二进制烟花算法的图像压缩方法
CN110740329A (zh) * 2018-07-19 2020-01-31 腾讯美国有限责任公司 视频编码解码方法和装置、计算机设备和存储介质
US11057639B2 (en) 2011-05-31 2021-07-06 Sun Patent Trust Derivation method and apparatuses with candidate motion vectors
US11076170B2 (en) 2011-05-27 2021-07-27 Sun Patent Trust Coding method and apparatus with candidate motion vectors
US11115664B2 (en) 2011-05-27 2021-09-07 Sun Patent Trust Image coding method, image coding apparatus, image decoding method, image decoding apparatus, and image coding and decoding apparatus
US11356694B2 (en) 2011-04-12 2022-06-07 Sun Patent Trust Moving picture coding method, moving picture coding apparatus, moving picture decoding method, moving picture decoding apparatus and moving picture coding and decoding apparatus
US11553202B2 (en) * 2011-08-03 2023-01-10 Sun Patent Trust Video encoding method, video encoding apparatus, video decoding method, video decoding apparatus, and video encoding/decoding apparatus
US11647208B2 (en) 2011-10-19 2023-05-09 Sun Patent Trust Picture coding method, picture coding apparatus, picture decoding method, and picture decoding apparatus

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
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
FR3029055B1 (fr) * 2014-11-24 2017-01-13 Ateme Procede d'encodage d'image et equipement pour la mise en oeuvre du procede
CN105681807B (zh) * 2016-01-06 2018-11-02 福州瑞芯微电子股份有限公司 一种基于h264协议的分像素运动矢量计算方法和装置
CN110662074B (zh) * 2018-06-28 2021-11-23 杭州海康威视数字技术股份有限公司 一种运动矢量确定方法和设备
CN109068140B (zh) * 2018-10-18 2021-06-22 北京奇艺世纪科技有限公司 视频编码中运动向量的确定方法、装置及视频编解码设备
JP7418687B2 (ja) 2018-12-28 2024-01-22 株式会社Ｊｖｃケンウッド 動画像符号化装置、動画像符号化方法及び動画像符号化プログラム
CN110061813B (zh) * 2019-04-09 2022-10-04 惠州市仲恺Tcl智融科技小额贷款股份有限公司 一种数据编码方法和解码方法、及相关装置
SG11202111757YA (en) * 2019-04-25 2021-11-29 Op Solutions Llc Adaptive motion vector prediction candidates in frames with global motion
BR112021021344A2 (pt) * 2019-04-25 2022-01-18 Op Solutions Llc Candidatos em quadros com movimento global
BR112021021348A2 (pt) 2019-04-25 2022-01-18 Op Solutions Llc Candidatos de previsão de vetor de movimento seletiva em quadros com movimento global

Citations (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040114689A1 (en) * 2002-12-13 2004-06-17 Huipin Zhang Wavelet based multiresolution video representation with spatially scalable motion vectors
US20040213468A1 (en) * 2003-04-28 2004-10-28 Samsung Electronics Co., Ltd. Method for determining reference picture and motion compensation method and apparatus thereof
US20040263361A1 (en) * 2003-06-25 2004-12-30 Lsi Logic Corporation Video decoder and encoder transcoder to and from re-orderable format
US20050226335A1 (en) * 2004-04-13 2005-10-13 Samsung Electronics Co., Ltd. Method and apparatus for supporting motion scalability
US20060008006A1 (en) * 2004-07-07 2006-01-12 Samsung Electronics Co., Ltd. Video encoding and decoding methods and video encoder and decoder
US20060013310A1 (en) * 2004-07-15 2006-01-19 Samsung Electronics Co., Ltd. Temporal decomposition and inverse temporal decomposition methods for video encoding and decoding and video encoder and decoder
US20060165301A1 (en) * 2005-01-21 2006-07-27 Samsung Electronics Co., Ltd. Video coding method and apparatus for efficiently predicting unsynchronized frame
US7199735B1 (en) * 2005-08-25 2007-04-03 Mobilygen Corporation Method and apparatus for entropy coding
US20070268964A1 (en) * 2006-05-22 2007-11-22 Microsoft Corporation Unit co-location-based motion estimation
US20080043832A1 (en) * 2006-08-16 2008-02-21 Microsoft Corporation Techniques for variable resolution encoding and decoding of digital video
US20080181308A1 (en) * 2005-03-04 2008-07-31 Yong Wang System and method for motion estimation and mode decision for low-complexity h.264 decoder
US20090304084A1 (en) * 2008-03-19 2009-12-10 Nokia Corporation Combined motion vector and reference index prediction for video coding
US20100232507A1 (en) * 2006-03-22 2010-09-16 Suk-Hee Cho Method and apparatus for encoding and decoding the compensated illumination change
US20100290530A1 (en) * 2009-05-14 2010-11-18 Qualcomm Incorporated Motion vector processing
US8116578B2 (en) * 2004-10-21 2012-02-14 Samsung Electronics Co., Ltd. Method and apparatus for effectively compressing motion vectors in video coder based on multi-layer
US8271293B2 (en) * 2004-09-17 2012-09-18 Digital Rise Technology Co., Ltd. Audio decoding using variable-length codebook application ranges
US8290055B2 (en) * 2004-06-28 2012-10-16 Google Inc. Video compression and encoding method
US20130027230A1 (en) * 2010-04-13 2013-01-31 Detlev Marpe Entropy coding

Family Cites Families (38)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5996728A (ja) 1982-11-25 1984-06-04 Fujitsu Ltd レジストパタ−ン形成方法
JPS5996728U (ja) 1982-12-21 1984-06-30 オムロン株式会社 光電スイツチ
JPH0263557U (fr) 1988-11-01 1990-05-11
GB2266023B (en) 1992-03-31 1995-09-06 Sony Broadcast & Communication Motion dependent video signal processing
US6141446A (en) 1994-09-21 2000-10-31 Ricoh Company, Ltd. Compression and decompression system with reversible wavelets and lossy reconstruction
US5731840A (en) 1995-03-10 1998-03-24 Kabushiki Kaisha Toshiba Video coding/decoding apparatus which transmits different accuracy prediction levels
JPH10224800A (ja) 1997-02-07 1998-08-21 Matsushita Electric Ind Co Ltd 動きベクトル符号化方法および復号化方法
US7020671B1 (en) 2000-03-21 2006-03-28 Hitachi America, Ltd. Implementation of an inverse discrete cosine transform using single instruction multiple data instructions
JP3597107B2 (ja) 2000-03-29 2004-12-02 沖電気工業株式会社 動きベクトル検出回路及び動きベクトル検出方法
US6958715B2 (en) 2001-02-20 2005-10-25 Texas Instruments Incorporated Variable length decoding system and method
US7929610B2 (en) * 2001-03-26 2011-04-19 Sharp Kabushiki Kaisha Methods and systems for reducing blocking artifacts with reduced complexity for spatially-scalable video coding
WO2003098939A1 (fr) * 2002-05-22 2003-11-27 Matsushita Electric Industrial Co., Ltd. Procedes de codage et de decodage d'image de mouvement et support d'enregistrement de donnees
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
AU2003261780B8 (en) 2002-11-25 2010-03-25 Godo Kaisha Ip Bridge 1 Motion compensation method, picture coding method and picture decoding method
JP4536325B2 (ja) 2003-02-04 2010-09-01 ソニー株式会社 画像処理装置および方法、記録媒体、並びにプログラム
US8064520B2 (en) 2003-09-07 2011-11-22 Microsoft Corporation Advanced bi-directional predictive coding of interlaced video
US7599438B2 (en) 2003-09-07 2009-10-06 Microsoft Corporation Motion vector block pattern coding and decoding
KR20050045746A (ko) 2003-11-12 2005-05-17 삼성전자주식회사 계층 구조의 가변 블록 크기를 이용한 움직임 추정 방법및 장치
CN100469146C (zh) 2004-11-17 2009-03-11 展讯通信（上海）有限公司 视频图像运动补偿装置
US8913660B2 (en) 2005-04-14 2014-12-16 Fastvdo, Llc Device and method for fast block-matching motion estimation in video encoders
JP4592656B2 (ja) * 2006-08-17 2010-12-01 富士通セミコンダクター株式会社 動き予測処理装置、画像符号化装置および画像復号化装置
KR101356735B1 (ko) * 2007-01-03 2014-02-03 삼성전자주식회사 전역 움직임 벡터를 사용해서 움직임 벡터를 추정하기 위한방법, 장치, 인코더, 디코더 및 복호화 방법
JP2009055519A (ja) 2007-08-29 2009-03-12 Sony Corp 符号化処理装置、符号化処理方法、復号処理装置、及び、復号処理方法
JP2009159323A (ja) * 2007-12-26 2009-07-16 Toshiba Corp 動画像符号化装置、動画像符号化方法及び動画像符号化プログラム
US20100027663A1 (en) * 2008-07-29 2010-02-04 Qualcomm Incorporated Intellegent frame skipping in video coding based on similarity metric in compressed domain
KR20100027384A (ko) 2008-09-02 2010-03-11 삼성전자주식회사 예측 모드 결정 방법 및 장치
KR101279573B1 (ko) 2008-10-31 2013-06-27 에스케이텔레콤 주식회사 움직임 벡터 부호화 방법 및 장치와 그를 이용한 영상 부호화/복호화 방법 및 장치
ES2629027T3 (es) 2009-06-19 2017-08-07 Orange Codificación de vectores de movimiento por competición de predictores
US9036692B2 (en) * 2010-01-18 2015-05-19 Mediatek Inc. Motion prediction method
KR20120016991A (ko) 2010-08-17 2012-02-27 오수미 인터 프리딕션 방법
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
US20120183047A1 (en) * 2011-01-18 2012-07-19 Louis Joseph Kerofsky Video decoder with reduced dynamic range transform with inverse transform clipping
FI4164224T3 (fi) * 2011-06-28 2024-05-07 Lg Electronics Inc Videodekoodauslaitteisto ja videokoodauslaitteisto
KR102014332B1 (ko) * 2011-10-21 2019-08-26 노키아 테크놀로지스 오와이 비디오 코딩 방법 및 장치
US9525861B2 (en) * 2012-03-14 2016-12-20 Qualcomm Incorporated Disparity vector prediction in video coding
US9503720B2 (en) * 2012-03-16 2016-11-22 Qualcomm Incorporated Motion vector coding and bi-prediction in HEVC and its extensions
JP6454468B2 (ja) 2013-12-26 2019-01-16 日東電工株式会社 延伸積層体の製造方法、該製造方法により得られる延伸積層体、該延伸積層体を用いた偏光膜の製造方法、および延伸装置

Patent Citations (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040114689A1 (en) * 2002-12-13 2004-06-17 Huipin Zhang Wavelet based multiresolution video representation with spatially scalable motion vectors
US20040213468A1 (en) * 2003-04-28 2004-10-28 Samsung Electronics Co., Ltd. Method for determining reference picture and motion compensation method and apparatus thereof
US20040263361A1 (en) * 2003-06-25 2004-12-30 Lsi Logic Corporation Video decoder and encoder transcoder to and from re-orderable format
US20050226335A1 (en) * 2004-04-13 2005-10-13 Samsung Electronics Co., Ltd. Method and apparatus for supporting motion scalability
US8290055B2 (en) * 2004-06-28 2012-10-16 Google Inc. Video compression and encoding method
US20060008006A1 (en) * 2004-07-07 2006-01-12 Samsung Electronics Co., Ltd. Video encoding and decoding methods and video encoder and decoder
US20060013310A1 (en) * 2004-07-15 2006-01-19 Samsung Electronics Co., Ltd. Temporal decomposition and inverse temporal decomposition methods for video encoding and decoding and video encoder and decoder
US8271293B2 (en) * 2004-09-17 2012-09-18 Digital Rise Technology Co., Ltd. Audio decoding using variable-length codebook application ranges
US8116578B2 (en) * 2004-10-21 2012-02-14 Samsung Electronics Co., Ltd. Method and apparatus for effectively compressing motion vectors in video coder based on multi-layer
US20060165301A1 (en) * 2005-01-21 2006-07-27 Samsung Electronics Co., Ltd. Video coding method and apparatus for efficiently predicting unsynchronized frame
US20080181308A1 (en) * 2005-03-04 2008-07-31 Yong Wang System and method for motion estimation and mode decision for low-complexity h.264 decoder
US7281771B1 (en) * 2005-08-25 2007-10-16 Mobilygen Corporation Method and apparatus for entropy coding
US7199735B1 (en) * 2005-08-25 2007-04-03 Mobilygen Corporation Method and apparatus for entropy coding
US20100232507A1 (en) * 2006-03-22 2010-09-16 Suk-Hee Cho Method and apparatus for encoding and decoding the compensated illumination change
US20070268964A1 (en) * 2006-05-22 2007-11-22 Microsoft Corporation Unit co-location-based motion estimation
US20080043832A1 (en) * 2006-08-16 2008-02-21 Microsoft Corporation Techniques for variable resolution encoding and decoding of digital video
US20090304084A1 (en) * 2008-03-19 2009-12-10 Nokia Corporation Combined motion vector and reference index prediction for video coding
US20100290530A1 (en) * 2009-05-14 2010-11-18 Qualcomm Incorporated Motion vector processing
US8675736B2 (en) * 2009-05-14 2014-03-18 Qualcomm Incorporated Motion vector processing
US20130027230A1 (en) * 2010-04-13 2013-01-31 Detlev Marpe Entropy coding

Cited By (37)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130272420A1 (en) * 2010-12-29 2013-10-17 Canon Kabushiki Kaisha Video encoding and decoding with improved error resilience
US20180242000A1 (en) * 2011-01-12 2018-08-23 Canon Kabushiki Kaisha Video Encoding and Decoding with Improved Error Resilience
US10499060B2 (en) * 2011-01-12 2019-12-03 Canon Kabushiki Kaisha Video encoding and decoding with improved error resilience
US20180316921A1 (en) * 2011-01-12 2018-11-01 Canon Kabushiki Kaisha Video Encoding and Decoding with Improved Error Resilience
US20180241999A1 (en) * 2011-01-12 2018-08-23 Canon Kabushiki Kaisha Video Encoding and Decoding with Improved Error Resilience
US20130287112A1 (en) * 2011-01-12 2013-10-31 Canon Kabushiki Kaisha Video encoding and decoding with improved error resilience
US10165279B2 (en) 2011-01-12 2018-12-25 Canon Kabushiki Kaisha Video encoding and decoding with improved error resilience
US9386312B2 (en) * 2011-01-12 2016-07-05 Canon Kabushiki Kaisha Video encoding and decoding with improved error resilience
US20180242001A1 (en) * 2011-01-12 2018-08-23 Canon Kabushiki Kaisha Video Encoding and Decoding with Improved Error Resilience
US9979968B2 (en) * 2011-01-12 2018-05-22 Canon Kabushiki Kaisha Method, a device, a medium for video decoding that includes adding and removing motion information predictors
US11146792B2 (en) 2011-01-12 2021-10-12 Canon Kabushiki Kaisha Video encoding and decoding with improved error resilience
US9300963B2 (en) * 2011-01-19 2016-03-29 Mediatek Inc. Method and apparatus for parsing error robustness of temporal motion vector prediction
US9525879B2 (en) * 2011-01-19 2016-12-20 Hfi Innovation Inc. Method and apparatus for parsing error robustness of temporal motion vector prediction
US20130208804A1 (en) * 2011-01-19 2013-08-15 Media Tek Inc. Method and Apparatus for Parsing Error Robustness of Temporal Motion Vector Prediction
US20160173872A1 (en) * 2011-01-19 2016-06-16 Mediatek Inc. Method and Apparatus for Parsing Error Robustness of Temporal Motion Vector Prediction
US20130294512A1 (en) * 2011-01-21 2013-11-07 Sk Telecom Co Ltd Apparatus and method for generating/recovering motion information based on predictive motion vector index encoding, and apparatus and method for image encoding/decoding using same
US9578330B2 (en) * 2011-01-21 2017-02-21 Sk Telecom Co., Ltd. Apparatus and method for generating/recovering motion information based on predictive motion vector index encoding, and apparatus and method for image encoding/decoding using same
US9781481B2 (en) 2011-01-21 2017-10-03 Sk Telecom Co., Ltd. Apparatus and method for generating/recovering motion information based on predictive motion vector index encoding, and apparatus and method for image encoding/decoding using same
US20130301737A1 (en) * 2011-02-07 2013-11-14 Sony Corporation Image processing device and method
US9392277B2 (en) * 2011-02-07 2016-07-12 Sony Corporation Image processing device and method
US11356694B2 (en) 2011-04-12 2022-06-07 Sun Patent Trust Moving picture coding method, moving picture coding apparatus, moving picture decoding method, moving picture decoding apparatus and moving picture coding and decoding apparatus
US11917186B2 (en) 2011-04-12 2024-02-27 Sun Patent Trust Moving picture coding method, moving picture coding apparatus, moving picture decoding method, moving picture decoding apparatus and moving picture coding and decoding apparatus
US11076170B2 (en) 2011-05-27 2021-07-27 Sun Patent Trust Coding method and apparatus with candidate motion vectors
US11115664B2 (en) 2011-05-27 2021-09-07 Sun Patent Trust Image coding method, image coding apparatus, image decoding method, image decoding apparatus, and image coding and decoding apparatus
US11979582B2 (en) 2011-05-27 2024-05-07 Sun Patent Trust Image coding method, image coding apparatus, image decoding method, image decoding apparatus, and image coding and decoding apparatus
US11570444B2 (en) 2011-05-27 2023-01-31 Sun Patent Trust Image coding method, image coding apparatus, image decoding method, image decoding apparatus, and image coding and decoding apparatus
US11575930B2 (en) 2011-05-27 2023-02-07 Sun Patent Trust Coding method and apparatus with candidate motion vectors
US11895324B2 (en) 2011-05-27 2024-02-06 Sun Patent Trust Coding method and apparatus with candidate motion vectors
US11057639B2 (en) 2011-05-31 2021-07-06 Sun Patent Trust Derivation method and apparatuses with candidate motion vectors
US11917192B2 (en) 2011-05-31 2024-02-27 Sun Patent Trust Derivation method and apparatuses with candidate motion vectors
US11509928B2 (en) 2011-05-31 2022-11-22 Sun Patent Trust Derivation method and apparatuses with candidate motion vectors
US11553202B2 (en) * 2011-08-03 2023-01-10 Sun Patent Trust Video encoding method, video encoding apparatus, video decoding method, video decoding apparatus, and video encoding/decoding apparatus
US20230105128A1 (en) * 2011-08-03 2023-04-06 Sun Patent Trust Video encoding method, video encoding apparatus, video decoding method, video decoding apparatus, and video encoding/decoding apparatus
US11979598B2 (en) * 2011-08-03 2024-05-07 Sun Patent Trust Video encoding method, video encoding apparatus, video decoding method, video decoding apparatus, and video encoding/decoding apparatus
US11647208B2 (en) 2011-10-19 2023-05-09 Sun Patent Trust Picture coding method, picture coding apparatus, picture decoding method, and picture decoding apparatus
CN110740329A (zh) * 2018-07-19 2020-01-31 腾讯美国有限责任公司 视频编码解码方法和装置、计算机设备和存储介质
CN109889833A (zh) * 2019-03-04 2019-06-14 中科院成都信息技术股份有限公司 一种基于改进二进制烟花算法的图像压缩方法

Also Published As

Publication number Publication date
US10757413B2 (en) 2020-08-25
US20180192055A1 (en) 2018-07-05
JP2016195466A (ja) 2016-11-17
JP2019216435A (ja) 2019-12-19
JP6360528B2 (ja) 2018-07-18
JP7025517B2 (ja) 2022-02-24
JP2013543285A (ja) 2013-11-28
US20170289549A1 (en) 2017-10-05
JP6280597B2 (ja) 2018-02-14
MY180135A (en) 2020-11-23
US10104376B2 (en) 2018-10-16
US20160309152A1 (en) 2016-10-20
JP2018139442A (ja) 2018-09-06
JP2015216656A (ja) 2015-12-03
JP2021048622A (ja) 2021-03-25
US10397578B2 (en) 2019-08-27
US20230105786A1 (en) 2023-04-06
JP2022069448A (ja) 2022-05-11
JP6563557B2 (ja) 2019-08-21
US20190014323A1 (en) 2019-01-10
MY190332A (en) 2022-04-15
US20200014929A1 (en) 2020-01-09
US10057581B2 (en) 2018-08-21
US9794570B2 (en) 2017-10-17
US20150350689A1 (en) 2015-12-03
US11457216B2 (en) 2022-09-27
JP2016195467A (ja) 2016-11-17
JP5996728B2 (ja) 2016-09-21
US9584813B2 (en) 2017-02-28
US20160309150A1 (en) 2016-10-20
US9414092B2 (en) 2016-08-09
WO2012043884A1 (fr) 2012-04-05
US20160309151A1 (en) 2016-10-20
JP6806855B2 (ja) 2021-01-06
US9544605B2 (en) 2017-01-10
US11973949B2 (en) 2024-04-30
US20210044801A1 (en) 2021-02-11

Similar Documents

Publication Publication Date Title
US11659196B2 (en) System for nested entropy encoding
US11973949B2 (en) Nested entropy encoding
US20220368925A1 (en) Method for encoding/decoding image and device using same
US20040013200A1 (en) Advanced method of coding and decoding motion vector and apparatus therefor

Legal Events

Date Code Title Description
AS Assignment

Owner name: SHARP LABORATORIES OF AMERICA, INC., WASHINGTON

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:SU, YEPING;SEGALL, CHRISTOPHER A.;SIGNING DATES FROM 20101026 TO 20101027;REEL/FRAME:025212/0981

AS Assignment

Owner name: SHARP KABUSHIKI KAISHA, JAPAN

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:SHARP LABORATORIES OF AMERICA, INC.;REEL/FRAME:030880/0548

Effective date: 20130725

AS Assignment

Owner name: DOLBY INTERNATIONAL AB, NETHERLANDS

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:SHARP KABUSHIKI KAISHA;REEL/FRAME:036006/0168

Effective date: 20150701

STCB Information on status: application discontinuation

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