IP Library Granted Patent US 12,457,370
Granted Patent B2
US 12,457,370 · App. 18/731,779 · Granted Oct 28, 2025

Video coding with embedded motion

Inventor: Donald Martin Monro (Beckington, GB)
Assignee: Xylon LLC
H04N19/97H04N19/31H04N19/537H04N19/61H04N19/63
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,457,370
App. No.
18/731,779
Granted
Oct 28, 2025
Kind
B2
Abstract

Implementations related to coding and/or decoding image data employing video coding with embedded motion are disclosed.

Claims (49)

1 . A method, comprising:

receiving image data comprising a sequence of one or more image frames, wherein the one or more image frames include a first image frame and a second image frame;

identifying a first basis function that represents at least, in part, a first portion of the first image frame;

identifying one or more further basis functions that represent at least, in part, a residue of the first image frame, the residue being obtained by removing the first basis function from the first image frame;

identifying a second portion of the second image frame that is represented at least by the first basis function;

determining a displacement between the first portion of the first image frame and the second portion of the second image frame; and

associating motion data with the first basis function, wherein the motion data indicates the displacement;

wherein the first portion includes two or more pixels of the first image frame,

wherein the second portion includes two or more pixels of the second image frame, and

wherein the first basis function and the one or more further basis functions are selected from a dictionary of basis functions.

2 . The method of claim 1 , further comprising:

producing a bitstream including information indicative of the first basis function with information indicative of the motion data.

3 . The method of claim 2 , wherein the information indicative of the first basis function comprises a coded atom.

4 . The method of claim 3 , wherein the bitstream also includes additional information associated with the coded atom, the additional information indicative of whether the motion data associated with the coded atom comprises one of a motion vector or a correction to the motion vector.

5 . The method of claim 1 , wherein the motion data comprises a motion vector.

6 . The method of claim 1 , wherein the associating motion data with the first basis function step comprises predicting the motion data based on the first basis function.

7 . The method of claim 1 , wherein the motion data comprises a correction to a motion vector.

8 . The method of claim 1 , wherein the identifying the first basis function that represents at least, in part, the first portion of the first image frame comprises performing a matching pursuits process on the first image frame.

9 . An apparatus, comprising:

an encoder comprising a processor and a memory, the encoder adapted to:

receive image data comprising a sequence of one or more image frames, wherein the one or more image frames include a first image frame and a second image frame;

identify a first atom that represents at least, in part, a first portion of the first image frame;

identify one or more further atoms that represent at least, in part, a residue of the first image frame, the residue being obtained by removing the first atom from the first image frame;

identify a second portion of the second image frame that is represented at least by the first atom;

determine a displacement between the first portion of the first image frame and the second portion of the second image frame;

associate motion data with the first atom, wherein the motion data indicates the displacement; and

generate a transmission bitstream using the first atom and the motion data,

wherein the first portion includes two or more pixels of the image data,

wherein the second portion includes two or more pixels of the second image frame, and

wherein the first atom and the one or more further atoms are selected by the encoder from a dictionary of atoms.

10 . The apparatus of claim 9 , wherein the encoder is further adapted to produce a bitstream including coded atoms and coded motion data.

11 . The apparatus of claim 10 , wherein the bitstream includes additional information associated with at least one of the coded atoms, the additional information indicating whether the coded motion data is associated with the at least one of the coded atoms.

12 . The apparatus of claim 11 , wherein when the additional information indicates the coded motion data is associated with the at least one of the coded atoms, the additional information further indicates whether the motion data associated with the at least one of the coded atoms comprises one of a motion vector or a correction to the motion vector.

13 . The apparatus of claim 10 , wherein the encoder is further adapted to intersperse the coded motion data with the coded atoms in the bitstream.

14 . An apparatus, comprising:

a decoder comprising a processor and a memory, the decoder adapted to:

receive a bitstream, the bitstream representing a first image frame and a second image frame in a sequence of image frames, the bitstream including coded motion data associated with a first coded atom;

extract the first coded atom from the bitstream, the first coded atom representing a first portion of the first image frame;

