CA2236227C - Custom character-coding compression for encoding and watermarking media content - Google Patents
Custom character-coding compression for encoding and watermarking media content Download PDFInfo
- Publication number
- CA2236227C CA2236227C CA002236227A CA2236227A CA2236227C CA 2236227 C CA2236227 C CA 2236227C CA 002236227 A CA002236227 A CA 002236227A CA 2236227 A CA2236227 A CA 2236227A CA 2236227 C CA2236227 C CA 2236227C
- Authority
- CA
- Canada
- Prior art keywords
- data
- media content
- based compression
- data frame
- compression algorithm
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Lifetime
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/80—Generation or processing of content or additional data by content creator independently of the distribution process; Content per se
- H04N21/83—Generation or processing of protective or descriptive data associated with content; Content structuring
- H04N21/835—Generation of protective data, e.g. certificates
- H04N21/8358—Generation of protective data, e.g. certificates involving watermark
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T1/00—General purpose image data processing
- G06T1/0021—Image watermarking
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/00007—Time or data compression or expansion
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/00086—Circuits for prevention of unauthorised reproduction or copying, e.g. piracy
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/00086—Circuits for prevention of unauthorised reproduction or copying, e.g. piracy
- G11B20/0021—Circuits for prevention of unauthorised reproduction or copying, e.g. piracy involving encryption or decryption of contents recorded on or reproduced from a record carrier
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/00086—Circuits for prevention of unauthorised reproduction or copying, e.g. piracy
- G11B20/00884—Circuits for prevention of unauthorised reproduction or copying, e.g. piracy involving a watermark, i.e. a barely perceptible transformation of the original data which can nevertheless be recognised by an algorithm
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
- H04N21/238—Interfacing the downstream path of the transmission network, e.g. adapting the transmission rate of a video stream to network bandwidth; Processing of multiplex streams
- H04N21/2389—Multiplex stream processing, e.g. multiplex stream encrypting
- H04N21/23892—Multiplex stream processing, e.g. multiplex stream encrypting involving embedding information at multiplex stream level, e.g. embedding a watermark at packet level
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2201/00—General purpose image data processing
- G06T2201/005—Image watermarking
- G06T2201/0053—Embedding of the watermark in the coding stream, possibly without decoding; Embedding of the watermark in the compressed domain
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.
Description
CUSTOM CHARACl'ER-CODING COMPRESSION FOR
ENCODING AND WATERMARKING MEDIA CONTENT
BACKGROUND OF THE INVENTION
1. Field of the Invention The present invention relates to the field of co~ u~ g. More particularly, the present invention relates to a method for protecting encoded media content for network distribution.
ENCODING AND WATERMARKING MEDIA CONTENT
BACKGROUND OF THE INVENTION
1. Field of the Invention The present invention relates to the field of co~ u~ g. More particularly, the present invention relates to a method for protecting encoded media content for network distribution.
2. Description ofthe ~ .ted Art Recent technological advances involving digital data co",~ression, network bandwidth improvement and mass storage have made networked distribution of media content more feasible. That is, media content, such as ~ligiti~ed music, can be conveniently distributed over the Internet. To protect the intellectua] property rights associated with a particular piece of media content, it is desirable to obscure the media content to prevent pil~l,ng of the content.
Consequently, what is needed is a way for coln~?lessing media content for convenient network dislribution, while also securing the cou,p,essedmedia conltent against lln~llthorized use.
SUMMAI~Y OF THE INVENTION
2 o The present invention provides a method for compressing media content for convenient public distribution, such as over a co~ ul~,r network, while also securing the media content for controlling distribution of the.media content and for preventing lln~llthorized use of the media content. The advantages of the present invention are provided by a method of colllpressillg media content in which a first pred~le~lnilled portion of a media content is colllplessed using a first data-based compression algorithm and inserted into a first portion of a data frame.
5 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 predete~ ed portion of the media content is different from the first predete ~ cl portion of the media content, and the second data-based col~ ession algolilhlll is dirrele.ll from the first data-based 10 compression algoli~l.ll. Preferably, at least one of the first and second data-based cc,lll~"ession algoli~ ,ls is a private data-based col~l~,ssion algo,illl-ll. The first and secondi portions of the data frame are separated by a pred~ cl header code, or can be sepal~ted by relative positions of the first and second predelelll~lled portions of compresxed 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. T:he inserted data stream is carried by at least one symbol in at least one initial data set associated with the OBCA. A preferential implen~llldlion uses designated symbols in one or more T~ n codebooks for embedding a 2 o ~dte.lllark in the colll~,~,ssed bit stream. The value of the wdte.ll~k bits recovered from the bit stream depend upon either the values associated with the symbols or alt~.l~Liv~ly the position of the symbol in the compressed bit stream.
According to the invention, a plurality of data frames are gell~rdted and are made available for distribution, for example, by trancmi~sion over a computer network, such as the Inte:rnet. Alternatively, the data frames can be made publiicly available for storage in a memory device, such as a CD ROM.
A plurality of predetelmilled portions of the media content can be 5 compressed using data-based colllpression algolil~ s and grouped into a respectively dirr.,.e.lt portion of the data frame. Each respective predetermined portion of the media content is dirr~ l~,nt from the first and the second predetermined portions of the media content. Similarly, the data-based compression algorithm used to co~ ress a l~esL~Ii~e portion of the media content 0 is dirr~ from the first and the second data-based col~-ession algo~ s.
Preferably, at least one of the data-based col~lession algo~ llls is a private data-based compression algoli 11ll,.
Initial data associated with each private data-based compression algolillllll is ellc"~pled and made publicly available when the data frames are made 15 available. The el~lylJted initial data is grouped into a data envelope within a data frame that is preferably available no later than a first data frame cont~ining media content compressed using the private data-based comp~ssion algo~ lll with which the encrypted initial data is associated, but can be made available during a later data frame. Examples of init~al data associated with at least one private data-20 based collll~ression algolitll.ll include a H-lrflll~ code-book and/or a vector qll~nti~tion code-book.
According to the invention, the media content can include audio content, such as music and/or spee;ch, images, video content, graphics and/or textual content.
BRIEF DE~'SCRIPTION OF THE DRAWING
The present inventiom is illustrated by way of example and not 5 limitation in the accolllp~lyillg figures in which like reference numerals intlicate similar ele]~ents and in which:
Figure 1 shows a flow diagram for a media content compression process according to the present invention;
Figure 2 shows an a~ g.~ nt of data in a data frame accoldh~g to 10 the presenl invention; and Figure 3 shows a flow diagram for illsc.l~ng a data stream not associated with the media content into a co l.pressed media content bit stream according to the present invention.
The present invention provides a method for co..l~fessing media content for convenient distribution, such as over a col.l~uter network, while also securing tlle media content for controlling distribution of the media content and for preventing pirating of the media content. Compression algoli~ l, as used herein, 2 o is an algo~ill-lll that accepts an input data stream and produces a coll~i.ponding output data stream having substantially fewer bits. A data-based colllplession algolillu.. (DBCA) is an algolill--ll that is a subset of compression algoli~ -s in general. The action of a DBCA, together with associated data, depends on a number of initial data values that have been determined before the colll~ression operation begins (that is, without any knowledge of the particular input data sequence to be compressed). The initial data values may represent parametric values or rnay be used as lookup tables (i.e., as code-books) by the algorithm.
5 Typical D]3CAs are noiseless comp~ression (e.g., Huffman) algo.i~ ls and vector q~-~nti7~tion (VQ) algorithms. The initial data values may be static, i.e., the initial data values do not change, or dynamic, i.e., the initial data values adapt to the input data stream during the course of col..l)lession. Two DBCAs are dirrcl., if the initial data values are dirr~.ll, ~llclller the algolill~ s are dirr.,;e~.
0 Figure 1 shows a flow diagram of a media content cc~ ,ssion-decompression process 10 according to the present invention. At step 11, a media content, such as audio signals, are sampled using well-known analog-to-digital techni~ es, or the input may be a digital r~rese ~ l ion of an analog signal. At step 12, tbe time-domain s~les obtained in step 11 are co~ d to frequency-15 domain salmples using well-known Fourier l.a.~rulltechniques.
At step 13, a selected portion of the frequency-domain samples of the media content are collll)lessed in a well-known manner using a publicly available l)BCA, such as a DBCA having a public ~,,rr...,,. code-book as initial data. Each binary character code or token of the public DBCA lep~esents at least 2 o one dirre~ q~nti7~d re~lcsellla~ion of the frequency-domain samples. When the media content is music, the selectecl portion of the frequency-domain samples that are co,.ll~essed using the public DBCA co.l.,;,pollds to a sele~ted frequency band of the audio content frequency Spe~ lnl, for example, 300 Hz to 3 kHz. In video transform coding, DC coefficients would be encoded with the standard table, whille the AC coefficients would be encoded with the custom (private) table.
The selected portion of the media content, according to the invention, may be null.
At step 14, the rem~inin~ frequency-domain samples corresponding to the remainder of the audio content frequency spectrum are similarly compressed in a well-known ..~ er using a private DBCA, that is, a DBCA in which the initial data is not publicly available. Examples of initial data for private DBCA
include private ~llffm~n code-books and private VQ code-books. Alternatively, 10 the compression pe-ru.l...ed in steps 13 and 14 can be done by any well-known greedy-type algo-ill~ that converts data into tokens or character codes, such as a VQ algo-ilh~, as long as at least one of the two comp~ssion steps is pe.ro....ed by a priva~:e greedy-type algo.;lll.... Of course, the present invention provides that the data cc,~ .ession of each step 13 and 14 can be ~.ro....ed by a private 1 5 DBCA.
At step lS, the tokens for the frequency-domain samples that were co~ ressed using the public DBCA are inserted into a first pre~lete ~l~inP~ portion 31 of a dala frame 30, shown in Figure 2. A data frame, as used herein, is an enrars~ tion of related data, for e.cample, data associated with a given time 2 o period, frequency bandwidth, spatial domain or cepstral domain. A data envelope, as used herein, is an encaps~llation of a subset of the data within a given data frame. For example, a data frame in a perceplual audio coder might contain a co.~ressed rep~s~ nn of 1024 conse~ live samples of audio data. A data envelope ~within that particular data. frame might contain a representation of the frequency interval DC to 300 Hz. Encapsulation, as used here, may be explicit or implicit. An example of an explicit ellcapsulation is use of a predetermined character code or a header. An implicit encapsulation, that is, an encapsulation 5 without a header, can be defined by relative positions of the encap~ulated data within the data frame.
At step 16, the tokelLs for the frequency-domain samples that were compressed using the private DBCA are inserted into a second portion 32 of data frame 30. According to the invention, second portion 32 can be explicitly or 10 implicitly e.~ tPcl within data frame 30. When second portion 32 is explicitly e ncapsulated within data frame, a header 33 formed by a predet~llnilled character code or predete, ..-in~d sequence of character codes Cont~ining infollllation relating to the private DBCA, such as escape characters and/or the number of characters co~ illed in second portion 32.
At step 17, the data frames are made publicly available, such as available for distribution by tran~mi~sion in a well-known manner over a colll~ .,r network, such as the Illt~ , or by storage in a user-owned storage device, such as a CD-R.OM, at a point-of-sale device. In one embodiment of the present invention, the initial h~l,llation associated with each private DBCA that is used is 2 o encrypted in a well-known ,l,an~lel using a secure el~cly~lion algoli~ll and is en-~aps~ d in the data frames preferably no later than the first data frame cont~ining media content compressed using the private DBCA with which the ellcly~led initial data is associated, but can be e~ap~,llated during a later data frame In ianother embodiment, the initial data for the public DBCA is made available with the encrypted initial data of the private DBCA In yet another alternative embodiment, both the initial data for the public and the private DBCAs are availab]le at the recipient of pub]icly available data frames 30 and are not s distributed when the data frames 30 are distributed Of course, for this embo~limPnt, the e~ ypled initial data of the private DBCA is secure and is not accessible lo lln~uthorized individuals. At step 18, the data frames and any initial data are received by the int~n~ed recipient At step 19, the tokens corresponding to the public DBCA in the 1 0 first portion 31 of each data frame are decl,~ressed using the public DBCA At step 20, the character codes corresponding to the private DBCA in the second portion 32 of each data frame are deco.~ essed using the private DBCA. When the first portion 31 of each data frame has been col-l~ssed by a private DBCA, portion 31 of each data frame is decol~lessed accordil~ly When e.l~.y~Led initial h.ro,., ation is el~ca~ lated in the data frames, the initial i.~..~.ation is decrypted prior to deco---~ression using the private DBCA At step 21, the frequency~domain samples resulting from the deco---l~ression steps 19 and 20 are re~csernhled to form frequency-domain samples of the frequency spectrum of the media signal l~.ese.lted by each data frame At step 22, the frequency-domain 2 o samples are ll~....ed to time-domain samples using well-known inverse Fourier transform t~chni~lues At step 23, the time-domain samples are converted to the media content using well-known digital-to-analog techni~ es When the initial data for the private DBCA is not known at step 20, steps 21-2'3 operate on only the portion of the media content that was contained in the first portion 31 of the data frames. In this way, a limited version of the media content is generated that may entice the recipient to ~llrchase the entire mediacontent because the fidelity of the media content is not satisfying.
s Figure 3 shows a functional block diagram 40 of a system for inserting a data stream not associated with the media content into a compressed media content bit stream. In block 41, analog media content is qu~nti7ed using well-known digital-to-analog qll~nti7ing techniques to for ~ iti7~d media content.
Al~ ati~ely, the input may already be a digital represe.l~lion of an analog signal. In block 42, the ~ligiti7e-l media content is l~ ~d from time-domain samples to frequency-domain samples using well-known Fourier transform and windowing techniques. In block 43, the floating point frequency-domain samples are converted into integer values in a well-known lllan~r. The qll~nti7er output is applied to a custom, or private, DBCA at block 44. A plurality of symbols are 1 5 output to a bit stream formatter at block 45 which outputs a bi~ .l of colll~)lessed media content. Functional blocks 4145 collcspolld to steps of 11-16 of method 10 shown in Figure 1.
Block 47 contains a data sequence as a string of bits that preferably l~resel~t~ w~term~rk data, but can lepleselll any information that is not 2 o associated with the media content. Block 48 contains control logic for selecting a wat~.ll~rk data site and sequencing w~lll~L data bits into custom DBCA 44, which emits symbols to the bi~lre~ll follllalL[ 45. According to the invention, private Dl3CA 44 can contain either a single data set (e.g., a single Hllrrl~n or VQ codebook) or a plurality of data sets (e.g., multiple Huffman or VQ
codebooks).
Control and timing 48 can be implemented in many ways For example, if the bit rate coming out of bit stream formatter 45 is N bits/sec, and M
watermark bits per second are desired to be inserted, and 1 bit per watermark site is inserted (without loss of generality), then timing and control 48 must insert a wate~.l~k bit on average every N/M bits corning out of bit stream formatter 45.
(Hence, the path co....frl;n~ the output of bit~lle~- fo-n~lLer 45 to control and timing 48 ) In this case, timing and control 48 can be implemented as a reloadable 10 dow.lco~ter that il~Ai~s an insertion when the dowllcou.,t, r reloads. In a more secure imple~lf ~ ;Qn, r~ 1Q~ s~ can be incorporated into control and timing 48 using a pseudo-random IlU~. ~e~.dt~r that causes an insertion on average every N/M bits.
More generally, private DBCA 44 may have a plurality of distinct 5 Hurrll~ codes devoted to w~ ;n~, for eYLq-mrle, k is equal to 2~ characters.
Then, up to K wa~ - ...~.1. bits can be inserted per special Hurrlndn symbol. For purposes of se.;ulily, more than one Huffman symbol devoted to the same bit sequence might be chosen. In the case of K wdt~ L bits per insertion, control and timing 48 causes an insertion on average every (N/M)*K bits. Alternatively, 2 o custom DBCA 44 may use one or more otherwise unused codebook indices for w~qt.orm~rk insertion. For example, when control and timing 48 in-lirqt~s an insertion, bit~lledlll folnlalt~ l 45 may put a w~ rk index and some predetermined llUlll~. of bits into the bi~ ,am. In this case, the w~ll~L
index appears to in~ic~te an unused codebook. Similarly, the position of the w~ index may be used to in-lic~tr the value of the watelll~k data, for example, if the index occurs in an odd-numbered section in the bil~LIeall~, a " 1 " bit would be in-lir~tr~, whereas appearance of the index in an even-numbered section 5 in~1icates a "O" bit.
While the present invention has been described in connection with media havmg an audio content, such as music and/or speech, it will be appreciated and understood that the present invention is applicable to media having audio andlor image andlor video andlor graph and/or textual content, and that 10 modifications may be made without depalling from the true spirit and scope of the invention.
Consequently, what is needed is a way for coln~?lessing media content for convenient network dislribution, while also securing the cou,p,essedmedia conltent against lln~llthorized use.
SUMMAI~Y OF THE INVENTION
2 o The present invention provides a method for compressing media content for convenient public distribution, such as over a co~ ul~,r network, while also securing the media content for controlling distribution of the.media content and for preventing lln~llthorized use of the media content. The advantages of the present invention are provided by a method of colllpressillg media content in which a first pred~le~lnilled portion of a media content is colllplessed using a first data-based compression algorithm and inserted into a first portion of a data frame.
5 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 predete~ ed portion of the media content is different from the first predete ~ cl portion of the media content, and the second data-based col~ ession algolilhlll is dirrele.ll from the first data-based 10 compression algoli~l.ll. Preferably, at least one of the first and second data-based cc,lll~"ession algoli~ ,ls is a private data-based col~l~,ssion algo,illl-ll. The first and secondi portions of the data frame are separated by a pred~ cl header code, or can be sepal~ted by relative positions of the first and second predelelll~lled portions of compresxed 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. T:he inserted data stream is carried by at least one symbol in at least one initial data set associated with the OBCA. A preferential implen~llldlion uses designated symbols in one or more T~ n codebooks for embedding a 2 o ~dte.lllark in the colll~,~,ssed bit stream. The value of the wdte.ll~k bits recovered from the bit stream depend upon either the values associated with the symbols or alt~.l~Liv~ly the position of the symbol in the compressed bit stream.
According to the invention, a plurality of data frames are gell~rdted and are made available for distribution, for example, by trancmi~sion over a computer network, such as the Inte:rnet. Alternatively, the data frames can be made publiicly available for storage in a memory device, such as a CD ROM.
A plurality of predetelmilled portions of the media content can be 5 compressed using data-based colllpression algolil~ s and grouped into a respectively dirr.,.e.lt portion of the data frame. Each respective predetermined portion of the media content is dirr~ l~,nt from the first and the second predetermined portions of the media content. Similarly, the data-based compression algorithm used to co~ ress a l~esL~Ii~e portion of the media content 0 is dirr~ from the first and the second data-based col~-ession algo~ s.
Preferably, at least one of the data-based col~lession algo~ llls is a private data-based compression algoli 11ll,.
Initial data associated with each private data-based compression algolillllll is ellc"~pled and made publicly available when the data frames are made 15 available. The el~lylJted initial data is grouped into a data envelope within a data frame that is preferably available no later than a first data frame cont~ining media content compressed using the private data-based comp~ssion algo~ lll with which the encrypted initial data is associated, but can be made available during a later data frame. Examples of init~al data associated with at least one private data-20 based collll~ression algolitll.ll include a H-lrflll~ code-book and/or a vector qll~nti~tion code-book.
According to the invention, the media content can include audio content, such as music and/or spee;ch, images, video content, graphics and/or textual content.
BRIEF DE~'SCRIPTION OF THE DRAWING
The present inventiom is illustrated by way of example and not 5 limitation in the accolllp~lyillg figures in which like reference numerals intlicate similar ele]~ents and in which:
Figure 1 shows a flow diagram for a media content compression process according to the present invention;
Figure 2 shows an a~ g.~ nt of data in a data frame accoldh~g to 10 the presenl invention; and Figure 3 shows a flow diagram for illsc.l~ng a data stream not associated with the media content into a co l.pressed media content bit stream according to the present invention.
The present invention provides a method for co..l~fessing media content for convenient distribution, such as over a col.l~uter network, while also securing tlle media content for controlling distribution of the media content and for preventing pirating of the media content. Compression algoli~ l, as used herein, 2 o is an algo~ill-lll that accepts an input data stream and produces a coll~i.ponding output data stream having substantially fewer bits. A data-based colllplession algolillu.. (DBCA) is an algolill--ll that is a subset of compression algoli~ -s in general. The action of a DBCA, together with associated data, depends on a number of initial data values that have been determined before the colll~ression operation begins (that is, without any knowledge of the particular input data sequence to be compressed). The initial data values may represent parametric values or rnay be used as lookup tables (i.e., as code-books) by the algorithm.
5 Typical D]3CAs are noiseless comp~ression (e.g., Huffman) algo.i~ ls and vector q~-~nti7~tion (VQ) algorithms. The initial data values may be static, i.e., the initial data values do not change, or dynamic, i.e., the initial data values adapt to the input data stream during the course of col..l)lession. Two DBCAs are dirrcl., if the initial data values are dirr~.ll, ~llclller the algolill~ s are dirr.,;e~.
0 Figure 1 shows a flow diagram of a media content cc~ ,ssion-decompression process 10 according to the present invention. At step 11, a media content, such as audio signals, are sampled using well-known analog-to-digital techni~ es, or the input may be a digital r~rese ~ l ion of an analog signal. At step 12, tbe time-domain s~les obtained in step 11 are co~ d to frequency-15 domain salmples using well-known Fourier l.a.~rulltechniques.
At step 13, a selected portion of the frequency-domain samples of the media content are collll)lessed in a well-known manner using a publicly available l)BCA, such as a DBCA having a public ~,,rr...,,. code-book as initial data. Each binary character code or token of the public DBCA lep~esents at least 2 o one dirre~ q~nti7~d re~lcsellla~ion of the frequency-domain samples. When the media content is music, the selectecl portion of the frequency-domain samples that are co,.ll~essed using the public DBCA co.l.,;,pollds to a sele~ted frequency band of the audio content frequency Spe~ lnl, for example, 300 Hz to 3 kHz. In video transform coding, DC coefficients would be encoded with the standard table, whille the AC coefficients would be encoded with the custom (private) table.
The selected portion of the media content, according to the invention, may be null.
At step 14, the rem~inin~ frequency-domain samples corresponding to the remainder of the audio content frequency spectrum are similarly compressed in a well-known ..~ er using a private DBCA, that is, a DBCA in which the initial data is not publicly available. Examples of initial data for private DBCA
include private ~llffm~n code-books and private VQ code-books. Alternatively, 10 the compression pe-ru.l...ed in steps 13 and 14 can be done by any well-known greedy-type algo-ill~ that converts data into tokens or character codes, such as a VQ algo-ilh~, as long as at least one of the two comp~ssion steps is pe.ro....ed by a priva~:e greedy-type algo.;lll.... Of course, the present invention provides that the data cc,~ .ession of each step 13 and 14 can be ~.ro....ed by a private 1 5 DBCA.
At step lS, the tokens for the frequency-domain samples that were co~ ressed using the public DBCA are inserted into a first pre~lete ~l~inP~ portion 31 of a dala frame 30, shown in Figure 2. A data frame, as used herein, is an enrars~ tion of related data, for e.cample, data associated with a given time 2 o period, frequency bandwidth, spatial domain or cepstral domain. A data envelope, as used herein, is an encaps~llation of a subset of the data within a given data frame. For example, a data frame in a perceplual audio coder might contain a co.~ressed rep~s~ nn of 1024 conse~ live samples of audio data. A data envelope ~within that particular data. frame might contain a representation of the frequency interval DC to 300 Hz. Encapsulation, as used here, may be explicit or implicit. An example of an explicit ellcapsulation is use of a predetermined character code or a header. An implicit encapsulation, that is, an encapsulation 5 without a header, can be defined by relative positions of the encap~ulated data within the data frame.
At step 16, the tokelLs for the frequency-domain samples that were compressed using the private DBCA are inserted into a second portion 32 of data frame 30. According to the invention, second portion 32 can be explicitly or 10 implicitly e.~ tPcl within data frame 30. When second portion 32 is explicitly e ncapsulated within data frame, a header 33 formed by a predet~llnilled character code or predete, ..-in~d sequence of character codes Cont~ining infollllation relating to the private DBCA, such as escape characters and/or the number of characters co~ illed in second portion 32.
At step 17, the data frames are made publicly available, such as available for distribution by tran~mi~sion in a well-known manner over a colll~ .,r network, such as the Illt~ , or by storage in a user-owned storage device, such as a CD-R.OM, at a point-of-sale device. In one embodiment of the present invention, the initial h~l,llation associated with each private DBCA that is used is 2 o encrypted in a well-known ,l,an~lel using a secure el~cly~lion algoli~ll and is en-~aps~ d in the data frames preferably no later than the first data frame cont~ining media content compressed using the private DBCA with which the ellcly~led initial data is associated, but can be e~ap~,llated during a later data frame In ianother embodiment, the initial data for the public DBCA is made available with the encrypted initial data of the private DBCA In yet another alternative embodiment, both the initial data for the public and the private DBCAs are availab]le at the recipient of pub]icly available data frames 30 and are not s distributed when the data frames 30 are distributed Of course, for this embo~limPnt, the e~ ypled initial data of the private DBCA is secure and is not accessible lo lln~uthorized individuals. At step 18, the data frames and any initial data are received by the int~n~ed recipient At step 19, the tokens corresponding to the public DBCA in the 1 0 first portion 31 of each data frame are decl,~ressed using the public DBCA At step 20, the character codes corresponding to the private DBCA in the second portion 32 of each data frame are deco.~ essed using the private DBCA. When the first portion 31 of each data frame has been col-l~ssed by a private DBCA, portion 31 of each data frame is decol~lessed accordil~ly When e.l~.y~Led initial h.ro,., ation is el~ca~ lated in the data frames, the initial i.~..~.ation is decrypted prior to deco---~ression using the private DBCA At step 21, the frequency~domain samples resulting from the deco---l~ression steps 19 and 20 are re~csernhled to form frequency-domain samples of the frequency spectrum of the media signal l~.ese.lted by each data frame At step 22, the frequency-domain 2 o samples are ll~....ed to time-domain samples using well-known inverse Fourier transform t~chni~lues At step 23, the time-domain samples are converted to the media content using well-known digital-to-analog techni~ es When the initial data for the private DBCA is not known at step 20, steps 21-2'3 operate on only the portion of the media content that was contained in the first portion 31 of the data frames. In this way, a limited version of the media content is generated that may entice the recipient to ~llrchase the entire mediacontent because the fidelity of the media content is not satisfying.
s Figure 3 shows a functional block diagram 40 of a system for inserting a data stream not associated with the media content into a compressed media content bit stream. In block 41, analog media content is qu~nti7ed using well-known digital-to-analog qll~nti7ing techniques to for ~ iti7~d media content.
Al~ ati~ely, the input may already be a digital represe.l~lion of an analog signal. In block 42, the ~ligiti7e-l media content is l~ ~d from time-domain samples to frequency-domain samples using well-known Fourier transform and windowing techniques. In block 43, the floating point frequency-domain samples are converted into integer values in a well-known lllan~r. The qll~nti7er output is applied to a custom, or private, DBCA at block 44. A plurality of symbols are 1 5 output to a bit stream formatter at block 45 which outputs a bi~ .l of colll~)lessed media content. Functional blocks 4145 collcspolld to steps of 11-16 of method 10 shown in Figure 1.
Block 47 contains a data sequence as a string of bits that preferably l~resel~t~ w~term~rk data, but can lepleselll any information that is not 2 o associated with the media content. Block 48 contains control logic for selecting a wat~.ll~rk data site and sequencing w~lll~L data bits into custom DBCA 44, which emits symbols to the bi~lre~ll follllalL[ 45. According to the invention, private Dl3CA 44 can contain either a single data set (e.g., a single Hllrrl~n or VQ codebook) or a plurality of data sets (e.g., multiple Huffman or VQ
codebooks).
Control and timing 48 can be implemented in many ways For example, if the bit rate coming out of bit stream formatter 45 is N bits/sec, and M
watermark bits per second are desired to be inserted, and 1 bit per watermark site is inserted (without loss of generality), then timing and control 48 must insert a wate~.l~k bit on average every N/M bits corning out of bit stream formatter 45.
(Hence, the path co....frl;n~ the output of bit~lle~- fo-n~lLer 45 to control and timing 48 ) In this case, timing and control 48 can be implemented as a reloadable 10 dow.lco~ter that il~Ai~s an insertion when the dowllcou.,t, r reloads. In a more secure imple~lf ~ ;Qn, r~ 1Q~ s~ can be incorporated into control and timing 48 using a pseudo-random IlU~. ~e~.dt~r that causes an insertion on average every N/M bits.
More generally, private DBCA 44 may have a plurality of distinct 5 Hurrll~ codes devoted to w~ ;n~, for eYLq-mrle, k is equal to 2~ characters.
Then, up to K wa~ - ...~.1. bits can be inserted per special Hurrlndn symbol. For purposes of se.;ulily, more than one Huffman symbol devoted to the same bit sequence might be chosen. In the case of K wdt~ L bits per insertion, control and timing 48 causes an insertion on average every (N/M)*K bits. Alternatively, 2 o custom DBCA 44 may use one or more otherwise unused codebook indices for w~qt.orm~rk insertion. For example, when control and timing 48 in-lirqt~s an insertion, bit~lledlll folnlalt~ l 45 may put a w~ rk index and some predetermined llUlll~. of bits into the bi~ ,am. In this case, the w~ll~L
index appears to in~ic~te an unused codebook. Similarly, the position of the w~ index may be used to in-lic~tr the value of the watelll~k data, for example, if the index occurs in an odd-numbered section in the bil~LIeall~, a " 1 " bit would be in-lir~tr~, whereas appearance of the index in an even-numbered section 5 in~1icates a "O" bit.
While the present invention has been described in connection with media havmg an audio content, such as music and/or speech, it will be appreciated and understood that the present invention is applicable to media having audio andlor image andlor video andlor graph and/or textual content, and that 10 modifications may be made without depalling from the true spirit and scope of the invention.
Claims (38)
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 compressing 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 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 compressing 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.
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 2, wherein the media content includes audio content.
10. The method according to claim 9, wherein the audio content includes music.
11. The method according to claim 9, wherein the audio content includes speech.
12. The method according to claim 2, wherein the media content includes images.
13. The method according to claim 2, wherein the media content includes video content.
14. The method according to claim 2, wherein the media content includes graphics.
15. The method according to claim 2, wherein the media content includes textual content.
16. 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.
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.
17. The method according to claim 16, wherein at least one of the first and second data-based compression algorithms is a private data-based compression algorithm.
18. The method according to claim 17, wherein one of the first and second data-based compression algorithms is a public data-based compression algorithm.
19. The method according to claim 18, wherein the predetermined portion of the media content compressed by public data-based compression algorithm is a null portion of the media content.
20. The method according to claim 17, wherein the first and second portions of the data frame are separated by a predetermined header code.
21. The method according to claim 17, 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.
22. The method according to claim 17, wherein the data frame is received from a computer network.
23. The method according to claim 17, wherein the step of receiving the data frame includes the step of receiving the data frame by a memory device.
24. The method according to claim 23, wherein the memory device is a CD ROM.
25. The method according to claim 17, wherein the steps of the method are performed for a plurality of data frames.
26. The method according to claim 17, 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.
27. The method according to claim 26, wherein at least one of the first, second and third data-based compression algorithms is a private data-based compression algorithm.
28. The method according to claim 17, 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.
decrypting each encrypted associated initial data of at least one private data-based compression algorithm.
29. The method according to claim 28, wherein the encrypted initial data is contained in the data frame.
30. The method according to claim 28, wherein the initial data associated with at least one private data-based compression algorithm includes at least one Huffman code-book.
31. The method according to claim 28, wherein the initial data associated, with at least one private data-based compression algorithm includes at least one vector quantization code-book.
32. The method according to claim 17, wherein the media content includes audio content.
33. The method according to claim 32, wherein the audio content includes music.
34. The method according to claim 32, wherein the audio content includes speech.
35. The method according to claim 17, wherein the media content includes images.
36. The method according to claim 17, wherein the media content includes video content.
37. The method according to claim 17, wherein the media content includes graphics.
38. The method according to claim 17, wherein the media content includes textual content.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US08/888,014 | 1997-07-03 | ||
| US08/888,014 US6266419B1 (en) | 1997-07-03 | 1997-07-03 | Custom character-coding compression for encoding and watermarking media content |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2236227A1 CA2236227A1 (en) | 1999-01-03 |
| CA2236227C true CA2236227C (en) | 2001-07-10 |
Family
ID=25392350
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002236227A Expired - Lifetime CA2236227C (en) | 1997-07-03 | 1998-04-30 | Custom character-coding compression for encoding and watermarking media content |
Country Status (4)
| Country | Link |
|---|---|
| US (5) | US6266419B1 (en) |
| EP (1) | EP0889471B1 (en) |
| CA (1) | CA2236227C (en) |
| DE (1) | DE69823587T2 (en) |
Families Citing this family (45)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6738495B2 (en) | 1995-05-08 | 2004-05-18 | Digimarc Corporation | Watermarking enhanced to withstand anticipated corruptions |
| US7006661B2 (en) | 1995-07-27 | 2006-02-28 | Digimarc Corp | Digital watermarking systems and methods |
| US6307949B1 (en) * | 1996-05-07 | 2001-10-23 | Digimarc Corporation | Methods for optimizing watermark detection |
| US6229924B1 (en) * | 1996-05-16 | 2001-05-08 | Digimarc Corporation | Method and apparatus for watermarking video images |
| US7177429B2 (en) | 2000-12-07 | 2007-02-13 | Blue Spike, Inc. | System and methods for permitting open access to data objects and for securing data within the data objects |
| US6266419B1 (en) * | 1997-07-03 | 2001-07-24 | At&T Corp. | Custom character-coding compression for encoding and watermarking media content |
| US7373513B2 (en) * | 1998-09-25 | 2008-05-13 | Digimarc Corporation | Transmarking of multimedia signals |
| US7532740B2 (en) | 1998-09-25 | 2009-05-12 | Digimarc Corporation | Method and apparatus for embedding auxiliary information within original data |
| US7197156B1 (en) | 1998-09-25 | 2007-03-27 | Digimarc Corporation | Method and apparatus for embedding auxiliary information within original data |
| JP2000115517A (en) * | 1998-10-06 | 2000-04-21 | Canon Inc | Information processor capable of making electronic watermark and communication network capable of accepting connection of the information processor |
| US7664264B2 (en) | 1999-03-24 | 2010-02-16 | Blue Spike, Inc. | Utilizing data reduction in steganographic and cryptographic systems |
| US6601046B1 (en) | 1999-03-25 | 2003-07-29 | Koninklijke Philips Electronics N.V. | Usage dependent ticket to protect copy-protected material |
| US7475246B1 (en) | 1999-08-04 | 2009-01-06 | Blue Spike, Inc. | Secure personal content server |
| US8121843B2 (en) | 2000-05-02 | 2012-02-21 | Digimarc Corporation | Fingerprint methods and systems for media signals |
| JP3973346B2 (en) * | 2000-07-06 | 2007-09-12 | 株式会社日立製作所 | CONTENT DISTRIBUTION SYSTEM, CONTENT REPRODUCTION DEVICE, CONTENT DISTRIBUTION DEVICE, AND STORAGE MEDIUM |
| FR2813743B1 (en) * | 2000-09-06 | 2003-01-03 | Claude Seyrat | COMPRESSION / DECOMPRESSION PROCESS FOR STRUCTURED DOCUMENTS |
| US7822969B2 (en) * | 2001-04-16 | 2010-10-26 | Digimarc Corporation | Watermark systems and methods |
| US7269622B2 (en) * | 2001-07-26 | 2007-09-11 | International Business Machines Corporation | Watermarking messaging sessions |
| US20030021416A1 (en) * | 2001-07-26 | 2003-01-30 | International Business Machines Corporation | Encrypting a messaging session with a symmetric key |
| US7257617B2 (en) * | 2001-07-26 | 2007-08-14 | International Business Machines Corporation | Notifying users when messaging sessions are recorded |
| US20030023850A1 (en) * | 2001-07-26 | 2003-01-30 | International Business Machines Corporation | Verifying messaging sessions by digital signatures of participants |
| AU2002334720B8 (en) | 2001-09-26 | 2006-08-10 | Interact Devices, Inc. | System and method for communicating media signals |
| US7599434B2 (en) | 2001-09-26 | 2009-10-06 | Reynolds Jodie L | System and method for compressing portions of a media signal using different codecs |
| US7302102B2 (en) | 2001-09-26 | 2007-11-27 | Reynolds Jodie L | System and method for dynamically switching quality settings of a codec to maintain a target data rate |
| US7457358B2 (en) | 2001-09-26 | 2008-11-25 | Interact Devices, Inc. | Polymorphic codec system and method |
| US7567721B2 (en) * | 2002-01-22 | 2009-07-28 | Digimarc Corporation | Digital watermarking of low bit rate video |
| US7287275B2 (en) | 2002-04-17 | 2007-10-23 | Moskowitz Scott A | Methods, systems and devices for packet watermarking and efficient provisioning of bandwidth |
| US20030226020A1 (en) * | 2002-06-04 | 2003-12-04 | Ripley Michael S. | Protecting digital broadcast content from unauthorized redistribution |
| US20040091111A1 (en) * | 2002-07-16 | 2004-05-13 | Levy Kenneth L. | Digital watermarking and fingerprinting applications |
| US7577841B2 (en) | 2002-08-15 | 2009-08-18 | Digimarc Corporation | Watermark placement in watermarking of time varying media signals |
| US7460684B2 (en) | 2003-06-13 | 2008-12-02 | Nielsen Media Research, Inc. | Method and apparatus for embedding watermarks |
| US20050125554A1 (en) * | 2003-12-03 | 2005-06-09 | International Business Machines Corporation | Method and apparatus for adaptive two-dimension inter-packet header compression |
| JP4059214B2 (en) * | 2004-03-04 | 2008-03-12 | ソニー株式会社 | Information reproducing system control method, information reproducing system, information providing apparatus, and information providing program |
| US7668334B2 (en) | 2004-07-02 | 2010-02-23 | Digimarc Corp | Conditioning imagery to better receive steganographic encoding |
| KR101087588B1 (en) | 2004-07-02 | 2011-11-29 | 닐슨 미디어 리서치 인코퍼레이티드 | Methods And Apparatus For Mixing Compressed Digital Bit Streams |
| US8160160B2 (en) | 2005-09-09 | 2012-04-17 | Broadcast International, Inc. | Bit-rate reduction for multimedia data streams |
| US8078301B2 (en) | 2006-10-11 | 2011-12-13 | The Nielsen Company (Us), Llc | Methods and apparatus for embedding codes in compressed audio data streams |
| US9349153B2 (en) * | 2007-04-25 | 2016-05-24 | Digimarc Corporation | Correcting image capture distortion |
| US7965838B2 (en) * | 2007-11-30 | 2011-06-21 | Faraday Technology Corp. | Watermark generating circuit and related method thereof |
| US8005801B2 (en) * | 2008-06-02 | 2011-08-23 | Microsoft Corporation | Aging and compressing multimedia content |
| US9767822B2 (en) | 2011-02-07 | 2017-09-19 | Qualcomm Incorporated | Devices for encoding and decoding a watermarked signal |
| US9767823B2 (en) | 2011-02-07 | 2017-09-19 | Qualcomm Incorporated | Devices for encoding and detecting a watermarked signal |
| US8880404B2 (en) * | 2011-02-07 | 2014-11-04 | Qualcomm Incorporated | Devices for adaptively encoding and decoding a watermarked signal |
| US10419511B1 (en) * | 2016-10-04 | 2019-09-17 | Zoom Video Communications, Inc. | Unique watermark generation and detection during a conference |
| US10185718B1 (en) | 2017-08-23 | 2019-01-22 | The Nielsen Company (Us), Llc | Index compression and decompression |
Family Cites Families (53)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US3803358A (en) * | 1972-11-24 | 1974-04-09 | Eikonix Corp | Voice synthesizer with digitally stored data which has a non-linear relationship to the original input data |
| US4788543A (en) * | 1986-11-05 | 1988-11-29 | Richard Rubin | Apparatus and method for broadcasting priority rated messages on a radio communications channel of a multiple transceiver system |
| US4851931A (en) | 1987-02-20 | 1989-07-25 | 1K Music International Ltd. | Method and apparatus for producing an audio magnetic tape recording at high speed from a preselected music library |
| US4908861A (en) * | 1987-08-28 | 1990-03-13 | International Business Machines Corporation | Data authentication using modification detection codes based on a public one way encryption function |
| JP2824994B2 (en) | 1989-02-06 | 1998-11-18 | キヤノン株式会社 | Color image processing equipment |
| US5040217A (en) | 1989-10-18 | 1991-08-13 | At&T Bell Laboratories | Perceptual coding of audio signals |
| US5091782A (en) | 1990-04-09 | 1992-02-25 | General Instrument Corporation | Apparatus and method for adaptively compressing successive blocks of digital video |
| JP3012698B2 (en) * | 1991-01-29 | 2000-02-28 | オリンパス光学工業株式会社 | Image data encoding apparatus and encoding method |
| US5369773A (en) * | 1991-04-26 | 1994-11-29 | Adaptive Solutions, Inc. | Neural network using virtual-zero |
| US5173900A (en) * | 1991-05-17 | 1992-12-22 | General Instrument Corporation | Method and apparatus for communicating different categories of data in a single data stream |
| US5243341A (en) | 1992-06-01 | 1993-09-07 | Hewlett Packard Company | Lempel-Ziv compression scheme with enhanced adapation |
| US5724091A (en) * | 1991-11-25 | 1998-03-03 | Actv, Inc. | Compressed digital data interactive program system |
| FR2687259B1 (en) | 1992-02-11 | 1994-05-06 | Ouest Standard Telematique Sa | DATA COMPRESSION METHOD FOR PROTOCOL DATA UNIT TRANSMISSION SYSTEM, DECOMPRESSION METHOD, AND CORRESPONDING DEVICE. |
| AU4373493A (en) * | 1992-05-15 | 1993-12-13 | Tecsec, Incorporated | Voice and data encryption device |
| US5495555A (en) * | 1992-06-01 | 1996-02-27 | Hughes Aircraft Company | High quality low bit rate celp-based speech codec |
| EP1139289B1 (en) * | 1992-09-01 | 2011-03-09 | Apple Inc. | Improved vector quantization |
| US5539865A (en) | 1992-11-10 | 1996-07-23 | Adobe Systems, Inc. | Method and apparatus for processing data for a visual-output device with reduced buffer memory requirements |
| IL104636A (en) * | 1993-02-07 | 1997-06-10 | Oli V R Corp Ltd | Apparatus and method for encoding and decoding digital signals |
| JP2989417B2 (en) * | 1993-04-15 | 1999-12-13 | 三洋電機株式会社 | Digital information playback device |
| US5794229A (en) * | 1993-04-16 | 1998-08-11 | Sybase, Inc. | Database system with methodology for storing a database table by vertically partitioning all columns of the table |
| JP3210996B2 (en) * | 1993-07-30 | 2001-09-25 | 三菱電機株式会社 | High efficiency coding device and high efficiency decoding device |
| JP3247804B2 (en) | 1993-08-17 | 2002-01-21 | 株式会社リコー | Data compression method, data compression / decompression method, code word data number limiting device |
| US5426699A (en) * | 1993-10-25 | 1995-06-20 | Antec Corporation | Method and apparatus for digitizing a scrambled analog video signal |
| US5488665A (en) | 1993-11-23 | 1996-01-30 | At&T Corp. | Multi-channel perceptual audio compression system with encoding mode switching among matrixed channels |
| DE4413451A1 (en) * | 1994-04-18 | 1995-12-14 | Rolf Brugger | Device for the distribution of music information in digital form |
| US5812882A (en) * | 1994-10-18 | 1998-09-22 | Lanier Worldwide, Inc. | Digital dictation system having a central station that includes component cards for interfacing to dictation stations and transcription stations and for processing and storing digitized dictation segments |
| AUPM987594A0 (en) | 1994-12-05 | 1995-01-05 | Southern Group Limited | High speed dubbing of compressed digital audio |
| CA2160942A1 (en) | 1994-12-16 | 1996-06-17 | Alexander Gibson Fraser | Method of protecting proprietary rights in works of authorship |
| EP0766471A1 (en) * | 1994-12-27 | 1997-04-02 | Kabushiki Kaisha Toshiba | Transmitter, receiver, communication processing system integrating them, and digital television broadcasting system |
| US5812663A (en) * | 1994-12-29 | 1998-09-22 | Fujitsu Limited | Data reproducing device |
| US5943422A (en) * | 1996-08-12 | 1999-08-24 | Intertrust Technologies Corp. | Steganographic techniques for securely delivering electronic digital rights management control information over insecure communication channels |
| SE504397C2 (en) * | 1995-05-03 | 1997-01-27 | Ericsson Telefon Ab L M | Method for amplification quantization in linear predictive speech coding with codebook excitation |
| US5664055A (en) * | 1995-06-07 | 1997-09-02 | Lucent Technologies Inc. | CS-ACELP speech compression system with adaptive pitch prediction filter gain based on a measure of periodicity |
| JPH0969951A (en) * | 1995-06-20 | 1997-03-11 | Ricoh Co Ltd | Encoding method and decoding method |
| US5659539A (en) * | 1995-07-14 | 1997-08-19 | Oracle Corporation | Method and apparatus for frame accurate access of digital audio-visual information |
| AU3484495A (en) | 1995-09-13 | 1997-04-01 | Hitachi Limited | Method and device for compressing and ciphering data |
| US5764774A (en) * | 1995-09-25 | 1998-06-09 | Intermec Corporation | Source data compression and decompression in code symbol printing and decoding |
| US5819215A (en) * | 1995-10-13 | 1998-10-06 | Dobson; Kurt | Method and apparatus for wavelet based data compression having adaptive bit rate control for compression of digital audio or other sensory data |
| JPH09182069A (en) * | 1995-12-22 | 1997-07-11 | Matsushita Electric Ind Co Ltd | Image compression method and device |
| US5805827A (en) * | 1996-03-04 | 1998-09-08 | 3Com Corporation | Distributed signal processing for data channels maintaining channel bandwidth |
| US5852806A (en) | 1996-03-19 | 1998-12-22 | Lucent Technologies Inc. | Switched filterbank for use in audio signal coding |
| US5668996A (en) * | 1996-04-29 | 1997-09-16 | Microsoft Corporation | Rendering CD redbook audio using alternative storage locations and formats |
| TW301103B (en) * | 1996-09-07 | 1997-03-21 | Nat Science Council | The time domain alias cancellation device and its signal processing method |
| US5809139A (en) * | 1996-09-13 | 1998-09-15 | Vivo Software, Inc. | Watermarking method and apparatus for compressed digital video |
| US5748904A (en) * | 1996-09-13 | 1998-05-05 | Silicon Integrated Systems Corp. | Method and system for segment encoded graphic data compression |
| US5805700A (en) * | 1996-10-15 | 1998-09-08 | Intel Corporation | Policy based selective encryption of compressed video data |
| JP2791313B2 (en) | 1996-10-31 | 1998-08-27 | キヤノン株式会社 | Image communication apparatus and method |
| US5893102A (en) * | 1996-12-06 | 1999-04-06 | Unisys Corporation | Textual database management, storage and retrieval system utilizing word-oriented, dictionary-based data compression/decompression |
| US6266419B1 (en) * | 1997-07-03 | 2001-07-24 | At&T Corp. | Custom character-coding compression for encoding and watermarking media content |
| US6111844A (en) | 1997-07-03 | 2000-08-29 | At&T Corp. | Quality degradation through compression/decompression |
| US6704866B1 (en) * | 1997-07-11 | 2004-03-09 | Cisco Technology, Inc. | Compression and encryption protocol for controlling data flow in a network |
| US6883137B1 (en) * | 2000-04-17 | 2005-04-19 | International Business Machines Corporation | System and method for schema-driven compression of extensible mark-up language (XML) documents |
| TWI276047B (en) * | 2005-12-15 | 2007-03-11 | Ind Tech Res Inst | An apparatus and method for lossless entropy coding of audio signal |
-
1997
- 1997-07-03 US US08/888,014 patent/US6266419B1/en not_active Expired - Lifetime
-
1998
- 1998-04-30 CA CA002236227A patent/CA2236227C/en not_active Expired - Lifetime
- 1998-06-22 DE DE69823587T patent/DE69823587T2/en not_active Expired - Lifetime
- 1998-06-22 EP EP98111444A patent/EP0889471B1/en not_active Expired - Lifetime
-
2001
- 2001-05-24 US US09/863,286 patent/US6760443B2/en not_active Expired - Lifetime
-
2004
- 2004-05-05 US US10/839,368 patent/US7492902B2/en not_active Expired - Fee Related
-
2008
- 2008-06-17 US US12/140,735 patent/US8041038B2/en not_active Expired - Fee Related
-
2011
- 2011-10-17 US US13/274,524 patent/US20120033812A1/en not_active Abandoned
Also Published As
| Publication number | Publication date |
|---|---|
| US8041038B2 (en) | 2011-10-18 |
| EP0889471A3 (en) | 1999-02-17 |
| US20040205485A1 (en) | 2004-10-14 |
| US7492902B2 (en) | 2009-02-17 |
| EP0889471B1 (en) | 2004-05-06 |
| CA2236227A1 (en) | 1999-01-03 |
| US6760443B2 (en) | 2004-07-06 |
| US6266419B1 (en) | 2001-07-24 |
| DE69823587D1 (en) | 2004-06-09 |
| US20010036270A1 (en) | 2001-11-01 |
| DE69823587T2 (en) | 2005-03-31 |
| US20120033812A1 (en) | 2012-02-09 |
| US20080250091A1 (en) | 2008-10-09 |
| EP0889471A2 (en) | 1999-01-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2236227C (en) | Custom character-coding compression for encoding and watermarking media content | |
| AU744440B2 (en) | Post-compression hidden data transport for video | |
| US6768980B1 (en) | Method of and apparatus for high-bandwidth steganographic embedding of data in a series of digital signals or measurements such as taken from analog data streams or subsampled and/or transformed digital data | |
| KR100351485B1 (en) | Data processor and data recorded medium | |
| JP4617049B2 (en) | Method and apparatus for embedding data in an encoded digital bitstream | |
| US6810131B2 (en) | Information processing method and apparatus | |
| KR100474438B1 (en) | Signal recording / reproducing method and apparatus, signal recording medium, signal transmitting / receiving method and apparatus | |
| KR100595202B1 (en) | Apparatus of inserting/detecting watermark in Digital Audio and Method of the same | |
| EP1519311B1 (en) | Average chrominance value modification for digital video watermarking | |
| AU694096B2 (en) | Method for the production and transmission of enhanced interactive multimedia information | |
| AU6099696A (en) | Method for the production and transmission of enhanced interactive multimedia information | |
| JPH09506223A (en) | Digital video transmission system | |
| US7110566B2 (en) | Modifying material | |
| EP1332470B1 (en) | Steganographic embedding of data in digital signals | |
| US6724913B1 (en) | Digital watermarking | |
| MXPA00010337A (en) | Multimedia adaptive scrambling system (mass). | |
| KR20040066165A (en) | Quantization index modulation (qim) digital watermarking of multimedia signals | |
| Nahrstedt et al. | Non-invertible watermarking methods for MPEG video and audio | |
| KR20010074604A (en) | Real-Time Watermarking Insertion/Extraction method for MPEG Stream using Block unit Quantization | |
| Bradley et al. | High-capacity invertible data-hiding algorithm for digital audio | |
| EP1711016A2 (en) | Coding data | |
| MXPA98005339A (en) | Compression of coding by personalized character to codify and mark with filigrana the content of med | |
| MXPA00001765A (en) | Post-compression hidden data transport for video | |
| JP2002042417A (en) | Method and device for modulating signal, method and device for recording signal, and signal recording medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKEX | Expiry |
Effective date: 20180430 |