Methods and systems for motion vector derivation at a video decoder

Information

  • Patent Grant
  • 11765380
  • Patent Number
    11,765,380
  • Date Filed
    Monday, November 30, 2020
    3 years ago
  • Date Issued
    Tuesday, September 19, 2023
    a year ago
Abstract
Method and apparatus for deriving a motion vector at a video decoder. A block-based motion vector may be produced at the video decoder by utilizing motion estimation among available pixels relative to blocks in one or more reference frames. The available pixels could be, for example, spatially neighboring blocks in the sequential scan coding order of a current frame, blocks in a previously decoded frame, or blocks in a downsampled frame in a lower pyramid when layered coding has been used.
Description
BACKGROUND

Motion estimation (ME) in video coding may be used to improve video compression performance by removing or reducing temporal redundancy among video frames. For encoding an input block, traditional motion estimation may be performed at an encoder within a specified search window in reference frames. This may allow determination of a motion vector that meets a predefined requirement, such as the minimization of a metric such as the sum of absolute differences (SAD) between the input block and the reference block. The motion vector (MV) information can then be transmitted to a decoder for motion compensation. The video decoder may then utilize the received motion vector information to displace the pixels from the reference frames to form reconstructed output pixels. This displacement may be used to represent the motion compensation.


Note that in the description below, the terms “frame” and “picture” are used interchangeably, as would be understood by persons of ordinary skill in the art.





BRIEF DESCRIPTION OF THE DRAWINGS/FIGURES


FIG. 1 illustrates MV derivation using already decoded blocks from a current frame, according to an embodiment.



FIG. 2 is a flow chart illustrating the process of MV derivation using already decoded blocks from a current frame, according to an embodiment.



FIG. 3 illustrates MV derivation using already decoded blocks from a current frame, where the motion search is based on blocks in two different reference frames, according to an embodiment.



FIG. 4 is a flow chart illustrating MV derivation using already decoded blocks from a current frame, where the motion search is based on blocks in two different reference frames, according to an embodiment.



FIG. 5 illustrates MV derivation using previously decoded blocks from a previously decoded frame, according to an embodiment.



FIG. 6 is a flow chart illustrating MV derivation using previously decoded blocks from a previously decoded frame, according to an embodiment.



FIG. 7 illustrates MV derivation using previously decoded blocks from already decoded previous and succeeding frames, according to an embodiment.



FIG. 8 is a flow chart illustrating MV derivation using previously decoded blocks from already decoded previous and succeeding frames, according to an embodiment.



FIG. 9 illustrates MV derivation using a previously decoded block from a lower level in a layered coding context, according to an embodiment.



FIG. 10 is a flow chart illustrating MV derivation using a previously decoded block from a lower level in a layered coding context, according to an embodiment.



FIG. 11 illustrates a computing context of an exemplary software embodiment.



FIG. 12 is a block diagram showing a self MV derivation module in the context of a H.264 encoder, according to an embodiment.



FIG. 13 is a block diagram showing a self MV derivation module in the context of a H.264 decoder, according to an embodiment.



FIG. 14 is a block diagram illustrating a system, according to an embodiment.





DETAILED DESCRIPTION

The following applies to video compression. The system and method described below may allow derivation of a motion vector (MV) at a video decoder. This can reduce the amount of information that needs to be sent from a video encoder to the video decoder. A block-based motion vector may be produced at the video decoder by performing motion estimation on available previously decoded pixels with respect to blocks in one or more reference frames. The available pixels could be, for example, spatially neighboring blocks in the sequential scan coding order of the current frame, blocks in a previously decoded frame, or blocks in a downsampled frame in a lower pyramid when layered coding has been used. In an alternative embodiment, the available pixels can be a combination of the above-mentioned blocks.


Already Decoded Spatially Neighboring Blocks in the Current Frame


In an embodiment, pixels that can be used to determine an MV may come from spatially neighboring blocks in the current frame, where these blocks have been decoded prior to the decoding of the target block in the current frame. FIG. 1 shows an example 100 utilizing one or more blocks 140 that are above and to the left of the target block 130 in a current frame 110. To determine a motion vector for the target block 130 that needs to be decoded in the current frame 110, motion search may be performed for one or more of the blocks 140 above and to the left of the target block 130, relative to the blocks 150 of reference frame 120, where blocks 150 correspond to blocks 140. Such an approach may be useful in decoding of predictive frames, also called P-frames, which hold only the changes relative to a previous frame.


In an embodiment, the raster scan coding order may be used to identify the spatial neighbor blocks that are above, to the left, above and to the left, and above and to the right of the target block.


Generally, this approach may be applied to available pixels of spatially neighboring blocks in the current frame, as long as the neighboring blocks were decoded prior to the target block in sequential scan coding order. Moreover, this approach may apply motion search with respect to reference frames in the reference frame list for a current frame.


The processing for this embodiment is illustrated as process 200 in FIG. 2. At 210, one or more blocks of pixels may be identified, where these blocks neighbor the target block of the current frame. Such neighboring blocks may or may not be immediately adjacent to the target block. At 220, motion search may be performed for the identified blocks. The motion search may be based on corresponding blocks of a reference frame, and at 230 yields motion vectors that connects the corresponding blocks of the reference frame to the identified blocks. Note that in an embodiment, 220 and 230 may precede 210, such that the motion vectors for the identified blocks may be known and the identified blocks decoded, prior to the identified blocks being used in this process. At 240, the motion vectors of the identified blocks are used to derive the motion vector for the target block, which may then be used for motion compensation for the target block. This derivation may be performed using any suitable process known to persons of ordinary skill in the art. Such a process may be, for example and without limitation, weighted averaging or median filtering. The process 200 concludes at 250.



FIG. 3 shows an embodiment 300 that may utilize one or more neighboring blocks 340 (shown here as blocks above and to the left of the target block 330) in a current frame 310. This may allow generation of a motion vector based on one or more corresponding blocks 350 and 355 in a previous reference frame 320 and a subsequent reference frame 360, respectively, where the terms “previous” and “subsequent” refer to temporal order. The motion vector can then be applied to target block 330. Here, the motion search may operate over an additional reference frame, in contrast to the embodiments of FIGS. 1 and 2. In an embodiment, a raster scan coding order may be used to determine spatial neighbor blocks above, to the left, above and to the left, and above and to the right of the target block. This approach may be used for bi-directional (B) frames, which use both the preceding and following frames for decoding.


The approach exemplified by FIG. 3 may be applied to available pixels of spatially neighboring blocks in a current frame, as long as the neighboring blocks were decoded prior to the target block in sequential scan coding order. Moreover, this approach may apply motion search with respect to reference frames in reference frame lists for a current frame.


The process of the embodiment of FIG. 3 is shown as process 400 of FIG. 4. At 410, one or more blocks of pixels may be identified in the current frame, where the identified blocks neighbor the target block of the current frame. At 420, motion search for the identified blocks may be performed, based on corresponding blocks in a temporally subsequent reference frame and on corresponding blocks in a previous reference frame. At 430, the motion search may result in motion vectors for the identified blocks. As in the case of FIGS. 2, 420 and 430 may precede 410, such that the motion vectors of the neighboring blocks may be determined prior to identification of those blocks. At 440, the motion vectors may be used to derive the motion vector for the target block, which may then be used for motion compensation for the target block. This derivation may be performed using any suitable process known to persons of ordinary skill in the art. Such a process may be, for example and without limitation, weighted averaging or median filtering. The process concludes at 450.


Already Decoded Blocks in Previously Decoded Frames


