MXPA98005339A - Compression of coding by personalized character to codify and mark with filigrana the content of med - Google Patents

Abstract

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

Description

COMPRESSION OF CUSTOMIZED CARD ENCODING TO CODIFY AND MARK WITH FILIGRANA THE MEDIA CONTENT DESCRIPTION OF THE INVENTION 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 the content of encoded media, for distribution in a network. 2. Description of Related Art Recent technological advances, involving the compression of digital data, the improvement of network bandwidth and mass storage, have made network distribution of media content more feasible.

That is, media content, such as digitized music, can conveniently be distributed through the Internet. To protect the intellectual property rights associated with a particular piece of media content, it is desirable to disguise or conceal the content of the media to prevent content piracy. REF. 27444 Accordingly, what is needed is a way to compress the content of media for distribution in a network conveniently, and at the same time also ensure the content of the media compressed against its unauthorized use. BRIEF DESCRIPTION OF THE INVENTION The present invention provides a method for compressing the content of media for convenient public distribution, such as over a computer network, while also ensuring the content of media to control the distribution of media content and for prevent unauthorized use of media content. The advantages of the present invention are provided by a method for compressing media content, in which a first predetermined portion of the content of the media is compressed using a first data compression algorithm, and inserted into a first portion. of a data block. A second predetermined portion of the content of the media is compressed using a second database compression algorithm, and inserted into a second portion of the data block. The second predetermined portion of the content of the media is different from the first predetermined portion of the content of the media, and the second database compression algorithm is different from the first database compression algorithm.

Preferably, at least one of the first and second database compression algorithms is a private database based compression algorithm. The first and second portions of the data block are separated by a predetermined header code, or they can be separated by relative positions in the first and second predetermined portions of the compressed media content within the data block. The present invention also provides a method for inserting a data stream not associated with the content of the media into a bitstream of the content of the compressed media. The inserted data stream is transported by at least one symbol in at least one initial data set, associated with the DBCA. A preferred implementation uses symbols designated in one or more Huffman encryption and decryption codes to set a watermark mark on the compressed bit stream. The value of the watermarked bits recovered from the bitstream depends on either the values associated with the symbols or, alternatively, the position of the symbol in the compressed bit stream. In accordance with the invention, a plurality of data blocks are generated, and made available for distribution, for example, by transmission over a network of computers, such as the Internet. Alternatively, the data blocks may be made publicly available to be stored in a memory device, such as a CD ROM (Compact Disc Read Only Memory). A plurality of predetermined portions of media content can be compressed using database-based compression algorithms, and grouped into a different portion, respectively, of a data block. Each respective predetermined portion of the content of the media is different from the first and second predetermined portions of the content of the media. Similarly, the database-based compression algorithm used to compress a respective portion of the content of the media is different from the first and second database-based compression algorithms. Preferably, at least one of the data compression algorithms is a private data compression algorithm. The initial data associated with each database compression algorithm is encoded and made available to the public when data blocks become available. The initial encoded data is grouped in a data packet, within a data block, which is preferably available no later than a first data block containing the content of the compressed media, using the algorithm of Private database compression, with which the initial encoded data are associated, but may become available during a subsequent data block. Examples of the initial data associated with at least one private database compression algorithm include a Huffman encryption and decryption code and / or a vector quantization encryption and decryption code. According to the invention, the content of the media may include audio content, such as music and / or voice, images, video content, graphics and / or textual content. BRIEF DESCRIPTION OF THE DRAWINGS The present invention is illustrated by way of example and not limitation, in the accompanying figures, in which like reference numerals indicate similar elements, and in which: Figure 1 shows a flow diagram of a method of compressing the content of media, according to the present invention; Figure 2 shows an array of data in a data block according to the present invention; and Figure 3 shows a flow chart for inserting a data stream not associated with the content of the media into a bitstream of the content of compressed media, according to the present invention.

