Cryptography – Communication system using cryptography – Having compression
Reexamination Certificate
1997-07-03
2001-07-24
Swann, Tod R. (Department: 2767)
Cryptography
Communication system using cryptography
Having compression
C380S028000, C380S217000, C341S050000, C341S065000, C382S246000, C708S203000
Reexamination Certificate
active
06266419
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates to the field of computing. More particularly, the present invention relates to a method for protecting encoded media content for network distribution.
2. Description of the Related Art
Recent technological advances involving digital data compression, network bandwidth improvement and mass storage have made networked distribution of media content more feasible. That is, media content, such as digitized music, can be conveniently distributed over the Internet. To protect the intellectual property rights associated with a particular piece of media content, it is desirable to obscure the media content to prevent pirating of the content.
Consequently, what is needed is a way for compressing media content for convenient network distribution, while also securing the compressed media content against unauthorized use.
SUMMARY OF THE INVENTION
The present invention provides a method for compressing media content for convenient public distribution, such as over a computer network, while also securing the media content for controlling distribution of the media content and for preventing unauthorized use of the media content. The advantages of the present invention are provided by 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. Preferably, at least one of the first and second data-based compression algorithms is a private data-based compression algorithm. The first and second portions of the data frame are separated by a predetermined header code, or can be separated by relative positions of the first and second predetermined portions of compressed media content within the data frame.
The present invention also provides a method for inserting a data stream not associated with the media content into a compressed media content bit stream. The inserted data stream is carried by at least one symbol in at least one initial data set associated with the DBCA. A preferential implementation uses designated symbols in one or more Huffman codebooks for embedding a watermark in the compressed bit stream. The value of the watermark bits recovered from the bit stream depend upon either the values associated with the symbols or alternatively the position of the symbol in the compressed bit stream.
According to the invention, 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. Alternatively, the data frames can be made publicly available for storage in a memory device, such as a CD ROM.
A plurality of predetermined portions of the media content can be compressed using data-based compression algorithms and grouped into a respectively different portion of the data frame. Each respective predetermined portion of the media content is different from the first and the second predetermined portions of the media content. Similarly, the data-based compression algorithm used to compress a respective portion of the media content is different from the first and the second data-based compression algorithms. Preferably, at least one of the data-based compression algorithms is a private data-based compression algorithm.
Initial data associated with each private data-based compression algorithm is encrypted and made publicly available when the data frames are made available. The encrypted initial data is grouped into a data envelope within a data frame that is preferably 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, but can be made available during a later data frame. Examples of initial data associated with at least one private data-based compression algorithm include a Huffman code-book and/or a vector quantization code-book.
According to the invention, the media content can include audio content, such as music and/or speech, images, video content, graphics and/or textual content.
REFERENCES:
patent: 4908861 (1990-03-01), Brachtl et al.
patent: 5243341 (1993-09-01), Seroussi et al.
patent: 5369773 (1994-11-01), Hammerstrom
patent: 5521940 (1996-05-01), Lane et al.
patent: 5636276 (1997-06-01), Brugger
patent: 5794229 (1998-08-01), French et al.
patent: 5805827 (1998-09-01), Chau et al.
patent: 5809139 (1998-09-01), Girod et al.
patent: 5812663 (1998-09-01), Akiyama et al.
patent: 5845150 (1998-12-01), Henion
patent: 5861824 (1999-01-01), Ryu et al.
patent: 5864682 (1999-01-01), Porter et al.
patent: 5883978 (1999-03-01), Ono
patent: 5893102 (1999-04-01), Maimone et al.
patent: 0 451 545 (1991-10-01), None
patent: 0 597 571 (1994-01-01), None
patent: WO 97 10659 (1997-03-01), None
Translation into the English language of Yoshiura et al., WIPO International Publication No. WO 97/10659, Mar. 20, 1997, pp. 1-65.*
Patent Abstracts of Japan, vol. 014, No. 500 (P-1125), Oct. 31, 1990 & JP 02 205982 A; Aug. 15, 1990.
Patent Abstracts of Japan, vol. 098, No. 001, Jan. 30, 1998 & JP 09 247418, Sep. 19, 1997.
Lacy John Blakeway
Quackenbush Schuyler Reynier
Snyder James H.
AT&T Corp.
Darrow Justin T.
Swann Tod R.
LandOfFree
Custom character-coding compression for encoding and... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Custom character-coding compression for encoding and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Custom character-coding compression for encoding and... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2539769