In this embodiment, pixels that can be used to determine an MV may come from a corresponding block in a previously reconstructed frame. FIG. 5 shows an example 500 of utilizing a block 540 from a previous frame 515, where the block 540 may be in a position corresponding to a target block 530 in a current frame 510. Here the MV can be derived from the relationship between the corresponding block 540 of the previously decoded frame 515 relative to one or more blocks 550 in a reference frame 520.


The processing for such an embodiment is shown in FIG. 6 as process 600. At 610, a block of pixels may be identified in a previous frame, where the identified block corresponds to a target block of a current frame. At 620, a motion vector may be determined for the identified block relative to a corresponding block in a reference frame. In an alternative embodiment, 620 may precede 610, such that the motion vector for the block of the previous frame may be derived prior to identifying the block for use with respect to the target block of the current frame. At 630, the motion vector may be used for the target block. The process may conclude at 640.


Another embodiment may use neighboring blocks next to the corresponding block of the previous frame to do the motion search in a reference frame. Examples of such neighboring blocks could be the blocks above, below, to the left, or to the right of the corresponding block in the previously reconstructed frame.


In an alternative embodiment, the available pixels can come from the corresponding blocks of previous and succeeding reconstructed frames in temporal order. This approach is illustrated in FIG. 7 as embodiment 700. To encode a target block 730 in a current frame 710, already decoded pixels may be used, where these pixels may be found in a corresponding block 740 of a previous frame 715, and in a corresponding block 765 of a succeeding frame 755. A first motion vector may be derived for corresponding block 740, by doing a motion search through one or more blocks 750 of reference frame 720. Block(s) 750 may neighbor a block in reference frame 720 that corresponds to block 740 of previous frame 715. A second motion vector may be derived for corresponding block 765 of succeeding frame 755, by doing a motion search through one or more blocks 770 of reference frame 760. Block(s) 770 may neighbor a block in reference frame 760 that corresponds to block 765 of succeeding frame 755. Based on the first and second motion vectors, forward and/or backward motion vectors for target block 730 may be determined. These latter motion vectors may then be used for motion compensation for the target block


This process is described as process 800 of FIG. 8. At 810, a block may be identified in a previous frame, where this identified block may correspond to the target block of the current frame. At 820, a first motion vector may be determined for this identified block of the previous frame, where the first motion vector may be defined relative to a corresponding block of a first reference frame. In 830, a block may be identified in a succeeding frame, where this block may correspond to the target block of the current frame. A second motion vector may be determined at 840 for this identified block of the succeeding frame, where the second motion vector may be defined relative to the corresponding block of a second reference frame. At 850, one or two motion vectors may be determined for the target block using the respective first and second motion vectors above. Process 800 may conclude at 860.


In another embodiment, neighboring blocks next to the corresponding block in the previous and succeeding reconstructed frames may be used to do the motion search based on their respective reference frames. An example of the neighboring blocks may be the blocks above, below, to the left, or to the right of the collocated blocks in the reconstructed frames, for example. Moreover, this approach can use motion search using reference frames in the reference frame lists, in both forward and backward temporal order.


Generally, the approach of FIGS. 3 and 7 may be used in the codec processing of bi-directional (B) frames.


Already Decoded Blocks in a Downsampled Frame in a Lower Pyramid of Layered Coding


In an embodiment, pixels that can be used to determine an MV for a target block may come from corresponding blocks in a lower layer whose video is downsampled from an original input in a scalable video coding scenario. FIG. 9 shows an example 900 utilizing a lower layer block 940 corresponding to the target block 930 of the current picture 910. The block 940 may occur in a picture 915 that corresponds to current picture 910. The corresponding block 940 can be used to perform the motion search, given one or more blocks 950 and 970 in respective reference pictures 920 and 960 in the lower layer. The reference pictures in the lower layer can be the forward or backward (previous or succeeding) pictures in temporal order. Since the motion vector may be derived in the downsampled layer, the motion vector may be upscaled before it is applied to the target block 930 in the target layer.


This approach may also be applied to already-decoded blocks that are spatial neighbors to the block 940 in the lower layer corresponding to the target frame 930 in the current picture 910.


The processing of FIG. 9 is shown as a flowchart 1000 in FIG. 10. At 1010, given a target block in a current frame, a corresponding block may be identified in a corresponding frame in a lower layer. At 1020, a motion vector may be determined for the corresponding block in the lower layer, relative to one or more reference frames in the lower layer. At 1030, the determined motion vector may be used for motion estimation for the target block in the current frame. The process may conclude at 1040.


In an alternative embodiment, 1020 may precede 1010, so that the motion vector is determined at the lower layer, prior to identifying the block in the lower layer for ME purposes for the target layer.


Mode Selection


A rate distortion optimization (RDO) model may be used to determine which coding mode is selected, given the options of motion estimation at video encoder side and motion estimation at video decoder side. The RDO model for motion estimation at the video encoder may generate a cost metric, and may include the costs of both coding distortion and MV bits, and the cost function for the motion estimation at the decoder may include only the coding distortion. In an embodiment, the video encoder may compare the costs for these two motion estimation options and determine which one to pick. In an embodiment, the video encoder may identify the chosen coding mode with a flag bit during communications between the encoder and the decoder. The video decoder may then act according to the state of the flag bit. If the flag bit indicates that motion estimation at the decoder side is utilized, the video decoder may derive the motion vector autonomously.


Such a mode selection process is illustrated in FIG. 11, as process 1100. At 1120, traditional encoder side motion estimation (ME) may first be performed to get an MV for this coding mode. At 1130, the corresponding RDO cost metric may be calculated. Let this cost be J0. At 1140, ME is performed at the decoder as described in any of the above embodiments, to get an MV for this coding mode. At 1150, the corresponding RDO cost metric may be calculated to be J1. At 1160, if J1<J0, then at 1170, the decoder side ME based result may be chosen. Otherwise, the result from the traditional ME based coding mode may be chosen at 1180. The process may conclude at 1190. In an alternative embodiment, more than two modes may be similarly evaluated, where the mode having the lowest RDO cost metric may be chosen. A flag can be used to signal the chosen mode in the communications between the encoder and decoder.


System


Logic to perform the processing described above may be incorporated in a self MV derivation module that is used in a larger codec architecture. FIG. 12 illustrates an exemplary H.264 video encoder architecture 1200 that may include a self MV derivation module 1240, where H.264 is a video codec standard. Current video information may be provided from a current video block 1210 in a form of a plurality of frames. The current video may be passed to a differencing unit 1211. The differencing unit 1211 may be part of the Differential Pulse Code Modulation (DPCM) (also called the core video encoding) loop, which may include a motion compensation stage 1222 and a motion estimation stage 1218. The loop may also include an intra prediction stage 1220, and intra interpolation stage 1224. In some cases, an in-loop deblocking filter 1226 may also be used in the loop.


The current video may be provided to the differencing unit 1211 and to the motion estimation stage 1218. The motion compensation stage 1222 or the intra interpolation stage 1224 may produce an output through a switch 1223 that may then be subtracted from the current video 1210 to produce a residual. The residual may then be transformed and quantized at transform/quantization stage 1212 and subjected to entropy encoding in block 1214. A channel output results at block 1216.


The output of motion compensation stage 1222 or inter-interpolation stage 1224 may be provided to a summer 1233 that may also receive an input from inverse quantization unit 1230 and inverse transform unit 1232. These latter two units may undo the transformation and quantization of the transform/quantization stage 1212. The inverse transform unit 1232 may provide dequantized and detransformed information back to the loop.


