Custom character-coding compression for encoding and watermarking media content

• US 6,266,419 B1
• Filed: 07/03/1997
• Issued: 07/24/2001
• Est. Priority Date: 07/03/1997
• Status: Expired due to Term

• Current Assignee: Hanger Solutions, LLC (IP Investments Group LLC)
• Original Assignee: AT&T Corporation (AT&T, Inc.)
• Inventors: Quackenbush, Schuyler Reynier, Lacy, John Blakeway, Snyder, James H.
• Primary Examiner(s): Swann, Tod R.
• Assistant Examiner(s): Darrow, Justin T.
• Application Number:
  US08/888,014
• Time in Patent Office: 1,482 Days
• Field of Search: 380/28, 380/49, 380/217, 380/239, 380/269, 380/24, 712/114, 712/224, 708/203, 709/247, 341/50, 341/65, 341/67, 341/81, 382/239, 382/246, 382/245
• US Class Current: 380/269
• CPC Class Codes: G06T 1/0021 Image watermarking
• CPC Class Codes: G06T 2201/0053 Embedding of the watermark in the coding stream, possibly without decoding; Embedding of the watermark in the compressed domain
• CPC Class Codes: G11B 20/00007 Time or data compression or expansion audio compression based on psychoacoustics G10L19/00; data processing for reproducing audio data at different playback speeds G10L21/04; video compression H04N19/00; data compression per se H03M7/30
• CPC Class Codes: G11B 20/00086 Circuits for prevention of unauthorised reproduction or copying, e.g. piracy indicating unauthorised use of record carriers in general G11B23/28; scrambling for television signal recording H04N5/913; network architectures or network protocols for network security H04L63/00; cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
• CPC Class Codes: G11B 20/0021 involving encryption or decryption of contents recorded on or reproduced from a record carrier
• CPC Class Codes: G11B 20/00884 involving a watermark, i.e. a barely perceptible transformation of the original data which can nevertheless be recognised by an algorithm
• CPC Class Codes: H04N 19/00 Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
• CPC Class Codes: H04N 21/23892 involving embedding information at multiplex stream level, e.g. embedding a watermark at packet level
• CPC Class Codes: H04N 21/8358 involving watermark protecting executable software by watermarking G06F21/16; image watermarking in general G06T1/0021; watermarks inserted in still images for transmission purposes H04N1/32144; inserting watermarks during video coding H04N19/467

Abstract

A method of compressing media content in which a first predetermined portion of a media content is compressed using a first data-based compression algorithm and inserted into a first portion of a data frame. A second predetermined portion of the media content is compressed using a second data-based compression algorithm and is inserted into a second portion of the data frame. The second predetermined portion of the media content is different from the first predetermined portion of the media content, and the second data-based compression algorithm is different from the first data-based compression algorithm. At least one of the first and second data-based compression algorithms is a private data-based compression algorithm. A plurality of data frames are generated and are made available for distribution, for example, by transmission over a computer network, such as the Internet.

Claims

1. A method of compressing media content, the method comprising the steps of:

compressing a first predetermined portion of a media content using a first data-based compression algorithm; and

compressing a second predetermined portion of the media content using a second data-based compression algorithm, the second predetermined portion of the media content being different from the first predetermined portion of the media content, and the second data-based compression algorithm being different from the first data-based compression algorithm.

2. The method according to claim 1, wherein at least one of the first and second data-based compression algorithms is a private data-based compression algorithm.

3. The method according to claim 2, wherein one of the first and second data-based compression algorithms is a public data-based compression algorithm.

4. The method according to claim 3, wherein the predetermined portion of the media content compressed by public data-based compression algorithm is a null portion of the media content.

5. The method according to claim 2, further comprising the steps of:

grouping the compressed first predetermined portion of the media content into a first portion of a data frame; and

grouping the compressed second predetermined portion of the media content into a second portion of the data frame.

6. The method according to claim 5, wherein the first and second portions of the data frame are separated by a predetermined header code.

7. The method according to claim 5, wherein the first and second portions of the data frame are separated by relative positions of the first and second predetermined portions of compressed media content within the data frame.

8. The method according to claim 5, further comprising the step of making the data frame publicly available.

9. The method according to claim 8, wherein the step of making the data frame publicly available includes the step of transmitting the data frame over a computer network.

10. The method according to claim 8, wherein the step of making the data frame publicly available includes the step of storing the data frame in a memory device.

11. The method according to claim 10, wherein the memory device is a CD ROM.

12. The method according to claim 8, wherein the steps of the method are performed for a plurality of data frames.

13. The method according to claim 12, further comprising the steps of:

receiving the publicly available data frames;

