MATCHING PURSUITS CODING OF DATA

• US 20080056346A1
• Filed: 08/31/2006
• Published: 03/06/2008
• Est. Priority Date: 08/31/2006
• Status: Active Grant

• Current Assignee: Xylon LLC (Intellectual Ventures LLC)
• Original Assignee: Intellectual Ventures Holding 35 LLC (Intellectual Ventures LLC)
• Inventors: Monro, Donald Martin
• Granted Patent: US 7,689,049 B2
• Time in Patent Office: Days
• US Class Current: 375/240
• CPC Class Codes: H04N 19/97 Matching pursuit coding

Abstract

Briefly, in accordance with one embodiment, an approach to employing Matching Pursuits coding of data is described.

Claims

1. A method comprising:

coding multi-dimensional data using a codebook of basis functions;

wherein said codebook comprises a subset of a larger multi-dimensional basis dictionary, said larger dictionary comprising separable combinations of one or more primary one dimensional basis function dictionaries.

2. The method of claim 1, wherein said one or more primary one dimensional basis dictionary or dictionaries are communicated to a decoder.

3. The method of claim 2, wherein a primary dictionary entry is communicated as sampled values of a function.

4. The method of claim 2, wherein a primary dictionary entry is communicated as parameters from which a function is capable of being computed.

5. The method of claim 1, wherein data indicative of the subset to be used is communicated to a decoder.

6. The method of claim 5, wherein the subset is described by a mask that is applied to a larger dictionary.

7. The method of claim 5, wherein the subset is described by data indicative of selected entries of said larger dictionary.

8. The method of claim 1, wherein said data and said dictionary are two dimensional.

9. The method of claim 8, wherein said two dimensional data comprises a digital image.

10. The method of claim 1, wherein said data and said dictionary are three dimensional.

11. The method a claim 10, wherein two of the three dimensions are spatial and the third dimension is temporal.

12. The method of claim 10, wherein the three dimensions are spatial.

13. The method of claim 1, wherein said data and said dictionary are of more than three dimensions.

14. The method of claim 13, wherein one of the dimensions is temporal.

15. The method of claim 1, wherein the data dimension is higher than the codebook dimension;

and wherein a Matching Pursuits process is applied to lower dimensions of the data.

16. The method of claim 1, wherein a transform is applied to said data in at least one dimension prior to application of a Matching Pursuits process.

17. The method of claim 16, wherein said transform comprises a wavelet transform.

18. The method of claim 17, wherein said transform comprises a Discrete Cosine Transform.

26. The method of claim 1, wherein said data and said dictionary are two dimensional.

27. The method of claim 26, wherein said two dimensional data comprises a digital image.

28. The method of claim 1, wherein said data and said dictionary are three dimensional.

29. The method a claim 28, wherein two of the three dimensions are spatial and the third dimension is temporal.

30. The method of claim 28, wherein the three dimensions are spatial.

31. The method of claim 1, wherein said data and said dictionary are of more than three dimensions.

32. The method of claim 31, wherein one of the dimensions is temporal.

33. The method of claim 1, wherein the data dimension is higher than the codebook dimension;

and wherein a Matching Pursuits process is applied to lower dimensions of the data.

34. The method of claim 1, wherein a transform is applied to said data in at least one dimension prior to application of a Matching Pursuits process.

35. The method of claim 34, wherein said transform comprises a wavelet transform.

36. The method of claim 35, wherein said transform comprises a Discrete Cosine Transform.

19. A method comprising:

decoding multi-dimensional data using a codebook of basis functions;

wherein said codebook comprises a subset of a larger multi-dimensional basis dictionary, said larger dictionary comprising separable combinations of one or more primary one dimensional basis function dictionaries.

20. The method of claim 19, wherein said one or more primary one dimensional basis dictionary or dictionaries are communicated to a coder.

21. The method of claim 20, wherein a primary dictionary entry is communicated as sampled values of a function.

22. The method of claim 20, wherein a primary dictionary entry is communicated as parameters from which a function is capable of being computed.

23. The method of claim 19, wherein data indicative of the subset to be used is communicated to a coder.

24. The method of claim 23, wherein the subset is described by a mask that is applied to a larger dictionary.

25. The method of claim 23, wherein the subset is described by data indicative of selected entries of said larger dictionary.

37. An article comprising:

a storage medium having stored therein instructions that, if executed, result in;

coding multi-dimensional data using a codebook of basis functions;

wherein said codebook comprises a subset of a larger multi-dimensional basis dictionary, said larger dictionary comprising separable combinations of one or more primary one dimensional basis function dictionaries.

38. The article of claim 37, wherein said instructions, if executed, further result in:

one or more primary one dimensional basis dictionary or dictionaries being communicated to a decoder.

39. The article of claim 38, wherein said instructions, if executed, further result in:

a primary dictionary entry being communicated as sampled values of a function.

40. The article of claim 39, wherein said instructions, if executed, further result in:

data indicative of the subset to be used being communicated to a decoder.

41. The article of claim 40, wherein said instructions, if executed, further result in:

the subset being described by a mask that is applied to a larger dictionary.

42. The article of claim 40, wherein said instructions, if executed, further result in:

the subset being described by data indicative of selected entries of said larger dictionary.

43. An article comprising:

a storage medium having stored therein instructions that, if executed, result in;

decoding multi-dimensional data using a codebook of basis functions;

wherein said codebook comprises a subset of a larger multi-dimensional basis dictionary, said larger dictionary comprising separable combinations of one or more primary one dimensional basis function dictionaries.

44. The article of claim 43, wherein said instructions, if executed, further result in:

said one or more primary one dimensional basis dictionary or dictionaries being communicated to a coder.

45. The article of claim 43, wherein said instructions, if executed, further result in:

data indicative of the subset to be used being communicated to a coder.

46. The article of claim 43, wherein said instructions, if executed, further result in:

the subset being described by a mask that is applied to a larger dictionary.

47. The article of claim 43, wherein said instructions, if executed, further result in:

the subset being described by data indicative of selected entries of said larger dictionary.