A self MV derivation module 1240 may implement the processing described herein for derivation of a motion vector from previously decoded pixels. Self MV derivation module 1240 may receive the output of in-loop deblocking filter 1226, and may provide an output to motion compensation stage 1222.



FIG. 13 illustrates an H.264 video decoder 1300 with a self MV derivation module 1310. Here, a decoder 1300 for the encoder 1200 of FIG. 12 may include a channel input 1338 coupled to an entropy decoding unit 1340. The output from the decoding unit 1340 may be provided to an inverse quantization unit 1342 and an inverse transform unit 1344, and to self MV derivation module 1310. The self MV derivation module 1310 may be coupled to a motion compensation unit 1348. The output of the entropy decoding unit 1340 may also be provided to intra interpolation unit 1354, which may feed a selector switch 1323. The information from the inverse transform unit 1344, and either the motion compensation unit 1348 or the intra interpolation unit 1354 as selected by the switch 1323, may then be summed and provided to an in-loop de-blocking unit 1346 and fed back to intra interpolation unit 1354. The output of the in-loop deblocking unit 1346 may then be fed to the self MV derivation module 1310.


The self MV derivation module may be located at the video encoder, and synchronize with the video decoder side. The self MV derivation module could alternatively be applied on a generic video codec architecture, and is not limited to the H.264 coding architecture.


The encoder and decoder described above, and the processing performed by them as described above, may be implemented in hardware, firmware, or software, or some combination thereof. In addition, any one or more features disclosed herein may be implemented in hardware, software, firmware, and combinations thereof, including discrete and integrated circuit logic, application specific integrated circuit (ASIC) logic, and microcontrollers, and may be implemented as part of a domain-specific integrated circuit package, or a combination of integrated circuit packages. The term software, as used herein, refers to a computer program product including a computer readable medium having computer program logic stored therein to cause a computer system to perform one or more features and/or combinations of features disclosed herein.


A software or firmware embodiment of the processing described above is illustrated in FIG. 14. System 1400 may include a processor 1460 and a body of memory 1410 that may include one or more computer readable media that store computer program logic 1420. Memory 1410 may be implemented as a hard disk and drive, a removable media such as a compact disk and drive, or a read-only memory (ROM) device, for example. Processor 1460 and memory 1410 may be in communication using any of several technologies known to one of ordinary skill in the art, such as a bus. Logic contained in memory 1410 may be read and executed by processor 1460. One or more I/O ports and/or I/O devices, shown as I/O 1470, may also be connected to processor 1460 and memory 1410.


Computer program logic 1420 may include decoded block identification logic 1430. This module of computer program logic, when executed on processor 1460, identifies a block of pixels that may ultimately be used to determine a motion vector for a target block. Computer program logic 1420 may also include motion vector determination logic 1440. This module of computer program logic, when executed on processor 1460, determines a motion vector on the basis of the identified block of pixels identified by decoded block identification logic 1430, relative to one or more reference frames. Computer program logic 1420 may also include motion vector application logic 1450. This module of computer program logic, when executed on processor 1460, uses the motion vector determined by logic module 1440 to perform motion estimation for the target block.


Alternatively, any of the logic modules shown in computer program logic 1420 may be implemented in hardware.


Methods and systems are disclosed herein with the aid of functional building blocks, such as those listed above, describing the functions, features, and relationships thereof. At least some of the boundaries of these functional building blocks have been arbitrarily defined herein for the convenience of the description. Alternate boundaries may be defined so long as the specified functions and relationships thereof are appropriately performed. In addition, the encoder and decoder described above may by incorporated in respective systems that encode a video signal and decode the resulting encoded signal respectively using the processes noted above.


While various embodiments are disclosed herein, it should be understood that they have been presented by way of example only, and not limitation. It will be apparent to persons skilled in the relevant art that various changes in form and detail may be made therein without departing from the spirit and scope of the methods and systems disclosed herein. Thus, the breadth and scope of the claims should not be limited by any of the exemplary embodiments disclosed herein.

Claims
  • 1. A video encoding method comprising: determining a first cost metric corresponding to motion estimation at a video decoder, the first cost metric consisting of only coding distortion for motion estimation at the video decoder;determining a second cost metric corresponding to motion estimation at a video encoder, the second cost metric comprising costs of coding distortion and motion vector bits for motion estimation at the video encoder;selecting a coding mode from motion estimation at the video decoder and motion estimation at the video encoder based on a comparison of the first and second cost metrics; andidentifying the selected coding mode for use in video decode, whereinthe determining the first cost metric comprises performing decoder side motion estimation and selecting a first motion vector for a first coding mode corresponding to the first cost metric, andthe decoder side motion estimation comprises: selecting a first block of decoded pixels of a first reference frame, the first block corresponding to a first target block in a current frame; andidentifying the first motion vector for the first target block based on motion estimation of a second reference frame using the first block.
  • 2. The video encoding method of claim 1, wherein the first block is in a position in the first reference frame corresponding to a position of the first target block in the current frame, the first reference frame is temporally previous to the current frame and the second reference frame is temporally previous to the first reference frame.
  • 3. The video encoding method of claim 1, wherein the first cost metric is based on motion compensation of the first target block using the first motion vector.
  • 4. The video encoding method of claim 1, further comprising: selecting a second block of decoded pixels of a third reference frame, the second block corresponding to the first target block, wherein the first motion vector is identified further based on motion estimation of a fourth reference frame using the second block.
  • 5. A video encoder comprising: a memory; andone or more processors in communication with the memory, the one or more processors being configured to:determine a first cost metric corresponding to motion estimation at a video decoder, the first cost metric consisting of only coding distortion for motion estimation at the video decoder;determine a second cost metric corresponding to motion estimation at a video encoder, the second cost metric comprising costs of coding distortion and motion vector bits for motion estimation at the video encoder;select a coding mode from motion estimation at the video decoder and motion estimation at the video encoder based on a comparison of the first and second cost metrics; andidentify the selected coding mode for use in video decode, whereinto determine the first cost metric, the one or more processors are further configured to perform decoder side motion estimation and select a first motion vector for a first coding mode corresponding to the first cost metric, andto perform the decoder side motion estimation, the one or more processors are further configured to:select a first block of decoded pixels of a first reference frame, the first block corresponding to a first target block in a current frame; andidentify the first motion vector for the first target block based on motion estimation of a second reference frame using the first block.
  • 6. The video encoder of claim 5, wherein the first block is in a position in the first reference frame corresponding to a position of the first target block in the current frame, the first reference frame is temporally previous to the current frame and the second reference frame is temporally previous to the first reference frame.
  • 7. The video encoder of claim 5, wherein the first cost metric is based on motion compensation of the first target block using the first motion vector.
  • 8. The video encoder of claim 5, the one or more processors being further configured to: select a second block of decoded pixels of a third reference frame, the second block corresponding to the first target block, wherein the first motion vector is identified further based on motion estimation of a fourth reference frame using the second block.
  • 9. At least one non-transitory computer-readable medium comprising instructions stored thereon, which if executed by one or more processors, cause the one or more processors perform video encoding by: determining a first cost metric corresponding to motion estimation at a video decoder, the first cost metric consisting of only coding distortion for motion estimation at the video decoder;determining a second cost metric corresponding to motion estimation at a video encoder, the second cost metric comprising costs of coding distortion and motion vector bits for motion estimation at the video encoder;selecting a coding mode from motion estimation at the video decoder and motion estimation at the video encoder based on a comparison of the first and second cost metrics; andidentifying the selected coding mode for use in video decode, whereinthe determining the first cost metric comprises performing decoder side motion estimation and selecting a first motion vector for a first coding mode corresponding to the first cost metric, andthe decoder side motion estimation comprises:selecting a first block of decoded pixels of a first reference frame, the first block corresponding to a first target block in a current frame; andidentifying the first motion vector for the first target block based on motion estimation of a second reference frame using the first block.
  • 10. The non-transitory computer-readable medium of claim 9, wherein the first block is in a position in the first reference frame corresponding to a position of the first target block in the current frame, the first reference frame is temporally previous to the current frame and the second reference frame is temporally previous to the first reference frame.
  • 11. The non-transitory computer-readable medium of claim 9, wherein the first cost metric is based on motion compensation of the first target block using the first motion vector.
  • 12. The non-transitory computer-readable medium of claim 9, wherein the instructions, if executed by the one or more processors, further cause the one or more processors to: select a second block of decoded pixels of a third reference frame, the second block corresponding to the first target block, wherein the first motion vector is identified further based on motion estimation of a fourth reference frame using the second block.