decompressing the first predetermined portion of each data frame using the first data-based compression algorithm; and

decompressing the second predetermined portion of each data frame using the second data-based compression algorithm.

14. The method according to claim 8, wherein each private data-based compression algorithm includes associated initial data,

the method further comprising the steps of:

encrypting the associated initial data of it least one private data-based compression algorithm; and

making the encrypted associated initial data publicly available with the data frame.

15. The method according to claim 14, further comprising the step of grouping each encrypted associated initial data into a data envelope within the data frame.

16. The method according to claim 14, wherein the steps of the method are performed for a plurality of data frames, and

wherein the step of making the encrypted associated initial data publicly available includes the step of making each encrypted associated initial data available no later than a first data frame containing media content compressed using the private data-based compression algorithm with which the encrypted initial data is associated.

17. The method according to claim 16, further comprising the steps of:

receiving the publicly available data frames;

decrypting each encrypted associated initial data;

decompressing the first predetermined portion of each data frame using the first data-based compression algorithm; and

decompressing the second predetermined portion of each data frame using the second data-based compression algorithm.

18. The method according to claim 14, wherein the initial data associated with at least one private data-based compression algorithm includes at least one Huffman code-book.

19. The method according to claim 18, wherein at least one Huffman code-book represents information that is distinct from the media content that is compressed by the private data-based compression algorithm.

20. The method according to claim 19, wherein the information that is distinct from the media content includes watermark data.

21. The method according to claim 18, wherein at least one symbol in at least one Huffman code-book represents content that is distinct from the media content that is compressed by the private data-based compression algorithm.

22. The method according to claim 21, wherein the content that is distinct from the media content includes watermark data.

23. The method according to claim 14, wherein the initial data associated with at least one private data-based compression algorithm includes at least one vector quantization code-book.

24. The method according to claim 23, wherein at least one vector quantization code-book represents information that is distinct from the media content that is compressed by the private data-based compression algorithm.

25. The method according to claim 24, wherein the information that is distinct from the media content includes watermark data.

26. The method according to claim 23, wherein at least one symbol in at least one vector quantization code-book represents content that is distinct from the media content that is compressed by the private data-based compression algorithm.

27. The method according to claim 26, wherein the content that is distinct from the media content includes watermark data.

28. The method according to claim 2, wherein the media content includes audio content.

29. The method according to claim 28, wherein the audio content includes music.

30. The method according to claim 28, wherein the audio content includes speech.

31. The method according to claim 2, wherein the media content includes images.

32. The method according to claim 2, wherein the media content includes video comment.

33. The method according to claim 2, wherein the media content includes graphics.

34. The method according to claim 2, wherein the media content includes textual content.

36. The method according to claim 14, wherein at least one of the first, second and third data-based compression algorithms is a private data-based compression algorithm.

37. The method according to claim 15, further comprising the steps of:

receiving the data frame;

decompressing the first predetermined portion of the data frame using the first data-based compression algorithm;

decompressing the second predetermined portion of the data frame using the second data-based compression algorithm; and

decompressing the third predetermined portion of the data frame using the third data-based compression algorithm.

35. A method of compressing media content, the method comprising the steps of:

compressing a first predetermined portion of a media content using a first data-based compression algorithm;

compressing a second predetermined portion of the media content using a second data-based compression algorithm, the second predetermined portion of the media content being different from the first predetermined portion of the media content, and the second data-based compression algorithm being different from the first data-based compression algorithm;

compressing a third predetermined portion of the media content using a third data-based compression algorithm, the third predetermined portion of the media content being different from the first and the second predetermined portions of the media content, and the third data-based compression algorithm being different from the first and second data-based compression algorithms;

grouping the compressed first predetermined portion of the media content into a first portion of a data frame;

grouping the compressed second predetermined portion of the media content into a second portion of a data frame; and

grouping the compressed third predetermined portion of the media content into a third portion of a data frame.

38. A method of receiving data, the method comprising the steps of:

receiving a publicly available data frame;

decompressing a first predetermined portion of the data frame using a first data-based compression algorithm, the first predetermined portion of the data frame representing a first predetermined portion of a media content; and

decompressing a second predetermined portion of the data frame using a second data-based compression algorithm, the second predetermined portion of the data frame being different from the first predetermined portion of the data frame, the second predetermined portion of the data frame representing a second predetermined portion of the media content, and the second data-based compression algorithm being different from the first data-based compression algorithm.

39. The method according to claim 38, wherein at least one of the first and second data-based compression algorithms is a private data-based compression algorithm.

40. The method according to claim 39, wherein one of the first and second data-based compression algorithms is a public data-based compression algorithm.