extract one or more further coded atoms that represent at least, in part, a residue of the first image frame, the residue being obtained by removing the first coded atom from the first image frame;

extract the coded motion data from the bitstream, wherein the coded motion data indicates a displacement between the first portion of the first image frame and a second portion of the second image frame, wherein the first coded atom represents the second portion of the second image frame; and

generate the first image frame and the second image frame based on the first coded atom and the displacement,

wherein the first coded atom represents two or more pixels of the first image frame, and

wherein the first coded atom and the one or more further coded atoms are included in a dictionary of atoms.

15 . The apparatus of claim 14 , wherein the coded motion data includes a correction to a motion vector previously predicted by the decoder, and wherein the decoder is further adapted to use the correction to modify the motion vector.

16 . The apparatus of claim 15 , wherein the motion vector comprises a predicted motion vector.

17 . The apparatus of claim 14 , wherein:

the bitstream includes additional information indicating whether the coded atoms are associated with the coded motion data; and

the decoder is further adapted to predict a motion vector when the additional information indicates that one of the coded atoms is not associated with the coded motion data.

18 . The apparatus of claim 17 , wherein when the additional information indicates that the at least one of the coded atoms is associated with the coded motion data, the additional information further indicates whether the coded motion data codes for one of the motion vector or a correction to the motion vector, and wherein the decoder is further adapted to modify the motion vector when the additional information indicates that the coded motion data codes for the correction to the motion vector.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 3, 2024
From: MONRO, DONALD M.
To: INTELLECTUAL VENTURES HOLDING 35 LLC
Reel/Frame 067600/0677 →
MERGER Recorded Jun 3, 2024
From: INTELLECTUAL VENTURES HOLDING 35 LLC
To: XYLON LLC
Reel/Frame 067607/0650 →
Continuity (6)
Continuation 18295653 · Apr 4, 2023
Continuation 17209570 · Mar 23, 2021
Continuation 16729748 · Dec 30, 2019
Continuation 16259867 · Jan 28, 2019
Continuation 11678479 · Feb 23, 2007
Related Publication 20240323454A1 · Sep 26, 2024
References Cited (225)
US 4675809A · Omoda · 1987 [cited by applicant]
US 4908873A · Philbert et al. · 1990 [cited by applicant]
US 5067015A · Combridge et al. · 1991 [cited by applicant]
US 5218435A · Lim et al. · 1993 [cited by applicant]
US 5315670A · Shapiro · 1994 [cited by applicant]
US 5321776A · Shapiro · 1994 [cited by applicant]
US 5412741A · Shapiro · 1995 [cited by applicant]
US 5559931A · Shindou et al. · 1996 [cited by applicant]
US 5699121A · Zakhor et al. · 1997 [cited by applicant]
US 5819017A · Akeley et al. · 1998 [cited by applicant]
US 5873076A · Barr et al. · 1999 [cited by applicant]
US 5956429A · Burns · 1999 [cited by applicant]
US 6029167A · Evans · 2000 [cited by applicant]
US 6052416A · Koga · 2000 [cited by applicant]
US 6086706A · Brassil et al. · 2000 [cited by applicant]
US 6125348A · Levine · 2000 [cited by applicant]
US 6144835A · Inoue · 2000 [cited by applicant]
US 6208744B1 · Ishige et al. · 2001 [cited by applicant]
US 6212235B1 · Nieweglowski et al. · 2001 [cited by applicant]
US 6336050B1 · Amin et al. · 2002 [cited by applicant]
US 6434542B1 · Farmen et al. · 2002 [cited by applicant]
US 6480547B1 · Chen et al. · 2002 [cited by applicant]
US 6625213B2 · Bottreau et al. · 2003 [cited by applicant]
US 6654503B1 · Sudharsanan et al. · 2003 [cited by applicant]
US 6820079B1 · Evans · 2004 [cited by applicant]
US 6874966B2 · Duqueroie et al. · 2005 [cited by applicant]
US 6990145B2 · Monro et al. · 2006 [cited by applicant]
US 7003039B2 · Zakhor et al. · 2006 [cited by applicant]
US 7079986B2 · Sieracki · 2006 [cited by applicant]
US 7230551B2 · Moriya et al. · 2007 [cited by applicant]
US 7511638B2 · Monro · 2009 [cited by applicant]
US 7511639B2 · Monro · 2009 [cited by applicant]
US 7545291B2 · Monro · 2009 [cited by applicant]
US 7548176B2 · Monro · 2009 [cited by applicant]
US 7586424B2 · Monro · 2009 [cited by applicant]
US 7602316B2 · Monro · 2009 [cited by applicant]
US 7671767B2 · Monro · 2010 [cited by applicant]
US 7737869B2 · Monro · 2010 [cited by applicant]
US 8055085B2 · Monro · 2011 [cited by applicant]
US 8130828B2 · Hsu et al. · 2012 [cited by applicant]
US 8144037B2 · Monro · 2012 [cited by applicant]
US 8503536B2 · Zuo et al. · 2013 [cited by applicant]
US 10194175B2 · Monro · 2019 [cited by applicant]
US 10523974B2 · Monro · 2019 [cited by applicant]
US 10958944B2 · Monro · 2021 [cited by applicant]
US 11622133B2 · Monro · 2023 [cited by applicant]
US 20010028683A1 · Bottreau et al. · 2001 [cited by applicant]
US 20020069206A1 · Bergman et al. · 2002 [cited by applicant]
US 20020118755A1 · Karczewicz · 2002 [cited by applicant]
US 20030108101A1 · Frossard et al. · 2003 [cited by applicant]
US 20030179825A1 · Sekiguchi et al. · 2003 [cited by applicant]
US 20040028135A1 · Monro · 2004 [cited by applicant]
US 20040126018A1 · Monro · 2004 [cited by applicant]
US 20040151245A1 · Lainema et al. · 2004 [cited by applicant]
US 20040165737A1 · Monro · 2004 [cited by applicant]
US 20040184666A1 · Sekiguchi et al. · 2004 [cited by applicant]
US 20040218836A1 · Kanatsu · 2004 [cited by applicant]
US 20050149296A1 · Sieracki · 2005 [cited by applicant]
US 20060029253A1 · Pace · 2006 [cited by applicant]
US 20060203906A1 · Divorra Escoda et al. · 2006 [cited by applicant]
US 20070016414A1 · Mehrotra et al. · 2007 [cited by applicant]
US 20070019723A1 · Valente · 2007 [cited by applicant]
US 20070030177A1 · Monro · 2007 [cited by applicant]
US 20070053434A1 · Monro · 2007 [cited by applicant]
US 20070053597A1 · Monro · 2007 [cited by applicant]
US 20070053603A1 · Monro · 2007 [cited by applicant]
US 20070140342A1 · Karczewicz et al. · 2007 [cited by applicant]
US 20070164882A1 · Monro · 2007 [cited by applicant]
US 20070237221A1 · Hsu et al. · 2007 [cited by applicant]
US 20070248163A1 · Zuo et al. · 2007 [cited by applicant]
US 20070252733A1 · Thebault et al. · 2007 [cited by applicant]
US 20070258654A1 · Monro · 2007 [cited by applicant]
US 20070271250A1 · Monro · 2007 [cited by applicant]
US 20070282933A1 · Monro · 2007 [cited by applicant]
US 20070290898A1 · Monro · 2007 [cited by applicant]
US 20070290899A1 · Monro · 2007 [cited by applicant]
US 20080005648A1 · Monro · 2008 [cited by applicant]
US 20080055120A1 · Monro · 2008 [cited by applicant]
US 20080056346A1 · Monro · 2008 [cited by applicant]
US 20080084924A1 · Monro · 2008 [cited by applicant]
US 20080086519A1 · Monro · 2008 [cited by applicant]
US 20080201352A1 · Monro · 2008 [cited by applicant]
US 20080205523A1 · Monro · 2008 [cited by applicant]
US 20090103602A1 · Xiong et al. · 2009 [cited by applicant]
US 20100040146A1 · Wang et al. · 2010 [cited by applicant]
CN 1864177A · 2006 [cited by applicant]
EP 0595599A2 · 1994 [cited by applicant]
EP 0836325A1 · 1998 [cited by applicant]
EP 1545010A1 · 2005 [cited by applicant]
EP 1610560A · 2005 [cited by applicant]
GB 2293733A · 1996 [cited by applicant]
GB 2409943A · 2005 [cited by applicant]
WO WO9716029 · 1997 [cited by applicant]
WO WO9908449 · 1999 [cited by applicant]
WO WO200115456 · 2001 [cited by applicant]
WO WO0163935A1 · 2001 [cited by applicant]
WO WO200213538 · 2002 [cited by applicant]
WO WO2004051863 · 2004 [cited by applicant]
WO WO2005027049 · 2005 [cited by applicant]
WO WO2005064799 · 2005 [cited by applicant]
WO WO2005067661 · 2005 [cited by applicant]
WO WO2005119581 · 2005 [cited by applicant]
WO WO2007030702 · 2007 [cited by applicant]
WO WO2007030784 · 2007 [cited by applicant]
WO WO2007030785 · 2007 [cited by applicant]
WO WO2007030788 · 2007 [cited by applicant]
WO WO2007084336 · 2007 [cited by applicant]
WO WO2007118220 · 2007 [cited by applicant]
WO WO2007145875 · 2007 [cited by applicant]
WO WO2007149358 · 2007 [cited by applicant]
WO WO2007149383 · 2007 [cited by applicant]
WO WO2007149384 · 2007 [cited by applicant]
WO WO2008027450 · 2008 [cited by applicant]
WO WO2008030426 · 2008 [cited by applicant]
WO WO2008045280 · 2008 [cited by applicant]
WO WO2008045281 · 2008 [cited by applicant]
De Natale, et al., “A Mesh-Interpolation Scheme for Very-Low Bitrate Coding of Video Sequences” European Transactions on Telecommunications, vol. 9, No. 1, pp. 47-55, 1998. [cited by applicant]
Tian et al., “Image Data Processing in the Compressed Wavelet Domain” Proceedings of ICSP'96, pp. 978-981, 1996. [cited by applicant]
Said et al., “A New, Fast, and Efficient Image Codec Based on Set Partitioning in Hierarchical Trees” IEEE Transactions on Circuits and Systems for Video Technology, vol. 6, No. 3, pp. 243-250, Jun. 1996. [cited by applicant]
Monro et al., “Alignment Blur in Coherently Averaged Images” IEEE Transactions on Signal Processing, vol. 44, No. 6, pp. 1596-1601, Jun. 1996. [cited by applicant]
Shapiro, “Embedded Image Coding Using Zerotrees of Wavelet Coefficients” IEEE Transactions on Signal Processing, vol. 41, No. 12, pp. 3445-3462, Dec. 1993. [cited by applicant]
Horst et al., “Mupcos: A multi-purpose coding scheme” Signal Processing: Image Communication 5,pp. 75-89,1993. [cited by applicant]
Brin et al., Copy detection mechanisms for digital documents, Proceedings of the 1995 ACM SIGMOD international conference on Management of data SIGMOD '95, vol. 24 ACM Press, May 1995, pp. 398-409. [cited by applicant]
Cancedda et al., Word Sequence Kernels, Mar. 2003, MIT Press, Journal of Machine Learning Research, vol. 3 Special Edition, pp. 1059-1082. [cited by applicant]
Cover et al. “Elements of Information Theory” Copyright Jon Wiley & Sons, Inc., p. 96, 1991. [cited by applicant]
Czerepinski et al., “Matching Pursuits Video Coding: Dictionaries and Fast Implementation” IEEE Trans Circuit Systems Video Technology, vol. 10, No. 7, pp. 1103-1115, Oct. 2000. [cited by applicant]
Daubechies, “Orthonormal Bases of Compactly Supported Wavelets” Comm. Pure Appl. Math., vol. 41 pp. 909-996, 1998. [cited by applicant]
De Vleeschouwer et al., “Subband dictionaries for low-cost matching pursuits of video residues,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 9, Issue 7, pp. 984-993, Oct. 1999. [cited by applicant]
Figueras et al., “Color Image Scalable Coding with Matching Pursuit” IEEE Int. Conference Acoustics Speech Signal Process, pp. III-53-III-56, May 2004. [cited by applicant]
Frossard et al., “High Flexibility Scalable Image Coding” Proceedings of VCIP 2003, Jul. 2003. [cited by applicant]
Gamito et al. “Lossles Coding of Floating Point Data with JPEG 2000 Part 10” Proceedings of the SPIE, SPIE, Bellingham, VA, US. vol. 5558, Aug. 2, 2004. pp. 276-287. [cited by applicant]
Golomb, S.W., “Run-length encodings” IEEE Trans Info Theory, Jul. 1966, 12(3):399-401. [cited by applicant]
Hosang, M., “A Character Elimination Algorithm for Lossless Data Compression” Data Compression Conference, Proceedings. DCC, IEEE Computer Society Press, Los Alamitos, CA, US, Apr. 2, 2002, pp. 1-10. [cited by applicant]
Huffman, David A., “A Method for the Construction of Minimum-Redundancy Codes,” Pro. Inst. Radio Eng., 1952, 9 (40), pp. 1098-1101. [cited by applicant]
Hull, Jonathan J., “Document Image Matching and Retrieval with Multiple Distortion-Invariant Descriptors”, International Association for Pattern Recognition Workshop on Document Analysis Systems, Series in Machine Perce… [cited by applicant]
Jun-peng Bao et al., “A new text feature extraction model and its application in document copy detection” Machine Learning and Cybernetics, 2003, International Conference on Nov. 2-5, 2003 Piscataway, NJ, USA, IEEE, vol… [cited by applicant]
Larsson, N.J., “The Context Trees of Block Sorting Compression” In Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, Mar. 30-Apr. 1, pp. 189-198. IEEE Computer Society Press, 1998. [cited by applicant]
Mallat et al., “Matching Pursuits with Time-Frequency Dictionaries” IEEE Trans. Signal Processing, vol. 41. No. 12, pp. 3397-3415, Dec. 1993. [cited by applicant]
Mallat, “A Theory for Multiresolution Signal Decomposition: The Wavelet Representation” IEEE Trans. Pattern Anal. Mach. Intel., vol. 11, No. 7, Jul. 1989. [cited by applicant]
Monro et al., “Bases for Low Complexity Matching Pursuits Image Coding” Dept. of Electron. & Electr. Eng., Bath Univ., UK, 2005.IEEE International Conference on Image Processing, Publication Date: Sep. 11-14, 2005. vol.… [cited by applicant]
Monro et al., “Improved Coding of Atoms in Matching Pursuits” IEEE Int. Conference. Image Processing, vol. 2, Sep. 2003. [cited by applicant]
Monro et al., “Visual Embedding of Wavelet Transformation Coefficients” IEEE International Conference Image Process, pp. 186-189, Sep. 2000. [cited by applicant]
Monro, “Basis Picking for Matching Pursuits Image Coding” IEEE International Conference on Image Processing, pp. 2495-2498, Sep. 2004. [cited by applicant]
Moschetti et al., “New Dictionary and Fast Atom Searching Method for Matching Pursuit Representation of Displaced Frame Difference” IEEE International Conference on Image Processing, pp. II-685-II-688, Sep. 2002. [cited by applicant]
Neff et al., “Matching Pursuit Video Coding—Part I: Dictionary Approximation” IEEE Trans. Circuits System Video Technology, vol. 12, No. 1, pp. 13-26, Jan. 2002. [cited by applicant]
Neff et al., “Very Low Bit-Rate Video Coding Based on Matching Pursuits” IEEE Trans. Circuits and Systems for Video Tech., vol. 7, No. 1, pp. 158-171, Feb. 1997. [cited by applicant]
Poh et al., “Comparison of Residual Compression Methods in Motion Compensated Video” IEEE Int. Workshop on Multimedia Signal Processing, pp. 109-112, Dec. 2002. [cited by applicant]
R. F. Rice, “Some Practical Universal Noiseless Coding Techniques,” Jet Propulsion Laboratory, Pasadena, California, JPL Publication 79-22, Mar. 1979. [cited by applicant]
Ramchandran et al., “Best Wavelet Packet Bases in a Rate-Distortion Sense” IEEE Transactions on Signal Processing, vol. 2, No. 2, pp. 160-175, Apr. 1993. [cited by applicant]
Sayood, Khalid, “Introduction to Data Compression” Morgan Kaufmann Publishers Inc., San Francisco, CA, USA 1996, pp. 27-32. [cited by applicant]
Sayood, Khalid, “Introduction to Data Compression” Morgan Kaufmann Publishers Inc., San Francisco, CA, USA 1991, pp. 98-99. [cited by applicant]
Salomon, “Data Compression: the complete reference”, Springer, pp. 32-33, 1998. [cited by applicant]
Schleimer et al., Data security protection: Winnowing: local algorithms for document fingerprinting, 2003 ACM SIGMOD international conference on Management of data (SIGMOD '03), ACM Press, Jun. 2003, pp. 76-85. [cited by applicant]
Steffen et al., “Theory of Regular M-band Wavelets Bases” IEEE Transactions on Signal Processing, vol. 41. No. 12, pp. 3497-3511, Dec. 1993. [cited by applicant]
Teuhola, J. “A Compression Method for Clustered Bit-Vectors” Information Processing Letters, Amsterdam, NL, vol. 7, No. 6, pp. 308-311, Oct. 1978. [cited by applicant]
Tredwell et al., “A Sequential Vector Selection Algorithm for Controllable Bandwidth Motion Description Encoding” IEEE Sympos. Intell. Multimedia. Video & Speech Process, May 2001. [cited by applicant]
Trott et al. “Wavelets Applied to Lossless Compression and Progressive Transmission of Floating Point Data in 3-D Curvilinear Grids” IEEE Proceedings of the Visualization Conference, Oct. 27, 1996, pp. 385-388. [cited by applicant]
Yuan et al., “Improved Matching Pursuits Image Coding” IEEE International Conference on Acoustics, Speech and Signal Processing ICASSP 2005, pp. II-201-II-204, Mar. 2005. [cited by applicant]
Yuan et al., “Low Complexity Separable Matching Pursuits” IEEE Int. Conference Acoustics Speech Signal Process, pp. III-725-III-728, May 2004. [cited by applicant]
Donald Monro, U.S. Appl. No. 11/677,515, filed Feb. 21, 2007, entitled “Hierarchical Update Scheme for Extremum Location with Indirect Addressing”. [cited by applicant]
Donald Monro, U.S. Appl. No. 11/678,004, filed Feb. 22, 2007, entitled, “Video Coding With Motion Vectors Determined By Decoder”. [cited by applicant]
Donald Monro, U.S. Appl. No. 11/678,479, filed Feb. 23, 2007, entitled, “Video Coding With Embedded Motion”. [cited by applicant]
Donald Monro, U.S. Appl. No. 11/777,256, filed Jul. 11, 2007. [cited by applicant]
Donald Monro, U.S. Appl. No. 11/677,511, filed Feb. 21, 2007, entitled “Hierarchical Update Scheme For Extremum Location”. [cited by applicant]
Donald Monro, U.S. Appl. No. 11/777,239, filed Jul. 12, 2007. [cited by applicant]
Donald Monro, U.S. Appl. No. 11/777,230, filed Jul. 12, 2007. [cited by applicant]
Donald Monro, U.S. Appl. No. 11/777,130, filed Jul. 12, 2007. [cited by applicant]
Donald Monro, U.S. Appl. No. 11/777,144, filed Jul. 12, 2007. [cited by applicant]
Donald Monro, U.S. Appl. No. 11/777,122, filed Jul. 12, 2007. [cited by applicant]
Donald Monro, U.S. Appl. No. 11/777,100, filed Jul. 12, 2007. [cited by applicant]
Donald Monro, U.S. Appl. No. 11/777,081, filed Jul. 12, 2007. [cited by applicant]
Donald Monro, U.S. Appl. No. 11/777,022, filed Jul. 12, 2007. [cited by applicant]
Donald Monro, U.S. Appl. No. 11/776,786, filed Jul. 12, 2007. [cited by applicant]
Donald Monro, PCT Serial No. PCT/US2007/008861, filed Apr. 9, 2007, entitled “Motion Assisted Data Enhancement”. [cited by applicant]
Donald Monro, PCT Serial No. PCT/US2008/002100, filed Feb. 19, 2008, entitled “Hierarchical Update Scheme For Extremum Location”. [cited by applicant]
Donald Monro, PCT Serial No. PCT/US2008/002101, filed Feb. 19, 2008, entitled “Hierarchical Update Scheme for Extremum Location with Indirect Addressing”. [cited by applicant]
International Search Report for Appln. No. PCT/US2007/013100 issued Jan. 14, 2008, 4pgs. [cited by applicant]
International Search Report for Appln. No. PCT/US2007/000759 issued Feb. 14, 2008, 7pgs. [cited by applicant]
International Search Report for Appln. No. PCT/US2007/014138 issued Oct. 29, 2007, 2 pgs. [cited by applicant]
International Search Report for Appln. No. PCT/US2007/014182 issued Jan. 18, 2008, 1 pg. [cited by applicant]
International Search Report for Appln. No. PCT/US2007/014181 issued Jan. 14, 2008. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 11/255,090, completed Feb. 2, 2008, mailed Feb. 6, 2008, 14pgs. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 11/332,777, completed Dec. 12, 2007, mailed Dec. 21, 2007, 4pgs. [cited by applicant]
Final Office Action for U.S. Appl. No. 11/425,142, completed Sep. 10, 2007, mailed Sep. 18, 2007, 9 pgs. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 11/425,142, completed Mar. 7, 2007, mailed Mar. 20, 2007, 8 pgs. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 11/470,611, completed Aug. 29, 2007, mailed Sep. 5, 2007, 6 pgs. [cited by applicant]
Written Opinion for Appln. No. PCT/US2007/000759 completed Feb. 14, 2007, mailed Feb. 25, 2008, 11pgs. [cited by applicant]
International Search Report for Patent Cooperation Treaty Appln. No. PCT/US2007/019034 issued Apr. 8, 2008, 2 pgs. [cited by applicant]
Written Opinion for Patent Cooperation Treaty Appln. No. PCT/US2007/019034 completed Mar. 31, 2008, mailed Apr. 8, 2008, 7 pgs. [cited by applicant]
Non-Final Rejection for U.S. Appl. No. 11/470,611, mailed on Jun. 30, 2008, 5 pgs. [cited by applicant]
Non-Final Rejection for U.S. Appl. No. 11/422,316, mailed on Jul. 3, 2008, 7 pgs. [cited by applicant]
Choog Soo Park et al., “Lost Motion Vector Recovery Algorithm,” Circuits and Systems, IEEE International Symposium on London, vol. 3, 1994, pp. 229-232. [cited by applicant]
Final Office Action for U.S. Appl. No. 11/332,777, mailed Aug. 13, 2008, 5 pgs. [cited by applicant]
Final Office Action for U.S. Appl. No. 11/255,090, mailed Sep. 3, 2008, 11 pgs. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 11/425,142, mailed Sep. 16, 2008, 12 pgs. [cited by applicant]
International Search Report for Appln. No. PCT/US2008/002179, issued Aug. 20, 2008, 12 pgs. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 11/255,090, dated Dec. 15, 2008, 11 pgs. [cited by applicant]
International Search Report and Written Opinion for Appln. No. PCT/US2008/002101, dated Dec. 12, 2008, 13 pgs. [cited by applicant]
Cotter et al., “Application of Tree-Based Searches to Matching Pursuit,” 2001 IEEE International Conference on Acoustics, Speech and Signal Processing, New York, NY, vol. 6, 7, May 2001, pp. 3933-3936. [cited by applicant]
Shoa et al., “Tree Structure Search for Matching Pursuit,” Image Processing, 2005, vol. 3, 11, pp. 908-911. [cited by applicant]
Qiangsheng Liu et al., “A low-cost video encoder with matching pursuit,” Intelligent Multimedia, Video and Speech Processing, May 2, 2001, pp. 502-505. [cited by applicant]
Yuan Yuan et al., “Improved Matching Pursuits Image Coding,” Acoustics, Speech, and Signal Processing, 2005, vol. 2, 18, pp. 201-204. [cited by applicant]
International Search Report and Written Opinion for Appln. No. PCT/US2008/002100, dated Dec. 12, 2008, 14 pgs. [cited by applicant]
International Search Reportfor Appln. No. PCT/US2007/021302, dated Dec. 10, 2008, 5 pgs. [cited by applicant]
Haoxing Zhang et al., “A Hybrid Video Coder Based on H.264 with Matching Pursuits,” Acoustics, Speech and Signal Processing, 2006, p. 889. [cited by applicant]
Yuan et al., “3D Wavelet Video Coding with Replicated Matching Pursuits,” Sep. 11, 2005, Image Processing, pp. 69-72. [cited by applicant]
Monro et al., “Subband Adaptive Dictionaries for Wavelet/Matching Pursuits Image Coding,” Oct. 8, 2006, Image Processing, p. 2136. [cited by applicant]
Chien-Kai et al., “Matching Pursuits Low Bit Rate Video Coding with Codebooks Adaptation,” Jun. 5, 2000, Acoustics, Speech, and Signal Processing, pp. 408-411. [cited by applicant]
International Search Report for Appln. No. PCT/US2007/021303, dated Dec. 12, 2008, 5 pgs. [cited by applicant]
Rabiee et al., “Scalable Subband Image Coding with Segmented Orthogonal Matching Pursuit,” Oct. 4, 1998, Image Processing, pp. 774-777. [cited by applicant]
Rabiee et al., “Low-bit-rate Subband Image Coding with Matching Pursuits,” Visual Communications and Image Processing, vol. 3309, 1998, pp. 875-880. [cited by applicant]
Schmid-Saugeon et al., “Dictionary Design for Matching Pursuit and Application to Motion-Compensated Video Coding,” 2004, IEEE Transactions on Circuits and Systems for Video Technology, pp. 880-886. [cited by applicant]
Copy of International Search Report for Appln. No. PCT/US2007/019297, dated Dec. 12, 2008, 5 pgs. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 11/422,316, mailed Dec. 4, 2008, 13 pgs. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 11/255,090, mailed Dec. 15, 2008, 15 pgs. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 11/332,777, mailed Feb. 25, 2009, 6 pgs. [cited by applicant]
Final Office Action for U.S. Appl. No. 11/425,142, mailed Mar. 2, 2009, 18 pgs. [cited by applicant]
International Search Report for Appln. No. PCT/US2007/014181 issued Jan. 23, 2008, 1 pg. [cited by applicant]
David Salomon, “Data Compression: The Complete Reference,” 1998, Springer, XP002464409, pp. 32-33. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 11/677,511, mailed Feb. 20, 2009, 23 pgs. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 11/677,515, mailed Feb. 25, 2009, 21 pgs. [cited by applicant]
International Search Report and Written Opinion of the International Searching Authority directed to related International Patent Application No. PCT/US2008/002255, mailed Nov. 13, 2008; 10 pages. [cited by applicant]
International Preliminary Report on Patentability directed to related International Patent Application No. PCT/US2008/002255, issued Aug. 26, 2009; 7 pages. [cited by applicant]
Escoda et al, “A Bayesian Approach to Video Expansions on Parametric Over-Complete 2-D Dictionaries,” Multimedia Signal Processing, Siena, Italy, Sep. 29-Oct. 1, 2004; 4 pages. [cited by applicant]
Escoda et al., “Video Coding Using a Deformation Compensation Algorithm Based on Adaptive Matching Pursuit Image Decompositions,” International Conference on Image Processing, ICIP-2003, Barcelona, Spain, Sep. 14-17, 20… [cited by applicant]