CLAIM FOR PRIORITY

This application is a continuation of U.S. patent application Ser. No. 16/552,995, filed on 27 Aug. 2019, now U.S. Pat. No. 10,863,194, entitled “METHODS AND SYSTEMS FOR MOTION VECTOR DERIVATION”, which is a continuation of U.S. patent application Ser. No. 15/960,120, filed on 23 Apr. 2018, now U.S. Pat. No. 10,404,994, entitled “METHODS AND SYSTEMS FOR MOTION VECTOR DERIVATION”, which is a continuation of U.S. patent application Ser. No. 14/737,437, filed on 11 Jun. 2015, now U.S. Pat. No. 9,955,179, entitled “METHODS AND SYSTEMS FOR MOTION VECTOR DERIVATION AT A VIDEO DECODER”, which is a continuation of U.S. patent application Ser. No. 12/567,540, filed on 25 Sep. 2009, now U.S. Pat. No. 9,654,792, entitled “METHODS AND SYSTEMS FOR MOTION VECTOR DERIVATION AT A VIDEO DECODER”, which is a Non-Provisional application of U.S. Provisional Patent Application Ser. No. 61/222,984, filed on 3 Jul. 2009, entitled “METHODS AND SYSTEMS FOR MOTION VECTOR DERIVATION AT A VIDEO DECODER”, all of which are incorporated by reference in their entireties for all purposes.