DETAILED DESCRIPTION The present invention provides a method for compressing the content of media for convenient distribution, such as through a network of computers, and at the same time also ensures the content of the media to control the distribution of media content and for Avoid piracy of media content. Compression algorithm, as used herein, is an algorithm that accepts an input data stream and produces a corresponding output data stream, which has substantially fewer bits. A database-based compression algorithm (DBCA) is an algorithm that is a subset of compression algorithms in general. The action of the DBCA, together with the associated data, depends on a number of initial data values, which have been determined before the compression operation begins (ie, without any knowledge of the particular input data sequence, a be compressed). The values of the initial data may represent parametric values, or they may be used as search tables (i.e., as encryption and decryption codes), by the algorithm. Typical DBCAs are non-noisy compression algorithms (for example, from Huffman) and vector quantization algorithms (VQ). The values of the initial data can be static, that is to say, that the values of the initial data do not change, or dynamic, that is, the values of the initial data adapt to the flow of input data during the course of the compression . Two DBCAs are different if the values of the initial data are different, if the algorithms are different. Figure 1 shows a flow chart of the compression-decompression process 10 of a media content, according to the present invention. In step 11, a content of the media, such as audio signals, is sampled using well-known analog-to-digital techniques, or the input can be a digital representation of an analogous signal. In step 12, the time domain samples obtained in step 11, are converted to frequency domain samples, using well-known Fourier transformation techniques. In step 13, a selected portion of the frequency domain samples of the media content are compressed in a well known manner, using a publicly available DBCA, such as a DBCA having a Huffman encryption and decryption code. , public, as initial data. Each binary character code or symbol of the public DBCA represents at least one different quantized representation of the frequency domain samples. When the content of the media is music, the selected portion of the frequency domain samples that are compressed using the public DBCA correspond to a frequency band selected from the frequency spectrum of the audio content, for example 300 Hz to 3 kHz In video transformation coding, the CD coefficients would be encoded with a standard table, while the AC coefficients would be encoded with the custom (private) table. The selected portion of the content of the means, according to the invention, may be null. In step 14, the remaining frequency domain samples, which correspond to the rest of the frequency spectrum of the audio content, are compressed in a similar manner, in a well-known manner, using a private DBCA, that is, a DBCA in the which initial data are not available to the public. Examples of initial data for a private DBCA include Huffman encryption and decryption codes, private and private VQ encryption and decryption codes. Alternatively, the compression performed in steps 13 and 14 can be done by any algorithm of the well-known ambitious type, which converts the data into symbols or character codes, such as a VQ algorithm, provided that at least one of the the two stages of compression are carried out by an algorithm of the private ambitious type. Of course, the present invention provides the compression of the data of each step 13 and 14 that can be performed by a private DBCA. In step 15, the symbols for the frequency domain samples that were compressed using the public DBCA are inserted into a first predetermined portion 31 of a data block 30, shown in Figure 2. A block of data, as used herein, is the encapsulation of related data, e.g., data associated with a given period of time, frequency bandwidth, spatial domain or cepstral domain. A data packet, as used herein, is the encapsulation of a subset of data within a given data block. For example, a block of data in a perceptual audio encoder may contain a compressed representation of 1024 consecutive samples of audio data. A data packet within that particular data block may contain a representation of the frequency range CD at 300 Hz. The encapsulation, as used herein, may be explicit or implicit. An example of an explicit encapsulation is the use of a character code or a default header. An implicit encapsulation, that is, an encapsulation without a header, can be defined by the relative positions of the data encapsulated within the data block.

