Source: https://patents.justia.com/patent/9843807
Timestamp: 2018-01-18 00:13:14
Document Index: 289890996

Matched Legal Cases: ['Application No. 61', 'art 2', 'art 2', 'art 2', 'art 2', 'art 2', 'art 2']

US Patent for Predictive motion vector coding Patent (Patent # 9,843,807 issued December 12, 2017) - Justia Patents Search
Justia Patents US Patent for Predictive motion vector coding Patent (Patent # 9,843,807)
Apr 25, 2017 - Dolby Labs
This application is a continuation of U.S. application Ser. No. 15/164,423, filed May 25, 2016, which is a continuation of U.S. application Ser. No. 14/723,693, filed May 28, 2015, now U.S. Pat. No. 9,357,230, issued on May 31, 2016, which is a continuation of U.S. application Ser. No. 14/242,975, filed Apr. 2, 2014, now U.S. Pat. No. 9,060,168, issued on Jun. 16, 2015, which is a continuation of U.S. application Ser. No. 13/057,204 filed Feb. 2, 2011, now U.S. Pat. No. 9,445,121, issued on Sep. 13, 2016, which is a National Stage Entry of PCT/US2009/052650 filed on Aug. 4, 2009 which claims the benefit of priority of U.S. Provisional Patent Application No. 61/086,056, filed Aug. 4, 2008, all of which are hereby incorporated by reference in their entirety.
In some embodiments, these multiple predictions can be, for example, weighted averages based on the distance of a pixel, for which hypotheses weights are to be derived, which are compared to a center of one or more neighboring blocks that corresponds to each prediction. In other embodiments, the distance may be between two motion vectors (e.g., |mv1−mv2|). This process can predict block boundaries, reduce residual effects, achieve efficient coding, and reduce blockiness that may occur at prediction boundaries.
valuey0=w(disty0,D)×MCPvalue({right arrow over (MVD)})+w(disty0,X)×MCPvalue({right arrow over (MVX)}) Eq. (1)
where disty0,D and disty0,X are the distances of y0 533 from the centers of block D 530 and X 510, {right arrow over (MVD)} and {right arrow over (MVX)} are the motion and weighting parameter vectors for blocks D 530 and X 510, and MCPValue( ) and w( ) are the values of the motion compensation process and the weighting for the prediction, respectively. This expression can be generalized to:
value y 0 = ∑ k ⁢ ⁢ w k ⁡ ( dist y 0 , block k ) × MCPvalue ⁡ ( MV block k → ) , Eq . ⁢ ( 2 )
valueyεP0=w(distyεP0,A)×MCPvalue({right arrow over (MVA)})+w(distyεP0,B)×MCPvalue({right arrow over (MVB)})+w(distyεP0,D)×MCPvalue({right arrow over (MVD)})+w(distyεP0,X)×MCPvalue({right arrow over (MVX)}) Eq. (2)
valueyεP1=w(distyεP1,B)×MCPvalue({right arrow over (MVB)})+w(distyεP1,X)×MCPvalue({right arrow over (MVX)}) Eq. (3)
valueyεP2=w(distyεP2,B)×MCPvalue({right arrow over (MVB)})+w(distyεP2,C)×MCPvalue({right arrow over (MVC)})+w(distyεP0,X)×MCPvalue({right arrow over (MVX)}) Eq. (4)
valueyεP3=w(distyεP3,A)×MCPvalue({right arrow over (MVA)})+w(distyεP3,X)×MCPvalue({right arrow over (MVX)}) Eq. (5)
where functions ƒk({right arrow over (MVblockk)},{right arrow over (MVX)}) depend on the motion and weighting parameter relationships between X and its neighboring blocks.
For example, a significant difference in the motion vectors of block X and block with kindex 0 may imply that block X and the block with kindex 0 differ significantly as well. Moreover, a significant difference in the motion vectors of two or more blocks may imply a significant probability that the respective motion vectors of each block may relate to (e.g., be based on) different objects or other image features. This may imply that the usefulness of OBDC, under these constraints, may be somewhat limited. In some embodiments, the function ƒ0({right arrow over (MVblock0)},{right arrow over (MVX)})=0 may be used. Where the motion vectors are significantly (e.g., substantially) similar, e.g., where the difference between motion vectors is below a threshold, T: ∥{right arrow over (MVblock)}−{right arrow over (MVX)}∥<T, the prediction from block0 can be considered to have greater significance and the weighting of block0 can be correspondingly increased. In some embodiments, these relationships and related weighting parameters could be pre-defined within the encoder and decoder. In some embodiments, these relationships and weighting parameters could be signaled and changed within the bit stream through, for example, defining and signaling new parameters in the sequence or picture parameter sets, or through the slice header of a video codec.
54. The computer program product of enumerated example embodiment 44 further comprising instructions associated with the OBDC prediction comprising computing a residual of the first macroblock that is independent of information from future macroblocks.
receiving data representing a block motion compensated video bit stream;
decoding, by a decoder based on the received data, a first block partition having a prediction type of inter-prediction,
decoding, by the decoder based on the received data, a second block partition having a prediction type of inter-prediction, the second block partition being edge adjacent to the first block partition;
decoding, by the decoder based on the received data, a third block partition; and
decoding, by the decoder based on the received data, an explicit signal, the explicit signal indicating a mode for the first block partition,
wherein a first mode identified by the explicit signal identifies the first block partition as being block motion compensated by motion vector information of the second block partition, and
a second mode identified by the explicit signal identifies the first block partition as being block motion compensated by motion vector information of the third block partition without motion vector information of the second block partition.
3. The method of claim 1, wherein in the first mode, decoding the first block partition comprises predicting one or more pixels of the first block partition using the motion vector information of the second block partition.
4. The method of claim 1, wherein the inter-prediction comprises bipredictive or multi-hypothesis inter-prediction.
5. The method of claim 1, wherein the explicit signal is included in header information of the received data.
6. The method of claim 1, wherein the second block partition is ordered before the first block partition in the video bit stream.
5412430 May 2, 1995 Nagata
5438374 August 1, 1995 Yan et al.
5699128 December 16, 1997 Hayashi
5764805 June 9, 1998 Martucci
5786860 July 28, 1998 Kim et al.
5987180 November 16, 1999 Reitmeier
6005626 December 21, 1999 Ding
6023301 February 8, 2000 Katata et al.
6026183 February 15, 2000 Talluri
6043846 March 28, 2000 Shen et al.
6430316 August 6, 2002 Wilkinson
6697433 February 24, 2004 Isu
6807231 October 19, 2004 Weigand et al.
6823087 November 23, 2004 Liu et al.
6850564 February 1, 2005 Pejhan et al.
6900846 May 31, 2005 Lee et al.
6909748 June 21, 2005 Dinerstein
6925126 August 2, 2005 Lan et al.
7164717 January 16, 2007 Katsavounidis et al.
7266149 September 4, 2007 Holcomb et al.
7545863 June 9, 2009 Haskell et al.
7606312 October 20, 2009 Conklin
7733960 June 8, 2010 Kondo et al.
7894524 February 22, 2011 Demos
8149916 April 3, 2012 Ghanbari
8340177 December 25, 2012 Li
8379720 February 19, 2013 Demos
8526496 September 3, 2013 Demos
8542738 September 24, 2013 Demos
9060168 June 16, 2015 Tourapis
9357230 May 31, 2016 Tourapis
9667993 May 30, 2017 Tourapis
20030202588 October 30, 2003 Yu
20040165664 August 26, 2004 Karczewicz et al.
20040184666 September 23, 2004 Sekiguchi et al.
20050025243 February 3, 2005 Sohn et al.
20050078755 April 14, 2005 Woods et al.
20060008003 January 12, 2006 Ji et al.
20060262853 November 23, 2006 Li et al.
20070047648 March 1, 2007 Tourapis et al.
20070263727 November 15, 2007 Sekiguchi et al.
20070286288 December 13, 2007 Smith et al.
20080240242 October 2, 2008 Lainema
20090086816 April 2, 2009 Leontaris et al.
20090213932 August 27, 2009 Haskell et al.
20100215101 August 26, 2010 Jeon et al.
20110142132 June 16, 2011 Tourapis et al.
20120224623 September 6, 2012 Cho et al.
20130070858 March 21, 2013 Demos
20130077692 March 28, 2013 Demos
20130322534 December 5, 2013 Demos
20140098189 April 10, 2014 Deng et al.
20140211853 July 31, 2014 Tourapis et al.
1738434 February 2006 CN
0782343 July 1997 EP
02-285816 November 1990 JP
05-037915 February 1993 JP
05-236456 September 1993 JP
09-163376 June 1997 JP
2000299864 October 2000 JP
WO 1995/004433 February 1995 WO
WO 1997/28507 August 1997 WO
WO 1998/44743 October 1998 WO
WO 1999/020040 April 1999 WO
WO 1999/020045 April 1999 WO
WO 2001/033864 May 2001 WO
WO 2003/007119 January 2003 WO
WO 2003/041041 May 2003 WO
WO 2004/04310 January 2004 WO
WO 2005/038603 April 2005 WO
“IEEE Standard Specifications for the Implementations of 8×8 Inverse Discrete Cosine Transform,” IEEE Std 1180-1990, The Institute of Electrical and Electronics Engineers, Inc., 12 pages (1991).
Aravind et al., “Packet Loss Resilience of MPEG-2 Scalable Video Coding Algorithms,” IEEE Transactions on Circuits and Systems for Video Technology, 6(5): 426-435 (Oct. 1996).
Bjontegaard, Ed., “H.26L Test Model Long Term No. 5 (TML-5) draft0,” ITU-Telecommunications Standardization Sector, Eleventh Meeting: Portland Oregon, XP001086628, 31 pages (Aug. 22-25, 2000).
Bloomfield, “Copy Protection—déjà vu,” Broadcast Engineering, 40(11): 14-15 (Oct. 1998).
Demos, “A comparison of hierarchical high definition imagery coding schemes,” Compcon Spring '92. Thirty-Seventh IEEE Computer Society International Conference, Digest of Papers., pp. 68-75 (Feb. 1992).
Demos, “An Example Representation for Image Color and Dynamic Range Which is Scalable, Interoperable, and Extensible,” 135th Technical Conference, Society of Motion Picture and Television Engineers, Los Angeles, CA, pp. 1-12 (Oct. 1993).
Demos, “Temporal and resolution layering in advanced television,” Proc. SPIE 2663, Very High Resolution and Quality Imaging, 2663:52-68 (Feb. 16, 1996).
Demos, “The Use of Logarithmic and Density Units for Pixels,” SMPTE Journal 100(10): 805-816 (Oct. 1990).
Flierl and Girod, “Multihypothesis Prediction for B frames,” ITU Study Group 16, Video Coding Experts Group, Fourteenth Meeting, Santa Barbara, CA, 11 pages (Sep. 24-27, 2001).
Flierl et al., “A Locally Optimal Design Algorithm for Block-Based Multi-Hypothesis Motion-Compensated Prediction,” Proceedings of the Data Compression Conference, 1998, Snowbird, UT, USA, Mar. 30-Apr. 1, 1998, Los Alamitos, CA, USA, IEEE Comput. Soc., US, pp. 239-248 (Mar. 30, 1998).
Girod, “Why B-Pictures Work: A Theory of Multi-Hypothesis Motion-Compensated Prediction,” Proceedings of 1998 International Conference on Image Processing, 1998, Chicago, IL, Oct. 4-7, 1998, Lost Alamitos, CA, USA, IEEE Comput. Soc., US, 2:213-217 (Oct. 1998).
H.261, ITU-CCITT The International Telegraph and Telephone Consultative Committee of ITU “Line Transmission on Non-Telephone Signals. Video codec for audiovisual services at px64 kbits/s,” 32 pages, (1990).
H.261, ITU-T Telecommunication Standardization Sector of ITU, “Line Transmission of non-telephone signals: Video Codec for Audiovisual Services at p × 64 kbits,” 29 pages (Mar. 1993).
H.262, ITU-T Telecommunication Standardized Sector of ITU, “Transmission of Non-Telephone Signals. Information Technology—Generic coding of moving pictures and associated audio information: Video” 211 pages (Jul. 1995).
H.263 Appendix III, ITU-T Telecommunication Standardization Sector of ITU, “Series H: Audiovisual and Multimedia Systems, Infrastructure of audiovisual services—coding of moving video. Video coding for low bit rate communication, Appendix III: Examples for H.263 encoder/decoder implementations,” 48 pages (Jun. 2001).
H.263, ITU-T Telecommunication Standardization Sector of ITU, “Series H: Audiovisual and Multimedia Systems, Infrastructure of audiovisual services—coding of moving video. Video coding for low bit rate communication,” 226 pages (Jan. 2005).
H.263, ITU-T, Telecommunication Standardization Sector of ITU, “Series H: Audiovisual and Multimedia Systems. Infrastructure of audiovisual services—Coding of moving video. Video coding for low bit rate communication,” 167 pages (Feb. 1998).
H.263, ITU-T, Telecommunication Standardization Sector of ITU, “Transmission of Non-Telephone Signals. Video coding for low bit rate communication,” 52 pages (Mar. 1996).
Hannuksela, “Generalized B/MH-Picture Averaging,” Joint Video Team (JVT) of ISO/IEC MPEG &ITU-T Video Coding Experts Group, Third Meeting, Fairfax, VA, 8 pages (May 6-10, 2002).
ISO/IEC 14496-2 International Standard, “Information technology—coding of audio-visual objects—Part 2: Visual,” 2nd Edition, 536 pages (Dec. 1, 2001).
ISO/IEC 14496-2 International Standard, “Information technology—coding of audio-visual objects—Part 2: visual. Amendment 2: Streaming video profile,” 2nd Edition Feb. 1, 2002, 61 pages (Feb. 2002).
Kikuchi et al., “Improved Multiple Frame Motion Compensation Using Frame Interpolation,” Video Standards and Drafts, 2nd JVT Meeting, Geneva, CH, Jan. 29-Feb. 1, 2002, No. JVT-B075, pp. 1-8.
Kikuchi et al., “Multi-frame interpolative prediction with modified syntax,” ITU-T Study Group 16 Video Coding Experts Group, Third Meeting, Fairfax, VA, 13 pages (Mar. 6-10, 2002).
Lillevold, “Improved Direct Mode for B Pictures in TML,” ITU Study Group 16 Video Coding Experts Group, Eleventh Meeting, Portland, OR, 2 pages (Aug. 22-25, 2000).
Lim, “A migration path to a better digital television system,” SMPTE Journal 103(1): 2-6 (Jan. 1, 1994).
Pinkerton, “Digital video stymied by content protection,” Dealscope: Consumer Electronics Marketplace, Philadelphia, 4(1): 32 (Jan. 1999).
Tudor, “MPEG-2 Video Compression Tutorial,” IEE Colloquium on MPEG-2 (Digest Nr. 1995/012), London, UK, Jan. 24, 1995, pp. 2/1-2/8, (Jan. 24, 1995).
Vincent et al., “Spatial Prediction in Scalable Video Coding,” International Broadcasting Convention, IEEE Conference Publication No. 413, RAI International Congress and Exhibition Centre, Amsterdam, The Netherlands, pp. 244-249 (Sep. 14-18, 1995).
Wiegand et al., “Draft ITU-T Recommendation and Final Draft International Standard of Joint Video Specification (ITU-T Rec. H.264 | ISO/IEC 14496-10 AVC)” 269 pages (May 27, 2003).
Wyszecki and Stiles, “Color Science: concepts and methods, quantitative data and formulae,” John Wiley & Sons, 2nd Edition, pp. 485-489 (1982).
Balle, et al., “Extended Texture Prediction for H.264 Intra Coding” Joint Video Team (JVT) of ISO/IEC MPEG & ITU-T VCEG (ISO/IEC JTC1/SC29/WG11 and ITU-T SG16, Jan. 14, 2007, 7 pages.
Chen, et al., “Motion-Vector Optimization of Control Grid Interpolation and Overlapped Block Motion Compensation Using Iterated Dynamic Programming” IEEE Transactions on Image Processing vol. 9, No. 7, Jul. 2000, pp. 1145-1157, Jul. 2000.
Chen, et al., “Transform-Domain Intra Prediction for H.264” IEEE, May 23, 2005, pp. 1497-1500, XP010815802.
Girod, Bernd, “Efficiency Analysis of Multihypothesis Motion-Compensated Prediction for Video Coding” IEEE Transactions on Image Processing, vol. 9, No. 2 Feb. 2000, pp. 173-183.
ISO/IEC JTC 1, “Coding of audio-visual objects—Part 2: Visual,” ISO/IEC 14496-2 (MPEG-4 Part 2), Jan. 1999, 348 pages.
ISO/IEC JTC 1, “Coding of moving pictures and associated audio for digital storage media at up to about 1.5 Mbit/s—Part 2: Video,” ISO/IEC 11172 (MPEG-1 ), Nov. 1993.
ITU-T and ISO.IEC JTC 1, “Generic coding of moving pictures and associated audio information—Part 2: Video,” ITU-T Rec. H.262 and ISO/IEC 13818-2 (MPEG-2), Nov. 1994.
ITU-T, “Advanced Video Coding for Generic Audiovisual Services”, series H: Audiovisual and Multimedia Systems; May 2003, pp. 1-282.
ITU-T, “Video codec for audiovisual services at px64 kbits/s,” ITU-T Rec. H.261, v2: Mar. 1993, 29 pages.
ITU-T, “Video coding for low bit rate communication,” ITU-T Rec. H.263, v2: Jan. 1998.
Narroschke, Matthias, “Extending H.264/AVC by an Adaptive Coding of the Prediction Error” Picture Coding Symposium, Apr. 24, 2006 Beijing Sullivan, et al., “Methods of Reduced-Complexity Overlapped Block Motion Compensation” Proceedings of the International Conference on Image Processing (ICIP) Austin, Nov. 13-16, 1994, vol. 2, Nov. 13, 1994, pp. 957-961.
Nayan, et al., “Transform Domain Overlapped Block Disparity Compensation in Wavelet Coding of Stereo Image Pairs” Information Communications and Signal Processing, 2003 and Fourth Pacific Rim Conference on Multimedia. Proceedings of the 2003 Joint Conference of the Fourth International Conference on Singapore, Dec. 15-18, 2003, Piscataway, NJ, USA, IEEE, vol. 1, Dec. 15, 2003, pp. 208-212.
Orchard, et al., “Overlapped Block Motion Compensation: An Estimation-Theoretic Approach”, IEEE Transactions on Image Processing, IEEE Service Center, Piscataway, NJ, US., vol. 3, No. 5, Sep. 1, 1994 pp. 693-699.
SMPTE 421M, “VC-1 Compressed Video Bitstream Format and Decoding Process”, Apr. 2006.
Su, et al., “Motion Estimation Methods for Overlapped Block Motion Compensation” IEEE Transactions on Image Processing, vol. 9, No. 9 Sep. 2000, pp. 1509-1521.
Sullivan, et al., “Methods of Reduced-Complexity Overlapped Block Motion Compensation” Proceedings of the International Conference on Image Processing (ICIP) Austin, Nov. 13-16, 1994, vol. 2, Nov. 13, 1994, pp. 957-961.
Tan, et al., “Intra Prediction by Averaged Template Matching Predictors” Consumer Communications and Networking Conference, 2007, CCNC 2007, Jan. 1, 2007, pp. 405-409.
Tan, et al., “Intra Prediction by Template Matching” Image Processing , 2006 IEEE International Conference on, IEEE, PI, Oct. 1, 2006, pp. 1693-1696.
Tao, et al., “A Parametric Solution for Optimal Overlapped Block Motion Compensation” IEEE Transactions on Image Processing, vol. 10, No. 3, Mar. 2001, pp. 341-350.
Tao, et al., “Joint Application of Overlapped Block Motion Compensation and Loop Filtering for Low Bit-Rate Video Coding” in Proceedings of the IEEE International Conference on Image Processing, vol. 3 pp. 626-629, Oct. 26-29, 1997.
Woo, et al., “Overlapped Block Disparity Compensation with Adaptive Windows for Stereo Image Coding” IEEE Transactions on Circuits and Systems for Video Technology, IEEE Service Center, Piscataway, NJ, US., vol. 10, No. 2, Mar. 2000, pp. 194-200.
Woo, W. et al., “Modified Overlapped block Disparity Compensation for Stereo Image Coding,” in Proc. SPIE EI-VCIP '99, Jan. 1999.
Office Action issued in U.S. Appl. No. 13/057,204 dated May 14, 2013, 25 pages.
Office Action issued in U.S. Appl. No. 13/057,204 dated Oct. 31, 2013, 16 pages.
Office Action issued in U.S. Appl. No. 14/242,975 dated Jun. 27, 2014, 29 pages.
Office Action issued in U.S. Appl. No. 13/057,204 dated Oct. 23, 2014, 44 pages.
Office Action issued in U.S. Appl. No. 14/242,975 dated Nov. 14, 2014, 11 pages.
Notice of Allowance issued in U.S. Appl. No. 14/242,975 dated Mar. 26, 2015, 7 pages (no new art cited).
Office Action issued in U.S. Appl. No. 13/057,204 dated May 7, 2015, 23 pages (no new art cited).
Office Action issued in U.S. Appl. No. 14/723,693 dated Aug. 10, 2015, 19 pages.
Office Action issued in U.S. Appl. No. 14/723,693 dated Dec. 21, 2015, 6 pages.
Notice of Allowance issued in U.S. Appl. No. 14/723,693 dated Feb. 1, 2016, 5 pages.
Notice of Allowance issued in U.S. Appl. No. 13/057,204 dated Mar. 30, 2016, 7 pages (no new art cited.
Patent Publication Number: 20170230666
Inventors: Alexandros Tourapis (Burbank, CA), Athanasios Leontaris (Burbank, CA)
Application Number: 15/496,795
International Classification: H04N 19/577 (20140101); H04N 19/139 (20140101); H04N 19/61 (20140101); H04N 19/30 (20140101); H04N 19/152 (20140101); H04N 19/159 (20140101); H04N 19/105 (20140101); H04N 19/573 (20140101); H04N 19/103 (20140101); H04N 19/176 (20140101); H04N 19/184 (20140101);