41. The method according to claim 40, wherein the predetermined portion of the media content compressed by public data-based compression algorithm is a null portion of the media content.

42. The method according to claim 39, wherein the first and second portions of the data frame are separated by a predetermined header code.

43. The method according to claim 39, wherein the first and second portions of the data frame are separated by relative positions of the first and second predetermined portions of compressed media content within the data frame.

44. The method according to claim 39, wherein the data frame is received from a computer network.

45. The method according to claim 39, wherein the step of receiving the data frame includes the step of receiving the data frame by a memory device.

46. The method according to claim 45, wherein the memory device is a CD ROM.

47. The method according to claim 39, wherein the steps of the method are performed for a plurality of data frames.

50. The method according to claim 39, wherein each private data-based compression algorithm includes encrypted initial data that is associated with the private data-based compression algorithm,

the method further comprising the step of:

decrypting each encrypted associated initial data of at least one private data-based compression algorithm.

51. The method according to claim 50, wherein the encrypted initial data is contained in the data frame.

52. The method according to claim 51, wherein each encrypted associated initial data is grouped into a data envelope within the data frame.

53. The method according to claim 50, wherein the initial data associated with at least one private data-based compression algorithm includes at least one Huffman code-book.

54. The method according to claim 53, wherein at least one Huffman code-book represents information that is distinct from the media content compressed by the private data-based compression algorithm.

55. The method according to claim 54, wherein the information that is distinct from the media content includes watermark data.

56. The method according to claim 53, wherein at least one symbol in at least one Huffman code-book represents content that is distinct from the media content compressed by the private data-based compression algorithm.

57. The method according to claim 56, wherein the content that is distinct from the media content includes watermark data.

58. The method according to claim 50, wherein the initial data associated with at least one private data-based compression algorithm includes at least one vector quantization code-book.

59. The method according to claim 58, wherein at least one vector quantization code-book represents information that is distinct from the media content compressed by the private data-based compression algorithm.

60. The method according to claim 59, wherein the information that is distinct from the media content includes watermark data.

61. The method according to claim 58, wherein at least one symbol in at least one vector quantization code-book represents content that is distinct from the media content compressed by the private data-based compression algorithm.

62. The method according to claim 61, wherein the content that is distinct from the media content includes watermark data.

63. The method according to claim 39, wherein the media content includes audio content.

64. The method according to claim 63, wherein the audio content includes music.

65. The method according to claim 63, wherein the audio content includes speech.

66. The method according to claim 39, wherein the media content includes images.

67. The method according to claim 39, wherein the media content includes video content.

68. The method according to claim 39, wherein the media content includes graphics.

69. The method according to claim 39, wherein the media content includes textual content.

48. A method of receiving data, the method comprising the steps of:

receiving a data frame;

decompressing a first predetermined portion of the data frame using a first data-based compression algorithm, the first predetermined portion of the data frame representing a first predetermined portion of a media content;

decompressing a second predetermined portion of the data frame using a second data-based compression algorithm, the second predetermined portion of the data frame being different from the first predetermined portion of the data frame, the second predetermined portion of the data frame representing a second predetermined portion of the media content, and the second data-based compression algorithm being different from the first data-based compression algorithm;

wherein the data frame includes a third predetermined portion, the third predetermined portion of the data frame being different from the first and second predetermined portions of the data frame, and the third predetermined portion of the data frame representing a third predetermined portion of the media content,

the method further comprising the step of decompressing a third predetermined portion of the data frame using a third data-based compression algorithm, and the third data-based compression algorithm being different from the first and the second data-based compression algorithms.

49. The method according to claim 48, wherein at least one of the first, second and third data-based compression algorithms is a private data-based compression algorithm.

70. A method of compressing media content, the method comprising the steps of:

converting time-domain samples of a media content to frequency-domain samples;

compressing a first predetermined portion of the frequency-domain samples using a first character-coding compression algorithm; and

compressing a second predetermined portion of the frequency-domain samples using a second character-coding compression algorithm;

said second predetermined portion of the frequency-domain samples being different from said first predetermined portion of the frequency-domain samples and said second character-coding compression algorithm being different from said first character-coding compression algorithm.

71. A method of receiving compressed media content, the method comprising the steps of:

receiving a data frame including a first and second predetermined portions;

decompressing said first predetermined portion of the data frame using a first character-coding decompression algorithm to obtain first frequency-domain samples of media content; and

decompressing said second predetermined portion of the data frame using a second character-coding decompression algorithm to obtain second frequency-domain samples of said media content;

said second frequency-domain samples being different from said first frequency-domain samples and said second character-coding decompression algorithm being different from said first character-coding decompression algorithm; and

converting said first and second frequency-domain samples to time-domain samples of said media content.