In step 16, the symbols for the frequency domain samples that were compressed using the private DBCA are inserted into a second portion 32 of the data block 30. According to the invention, the second portion 32 can be explicitly encapsulated or implicitly, within the data block 30. When the second portion 32 explicitly encapsulates within the data block, a header 33, consisting of a predetermined character code or a code sequence of predetermined character, containing information regarding the private DBCA , such as escape characters and / or the number of characters contained in the second portion 32. In step 17, the data blocks are made available to the public, such as available for distribution by transmission in a well-known manner through of a computer network, such as the Internet, or for storage on a storage device owned by the user, such as a CD-ROM, in a point-of-sale device. In one embodiment of the present invention, the information associated with each private DBCA that is used is encoded in a well-known way, using a secure coding algorithm, and is encapsulated in the data blocks, preferably not later that the first block of data containing the content of compressed media, using the private DBCA with which the initial coded data is associated, but may be encapsulated during a subsequent data block. In another modality, the initial data for the public DBCA is made available with two coded initial data from the private DBCA. In yet another alternative mode, both of the initial data for the public and private DBCAs are available in the receiver of the blocks of data available to the public 30, and are not distributed when the data blocks are distributed. Of course, for this mode the initial coded data of the private DBCA are insured and are not accessible to unauthorized individuals. In step 18, the data blocks and any initial data are received by the intended receiver. In stage 19, the symbols corresponding to the Public DBCA in the first portion 31 of each data block are decompressed using the public DBCA. In step 20, the character codes corresponding to the private DBCA in the second portion 32 of each data block are decompressed using the private DBCA. When the first portion 31 of each data block has been compressed by the private DBCA, the portion 31 of each data block decompresses accordingly. When the initial encoded information is encapsulated in the data blocks, the initial information is decoded before decompression, using the private DBCA. In step 21, the frequency domain samples resulting from the decompression steps 19 and 20 are reassembled to form frequency domain samples of the frequency spectrum of the media signal represented by each data block. In step 22, the samples of the frequency domain are transformed to time domain samples, using well known techniques of inverse Fourier transformation. In step 23, the time domain samples are converted to the content of the media using well-known digital-to-analog techniques. When the initial data for the private DBCA is not known in step 20, steps 21-32 operate on only the portion of media content that was contained in the first portion 31 of the data blocks. In this way, a limited version of the media content is generated, which can attract the recipient to purchase the complete media content, because the fidelity of the media content is not satisfactory. Figure 3 shows a functional block diagram 40, of a system for inserting a data stream not associated with the media content in a bit stream of the compressed media content. In block 41, the media content, analog, is quantified using well-known digital-to-analog quantization techniques, for the digitized content of the media. Alternatively, the input can be either a digital representation of an analog signal. In block 42, the digitized content of the media is transformed from time domain samples to frequency domain samples using well known Fourier transformation and windowing techniques. In block 43, the floating-point frequency domain samples are converted to integer values in a well-known manner. The quantizer output is applied to a private or customized DBCA, in block 44. A plurality of symbols are sent to a device for formatting the bitstream in block 45, which produces a bitstream of the contents of the blocks. compressed media. Functional blocks 41-45 correspond to steps 11-16 of method 10 shown in Figure 1. Block 47 contains a data sequence as an ordered sequence of bits, which preferably represent watermarked data, but may represent Any information that is not associated with media content. The block 48 contains a control logic for selecting the site of the watermarked data, and for sequencing the data bits marked with watermark in the customized DBCA 44, which emits symbols to the device that formats the bitstream 45 .

According to the invention, the private DBCA 44 may contain either a single data set (for example, a unique Huffman or VQ encryption and decryption code) or a plurality of data sets (e.g., encryption codes). and decrypted Huffman or multiple VQs). The control and coordination 48 can be implemented in many ways. For example, if the bit rate exiting the device to format the bitstream is N bits / s, and M bits marked with watermark per second are to be inserted, and 1 bit per site is inserted with a watermark (without loss of generality), then the control and coordination 48 must insert a bit marked with watermark on average every N / M bits that leave the device to format the bitstream. (Therefore, the path connects the output of the device to format the bitstream with control and coordination 48). In this case, the control and coordination 48 can be implemented as a rechargeable counter, which indicates an insertion when the counter is recharged. In a safer implementation, randomness can be incorporated into the control and coordination 48, using a generator of a pseudorandom number, which causes an average insertion per N / M bits. More generally, DBCA 44 may have a plurality of different Huffman codes, dedicated to watermark marking, for example, k equals 2 characters. Then, even K bits marked with a watermark can be inserted by a special Huffman symbol. For security purposes, more than one Huffman symbol dedicated to the same sequence of bits can be chosen. In the case of K bits marked with filigree by insertion, the control and coordination 48 causes an insertion on average every (N / M) * K bits. Alternatively, the custom DBCA 44 may use one or more indexes of encryption and decryption codes otherwise unused for the insertion of the watermark mark. For example, when control and coordination 48 indicates an insertion, the device for formatting the bitstream may set a watermark mark index and a predetermined number of bits in the bitstream. In this case, the index of the filigree mark appears to indicate an unused encryption and decryption code. Similarly, the position of the watermark mark index can be used to indicate the value of the watermarked data, for example, if the index occurs in an odd numbered section in the bit stream, a bit " 1"would be indicated, any occurrence of the index in a section numbered evenly, indicates a" 0"bit. Although the present invention has been described in connection with media having an audio content, such as music and / or voice, it will be appreciated and understood that the present invention is applicable to media having an audio and / or image content and / or video and / or graphics and / or textual, and that modifications can be made without departing from the true spirit and scope of the invention. It is noted that in relation to this date, the best method known to the applicant to carry out the aforementioned invention, is that which is clear from the present description of the invention. Having described the invention as above, property is claimed as contained in the following:

Claims (38)

1. A method for compressing media content, the method comprises the steps of: compressing a first predetermined portion of a media content using a first database compression algorithm; and compressing a second predetermined portion of the content of the media using a second database compression algorithm, the second predetermined portion of media content is different from the first predetermined portion of media content, and the second compression algorithm The database is different from the first database compression algorithm.