US Referenced Citations (154)
Number Name Date Kind
4383272 Netravali et al. May 1983 A
4466714 Dyfverman Aug 1984 A
4862259 Gillard Aug 1989 A
4862260 Harradine et al. Aug 1989 A
4864393 Harradine et al. Sep 1989 A
4864398 Avis et al. Sep 1989 A
4865394 Gillard Sep 1989 A
4967271 Campbell et al. Oct 1990 A
5313281 Richards May 1994 A
5398068 Liu et al. Mar 1995 A
5410358 Shackleton et al. Apr 1995 A
5467086 Jeong Nov 1995 A
5546477 Knowles et al. Aug 1996 A
5568200 Pearlstein et al. Oct 1996 A
5592226 Lee et al. Jan 1997 A
5615287 Fu et al. Mar 1997 A
5642239 Nagai Jun 1997 A
5677735 ueno et al. Oct 1997 A
5699499 Kawada et al. Dec 1997 A
5734435 Wilson et al. Mar 1998 A
5742343 Haskell et al. Apr 1998 A
5748248 Parke May 1998 A
5786864 Yamamoto Jul 1998 A
5831677 Streater Nov 1998 A
5838828 Mizuki et al. Nov 1998 A
5943090 Eiberger et al. Aug 1999 A
5943444 Shimizu et al. Aug 1999 A
5974177 Krtolica Oct 1999 A
5995154 Heimburger Nov 1999 A
5999173 Ubillos Dec 1999 A
6014473 Hossack et al. Jan 2000 A
6058142 Ishikawa et al. May 2000 A
6067321 Lempel May 2000 A
6072833 Yamauchi Jun 2000 A
6081554 Lee et al. Jun 2000 A
6084908 Chiang et al. Jul 2000 A
6125144 Matsumura et al. Sep 2000 A
6130912 Chang et al. Oct 2000 A
6141449 Kawada et al. Oct 2000 A
6148109 Boon Nov 2000 A
6157396 Margulis et al. Dec 2000 A
6181382 Kieu et al. Jan 2001 B1
6185329 Zhang et al. Feb 2001 B1
6208760 De Haan et al. Mar 2001 B1
6222885 Chaddha et al. Apr 2001 B1
6256068 Takada et al. Jul 2001 B1
6289052 Faryar et al. Sep 2001 B1
6408096 Tan Jun 2002 B2
6421386 Chung et al. Jul 2002 B1
6519005 Bakhmutsky et al. Feb 2003 B2
6556197 Van Hook et al. Apr 2003 B1
6556718 Piccinelli et al. Apr 2003 B1
1450809 Lee Oct 2003 A1
6654420 Snook Nov 2003 B1
6690728 Chang et al. Feb 2004 B1
6707367 Castaneda et al. Mar 2004 B2
6765964 Conklin Jul 2004 B1
6807231 Wiegand et al. Oct 2004 B1
7010279 Rofougaran Mar 2006 B2
7023921 Subramaniyan et al. Apr 2006 B2
7133451 Kim et al. Nov 2006 B2
7248844 Rofougaran Jul 2007 B2
7259649 Ancey et al. Aug 2007 B2
7260148 Sohm Aug 2007 B2
7289672 Sun et al. Oct 2007 B2
7336720 Martemyanov et al. Feb 2008 B2
7463687 Subramaniyan et al. Dec 2008 B2
7526256 Bhatti et al. Apr 2009 B2
7590180 Kang Sep 2009 B2
7616692 Holcomb et al. Oct 2009 B2
7683851 Rofougaran et al. Mar 2010 B2
7751482 Srinivasan et al. Jul 2010 B1
7764740 Seok et al. Jul 2010 B2
7890066 Rofougaran et al. Feb 2011 B2
8107748 Miao et al. Jan 2012 B2
8233538 Sun et al. Jul 2012 B2
8238421 Choi et al. Aug 2012 B2
8279018 Song et al. Oct 2012 B1
8279927 Sun et al. Oct 2012 B2
8295551 Lertrattanapanich et al. Oct 2012 B2
8331450 Sun et al. Dec 2012 B2
8462852 Xu et al. Jun 2013 B2
8494054 Nair et al. Jul 2013 B2
8519814 Feng et al. Aug 2013 B2
9060175 Wang Jun 2015 B2
20020175320 Heun et al. Nov 2002 A1
20020176500 Bakhmutsky et al. Nov 2002 A1
20030031128 Kim et al. Feb 2003 A1
20030063671 Song Apr 2003 A1
20030063673 Riemens et al. Apr 2003 A1
20030095603 Lan et al. May 2003 A1
20030103568 Lee et al. Jun 2003 A1
20030189981 Lee Oct 2003 A1
20040046891 Mishima et al. Mar 2004 A1
20040114688 Kang Jun 2004 A1
20040223548 Kato et al. Nov 2004 A1
20040258154 Liu et al. Dec 2004 A1
20050018772 Sung et al. Jan 2005 A1
20050135481 Sung et al. Jun 2005 A1
20050220190 Ha et al. Oct 2005 A1
20050259736 Payson Nov 2005 A1
20050286777 Kumar et al. Dec 2005 A1
20060017843 Shi et al. Jan 2006 A1
20060018383 Shi et al. Jan 2006 A1
20060109905 Seok et al. May 2006 A1
20060120613 Su et al. Jun 2006 A1
20060126952 Suzuki et al. Jun 2006 A1
20060203904 Lee et al. Sep 2006 A1
20060215761 Shi et al. Sep 2006 A1
20070053440 Hsieh et al. Mar 2007 A1
20070064803 Miao et al. Mar 2007 A1
20070064804 Paniconi et al. Mar 2007 A1
20070086526 Koto et al. Apr 2007 A1
20070116124 Wu et al. May 2007 A1
20070223585 Fujisawa et al. Sep 2007 A1
20070239546 Blum et al. Oct 2007 A1
20070268964 Zhao Nov 2007 A1
20070297510 Herpel et al. Dec 2007 A1
20080069230 Kondo Mar 2008 A1
20080101707 Mukherjee et al. May 2008 A1
20080159392 Chiang et al. Jul 2008 A1
20080159398 Murakami et al. Jul 2008 A1
20080159400 Lee et al. Jul 2008 A1
20080175320 Sun et al. Jul 2008 A1
20080181309 Lee et al. Jul 2008 A1
20080214146 Lincoln et al. Sep 2008 A1
20080240242 Lainema Oct 2008 A1
20080253457 Moore Oct 2008 A1
20080260278 Zuo et al. Oct 2008 A1
20080281685 Jaffe et al. Nov 2008 A1
20090060359 Kim et al. Mar 2009 A1
20090067505 Tourapis et al. Mar 2009 A1
20090304084 Hallapuro Mar 2009 A1
20090161763 Rossignol et al. Jun 2009 A1
20090172751 Aldrey et al. Jul 2009 A1
20090207915 Yan et al. Aug 2009 A1
20090238268 Hsu et al. Sep 2009 A1
20100046614 Choi et al. Feb 2010 A1
20100074332 Karczewicz et al. Mar 2010 A1
20100109798 Chu May 2010 A1
20100166072 Bukin Jul 2010 A1
20100201457 Lee et al. Aug 2010 A1
20100296580 Metoevi et al. Nov 2010 A1
20110002387 Chiu et al. Jan 2011 A1
20110002389 Xu et al. Jan 2011 A1
20110090964 Lidong et al. Apr 2011 A1
20110261882 Zheng et al. Oct 2011 A1
20110286523 Dencher Nov 2011 A1
20120093217 Jeon et al. Apr 2012 A1
20120294370 Chiu et al. Nov 2012 A1
20130064296 Sun et al. Mar 2013 A1
20130082810 Feng et al. Apr 2013 A1
20130287111 Xu et al. Oct 2013 A1
20130336402 Xu et al. Dec 2013 A1
Foreign Referenced Citations (67)
Number Date Country
1450809 Oct 2003 CN
1961582 May 2007 CN
1977539 Jun 2007 CN
101001377 Jul 2007 CN
101005620 Jul 2007 CN
101018334 Aug 2007 CN
101023673 Aug 2007 CN
101023676 Aug 2007 CN
101378504 Mar 2009 CN
101621696 Jan 2010 CN
101647285 Feb 2010 CN
101945276 Jan 2011 CN
102045563 May 2011 CN
102340664 Feb 2012 CN
102010025816 Jan 2011 DE
102010046508 Jun 2011 DE
102011008630 Sep 2011 DE
0391094 Dec 1990 EP
0596732 Nov 1993 EP
0634871 Jul 1994 EP
0781041 Jun 1997 EP
0883298 Jun 1998 EP
0294957 Dec 1998 EP
1903798 Mar 2008 EP
1932366 Jun 2008 EP
1936995 Jun 2008 EP
1936998 Jun 2008 EP
1981281 Oct 2008 EP
2248361 Apr 1992 GB
2471577 Jan 2011 GB
2477033 Apr 2012 GB
10023420 Jan 1998 JP
10336666 Dec 1998 JP
11205799 Jul 1999 JP
4352189 Mar 2000 JP
2000350211 Dec 2000 JP
2003169338 Jun 2003 JP
2003319400 Nov 2003 JP
2004048512 Feb 2004 JP
2004328633 Nov 2004 JP
2004343349 Dec 2004 JP
2005094458 Apr 2005 JP
2005269164 Sep 2005 JP
2006033433 Feb 2006 JP
2009044350 Feb 2009 JP
2011029863 Feb 2011 JP
20090069461 Jul 2009 KR
1020110003438 Jan 2011 KR
494686 Jul 2007 TW
I298597 Jul 2008 TW
I301953 Oct 2008 TW
I303944 Dec 2008 TW
201127068 Aug 2011 TW
201204054 Jan 2012 TW
200708115 Jun 2012 TW
9746020 Dec 1997 WO
9925122 May 1999 WO
9952281 Oct 1999 WO
2007035276 Mar 2007 WO
2008117158 Oct 2008 WO
2009110754 Oct 2009 WO
2010086041 Aug 2010 WO
2012045225 Apr 2012 WO
2006000504 Jun 2012 WO
2012083487 Jun 2012 WO
2012125178 Sep 2012 WO
2013048908 Apr 2013 WO
Non-Patent Literature Citations (162)
Entry
Combined Search and Examination Report for United Kingdom Patent Application No. 1100658.2 dated May 16, 2011, 6 pages.
Combined Search and Examination Report received for GB Patent Application No. GB1100658.2, dated May 16, 2011.
Combined Search and Examination Report received for GB1011216.7, dated Oct. 14, 2010, 6 pages.
Combined Search and Examination Report received for GB1015985.3, dated Jan. 17, 2011, 5 pages.
Decision of Grant for Japanese Patent Application No. 2013-540202 dated Feb. 24, 2015, 2 pages.
Decision of Rejection for Taiwan Patent Applicaiton No. 100101277 dated Jan. 22, 2014, 6 pages.
EP Office Action, dated Aug. 11, 2016, for European Patent Application No. 11830181.1.
European Office Action dated Mar. 16, 2016 for EP Patent Application No. 10860988.4.
Extended European Search Report for European Patent Application No. 11830181.1 dated Dec. 11, 2014, 9 pages.
Final Notification of Reasons for Refusal for Japanese Patent Application No. 2011-004871 dated Nov. 20, 2012, 4 pages.
Final Office Action for U.S. Appl. No. 12/567,540 dated Jan. 30, 2013, 12 pages.
Final Office Action for U.S. Appl. No. 12/567,540 dated Jun. 15, 2016, 14 pages.
Final Office Action for U.S. Appl. No. 12/566,823 dated Apr. 14, 2014, 13 pages.
Final Office Action for U.S. Appl. No. 12/566,823 dated Aug. 6, 2012, 18 pages.
Final Office Action for U.S. Appl. No. 12/657,168 dated Jan. 17, 2013, 16 pages.
Final Office Action for U.S. Appl. No. 13/575,233 dated Feb. 18, 2016, 14 pages.
Final Office Action for U.S. Appl. No. 13/575,233 dated May 14, 2015, 14 pages.
Final Office Action for U.S. Appl. No. 14/578,802 dated May 13, 2016, 5 pages.
Final Office Action for U.S. Appl. No. 10/848,992 dated Nov. 28, 2008, 12 pages.
Final Office Action for U.S. Appl. No. 12/767,744 dated Jan. 17, 2012, 6 pages.
Final Office Action dated Jun. 15, 2016 for U.S. Appl. No. 12/567,540.
Final Office Action, dated Jan. 4, 2017 for U.S. Appl. No. 13/575,233.
First Office Action and Search Report for Chinese Patent Applicaiton No. 201110056040.4 dated Sep. 2, 2013, 11 pages.
International Preliminary Report on Patentability and Written Opinion received for PCT Patent Application No. PCT/US2012/056682, dated Apr. 1, 2014.
International Preliminary Report on Patentability and Written Opinion received for PCT Patent Application No. PCT/CN2010/002107, dated Jun. 25, 2013.
International Preliminary Report on Patentability received for PCT Application No. PCT/CN2011/000568, dated Apr. 18, 2013.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/CN2011/000568, dated Jan. 19, 2012.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/CN2010/002107, dated Oct. 13, 2011.
Japanese Office Action received for Japanese Patent Application No. 2011-004871, dated Aug. 14, 2012.
Japanese Office Action received for Japanese Patent Application No. 2011-004871, dated Nov. 20, 2014, 4 pages of Office Action, including 2 pages of English Translation.
Korean Office Action received for Korean Patent Application No. 10-20110004254, dated Dec. 26, 2012; 5 pages of Office Action, including 2 pages of English Translation.
Non-Final Office Action for U.S. Appl. No. 12/566,823 dated Jan. 10, 2012, 10 pages.
Non-Final Office Action for U.S. Appl. No. 12/566,823 dated Sep. 18, 2013, 12 pages.
Non-Final Office Action for U.S. Appl. No. 12/567,540 dated Apr. 6, 2012, 11 pages.
Non-Final Office Action for U.S. Appl. No. 12/567,540 dated Oct. 21, 2013, 11 pages.
Non-Final Office Action for U.S. Appl. No. 12/567,540 dated Sep. 24, 2014, 10 pages.
Non-Final Office Action for U.S. Appl. No. 12/657,168 dated Mar. 16, 2012, 15 pages.
Non-Final Office Action for U.S. Appl. No. 13/575,233 dated Dec. 18, 2014, 10 pages.
Non-Final Office Action for U.S. Appl. No. 13/575,233 dated Jul. 14, 2016, 14 pages.
Non-Final Office Action for U.S. Appl. No. 13/575,233 dated Sep. 11, 2015, 11 pages.
Non-Final Office Action for U.S. Appl. No. 13/895,939 dated Dec. 4, 2015, 15 pages.
Non-Final Office Action for U.S. Appl. No. 13/895,939 dated Mar. 4, 2015, 10 pages.
Non-Final Office Action for U.S. Appl. No. 14/578,802 dated Dec. 23, 2015, 5 pages.
Non-Final Office Action for U.S. Appl. No. 13/575,233 dated Jun. 2, 2017.
Non-Final Office Action for U.S. Appl. No. 14/737,437, dated May 5, 2017.
Non-Final Office Action for U.S. Appl. No. 15/960,120, dated Jan. 2, 2019.
Non-Final Office Action for U.S. Appl. No. 16/552,995, dated Apr. 30, 2020.
Non-Final Office Action for U.S. Appl. No. 10/848,992 dated Dec. 12, 2007, 7 pages.
Non-Final Office Action for U.S. Appl. No. 12/767,744 dated Apr. 18, 2011, 7 pages.
Non-Final Office Action for U.S. Appl. No. 13/679,957 dated Feb. 21, 2014, 7 pages.
Non-Final Office Action dated Jul. 31, 2015 for U.S. Appl. No. 14/140,349.
Notice of Allowance for Taiwan Patent Applicaiton No. 099121807 dated Aug. 12, 2015, 3 pages.
Notice of Allowance for U.S. Appl. No. 12/566,823 dated Aug. 14, 2014, 8 pages.
Notice of Allowance for U.S. Appl. No. 12/582,061 dated Jan. 30, 2013, 16 pages.
Notice of Allowance for U.S. Appl. No. 13/895,939 dated Apr. 11, 2016, 7 pages.
Notice of Allowance for U.S. Appl. No. 13/895,939 dated Sep. 12, 2014, 10 pages.
Notice of Allowance for U.S. Appl. No. 14/140,349 dated Apr. 27, 2016, 5 pages.
Notice of Allowance for U.S. Appl. No. 14/578,802 dated Aug. 16, 2016, 8 pages.
Notice of Allowance for U.S. Appl. No. 12/567,540 dated Jan. 11, 2017.
Notice of Allowance for U.S. Appl. No. 13/996,582, dated Jul. 15, 2016.
Notice of Allowance for U.S. Appl. No. 14/737,437 dated Dec. 27, 2017.
Notice of Allowance for U.S. Appl. No. 15/960,120, dated May 1, 2019.
Notice of Allowance for U.S. Appl. No. 16/552,995, dated Aug. 21, 2020.
Notice of Allowance for U.S. Appl. No. 10/848,992 dated Dec. 11, 2009, 4 pages.
Notice of Allowance for U.S. Appl. No. 12/767,744 dated Oct. 16, 2012, 5 pages.
Notice of Allowance for U.S. Appl. No. 13/679,957 dated Jul. 10, 2014, 5 pages.
Notice of Allowance received for Chinese Patent Application No. 201010507057.2, dated Mar. 6, 2014.
Notice of allowance received for Japanese Patent Application No. 2010-211120, dated Jan. 24, 2012, 1 page.
Notice of Allowance received for Korean Patent Application No. 10-2010-0102216, dated Nov. 26, 2012, 3 pages of English Translation.
Notice of Allowance received for Korean Patent Application No. 10-2010-064539, dated Sep. 27, 2012, 3 pages of Notice of Allowance, including 1 page of English Translation.
Notice of Last Preliminary Rejection for Korean Patent Applicaiton No. 10-2010-4254 dated Jun. 19, 2013, 11 pages.
Notice of Preliminary Rejection for Korean Patent Applicaiton No. 10-2010-4254 dated Dec. 26, 2012, 5 pages.
Notice of Preliminary Rejection for Korean Patent Applicaiton No. 10-2010-4254 dated Jun. 12, 2012, 6 pages.
Office Action and Search Report for Taiwan Patent Applicaiton No. 099121807 dated Feb. 15, 2015, 8 pages.
Office Action and Search Report for Taiwan Patent Applicaiton No. 100101277 dated Aug. 7, 2013, 19 pages.
Office Action and Search Report for Taiwan Patent Application No. 100123109 dated Oct. 22, 2014, 18 pages.
Office Action for European Patent Application No. 10860988.4 dated Mar. 16, 2016, 9 pages.
Office Action for German Patent Applicaiton No. 10 2010 025 816.4 dated Jan. 30, 2015, 11 pages.
Office Action for German Patent Application No. 10 2011 008 630.7 dated Oct. 30, 2015, 18 pages.
Office Action for U.S. Appl. No. 15/960,120, dated Jan. 2, 2019.
Office Action received for China Patent Application No. 201010507057.2, dated Apr. 12, 2013, 12 pages, including 7 pages of English Translation.
Office Action Received for Chinese Patent Application No. 20100507057.2, dated Aug. 3, 2012, 3 pages of Office Action and 3 pages of English Translation.
Office Action received for Chinese Patent Application No. 201010270056.0, dated May 3, 2012.
Office Action received for Chinese Patent Application No. 2010-10270056.0,dated May 27, 2013.
Office Action received for Chinese Patent Application No. 201010507057.2, dated Aug. 3, 2012, 3 pages of Office Action and 3 pages of English Translation.
Office Action received for Chinese Patent Application No. 201010270056.0, dated Dec. 13, 2012, including 5 pages of English Translation.
Office Action received for Chinese Patent Application No. 201010507057.2, dated Oct. 28, 2013.
Office Action received for Chinese Patent Application No. 201110056040.4, dated Mar. 31, 2014.
Office Action received for Chinese Patent Application No. 201110056040.4, dated Sep. 2, 2013.
Office Action received for German Patent Application No. 10 2010 046 508.9, dated Jul. 26, 2011.
Office Action received for German Patent Application No. 10 2010 046 508.9, dated Sep. 5, 2012, 13 pages of Office Action, including 5 pages of English Translation.
Office Action received for Japanese Patent Application No. 2013532027, dated Jan. 21, 2014.
Office Action received for Japanese Patent Application No. 2013540202, dated Feb. 4, 2014.
Office Action received for Korean Patent Application No. 10-2010-4254, dated Feb. 10, 2012.
Office Action received for Korean Patent Application No. 1020137002525, dated Jan. 24, 2014.
Office Action received for Korean Patent Application No. 2010-0102216, dated May 22, 2012.
Office Action received for Korean Patent Application No. 10-2010-064539, dated Feb. 10, 2012.
Office Action received for Korean Patent Application No. 10-2011-4254, dated Jun. 19, 2013.
Office Action received for Taiwanese Patent Application No. 100101277, dated Feb. 14, 2014.
Office Action received for Taiwanese Patent Application No. 100101277, dated Aug. 7, 2013.
Office Action received in U.S. Appl. No. 12/566,823, dated Jan. 10, 2012, 10 pages.
Reasons for Rejection for Japanese Patent Application No. 2011-004871 dated Aug. 14, 2012, 4 pages.
Search Report dated Jul. 26, 2016, for TW Patent Application No. 104130109.
Second Office Action for Chinese Patent Applicaiton No. 201110056040.4 dated Mar. 31, 2014, 7 pages.
“Content description data”, Telecommunication Standardization Sector of ITU, Erratum 1, Recommendation ITU-T H.262 Amendment 1, Geneva, Apr. 22, 2002. 1 page.
“Infrastructure of audiovisual services—Coding of moving video”, International Telecommunication Union, Series H: Audiovisual and Multimedia Systems, H.262, Feb. 2000, 220 pages.
“MVC Decoder Description”, ITU—Telecommunication Standardization Sector, Study Group 16, Study Period 1997-2000, Geneva Feb. 7-18, 2000.
“No English Translation Available”, Second Office Action for Chinese Patent Application No. 201080068069.8 dated Oct. 20, 2015, 5 pages.
“No English Translation Available”, Third Office Action for Chinese Patent Application No. 201080068069.8 dated Apr. 1, 2016, 3 pages.
“Series H: Audiovisual and Multimedia Systems Infrastructure of audiovisual services—Coding of moving video”, International Telecommunication Union, H.262, Amendment 2, Jan. 2007, Information technology—Generic coding of moving pictures and associated audio information: Video Amendment 2: Support for colour spaces, 14 pages.
“Series H: Audiovisual and Multimedia Systems Infrastructure of audiovisual services—Coding of moving video”, International Telecommunication Union, H.262, Corrigendum 2, Information technology—Generic coding of moving pictures and associated audio information: Video Technical Corrigendum 2, May 2006, 14 pages.
“Series H: Audiovisual and Multimedia Systems Infrastructure of audiovisual services—Coding of moving video”, International Telecommunication Union, H.262, Amendment 1, Nov. 2000, 26 pages.
“Series H: Audiovisual and Multimedia Systems Infrastructure of audiovisual services—Coding of moving video”, International Telecommunication Union, H.262, Amendment 4, Feb. 2012, Information technology—Generic coding of moving pictures and associated audio information: Video: Frame packing arrangement signalling for 3D content, 238 pages.
“Series H: Audiovisual and Multimedia Systems Infrastructure of audiovisual services—Coding of moving video”, International Telecommunication Union, H.262, Corrigendum 1, Nov. 2000, 10 pages.
“Series H: Audiovisual and Multimedia Systems Infrastructure of audiovisual services—Coding of moving video”, International Telecommunication Union, H.264, Jan. 2012, Recommendation ITU-T H.264, 680 pages.
“Series H: Audiovisual and Multimedia Systems Infrastructure of audiovisual services—Coding of moving video”, International Telecommunication Union, H.264, Nov. 2007, Advanced video coding for generic audiovisual services, 564 pages.
“Series H: Audiovisual and Multimedia Systems Infrastructure of audiovisual services—Coding of moving video”, International Telecommunication Union; H.264, Feb. 2014, Advanced video coding for generic audiovisual services, 790 pages.
“Working Draft No. 2, Revision 0 (WD-2)”, Document JVT-B118, Dec. 3, 2011, pp. 3-100; p. 27, paragraph 4.4.4 to p. 32, paragraph 4.4.5.
Anttila, et al., “Transferring Real-Time Video on the Internet”, www.tml.hut.fi/Opinnot/Tik-110.551/1997/iwsem.html, printed Aug. 4, 2000.
Baxes, “Digital Image Processing: Principles and Applications”, John Wiley & Sons, 1994, 88-91.
Bjontegaard, “H.26L Test Model Long Term 8 (TML-8) draft0”, ITU Study Group 16, Apr. 2, 2001, 1-2, 16-19.
Bjontegaard, “Video Coding Experts Group (Question 15)”, ITU—Telecommunications Standardization Section, Document Q15-F-11, Sixth Meeting: Seoul, Korea, Nov. 3-6, 1998.
Bjontegaard,“Video Coding Experts Group (Question 15)”, ITU—Telecommunications Standardization Section, Document Q15-J-72, Tenth Meeting: Osaka, May 16-18, 2000.
Blume, “New Algorithm for Nonlinear Vector-Based Upconversion with Center Weighted Medians”, Journal of Electronic Imaging 6(3), Jul. 1997, 368-378.
Blume, “Nonlinear Vector Error Tolerant Interploation of Intermediate Video Images by Weighted Medians”, Signal Processing Image Communication, vol. 14, (Search Report PCTUS00/18386), 851-868.
Chang, et al., “11 Fast integer motion estimation for H.264 video coding standard”, 11, 2004 IEEE International Conference on Multimedia and Expo : Jun. 27-30, 2004, Taipei, Taiwan, IEEE Operations Center, Piscataway, NJ, vol. 1, Jun. 27, 2004.
Chang, A. et al., “Fast integer motion estimation for H.264 video coding standard”, 2004 IEEE International Conference on Multimedia and Expo: Jun. 27-30, 2004, vol. 1, pp. 289-292, Taipei, Taiwan, IEEE Operations Center, Piscataway, NJ.
Chen, et al., “A Macroblock Level Adaptive Search Range Algorithm for Variable Block Size Motion Estimation in h.264/avc”, International Symposium on Intelligent Signal Processing and Communication Systems, ISPACS, Xiamen, China, Nov. 28, 2007-Dec. 1, 2007, 598-601.
Chen, et al., “Source Model for Transform Video Coder and its Application—Part II: Variable Frame Rate Coding”, XP000687649, IEEE Transactions on Circuits and Systems for Video Technology, vol. 7, No. 2, Apr. 1997.
Chiu, et al., “Fast Techniques to Improve Self Derivation of Motion Estimation”, Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, JCTVC-B047, Jul. 21-28, 2010 (10 pages).
Chiu, et al., “Report of Self Derivation of Motion Estimation Improvement in TMuC”, Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, URL: http://phenix,int-evry.fr/jct/doc_end_user/documents/3_Guangzhou/wg11/JCTVC-C127-M18151-v1-JCTVC-C127.zip (see JCTVC-C127.doc), Oct. 3, 2010 (13 pages).
Chiu, et al., “Self-Derivation of Motion Estimation Techniques to Improve Video Coding Efficientcy”, Applications of Digital Image Processing XXX111 Proc. of SPIE, vol. 7798, Sep. 7, 2010 (11 pages).
Chiu, et al., “TE1: Report of Self Derivation of Motion Estimation Improvement in TMuC”, 3. JCT-VC Meeting; 94. MPEG Meeting; Oct. 7, 2010-Oct. 15, 2010; Guangzhou; (Joint Collaborative Team on Video Coding of ISO/IEC JTC1/SC29/WG11 and ITU-TSG.16); http://wftp3.itu.int/av-arch/jctvc-site. No. JCTVC-C127, Mar. 10, 2010 XP030007834.
Chiu, et al., “TE1: Fast Techniques to Improve Self Derivation of Motion Estimation”, 2. JCT-VC Meeting; Jul. 21, 2010 to Jul. 28, 2010; Geneva Joint Collaborative Team on Video Coding of ISO/IEC JTC1/SC29/WG11 and ITU-T SG.1; URL: http//wftp3.itu.int/av-arch/jctvc-site/; No. JCTVC-B047; Jul. 28, 2010, XP030007627; ISSN: 0000-0048.
Haavisto, et al., “Motion Adaptive Scan Rate Up-Conversion”, Multidimensional Systems and Signal Processing, XP 000573419, vol. 3, 1992 (Search Report PCTUS/183836 and PCTUS00/18390), 113-130.
Han, et al., “Frame-Rate Up-Conversion Using Transmitted Motion and Segmentation Fields for Very Low Bit-Rate Video Coding”, Proceedings for ICIP (International Conference on Image Processing), 1997, 747-750.
Hsia, et al., “High Efficiency and Low Complexity Motion Estimation Algorithm for MPEG-4 AVC/H.264 Coding”, Tamkang Journal of Science and Engineering, 2007,vol. 10, No. 3, 221-234.
Huang, et al., “TE1: decoder-Side Motion Vector Derivation with Switchable Template Matching”, Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/ IEC JTC1/SC29/WG11, Document: JCTVC-B076, Jul. 21-28, 2010, 11 pages.
Kamp, et al., “Decoder Side Motion Vector Derivation for Inter Frame Video Coding”, 15th IEEE International Conference on Image Processing (ICIP 2008). Oct. 12-15, 2008, pp. 1120-1123.
Kamp, et al., “Fast Decoder Side Motion Vector Derivation for Inter Frame Video Coding”, Proceedings of the International Picture Coding Symposium (PCS) '09, Digital Object Identifier 10.1109/PCS.2009.5167453, Print ISBN 978-1-4244-4593-6, IEEE, Piscataway, Chicago, IL, USA, May 6-8, 2009, 4 pages.
Kamp, Steffen et al., “Fast decoder side motion vector derivation for inter frame video coding”, Picture Coding Symposium 2009, May 6, 2009, Chicago, IL.
Kim, et al., “Local Motion-Adaptive Interpolation Technique Based on Block Matching Algorithms”, Signal Processing Image Communication, Nov. 1992, No. 6 Amsterdam.
Kiranyaz, et al., “Motion Compensated Frame Interpolation Techniques for VLBR Video Coding”, Proceedings for ICIP (International Conference on Image Processing), 1997.
Klomp, et al., “Decoder-Side Block Motion Estimation for H.264/MPEG-4 AVC Based Video Coding”, IEEE International Symposium on Circuits and Systems (ISCAS 2009), May 24-27, 2009, pp. 1641-1644.
Kokaram, et al., “Detection and Removal of Impulsive Noise in Image Sequences”, Proceedings of the Singapore International Conference on Image Processing, Sep. 1992, Singapore.
Kronander, “Post and Pre-Processing in Coding of Image Sequences Using Filters with Motion Compensated History”, International Conference on Acoustics, Speech, and Signal Processing, Apr. 1988, New York City.
Laroche, et al., “RD Optimized Coding for Motion Vector Predictor Selection”, IEEE Transactions on Circuits and Systems for Video Technology, vol. 18(12), Dec. 2008, pp. 1681-1691.
Migliorati, et al., “Multistage Motion Estimation for Image Interpolation”, Signal Processing Image Communication, vol. 7, 1995, 187-199.
Murakami, et al., “Advanced B Skip Mode with Decoder-Side Motion Estimation”, 37th VCEG meeting at Yokohama, VCEG-AK12, Hitachi Inspire the Next, Central research Laboratory, Embedded System Platform Research Laboratory.
Murakami, T. et al., “Advanced B Skip Mode with Decoder-side Motion Estimation”, 37 VCEG Meeting (Video Coding Experts Group of ITU-T SG.16), Apr. 11, 2009, Yokohama, Japan.
Nisar, et al., “Fast Motion Estimation Algorithm Based on Spatio-Temporal Correlation and Direction of Motion Vectors”, Electronics Letters, Dept. of Mechatronics, Gwangju Inst. of Sci & Technol. 11/23/20016, vol. 42, No. 24, 2.
Poynton, “A Technical Introduction to Digital Video”, John Wiley & Sons, 1996, 8-11.
Sadka, et al., “Error Performance Improvement in Block-Transform Video Coders”, www.research.att.com/mrc/pv99/contents/papers/sadka/sadka.htm printed Aug. 4, 2000.
Sallent, “Simulation of a Teleconference Codec for ISDN”, Proceedings of the European Signal Proceeding Conference, vol. 4, Amsterdam, Sep. 1990.
Sato, et al., “Video OCR for Digital News Archive”, IEEE International Workshop on content-Based Access of Image and Video Database, XP002149702, 1998, 52-60.
Stallings, et al., “Business Data Communications”, Third Edition, 198, Prentice-Hall, Inc., Chapter 2.
Sullivan, et al., “Meeting report of the second meeting of the Joint Collaborative Team on Video Coding (JCT-VC), Geneva, CH, Jul. 21-28, 2010”, URL: http://wftp3.itu.int/av-arch/jctvc-site/, Oct. 7, 2010.
Thomas, “A Comparison of Motion-Compensated Interlace-to-Progressive Conversion Methods”, Signal Processing Image Communication, vol. 12, 1998, 209-229.
Ugur (Nokia), K. et al., “11 Description of video coding technology”, proposal by Tandberg, Nokia, Ericsson, 1. JCT-VC Meeting; Apr. 15, 2010-Apr. 23, 2010; Dresden; URL: http://wftp3.itu.int/av-arch/jctvc-site/, Apr. 12, 2010.
Werda, et al., “Optimal DSP-Based Motion Estimation Tools Implementation for H.264/AVC Baseline Encoder”, IJCSNS International Journal of Computer Science and Network Security, May 2007, vol. 7, No. 5, 141-150.
Wiseman, “An Introduction to MPEG Video Compression”, members.aol.com/symbandgrl printed Apr. 14, 2000.
Yi, et al., “Fast techniques to improve seif derivation of motion estimation—presentation slides”, Jul. 28, 2010 (Jul. 28, 2010), XP055255145, Retrieved from the Internet: URL:http://wftp3.itu.int/av-arch/jctvc-site/2010_07_B_Geneva/JCTVC-B047.zip.
Related Publications (1)
Number Date Country
20210084327 A1 Mar 2021 US
Provisional Applications (1)
Number Date Country
61222984 Jul 2009 US
Continuations (4)
Number Date Country
Parent 16552995 Aug 2019 US
Child 17107396 US
Parent 15960120 Apr 2018 US
Child 16552995 US
Parent 14737437 Jun 2015 US
Child 15960120 US
Parent 12567540 Sep 2009 US
Child 14737437 US