2. The method according to claim 1, characterized in that at least one of the first and second data compression algorithms is a private data base compression algorithm.

3. The method according to claim 2, characterized in that one of the first and second compression algorithms based on data, is a compression algorithm based on public data.

4. The method according to claim 3, characterized in that the predetermined portion of the media content compressed by the public data base compression algorithm is a null portion of the media content.

5. The method according to claim 2, characterized in that it further comprises the steps of: grouping the first compressed predetermined portion of the media content into a first portion of a data block; and grouping the second compressed predetermined portion of the media content in a second portion of the data block.

6. The method according to claim 5, characterized in that the first and second portions of the data block are sated by a predetermined header code.

7. The method according to claim 5, characterized in that the first and second portions of the data block are sated by relative positions of the first and second predetermined portions of the content of the compressed media within the data block.

8. The method according to claim 5, characterized in that it also comprises the step of making the data block available to the public.

9. The method according to claim 2, characterized in that the content of the media includes audio content.

10. The method according to claim 9, characterized in that the audio content includes music.

11. The method according to claim 9, characterized in that the audio content includes speech.

12. The method according to claim 2, characterized in that the content of the means includes images.

The method according to claim 2, characterized in that the content of the media includes video content.

14. The method according to claim 2, characterized in that the content of the media includes graphics.

15. The method according to claim 2, characterized in that the content of the media includes textual content.

16. A method for receiving data, the method is characterized in that it comprises the steps of: receiving a publicly available data block; decompressing a first predetermined portion of a data block using a first database compression algorithm, the first predetermined portion of the data block represents a first predetermined portion of a content of the media; and decompressing a second predetermined portion of the data block, using a second database compression algorithm, the second predetermined portion of the data block is different from the first predetermined portion of the data block, the second predetermined portion of the data block , represents a second predetermined portion of the media content, and the second database compression algorithm is different from the first database compression algorithm.

17. The method according to claim 16, characterized in that at least one of the first and second database compression algorithms is a private data base compression algorithm.

18. The method according to claim 17, characterized in that one of the first and second compression algorithms based on data, is a compression algorithm based on public data.

19. The method according to claim 18, characterized in that the predetermined portion of the contents of the media compressed by the public data base compression algorithm is a null portion of the content of the media.

20. The method according to claim 17, characterized in that the first and second portions of the data block are separated by a predetermined header code.

21. The method according to claim 17, characterized in that the first and second portions of the data block are separated by relative positions of the first and second predetermined portions of the content of compressed media within the data block.

22. The method according to claim 17, characterized in that the data block is received from a computer network.

23. The method according to claim 17, characterized in that the step of receiving the data block includes the step of receiving the data block by a memory device.

24. The method according to claim 23, characterized in that the memory device is a CD ROM.

25. The method according to claim 17, characterized in that the steps of the method are performed by a plurality of data blocks.

26. The method according to claim 17, characterized in that the data block includes a third predetermined portion, the third predetermined portion of the data block is different from the first and second predetermined portions of the data block, and the third predetermined portion of the block data, represents a third predetermined portion of media content, the method further comprises the step of decompressing a third predetermined portion of the data block, using a third data compression algorithm, and the third compression algorithm based on The data is different from the first and second compression algorithms based on data.

27. The method according to claim 26, characterized in that at least one of the first, second and third database compression algorithms is a private data base compression algorithm.

28. The method according to claim 17, characterized in that each private data base compression algorithm includes coded initial data, which is associated with the private data compression algorithm, the method further comprising the steps of: decoding each one of the coded, associated initial data of at least one private database-based compression algorithm.

29. The method according to claim 28, characterized in that the coded initial data is contained in the data block.

30. The method according to claim 28, characterized in that the initial data associated with at least one private database compression algorithm, includes at least one Huffman encryption and decryption code.

31. The method according to claim 28, characterized in that the initial data associated with at least one private database compression algorithm, includes at least one vector quantization encryption and decryption code.

32. The method according to claim 17, characterized in that the media content includes audio content.

33. The method according to claim 32, characterized in that the audio content includes music.

34. The method according to claim 32, characterized in that the audio content includes speech.

35. The method according to claim 17, characterized in that the content of the means includes images.

36. The method according to claim 17, characterized in that the content of the media includes video content.

37. The method according to claim 17, characterized in that the content of the media includes graphics.

38. The method according to claim 17, characterized in that the media content includes textual content.