text:
Featured news
US Bancorp teams up with VeriSign on banking security
The bank will use VeriSign's Unified Authentication service to validate and secure interactions with commercial banking customers, providing them with a secure USB token that they must use when accessing services online.
The deal is just the latest evidence of renewed interest in so-called "multifactor" authentication within the banking industry, which is struggling with an epidemic of sophisticated online identity theft scams, according to Judy Lin, executive vice-president for VeriSign's security services.
By Paul Roberts at MicroScope.
[ Read more ]
Reading our newsletter every Monday will keep you up-to-date with security news.
Receive a daily digest of the latest security news.


text:
Sweet Meat by MattMartinArtWatch
©2010-2016 MattMartinArt
I like the way the abdomin turns when she turns her body, good picture.
dang is that one zombie eating her ass? hope she didn't have chili cheese fries or that zombie will be in for a rude surprise, maybe even knock it out cold.
I'm a pervert zombie .°)
Love it bro!
Sweet, dOOd! I've got a Sunday strip on the board now that has zombies in it!
LOL! These are some perv zombies!

subset: commoncrawl


text:
|Número de publicación
|Tipo de publicación
|Número de solicitud
|Fecha de publicación
|21 Ago 2001
|Fecha de presentación
|26 Abr 2000
|Fecha de prioridad
|24 Jun 1998
|También publicado como
|Número de publicación
|Ingemar J. Cox, Matthew L. Miller, Ryoma Oami
|Cesionario original
|Nec Research Institute, Inc.
|Exportar cita
|BiBTeX, EndNote, RefMan
|Citas de patentes (18), Otras citas (38), Citada por (152), Clasificaciones (34), Eventos legales (5)
|Enlaces externos: USPTO, Cesión de USPTO, Espacenet
This application is a division of U.S. patent application Ser. No. 09/118,467 filed Jul. 17, 1998.
This is a conversion of provisional application Ser. No. 60/090,532, filed Jun. 24, 1998.
The present invention relates to digital watermarking of data including image, video and multimedia data. Specifically, the invention relates to insertion and detection or extraction of embedded signals for purposes of watermarking, in which the insertion and detection procedures are applied to sums of subregions of the data. When these subregions correspond to the 8×8 pixel blocks used for MPEG and JPEG compression and decompression, the watermarking procedure can be tightly coupled with these compression algorithms to achieve very significant savings in computation. The invention also relates to the insertion and detection of embedded signals for the purposes of watermarking, in which the watermarked data might have undergone distortion between the times of insertion and detection of the watermark.
The proliferation of digitized media such as image, video and multimedia is creating a need for a security system that facilitates the identification of the source of the material.
Content providers, i.e. owners of works in digital data form, have a need to embed signals into video/image/multimedia data, which can subsequently be detected by software, and/or hardware devices for purposes of authentication of copyright ownership, and copy control and management.
For example, a coded signal might be inserted in data to indicate that the data should not be copied. The embedded signal should preserve the image fidelity, be robust to common signal transformations and resistant to tampering. In addition, consideration must be given to the data rate that can be provided by the system, though current requirements are relatively low—a few bits per frame.
In U.S. patent application Ser. No. 08/534,894, filed Sep. 28, 1995, entitled "Secure Spread Spectrum Watermarking for Multimedia Data", which is incorporated herein by reference, there was proposed a spread spectrum watermarking method which embedded a watermark signal into perceptually significant regions of an image for the purposes of identifying the content owner and/or possessor. A strength of this approach is that the watermark is very difficult to remove. In fact, this method only allows the watermark to be read if the original image or data is available for comparison. This is because the original spectrum of the watermark is shaped to that of the image through a non-linear multiplicative procedure, and this spectral shaping must be removed prior to detection by matched filtering In addition, the watermark is usually inserted into the N largest spectral coefficients, the ranking of which is not preserved after watermarking. This method does not allow software and hardware devices to directly read embedded signals without access to the original unwatermarked material.
In an article by Cox et al., entitled "Secured Spectrum Watermarking for Multimedia" available at http:./www.neci.nj.nec.com/tr/index.html (Technical Report No. 95-10) spread spectrum watermarking is described which embeds a pseudo-random noise sequence into the digital data for watermarking purposes.
The above prior art watermark extraction methodology requires the original image spectrum be subtracted from the watermark image spectrum. This restricts the use of the method when there is no original image or original image spectrum available to the decoder. One application where this presents a significant difficulty is for third party device providers desiring to read embedded information for operation or denying operation of such a device.
In U.S Pat. No. 5,319,735 by R. D. Preuss et al entitled "Embedded Signaling" digital information is encoded to produce a sequence of code symbols. The sequence of code symbols is embedded in an audio signal by generating a corresponding sequence of spread spectrum code signals representing the sequence of code symbols. The frequency components of the code signal being essentially confined to a preselected signaling band lying within the bandwidth of the audio signal and successive segments of the code signal corresponds to successive code symbols in the sequence. The audio signal is continuously frequency analyzed over a frequency band encompassing the signaling band and the code signal is dynamically filtered as a function of the analysis to provide a modified code signal with frequency component levels which are, at each time instant, essentially a preselected proportion of the levels of the audio signal frequency components in corresponding frequency ranges. The modified code signal and the audio signal are combined to provide a composite audio signal in which the digital information is embedded. This component audio signal is then recorded on a recording medium or is otherwise subjected to a transmission channel. Two key elements of this process are the spectral shaping and spectral equalization that occur at the insertion and extraction stages, respectively, thereby allowing the embedded signal to be extracted without access to the unwatermarked original data.
In U.S. patent application Ser. No. 081708,331, filed Sep. 4, 1996, entitled "A Spread Spectrum Watermark for Embedded Signaling" by Cox, and incorporated herein by reference, there is described a method for extracting a watermark of embedded data from watermarked images or video without using an original or unwatermarked version of the data.
This method of watermarking an image or image data for embedded signaling requires that the DCT (discrete cosine transform) and its inverse of the entire image be computed. There are fast algorithms for computing the DCT in N log N time, where N is the number of pixels in the image. However, for N=512×512, the computational requirement is still high, particularly if the encoding and extracting processes must occur at video rates, i.e. 30 frames per second. This method requires approximately 30 times the computation needed for MPEG-II decompression.
One possible way to achieve real-time video watermarking is to only watermark every Nth frame. However, content owners wish to protect each and every video frame. Moreover, if it is known which frames contain embedded signals, it is simple to remove those frames with no noticeable degradation in the video signal.
An alternative option is to insert the watermark into n×n blocks of the image(subimages) where n<<N. If the block size is chosen to be 8×8, i.e. the same size as that used for MPEG image compression, then it is possible to tightly couple the watermark insertion and extraction procedures to those of the MPEG compression and decompression algorithms. Considerable computational saving can then be achieved since the most expensive computations relate to the calculation of the DCT and its inverse and these steps are already computed as part of the compression and decompression algorithm. The incremental cost of watermarking is then very small, typically less than five percent of the computational requirements associated with MPEG.
U.S. patent application Ser. No. 08/715,953, filed Sep. 19, 1996, entitled "Watermarking of Image Data Using MPEG/JPEG Coefficients" which is incorporated herein by reference, advances this work by using MPEG/JPEG coefficients to encode the image data.
U.S. patent application Ser. No. 08/746,022, filed Nov. 5, 1996, entitled "Digital Watermarking", which is incorporated herein by references, describes storing watermark information into subimages and extracting watermark information from subimages.
A review of watermarking is found in an article by Cox et al., entitled "A review of watermarking and the importance of perceptual modeling" in Proc. of EI'97, vol. 30-16, Feb. 9-14, 1997.
There have been several proposals to watermark MPEG video or JPEG compressed still images. In all cases, each 8×8 DCT block is modified to contain the watermark or a portion thereof Consequently, decoding of the watermark requires that each 8×8 block be individually analyzed to extract the watermark signal contained therein. The individual extracted signals may then be combined to form a composite watermark, which is then compared with known watermarks. Because each block must be analyzed individually, an uncompressed image must be converted back to the block-based DCT representation, which is computationally expensive. Thus, while the decoder may be computationally efficient in the DCT domain, extracting a watermark from the spatial domain is much more expensive.
To allow for computationally efficient detection of the watermark in both the spatial and DCT domains, a watermark may be inserted in the sum of all the 8×8 blocks in the DCT domain, or the sum of a subset of all the 8×8 blocks in the DCT domain. A major advantage of this approach is that if the image is only available in the spatial domain, then the summation can also be performed in the spatial domain to compute a small set of summed 8×8 blocks and only those blocks must then be transformed into the DCT domain. This is because the sum of the DCT blocks is equal to the DCT of the sum of the intensities. Thus, the computational cost of decoding in the DCT and spatial domains is approximately the same.
A second advantage of watermarking the sum of the DCT blocks is that there are an unlimited number of equivalent methods to apportion the watermark throughout the image. For example, if the watermark requires a change of Δi to the i'the coefficient of the summed DCT block, then, if there are M blocks in the image, Δi/M can be added to each individual block, or block 1 can have Δi added to it and the remaining M-1 blocks left unaltered, ignoring for the moment issues of image fidelity. Because of this one to many mapping, it is possible to alter the insertion algorithm without changing the decoder. This is a very important characteristic, since in some watermarking applications, there may be many hardware decoders that are deployed, such that changing the decoder is impractical. However, improvements to the insertion algorithm can still result in improved detection using the approach described herein.
A third advantage of watermarking the sum of the DCT blocks is that watermark signals extracted from these sums have small variances, compared with the amount that they may be changed without causing fidelity problems. This means that, in many cases, it is possible to change an image so that the summed DCT blocks perfectly match the required watermark signal, even though the resulting image appears identical to the original.
Finally, it is well known that some problems, such as modeling the human visual system, are best performed in the frequency domain, where other problems such as geometric transformations are more conveniently dealt with in the spatial domain. Since the computational cost of decoding the watermark is now symmetric, it is possible to switch from spatial to frequency domains at will in order to correct for various signal transformations that may corrupt the watermark.
The present invention concerns a novel insertion method which employs a specific model of the human visual system which provides much better control over image fidelity. Tests have shown that it is possible to obtain large signals (more than 15 standard deviations from 0 correlation) with images that are indistinguishable from their respective original images.
The method handles robustness against various types of attacks in ways that are easy to relate to the specific type of attack.
The method is adaptable so that the model of the human visual system and the techniques used for handling attacks can be changed later without having to change the detector. The result is that it is possible to continue improving watermarking, particularly DVD (digital video disk) watermarking, even after many detectors have been installed. This is analogous to the situation with MPEG video for which encoder technology can be improved without having to change existing decoders.
Use of the present insertion method allows a simple detection algorithm in either MPEG or decompressed domains.
The invention also concerns a novel detection method which is easy to implement, easy to analyze and has a low computational cost, whether the incoming video is MPEG compressed or uncompressed.
The present invention also concerns a novel insertion method that hides multiple patterns in the data These patterns fall into two categories: 1) registration patterns used during detection to compensate for translational shifts, and 2) watermark patterns that encode the information content of the watermark.
A principal object of the present invention is the provision of a digital watermark insertion method which allows detection of watermarks after the watermarked data is subjected to predefined scale changes, without modification to the watermark detector.
Another object of the invention is the provision of a watermark detection method that is computationally inexpensive in either the MPEG or decompressed domains.
A still other object of the invention is the provision of a digital watermarking method that withstands attacks without having to change a detector.
Further and still other objects of the invention will become more clearly apparent when the following description is read in conjunction with the accompanying drawings.
FIG. 1 is a general data flow diagram of a method of inserting a watermark into media data,
FIG. 2 is a schematic diagram of an MPEG-2 encoder;
FIG. 3 is a schematic diagram of a modified MPEG-2 encoder for reducing degradation of a watermark in watermarked data;
FIG. 4 is a schematic diagram of an alternative modified MPEG-2 encoder for reducing degradation of a watermark in watermarked data;
FIG. 5 is a flow chart of the process performed in the watermark correction device in FIGS. 3 and 4;
FIG. 6 is a flow chart of the process performed in step 506 of FIG. 5;
FIG. 7 is a flow chart of an alternative process performed in step 506 of FIG. 5;
FIG. 8 is a flow diagram of a method of extracting a watermark from MPEG media data;
FIG. 9 is a flow diagram of a method of extracting a watermark from uncompressed media;
FIG. 10 is a flow diagram of a method of detecting a watermark from MPEG data, with registration; and
FIG. 11 is a flow diagram of a method of detecting a watermark from uncompressed image data, with registration
As used in the following description the terms image and image data will be understood to be equally applicable to video, image and multimedia data. The term "watermark" will be understood to include embedded data, symbols, images, instructions or any other identifying information.
In order to better understand the present invention, first a review of the basic watermarking method will be presented followed by additional descriptions of the improvements comprising the present invention.
First, we define some notations. Let a watermark to be embedded into an image be an N dimensional vector, denoted by W[1, . . . ,N]. In the following text, the notation W[1, . . . ,N] is used in the same manner as W[k] (k=1, . . . ,N). Let V [1, . . . ,N] denote a vector value extracted from an image, where the element V[k] corresponds to W[k]. Specifically, the value V[k] is a weighted sum of DCT coefficients given by
where D_k[i] (i=1, . . . , n_k) indicate members of the set of DCT coefficients used for calculating V[k], n_k indicates the number of members, and F_k[i] (i=1, . . . , n_k) are weighting coefficients related to a filter processing. The concept of F_k is that the DCT coefficients are weighted according to how much noise might be expected in each coefficient. To calculate V[1, . . . ,N], n×n DCT coefficients are first calculated over a whole image. Then the coefficients are classified into N sets, each of which is related to each element of V[1, . . . , N]. The rule of classifying DCF coefficients is predetermined, and the same rule is used in both inserting and detecting a watermark.
Before inserting a watermark into an image, a detection algorithm is applied to the image to find a watermark that is already present in the image. If the image does not contain a watermark, the extracted values, V[1, . . . , N] will be normally distributed random numbers that do not correlate any watermark W[1, . . . , N]. A watermark W[1, . . . , N] is inserted into an image by changing each of D_k [1, . . . , n_k] (k−1, . . . , N) slightly in order to make the extracted value V[1, . . . , N] highly correlate the watermark W[1, . . . , N]. Let the target value of V[1, . . . , N] be denoted by ω[1, . . . , N], that is, the values V[1, . . . ,N] are changed to ω[1, . . . , N] by inserting the watermark W[1, . . . , N]. The target values ω[1, . . . , N] have high correlation with the watermark W[1, . . . , N] and they are determined as will be described below.
After the target values ω[1, . . . , N] are determined, the difference ω[k]−V[k] is distributed among the DCT coefficients D_k[1, . . . , n_k]. Then a watermark is inserted by adding the allocated difference value to the corresponding DCT coefficients D_k[1, . . . . , n_k]. This change of DCT coefficients must be done in such a manner so as not to change the appearance of the image.
In distributing the difference ω[k]−V[k], a characteristic of the human visual process is taken into account. The amount of change that does not cause a visible change in the image is different for each DCT coefficient D_k[i]. This amount depends on the human visual process which can be approximately simulated with a computational model. The amount of change is referred to as "slack". The slack is calculated for each DCT coefficient and it is used in distributing the difference ω[k]−V[k] among the DCT coefficients. Next we describe how to calculate the values of the slack using a model of the human visual process.
The preferred computational model of human visual sensitivity that is used in the present invention is found in an article by Andrew B. Watson, entitled "DCT Quantization Matrices Usually Optimized for Indirect Images" in SPIE, vol. 1913 (1993), pp. 202-216. This model was applied to watermarking in an article by Christine I. Podilchuk and Wenjun Zeng entitled "Digital Image Watermarking Using Visual Models", Proc. of EI'97, vol. 3016, Feb. 9-14, 1997. The current invention differs from that of Podilchuk and Zeng in (i) not requiring the original unwatermarked image at the decoder and (ii) not extracting the watermark from the individual 8×8 blocks, but from the sum of a set of 8×8 blocks. Other computational models are also usable.
For each element of the image's block DCT, d[i,j], this model computes a value called the element's "slack", S[i,j], which indicates how much a particular d[i,j] value may be altered before such an alteration becomes visible. The value is computed in three steps. The first step models the contrast masking phenomenon of the human visual system and models the visual sensitivity at different frequencies and handles the difference between visual sensitivity to changes in different frequencies. The second step models the luminance masking phenomenon of the human visual system and handles the fact that the visual system is more sensitive to changes in dark regions than to changes in bright regions. The third step handles the fact that the sensitivity to changes depends in part on the percentage that the frequency is changing (i.e. a DCI term with a small value in it may only change a little, while one with a larger value may change more).
The perceptual model makes use of a matrix of values that indicate the relative sensitivity of the human visual system to the different terms of a spatial 8×8 DCT. The formulae for computing this matrix are available in an article by Albert J. Ahumada Jr. and Heidi A. Peterson entitled "Luminance-Model-Based DCT Quantization for Color Image Compression", in SPIE, vol. 1666, (1992) pp. 365-374.
After computing the slacks for all the 8×8 DCT's in the image, a slack can be assigned to each D_k[1, . . . , n_k]. Call these slacks S_k[1, . . . ,n_k]. It is now possible to distribute the changes in the V's over all the D_k's with minimal visual impact. This is done according to the following formula:
where D'_k[1, . . . ,n_k] are the modified 8×8 DCT coefficients, and ω[k] and V[k] are the k'the elements of a and V, respectively. The effect of this formula is to distribute the desired change in a given element of the watermark vector (ω[k]−V[k]) over all the DCT coefficients that are summed to produce that element, proportionately according to those DCT coefficients' slacks. To illustrate, consider two simple examples: 1) If all the slacks are 0 except for slack S_k[m], then the sum of all the values S_k[j]F_k[j] is equal to S_k[m]F_k[m], and only D_k[m] is changed. It is changed by the full value of (ω[k]−V[k]). 2) If all the slacks are equal and all the coefficients F_k[i]=1, then each D_k[i] is changed by the same amount.
After making these changes, convert all the 8×8 DCF's back into the spatial domain, and the result is a watermarked image. It is easy to show that the sum of all the D_k's for a given k will equal ω [k]. The process of making this is referred to as "inserting Omega into the image". The watermark extracted from the resulting image, if the image has not been attacked, will be exactly ω, not ω plus noise.
There are two important issues remaining to be discussed. First, how to decide on ω, and, second, how to make the watermark robust.
Previously, the equivalent of a) was computed as:
where α a is a small constant, and W is a zero-mean watermark signal. It is possible to use the same formula here, but it is too limiting to result in the strongest possible watermark using the present invention. In practicing the invention, it is often possible to insert an ω that has perfect correlation with the watermark, W, without causing any visible change in the image. The following formula is used:
This result is a weighted sum of the watermark signal and the original, noise (image) signal. If β is set to 0, the result is an ω that perfectly correlates with W.
The signal to noise ratio for an unattacked image will be:
where std(X) is the standard deviation of X.
There are many ways to choose α and β based on optimizations to maximize different criteria such as fidelity or robustness.
At this point there is a complete method of inserting watermarks. The method contains explicit modeling of human vision, but it does not contain any explicit method of making the watermark robust. In fact, the method as described so far will try to put as much of the watermark as possible into the high frequencies since these frequencies have the largest slack, but this is a poor thing to do from the point of view of robustness.
To make the watermark robust against a given set of attacks or signal degradations, it is first necessary to consider how those attacks affect the various terms of the 8×8 DCT's in the image. Then, terms that are affected by attacks or signal degradations in similar ways are grouped together, and watermarked as if the group of terms were a separate image.
The following is a simple example. Suppose there is only concern about two possible attacks: cropping 24 columns of pixels from the left side of the image, or cropping 24 columns of pixels from the right side of the image. This results in three groups of DCT terms: those that come from the 3 left-most columns of 8×8 DCT's blocks, those that come from the 3 right-most columns, and those that come from the rest of the image. All the terms in each of these groups either survives or is destroyed by any given attack together. If each group is watermarked as though it were a separate image, then the watermark from at least one group will generally survive attack (assuming that the 24-column cropping attacks are the only attacks possible), and the watermark that is extracted will consist of the correct watermark, from that group, plus some noisy watermarks from groups that were damaged by the attack.
A more interesting example is low-pass and high-pass filtering attacks. It is possible to group all the low frequencies together into one group, and all the high frequencies into one or more other groups. If the predetermined rule for classifying DCT coefficients into the N sets is designed in such a way that each set has coefficients of many different frequencies, then the complete watermark can be inserted into each group. Then, if the high frequencies are removed, the watermark will still be detectable in the low frequencies, and vice-versa.
The more groups the terms are divided into, the more robust will be the watermark. There is a cost because it will become increasingly more difficult to distribute the changes without causing visible distortion.
It is important to note that the best balance can be achieved after the detectors are in wide use. It is possible to modify the insertion algorithm to make watermarks robust against a wide variety of attacks without having to change detection at all.
Presently only three groups are used. One group collects together most of the low frequencies. Each of the other two groups represents one higher frequency.
In the preferred method, a watermark is not placed in any of the higher frequencies. The reason is not that they are susceptible to attack (that is handled by the design of the Filter [ ] used in detection). Rather, it is because watermarking the higher frequencies causes MPEG compression rates to go down substantially. An alternative solution might be to add other groups that contain higher frequencies.
In FIG. 1, there is shown a flow diagram of the watermark insertion method. The digital image is divided into a collection of n×n blocks, preferably 8×8 blocks, in step 10. The discrete cosine transform (DCT) of each block is computed in a known manner in step 12. The DCT's are separated into groups that respond to different attacks in the same manner 14. A first group G is selected in step 16.
Next, extract a watermark V, using only the terms in the group G in step 18. Determine a new signal (target value) ω selected such that ω is similar to V but is highly correlated with watermark W in step 20.
Add fractions of ω−V to terms in G according to perceptual slack in step 22. Decide whether group G is the last group in step 24. If not, select next group G in step 26, and extract watermark V using only terms of next group G in step 18 and continue procedures until the last group G is found in step 24. Next, compute the inverse DCTs of the blocks in step 28 resulting in a watermarked image.
Some alternative steps in the insertion method are possible. For example, the distribution of the difference between ω and V over DCT terms can be done stochastically to help deter tampering and reduce susceptibility to tampering.
Also, the groups of DCT terms for robustness purposes could be performed dynamically. For example, the insertion program could simulate various attacks on the image and determine the effect on the values of the DCT term. Then, the program would cause appropriate allocation of the terms into the groups similarly affected.
The inserter can be designed with a user-interface that allows the user to set two parameters: (1) the maximum perceptual difference between the original image and the watermarked image (J) and (2) the maximum allowable probability of missed detection after any of the predefined set of attacks. The algorithm would then insert watermarks into a large number of images automatically, according to the allowable perceptual change J and checking each one against simulations of the attacks. If an image fails to meet the specified robustness constraint (maximum allowable probability of missed detection), then the user would be notified so that a manual decision can be made to compensate or trade-off image fidelity for robustness.
In addition, the distribution of the difference between ω and V over DCT terms can be modified to explicitly compensate for MPEG quantization. Using the above watermark insertion method there may result a degraded watermark in the watermarked data. In order to enhance the watermark in the watermarked data after MPEG compression several techniques are possible.
FIG. 2 is a schematic diagram of a typical MPEG-2 encoder. FIG. 2 depicts elements which are indispensable to execute an MPEG-2 encoding of P pictures, or to perform a combined interframe prediction and DCT coding. Input images are provided as one input to subtractor 30. The other input to subtractor 30 is predicted image generated in frame memory 32. The predicted images are subtracted from the input images at subtractor 30. A discrete cosine transform (DCT) is performed at DCT calculator 34 on the output signal from subtractor 30. The DCT coefficients are quantized in quantizer 36. The outputs of the quantizer 36 are sent to a variable length encoder 38 where Huffman encoding is performed. The quantized DCT coefficients outputted from the quantizer 36 are also sent to an inverse quantizer 40 where they are de-quantized. Inverse DCT of the de-quantized DCr coefficients is performed in the inverse DCT calculator 42. The results are added at adder 44 to the predicted image outputted from the frame memory 32, and then an image which is expected to be the same as that acquired in a decoder is reconstructed. The reconstructed image is called "a locally decoded image." This locally decoded image is stored in the frame memory 32 to produce the predicted images.
FIG. 3 is a schematic diagram of a modified MPEG-2 encoder for reducing degradation of a watermark in watermarked data. Before MPEG-2 encoding, DCT is performed on a input image at the DCT calculator 50 and watermark signals are added to the DCT coefficients at adder 52. The output DCT coefficients including watermark information is subject to inverse DCT in the inverse DCT calculator 54. The output of inverse DCT calculator 54 are images with a watermark. These watermarked images are sent to MPEG-2 encoder and MPEG-2 encoding is performed as described above. In addition, in this embodiment, watermark information is modified in order to be suited to MPEG-2 compression. DCI coefficients for the predicted images are calculated in DCT calculator 56. The quanitization values outputted from quantizer 36 are de-quantized in inverse quantizer 58. The results of inverse quanitization are added at adder 60 to the DCT coefficients outputted from DCT calculator 56. The results of addition correspond to the DCT coefficients for the decoded images which are expected to be generated in a decoder. These DCT coefficients are inputted into a watermark correction device 62. The watermark correction device 62 outputs watermark correction signals. At adder 64, the watermark correction signals from device 62 are added to the quantization values from quantizer 36. The output of adder 64 is used as the inputs to variable length encoder 38 and inverse quantizer 40.
Next, we describe the process performed in the watermark correction device 62. Let us introduce several new notations to explain the process. Let Dq_k[i] be the quantization value corresponding to D_k[i], that is, the quantization value of the i-th member of the k-th set for calculating the value V. Let Q_k[i] be the quantization step size used in obtaining Dq_k[i]. Let Dr_k[i] be the output value of adder 60 that is obtained by adding the inverse quantization value of Dq_k[i] calculated in inverse quantizer 58 to the corresponding DCT coefficient outputted from DCT calculator 56. Let Vr[1, . . . , N] be the value extracted from the output values of adder 60, Dr_k[i], in the same manner that the value V[1, . . . , N] is calculated in inserting a watermark. We assume that the target value ω[1, . . . , N] is also available in the watermark correction device 62.
FIG. 5 shows that the flow chart describing the process performed in the watermark correction device 62. First the index k of the watermark element is set to 1 (Step 500). Next the value Vr[k] is calculated (Step 502) by
where the weighting coefficients F_k[1, . . . ,n_k] are the same value as those used in calculating V[k]. Then the absolute value of the difference between the value Vr[k] and the target value ω[k], and the sign of the difference are computed in step 504 by the following equations:
This value Dif corresponds to the distortion of the watermark inserted at the adder 52 generated in the quantization process.
On the basis of the absolute value Dif and the sign s watermark correction signals are generated in step 506. The process in Step 506 is describe below. After calculating the watermark, correction signals for the DCT coefficients related to the k-th element of the watermark, index k is compared with N in step 508. If k>N. then the process is finished. If k≦N, the value k is increased by one in step 510, and the process goes back to step 502. The watermark correction process is thus performed, and the obtained watermark correction signals are finally outputted to adder 64.
Next, we describe the process performed in step 506 in FIG. 5, using the flow chart in FIG. 6. In step 506, the watermark correction signals for the DCT related to the k-th element of the watermark are generated. The array ΔDq_k[i] (i=1, . . . n_k) are first all set to zero in step 520. Next, the value j is set to one in step 522. Then the index of the DCT coefficients i is found through a permuting function p(j) in step 523. The function p(j) returns the j-th value of a permutation obtained after the integers 1 to n_k are permuted. The simplest example is p(j)=j. Next, a value−s is stored in ΔDq_k[i], and the value Dif is decreased by Q_k[i] F_k[i] in step 524. This indicates that the quantization value Dq_k[i] is changed by -s by adding ΔDq_k[i] to Dq_k[i] at adder 64. The value s is 1 or −1, so the change in the quantization value is one. In other words, de-quantized value obtained in a inverse quantizer in a decoder is changed by −Q_k[i], one step size. The value Dif after the update is identical to the absolute value of the difference between ω[k] and Vr[k] calculated with the corrected quantization value Dq_k[i] +Dq_k[i]. (i=1, . . . n_k). After step 524, the values Dif and zero, and index j and n_k are compared in step 526. If Dif<0 or I>n_k, then this subroutine is finished. If the condition is not satisfied, the index j is increased by certain amount Δj in step 528, then the process returns to step 523.
Instead of the process shown in FIG. 6, an alternative process shown in FIG. 7 can be used as the process of step 506. In the process shown in FIG. 7, a step 530, checking whether the quantization value Dq_k[i] equals zero or not, is added between step 523 and step 524. In this case, step 524 is performed only if the quantization value Dq_k[i] is a non-zero value. This allows a reduction in the increase of the number of bits caused by correcting watermark information, because changing a quantization value from zero to non-zero value generally results in a large increase in the number of bits.
FIG. 4 is a schematic diagram of an alternative embodiment of a modified MPEG-2 encoder for reducing degradation of a watermark in watermarked data. In this embodiment, the basic concept is the same as the described in connection with FIG. 3. The differences lie in the fact that subtraction of the predicted images from the input original images is performed in the DCT domain not in the spatial domain. For the predicted image outputted from the frame memory 32, DCT is performed in DCT calculator 70, and the results are subtracted from the watermarked DCT coefficients at subtractor 72. The results of subtraction are sent to the quantizer 36 and then the watermark correction is performed in the same manner as shown in FIG. 3. The results outputted from subtractor 72 are the same as the results outputted from the DCT calculator 34 in FIG. 3 because of the linearity of DCT. Therefore, the results obtained in the processes followed by quantization in quantizer 36 are the same as those in FIG. 3. This embodiment results in a reduction in the number of DCT calculations.
The detection procedure to detect a watermark in an image will now be described.
If MPEG video is the input image data format, the following detection process determines whether watermark W is present, where W[1, . . . ,N] =the watermark being tested for.
Decode the Huffman code, but do not compute the inverse DCT's, so that, for each frame (at least, each I-frame), there is an array of 8×8 DCTs.
Next perform the same summation of DCT coefficients that was performed during watermark insertion to obtain the vector V. Compute the correlation coefficient C, between V and the watermark being tested for, W:
Finally, convert C into a normalized Fisher Z statistic:
where N is the length of the watermark.
The Z value indicates whether the watermark is present. A preferred threshold for Z is 4 (i.e. Z≧4 means the watermark is present), but other values may be used depending on the desired probabilities of false alarms and missed detections.
FIG. 8 is a flow diagram of the detection method for MPEG video input described above. The input MPEG video is subject to a Huffman decoder and partial parser 80 where the output is a set of DCT for n×n, preferably 8×8, blocks of the video input.
The n×n DCTs are provided to watermark accumulator 82. Accumulator 82 has memory whose length is the watermark length N. DCT coefficients from the Huffman decoder and partial parser 80 are classified according to a predetermined rule and summed for extracting a watermark as mentioned before, and the results are accumulated in the memory. The extracted watermark is proved to comparator 84 where it is compared with possible watermarks in the image by calculating correlation coefficients between the extracted watermark and the possible watermarks as mentioned before. The possible watermarks are the universe of the watermarks accumulators and comparator are found, for instance, in U.S. patent application Ser. No. 08/1746,022.
The output of comparator 84 is the likelihood (normalized Fisher Z statistic) of the detected watermark being each of the possible watermarks. The most likely watermark is determined and is deemed the watermark in the image, or, if the detector does not exceed a predetermined threshold, then no watermark is present.
Alternatively, if the incoming input data comprises an uncompressed image, an embedded watermark can be detected by applying the method above to DCT coefficients obtained by performing 8×8 DCT for the whole image. In this case, DCT have to be performed for each 8×8 block, but a skillfully designed rule for classifying DCT coefficients into N sets enables us to avoid performing DCT many times. Before explaining the method to reduce DCT calculation, let us define some notations.
Let h_m(i,j) (i=1 . . . 8,j=1, . . . 8. m=0, . . . ,M−1) be a set of functions that map frequency indices of 8×8 DCr coefficients (i,j) onto the indices k of the element of a watermark, and M indicates the number of functions. So if k=h_m(i,j), then a DCT coefficient whose index is (i,j) is classified into the k-th set of DCT coefficients for calculating the value V[k]. We prepare M different functions h_m(i,j) (m−0, . . .M−1). Which function is selected for a certain 8×8 block depends on the numbers r and c of the block where r and c indicate the row and column numbers of the block respectively. So the index of the functions, m, is first found according to the values r and c, then the index of the sets, k, is determined by h_m(i,j) for each DCT coefficient. Using these functions h_m(i,j) in classifying DCT coefficients is assumed in the remaining part of the detailed description.
In this case, we can reduce the number of DCT calculations in the following manner. First the sum of the blocks whose indices m are the same is computed for each m=0, . . . ,M−1. Let this summed block be denoted by VB_m[i,j] (m=0, . . . ,M−1). Then DCT is performed for the M summed blocks VB_m[i,j] (m=0, . . . , M−1). Finally, the DCT coefficients of the summed blocks are classified into N sets according to the value h_m(i,j), and added together within each set to obtain V[1, . . . ,N]. The obtained results V[1, . . .N] are the same as V[1, . . .N] obtained with the method mentioned above because DCT is a linear transform, that is, the sum of DCT blocks equals the result of DCT for the sum of the blocks. If M is much less than the total number of blocks in an image, the number of DCT calculations is dramatically reduced. This method thus allows us to extract watermarks with small calculation cost.
FIG. 9 shows a flow diagram of the detection method for uncompressed video input data as described above.
The uncompressed video image data is provided to n×n accumulators, preferably 8×8 accumulators 90. The memory requirement is n2 times the number of the function h_m(i,j). For each index m. the blocks with the same index m are summed and the resultant M summed blocks are accumulated in the memory.
The output is the summed signal of each of the n×n blocks. The output is subject to a DCT transform 92. The number of transformations is proportional to the number of the functions h_m(i,j). The result is a group of n×n DCTs which is classified into N sets according to the functions h_m(i,j) and summed for extracting a watermark as mentioned before. The obtained watermark is provided to watermark accumulator 94 and accumulated. The memory requirement for accumulator 94 is proportional to the watermark length. The extracted watermark is provided as input to comparator 96. The other inputs to comparator 96 are the possible watermarks that may have been inserted into the input image data The comparator computes a likelihood (normalized Fisher Z statistic) of each possible watermark having been inserted into the image data. The most likely watermark is determined and is deemed the watermark in the image.
A limitation of block based DCT methods is their sensitivity to spatial shifts of the image. For example, if the image is shifted two pixels to the right, then the DCT coefficients change significantly, so that the watermark cannot be detected. Furthermore, general distortions, such as scaling and rotation, also make the watermark undetectable.
To solve these problems, the above insertion and extraction methods may be modified in two ways. The first possible modification is to insert multiple watermarks designed to survive predefined distortions of the video The second modification is to arrange that translations can be compensated for without performing the summation more than once. Optionally, this second modification may be further modified to insert registration patterns, one for each of the multiple watermarks, which can be used by a modified watermark detector to compensate for arbitrary translations of the video.
Wherein detecting watermarks inserted using the above method, it is necessary to divide the image into the same grid of n×n blocks as was used during insertion. If the image has been translated since watermark insertion then determining the correct grid becomes difficult. In many applications, this is a serious problem, since certain, specific transformations can be expected. For example, it can be expected that video on a DVD disk might be modified to fit on a standard television screen by conversion to either "panscan" or "letterbox " mode. In a panscans mode, the horizontal image resolution is increased, and the image is cropped at a predetermined offset, so that the resulting image will be correct when viewed on a 3×4-aspect-ratio television screen. In "letterbox×" mode, the image is scaled vertically, and black is added at the top and bottom, so that the whole image will fit correctly on a 3×4-aspect-ratio screen. Since these two geometric transformations are more likely than any other, it is reasonable to prepare for them specifically.
The problem of the predetermined scaling or transforming of watermarked video is solved in the present invention by inserting an additional watermark for each of the likely transformations. Each of these watermarks is designed so that, when the image has undergone the corresponding known transformation, the grid of n×n blocks used during insertion will align with a predetermined grid used during detection. Thus, if the image has undergone no transformation, then the detection grid will align with the normal mode watermark, and the normal mode watermark will be detected. If the image has undergone "panscan" transformation, then the same detection grid will align with the "panscan" watermark, and the "panscan" watermark will be detected, and so forth for "letterbox " scan or any other predefined transformation.
The procedure for inserting a watermark that is to be detected after a specific transformation comprises the following steps:
1. Make a copy, IT, of the image being watermarked, I, and apply the transformation to be compensated for the image. For example, IT might be a copy of I that has been transformed into "letterbox " mode by vertical shrinking of I.
2. Create a watermarked version of the transformed image, IT′, according to the general watermarking method described above.
3. Let WT=IT′−IT be the spatial pattern that was added to IT when it was watermarked.
4. Perform the inverse transformation on WT to yield the corresponding watermark pattern, W, for the untransformed image. For example, if the transformation to be compensated for was "letterbox " mode, then W would be obtained by vertically expanding WT.
5. Let I′=I+W be the image with a watermark added for the given transformation.
When the transformation is applied to I′, the result will be approximately IT′, and the watermark will be detected by the same procedure designed to detect a normal watermark.
This process can only be used for a small number of transformations, as each additional watermark causes additional degradation of the image, and reduces the detectability of other watermarks in the image. However, tests have shown that three watermarks—two for transformed images and one for the untransformed image—result in acceptable fidelity and good detectability. Alternatively, for video, each watermark can be inserted in a time-multiplexed manner.
In cases where the transformations that an image will undergo are not predefined or predetermined, or where there are too many probable transformations to allow for the insertion of a separate watermark for each transformation, the above described method of compensating for transformations is not optimal. Thus, the present invention includes an additional improvement, which compensates for arbitrary translation of the image between the times of watermark insertion and watermark detection.
Arbitrary translation is compensated for in two ways. One way is by translations by even multiples of 8 pixels in the x or y directions when 8×8 blocks are used. This can be easily compensated for if the following restrictions are imposed on the relationship between an index of h_m (i,j), and the row and column numbers of blocks, r and c. We determine the index m according to
where f(r,c) is a linear function of r and c, and f(0, 1) and f(1, 0) are integers. In addition, let h_m(i,j) be a function expressed as
where a is an integer. These restrictions are assumed in the remaining part of the detailed description. In this case, the shift compensation is performed in the basic detection algorithm by computing the correlation of the extracted watermark with all cyclical shifts of the watermark being tested for. This is because the values VB-A(i,j) (m=0, . . . ,M−1) obtained from a watermarked image shifted by a multiple of 8 pixels in the horizontal and/or the vertical directions are identical to the values VB-—m[i,j] (m=0, . . . , M−1) obtained from the non-shifted image except that the indices m are cyclically shifted. As a result, the extracted value V[1, . . . ,N] obtained from a watermarked image shifted by a multiple of 8 are identical to the value V[1, . . . ,N] obtained from the non-shifted image except that the elements V[k] are cyclically shifted. For n×n grid format, the same thing is true of a shift of a multiple of n in the horizontal and/or the vertical directions.
For shifts of less than 8 pixels in x and/or y directions, an exhaustive search can be performed of all 64 possibilities and the maximum Z value taken from the set of 64×M−Z values, where M is the number of 8×8 accumulators. In our tests M was chosen to be 64. The factor M is necessary to account for the cyclic shifts that are introduced by shifts of a multiple of 8 pixels.
The exhaustive search requires shifting the M 8×8 accumulator array in the spatial domain and then performing the DCT of each of the M 8×8 blocks. This is performed 64 times, once for each of the possible shifts. Thus it is necessary to perform 64×M 8×8 DCTs. If this computation is too expensive in terms of time or memory an alternative method can be used, as described below.
The second way, which compensates for translations of non-even multiples of n pixels, uses a pattern (referred to as a "registration pattern") which can be inserted at the time of watermark insertion. By finding the location where the registration signal best matches a predefined signal, a detector can determine how much to shift the data before extracting the watermark. This shifting must be done in the spatial domain, but can be done with accumulators, so conversions of whole images are avoided.
Moreover, the 64×M 8×8 DCTs are unnecessary. Instead, the correct registration is determined in the spatial domain and then compensated for by shifting the pixels in the accumulator arrays. The M 8×8 accumulators are only then transformed into the DCTT domain and the watermark extraction is performed as described above. The registration pattern is an 8×8 spatial pattern inserted into the image in such a way that the sum of all 8×8 pixel blocks highly correlates with the pattern. Again, an n×n spatial pattern is used when the video is n×n blocks. A registration pattern can be inserted by using the watermark insertion method described above. The sum of all 8×8 pixel blocks becomes highly correlated with a registration pattern if the DCT coefficients of the sum block and those of the registration pattern are highly correlated to each other. In addition, the DCT coefficients of the sum block equals the sum of all DCT blocks because of the linearity of DCT. We can thus insert a registration pattern using a method similar to that inserting a watermark described above, considering the DCT coefficients of a registration pattern as a watermark W and considering the sum of all 8×8 DCT blocks as a value V.
Insertion is performed by converting the registration pattern into the DCT domain, and then using the basic insertion algorithm with different Dks and Fks. Specifically, each AC term of the registration pattern's DCT is considered one element of the watermark, W[k]. The set of DCT terms that are summed together to extract this element, Dk, is simply the set of corresponding terms of all the 8×8 DCTs in the image. All the Fks are set to 1. Using these Dks and Fks, the insertion algorithm inserts a registration pattern along with each watermark. The watermarks are still inserted with the original Dks and Fks.
During detection, registration is performed as follows. Each of a predetermined number of blocks is summed together to form a single n×n, typically 8×8, block. We have arbitrarily used 64 blocks in our tests. This block contains a registration pattern placed there by the insertion process. To determine the horizontal and vertical translation of the frame, a correlation process is performed in the spatial domain to determine these offsets. Sixty-four correlations are performed for each of the 8 horizontal and 8 vertical motions that are possible. When the 8×8 patch is shifted either horizontally or vertically, a wrap around shift is performed.
We now describe how to determine the shift of the grid. In the following method, we assume the integer values f(0,1) and f(1,0) are relatively prime to M.
First, the blocks for which the same function h_m(i,j) is used in classifying DCT coefficients are added together in the spatial domain for generating a summed block VB_m[i,j] for each m. The sum of all n×n blocks denoted by AB[i,j], is computed by
Then the correlation coefficient between AB[i,j] and a registration pattern, denoted by R[i,j] is computed. After calculation of the correlation coefficient, the values AB[i,j] are cyclically shifted by one column in the horizontal direction, and the correlation coefficient between AB[i,j] and R[i,j] is calculated in the same way. The same operations are repeated for each shift. After shifting n times, AB[i,j] becomes identical to AB[i,j] before any shift is done. Then, the values AB[i,j] are cyclically shifted by one row in the vertical direction, and calculation of a correlation coefficient and shift by one column in the horizontal direction are repeated. In this way, we can l calculate correlation coefficients for all n2 possible shifts. At the same time, we search the shift value (offset), denoted by (X,Y), which gives the maximum correlation coefficient.
After the offset (X,Y) has been determined, the M summed blocks VB_m[i,j] are then shifted accordingly in the spatial domain. Next, we describe the method to compensate for the shift value X in the horizontal direction. To do so, the values VB_m[i,j] (m=0, . . . ,M−1) are first copied on an n×nM array VB1[i,j] (i=1, . . . ,nj=1, . . . , nM). In copying the values VB_m[i,j], the spatial relationships between blocks, that is, which blocks are adjoining a certain block are considered. The function f(r,c) is linear, so
This indicates that the blocks whose index m equals
are located next to the blocks in which m=m0. So, the values VB_ml are copied next to the values VB_m0 in the array VB1. For this reason, for each I (I=0, . . . ,M−1), the values VB_m′[i,j](i=1, . . . ,n, j=1, . . . , n, m′ J=×f(0,1) mod M) are copied in the n×n square region of VB1 where the index of the left-top comer is (1, nI+1). After copying the values for all I, the array VB1 is filled with the values VB_m[i,j] because f (0,1) and M are relatively prime. Next, the values in the array VB1 are cyclically shifted by X in the horizontal direction. Then the values in VB1 are returned to VB_m in such a way that the value in the n×n region of VB1 where the index of the left-top comer is (1, nI+1) are substituted to VB_m′[i,j] (i=1, . . . ,n,j=1, . . . , n, m′=I×f(0,1) mod M) for each (I=0, . . . , M−1). The horizontal offset value X can thus be compensated for without shifting the whole image itself.
Next, the shift value Y in the vertical direction is compensated for. To do so, the values VB_m[i,j] (m=0, . . . ,M-1) are first copied on an nM×n array VB2 [i,j] (i=1,. . . ,nM, j=1, . . . ,n). In copying the values VB_m[i,j], the spatial relationship between blocks are considered. The function f(r,c) is linear, so
This indicates that the blocks whose index m equals
locate under the blocks in which m=m0. So, the values VB_m1 are copied under the values VB_m0 in the array VB2. For this reason, for each I (I=0, . . . ,M−1), the values V_m′[i,j] (i=1, . . . , n, m′=I×f (0,1) mod M) are copied on the n×n square region of VB1 where the index of the left-top corner is (nI+1, 1). After copying the values for all 1, the array VB2 is filled with the values VB_m [i,j] because f (1,0) and M are relatively prime. Next, the values in the array VB2 are cyclically shifted by Y in the vertical direction. Then the values in VB2 are returned to VB_m in such a way that the value in the n×n region of VB2 where the index of the left-top corner is (nI+1, 1) are substituted in VB_m′[i,j] (i=1, . . .n,j=1, . . . ,n, m′=I×f(0,1) mod M) for each 1 (I=0, . . . M−1. The vertical offset value Y can thus be compensated without shifting the whole image itself.
The offset of the n×n grid is compensated by the process mentioned above. These processes are performed in the registration process 108 as will be explained later. A shift of a multiple of n remains even after these processes, but this shift does not affect the watermark detection because the correlation coefficient between a watermark W and an extracted value V is calculated by shifting the watermark W cyclically as described above. After the registration process above is applied, the M blocks VB_m (m=0, . . . ,M−1) are transformed back to the DCT domain.
With reference now to FIGS. 10 and 11, there are shown the basic detection algorithms modified to compensate for translational registration. In the case of MPEG video input (FIG. 10), 8×8 DCT blocks obtained from an MPEG video stream are first classified into M groups according to their indices m of the function h_m (i,j), summed within the groups for generating M summed blocks, and the resultant summed blocks are accumulated in 8×8 accumulators 102. The M summed blocks in accumulators 102 must be converted into the spatial domain by perform an inverse DTC operation in inverse DCT converter 104, and accumulated in accumulators 106. Finding the offset value of the 8×8 grid and compensating for the offset is executed for the output from 8×8 accumulators 106 in registration 108 as described above. The registration data outputted from registration process 108 is accumulated in accumulators 110 and converted into the DCT domain in DCT converter 112 for watermark extraction by use of accumulators 114, watermark extractor 116 and watermark decoder 118. In watermark extractor 116, the DCT coefficients outputted from accumulator 114 are classified into N sets according to the functions h_m (i,j) and summed for extracting a watermark. The obtained watermark is provided to watermark decoder 118, in which the processes executed in comparator 84 in FIG. 8 for finding a watermark corresponding to the extracted watermark. The watermark considered to have been inserted is outputted from the watermark decoder 118. In the case of uncompressed input data (FIG. 11), the input data is divided into 8×8 blocks and accumulated in accumulators 106 according to the indices of the functions h_m(i,j), and registration 108 is performed before conversion into the DCT domain in DCT converter 112. The process continues as described above.
While there has been described and illustrated methods of insertion and detection of watermarks in image data, it will be understood by those skilled in the art that variations and modifications are possible without deviating from the spirit and broad teachings of the present invention which shall be limited solely by the scope of the claims appended hereto.
|Patente citada
|Fecha de presentación
|Fecha de publicación
|30 Sep 1988
|3 Jul 1990
|General Electric Company
|Digital signal encoding and decoding apparatus
|17 Dic 1991
|7 Jun 1994
|Bolt Beranek And Newman Inc.
|Embedded signalling
|30 Jun 1994
|25 Jun 1996
|Hewlett-Packard Company
|Embedded hidden identification codes in digital objects
|1 Feb 1995
|25 Jun 1996
|International Business Machines Corporation
|Color correct digital watermarking of images
|30 Sep 1994
|22 Oct 1996
|Eastman Kodak Company
|Method and apparatus for reducing quantization artifacts in a hierarchical image storage and retrieval system
|7 Jun 1995
|18 Mar 1997
|The Dice Company
|Steganographic method and device
|8 May 1995
|3 Jun 1997
|Digimarc Corporation
|Steganography methods employing embedded calibration data
|14 Dic 1994
|8 Jul 1997
|Barton; James M.
|Method and apparatus for embedding authentication information within digital data
|23 Feb 1995
|19 Ago 1997
|Sandford, Ii; Maxwell T.
|Data embedding
|12 Mar 1996
|2 Sep 1997
|Leighton; Frank Thomson
|Watermarking process resilient to collusion attacks
|31 Dic 1996
|11 Nov 1997
|The Dice Company
|Steganographic method and device
|12 Jun 1995
|3 Ene 1996
|Hewlett-Packard Company
|Encoding of digital information
|Título no disponible
|20 Mar 1989
|21 Sep 1989
|Imperial College
|Digital data security system
|19 Ene 1995
|27 Jul 1995
|Rod Hugh Borland
|Method of and apparatus for manipulating digital data works
|22 Dic 1995
|11 Jul 1996
|Stuart John Best
|Audio signal identification using digital labelling signals
|5 Feb 1996
|15 Ago 1996
|Central Research Lab Ltd
|Method and apparatus for coding information
|4 Mar 1996
|6 Sep 1996
|Highwater Fbi Limited
|Method of and apparatus for manipulating digital data works
|"Digital Copyright: Who Owns What?" NewMedia, Sep. 1995, pp. 38-43.
|"Publish and Be Robbed?" New Scientist, Feb. 18, 1995, pp. 32-37.
|A.G. Bors et al., "Image Watermarking Using DCT Domain Constraints", Dept. Of Informatics, University of Thessaloniki.
|Ahumada, Jr. et al., "Luminance-Model-Based DCT Quantization for Color Image Compression", SPIE, vol. 1666 (1992), pp. 365-374.
|C.T. Hsu et al., "Hidden Signatures in Images", ICIP 96 Conf. Proc., Sep. 16-19, 1996.
|Campana and Quinn, "Spread spectrum communications," in IEEE Potentials, Apr. 1993,pp.13-16.
|Cox et al.,"A review of watermarking and the importance of perceptual modeling", Proc. of EI'97, vol. 3016, Feb. 9-14, 1997.
|Craver et al., "Can Invisible Watermarks Resolve Rightful Ownerships?", IBM Research Report, RC 20509, Jul. 25, 1996.
|D. Kahn, "Information Hiding-An Annotated Bibliography", Macmillan 1967, Library of Congress catalog No. 63-16109.
|D. Kahn, "Information Hiding—An Annotated Bibliography", Macmillan 1967, Library of Congress catalog No. 63-16109.
|Digimarc Overview & "Wired" Magazine article (Jul. 1995 issue) -Jun. 1995.
|F.M. Boland et al., "Watermarking Digital Images for Copyright Protection", Image Processing and its Applications, Jul. 4-6, 1995, Conference Publication No. 410, pp. 326-330.
|G. Caronni, "Assuring Ownership Rights for Digital Images," in Proc. Reliable IT Systems, VIS '95, 1995.
|H.S. Stone, "Analysis of Attacks on Image Watermarks with Randomized Coefficients", NEC Research Institute, May 17, 1996.
|Hartung et al., "Digital Watermarking of Raw and Compressed Video", Systems for Video Communication, Oct. 1996, pp. 205-213.
|I. Pitas, "A Method of Signature Casting on Digital Images".
|I.J. Cox et al, "Secure Spread Spectrum Watermarking for Multimedia", NEC Research Institute, Technical Report 95-10.
|J. Brassil et al., "Electric Marking and Identification Techniques to Discourgae Document Copying," in Proc. Infocom '94, pp. 1278-1287, 1994.
|J.J.K. O Ruanaidh et al., "Phase Watermarking of Digital Images".
|J.J.K. O Ruanaidh et al., "Watermarking Digital Images for Copyright Protection", EVA 96 Florence, pp. 1-7.
|K. Hirotsugu, "An Image Digital Signature System with ZKIP for the Graph Isomorphism", ICIP 96 Conf. Proc., Sep. 16-19, 1996.
|K. Matsui et al, "Video-Steganography: How to Secretly Embed a Signature in a Picture," in IMA Intellectual Property Project Proc., vol. 1, pp. 187-206, 1994.
|K. Tanaka et al, "Embedding Secret Information into a Dithered Multi-level Image," in IEEE Military Comm. Conf., pp. 216-220, 1990.
|Koch and Zhao, "Towards Robust and Hidden Image Copyright Labeling," in Proc. of 1995 IEEE Workshop on Nonlinear Signal and Image Processing (Neos Marmaras, Halkidiki, Greece, Jun. 20-22 1995.
|Koch, Rindfrey and Zhao, "Copyright Protection for Multimedia Data," in Proc. of the Int'l Conf. on Digital Media and Electronic Publishing (Leeds, UK, Dec. 6-8, 1994).
|Kohno et al, "Spread Spectrum Access Methods for Wireless Communications," in IEEE Communications Magazine, Jan. 1995, pp. 58-67.
|L. Boney et al., "Digital Watermarks for Audio Signals".
|M. Schneider et al., "A Robust Content Based Digital Signature for Image Authentication", ICIP 96 Conf. Proc. Sep. 16-19, 1996.
|Macq and Quisquater, "Cryptology for Digital TV Broadcasting," in Proc. of the IEEE, vol. 83, No. 6, pp. 944-957, 1995.
|Mowbray and Grant, "Wideband coding for uncoordinated multiple access communication," in Electronics & Communication Engineering Journal, Dec. 1992, pp. 351-361.
|Podilchuk et al., "Digital Image Watermarking Using Visual Models", Proc. of EI'97, vol. 3016, Feb. 9-14, 1997.
|R.B. Wolfgang et al., "A Watermark for Digital Images".
|R.G. Van Schyndel et al, "A digital watermark," in Intl. Conf. On Image Processing, vol. 2, pp. 86-90, 1994.
|S. Roche et al., "Multi-Resolution Access Control Algorithm Based on Fractal Coding", ICIP 96 Conf. Proc., Sep. 16-19, 1996.
|Swanson et al., "Transparent Robust Image Watermarking", Proc. IEEE Int. Conf. On Image Proc. 1996.
|T. Aura, "Invisible Communication", Nov. 6, 1995.
|W. Bender et al, "Techniques for data hiding," in Proc. of SPIE, vol. 2420, No. 40, Feb. 1995.
|Watson, "DCT quantization matrices visually optimized for individual images", SPIE, vol. 1913, pp. 202-216.
|Patente citante
|Fecha de presentación
|Fecha de publicación
|28 Jul 2000
|28 Ene 2003
|Verizon Laboratories Inc.
|Systems and methods for etching digital watermarks
|26 Oct 1999
|10 Jun 2003
|Koninklijke Philips Electronics N.V.
|Watermark detection
|29 Nov 2001
|18 May 2004
|Digimarc Corporation
|Watermarking enhanced to withstand anticipated corruptions
|20 Ago 2001
|13 Jul 2004
|Digimarc Corporation
|Detection of out-of-phase low visibility watermarks
|4 Ago 1999
|17 Ago 2004
|Lucent Technologies, Inc.
|High-capacity digital image watermarking based on waveform modulation of image components
|20 Jul 1999
|30 Nov 2004
|Nec Corporation
|System for changing attribute of image by electronic watermark
|8 Nov 2002
|8 Mar 2005
|Koninklijke Philips Electronics N.V.
|Watermark detection
|2 Abr 2002
|10 May 2005
|Digimarc Corporation
|Hiding information out-of-phase in color channels
|11 Ene 2000
|5 Jul 2005
|Cognicity, Inc.
|Transactional watermarking
|25 Oct 2001
|13 Dic 2005
|Digimarc Corporation
|Synchronizing watermark detectors in geometrically distorted signals
|6 Abr 2000
|18 Abr 2006
|Canon Kabushiki Kaisha
|Method for determining a partition in order to insert a watermark, and associated insertion and decoding methods
|28 Mar 2002
|30 May 2006
|Digimarc Corporation
|Inferring object status based on detected watermark data
|29 Abr 2002
|22 Ago 2006
|University Of North Carolina At Charlotte
|Automated digital watermarking methods using neural networks
|3 Sep 2002
|7 Nov 2006
|Koninklijke Philips Electronics N.V.
|Copy protection via redundant watermark encoding
|17 Nov 2004
|5 Dic 2006
|Koninklijke Philips Electronics N.V.
|Watermark detection
|26 Nov 2003
|30 Ene 2007
|Digimarc Corporation
|Method for utilizing fragile watermark for enhanced security
|28 Feb 2003
|6 Mar 2007
|Kaleidescope, Inc.
|Recovering from de-synchronization attacks against watermarking and fingerprinting
|12 Dic 2002
|17 Abr 2007
|Sony United Kingdom Limited
|Data processing apparatus and method of processing data
|12 Dic 2002
|28 Ago 2007
|Sony United Kingdom Limited
|Apparatus and method for detecting embedded watermarks
|30 May 2006
|4 Sep 2007
|Digimarc Corporation
|Multiple watermarks in content
|15 Ene 2004
|8 Abr 2008
|Victor Company Of Japan, Ltd.
|Recording and reproduction apparatus, recording and reproduction method, recording and reproduction program for imperceptible information to be embedded in digital image data
|24 Abr 2006
|6 May 2008
|Verance Corporation
|System reactions to the detection of embedded watermarks in a digital host content
|10 Ene 2007
|15 Jul 2008
|Digimarc Corporation
|Methods to evaluate images, video and documents
|6 Jul 1999
|12 Ago 2008
|Koninklijke Philips Electronics N.V.
|Detection of a watermark in a compressed video signal
|24 Oct 2006
|26 Ago 2008
|Digimarc Corporation
|Methods and apparatus to process media
|11 May 2004
|14 Oct 2008
|Digimarc Corporation
|Digital watermarking systems and methods
|9 Dic 2005
|2 Dic 2008
|Nielsen Media Research, Inc.
|Method and apparatus for embedding watermarks
|2 Ago 2006
|27 Ene 2009
|Digimarc Corporation
|Perceptual modeling of media signals for data hiding
|1 Jun 2004
|26 May 2009
|Digimarc Corporation
|Documents and methods involving multiple watermarks
|7 May 2004
|8 Sep 2009
|Avid Technology, Inc.
|26 Abr 2005
|10 Nov 2009
|Verance Corproation
|Methods and apparatus for enhancing the robustness of watermark extraction from digital host content
|3 Nov 2004
|1 Dic 2009
|Kddi Corporation
|Digital watermarking system and drift compensating system
|23 Ago 2004
|8 Dic 2009
|Thomson Licensing
|Apparatus and methods for improving detection of watermarks in content that has undergone a lossy transformation
|12 Nov 2008
|5 Ene 2010
|The Nielsen Company (Us), Llc
|Method and apparatus for embedding watermarks
|1 Jun 2005
|23 Feb 2010
|Digimarc Corp
|Conditioning imagery to better receive steganographic encoding
|30 Mar 2010
|Digimarc Corporation
|Associating first and second watermarks with audio or video content
|14 Jun 2005
|15 Jun 2010
|Digimarc Corporation
|Low visible digital watermarks
|9 Oct 2002
|22 Jun 2010
|The Nielsen Company (Us), Llc.
|Methods and apparatus for identifying a digital audio signal
|8 Oct 2003
|31 Ago 2010
|Verance Corporation
|Media monitoring, management and information system
|14 May 2003
|5 Oct 2010
|Schreiner Group Gmbh & Co. Kg
|Visible authentication patterns for printed document
|27 Ene 2009
|26 Oct 2010
|Digimarc Corporation
|Perceptual modeling of media signals for data hiding
|14 Dic 2010
|The Nielsen Company (Us), Llc
|Data insertion apparatus and methods for use with compressed audio/video data
|10 Ene 2007
|2 Ago 2011
|Digimarc Corporation
|Apparatus to process images and video
|27 Ago 2010
|2 Ago 2011
|Schreiner Group Gmbh & Co. Kg
|Visible authentication patterns for printed document
|25 Sep 2009
|23 Ago 2011
|Verance Corporation
|Methods and apparatus for enhancing the robustness of watermark extraction from digital host content
|11 Jun 2010
|27 Sep 2011
|Digimarc Corporation
|Digital watermarking in data representing color channels
|7 Oct 2009
|11 Oct 2011
|Digimarc Corporation
|Digital watermarks
|10 Oct 2007
|13 Dic 2011
|The Nielsen Company (Us), Llc
|Methods and apparatus for embedding codes in compressed audio data streams
|5 Nov 2009
|27 Dic 2011
|The Nielsen Company (Us), Llc
|Methods and apparatus for embedding watermarks
|26 Oct 2007
|3 Ene 2012
|Digimarc Corporation
|Systems and methods for processing content objects
|10 Ene 2012
|Digimarc Corporation
|Associating first and second watermarks with audio or video content
|11 Mar 2008
|24 Ene 2012
|Verance Corporation
|System reactions to the detection of embedded watermarks in a digital host content
|7 Jun 2011
|29 May 2012
|Schreiner Group Gmbh & Co. Kg
|Visible authentication patterns for printed document
|9 Dic 2009
|12 Jun 2012
|Digimarc Corporation
|Out of phase digital watermarking in two chrominance directions
|9 Jun 2009
|3 Jul 2012
|Avio Technology, Inc.
|Watermarking of motion pictures
|26 Oct 2010
|3 Jul 2012
|Digimarc Corporation
|Perceptual modeling of media signals for data hiding
|5 Dic 2006
|21 Ago 2012
|Digimarc Corporation
|Digital watermarking applications
|19 Jun 2009
|4 Sep 2012
|Verance Corporation
|Efficient and secure forensic marking in compressed
|19 Nov 2010
|2 Oct 2012
|Verance Corporation
|System reactions to the detection of embedded watermarks in a digital host content
|14 Sep 2005
|9 Oct 2012
|Thomson Licensing
|Video codec with weighted prediction utilizing local brightness variation
|29 Ago 2008
|27 Nov 2012
|Adobe Systems Incorporated
|Video watermarking with fast detection
|25 Dic 2012
|Verance Corporation
|Methods and apparatus for thwarting watermark detection circumvention
|6 Ago 2012
|1 Ene 2013
|Verance Corporation
|Efficient and secure forensic marking in compressed domain
|8 Ene 2013
|The Nielsen Company (Us), Llc
|Methods and apparatus for embedding watermarks
|5 Nov 2008
|26 Feb 2013
|Adobe Systems Incorporated
|Video watermarking with temporal patterns
|29 Jun 2005
|2 Abr 2013
|The Nielson Company (Us), Llc
|Methods and apparatus for mixing compressed digital bit streams
|30 Ene 2012
|28 May 2013
|Verance Corporation
|Remote control signaling using audio watermarks
|3 Nov 2011
|10 Sep 2013
|Verance Corporation
|Extraction of embedded watermarks from a host content based on extrapolation techniques
|4 Sep 2012
|17 Sep 2013
|Verance Corporation
|Asymmetric watermark embedding/extraction
|15 Abr 2010
|1 Oct 2013
|The Nielsen Company (Us), Llc
|Methods and apparatus for identifying a digital audio signal
|29 Ago 2011
|1 Oct 2013
|Verance Corporation
|Forensic marking using a common customization function
|13 Sep 2012
|19 Nov 2013
|Adobe Systems Incorporated
|Video watermarking with fast detection
|9 Nov 2010
|3 Dic 2013
|The Nielsen Company (Us), Llc
|Data insertion apparatus and methods for use with compressed audio/video data
|3 Nov 2011
|24 Dic 2013
|Verance Corporation
|Watermark extraction based on tentative watermarks
|21 Sep 2011
|4 Feb 2014
|Digimarc Corporation
|Digital watermarks
|16 Feb 2007
|18 Feb 2014
|Kaleidescape, Inc.
|Recovering from de-synchronization attacks against watermarking and fingerprinting
|12 Jun 2012
|25 Feb 2014
|Digimarc Corporation
|Encoding in two chrominance directions
|17 Dic 2012
|25 Mar 2014
|Verance Corporation
|Efficient and secure forensic marking in compressed domain
|3 Nov 2011
|25 Mar 2014
|Verance Corporation
|Efficient extraction of embedded watermarks in the presence of host content distortions
|13 Sep 2012
|13 May 2014
|Verance Corporation
|Time varying evaluation of multimedia content
|23 Nov 2011
|3 Jun 2014
|Verance Corporation
|Enhanced content management based on watermark extraction records
|20 Nov 2012
|3 Jun 2014
|Verance Corporation
|Pre-processed information embedding system
|10 Ene 2012
|24 Jun 2014
|Digimarc Corporation
|Associating first and second watermarks with audio or video content
|7 Jul 2006
|15 Jul 2014
|Verance Corporation
|Watermarking in an encrypted domain
|7 Dic 2012
|22 Jul 2014
|The Nielsen Company (Us), Llc
|Methods and apparatus for embedding watermarks
|24 May 2013
|29 Jul 2014
|Verance Corporation
|Remote control signaling using audio watermarks
|10 May 2010
|12 Ago 2014
|Verance Corporation
|Media monitoring, management and information system
|4 Sep 2012
|19 Ago 2014
|Verance Corporation
|Circumvention of watermark analysis in a host content
|5 Abr 2011
|16 Sep 2014
|Verance Corporation
|Watermark extraction and content screening in a networked environment
|5 Abr 2011
|16 Sep 2014
|Verance Corporation
|Content access management using extracted watermark information
|13 Sep 2012
|21 Oct 2014
|Verance Corporation
|Second screen content
|3 Nov 2011
|30 Dic 2014
|Verance Corporation
|Extraction of embedded watermarks from a host content using a plurality of tentative watermarks
|30 Sep 2011
|3 Mar 2015
|The Nielsen Company (Us), Llc
|Methods and apparatus for embedding codes in compressed audio data streams
|26 Sep 2013
|14 Abr 2015
|Verance Corporation
|Forensic marking using a common customization function
|19 Jul 2007
|9 Jun 2015
|Verance Corporation
|Signal continuity assessment using embedded watermarks
|8 Sep 2005
|11 Ago 2015
|The Nielsen Company (Us), Llc
|Digital data insertion apparatus and methods for use with compressed audio/video data
|8 Feb 2013
|11 Ago 2015
|Verance Corporation
|Enhanced content distribution using advertisements
|17 Dic 2008
|25 Ago 2015
|Digimarc Corporation
|Out of phase digital watermarking in two chrominance directions
|2 Jun 2014
|25 Ago 2015
|Verance Corporation
|Pre-processed information embedding system
|15 Ago 2014
|6 Oct 2015
|Verance Corporation
|Circumvention of watermark analysis in a host content
|26 Sep 2011
|3 Nov 2015
|Digimarc Corporation
|Digital watermarking in data representing color channels
|28 Jul 2014
|17 Nov 2015
|Verance Corporation
|Remote control signaling using audio watermarks
|13 Mar 2013
|17 Nov 2015
|The Nielsen Company (Us), Llc
|Methods and apparatus for mixing compressed digital bit streams
|14 Jul 2014
|1 Dic 2015
|The Nielsen Company (Us), Llc
|Methods and apparatus for embedding watermarks
|25 Oct 2013
|8 Dic 2015
|Verance Corporation
|Content management using multiple abstraction layers
|25 Feb 2014
|26 Ene 2016
|Digimarc Corporation
|Encoding in two chrominance directions
|23 Jul 2013
|2 Feb 2016
|Verance Corporation
|Watermark extractor enhancements based on payload ranking
|28 Mar 2002
|31 Oct 2002
|Rhoads Geoffrey B.
|Inferring object status based on detected watermark data
|25 Oct 2001
|1 May 2003
|Bradley Brett A.
|Synchronizing watermark detectors in geometrically distorted signals
|8 Nov 2002
|8 May 2003
|Koninklijke Philips Electronics N.V.
|Watermark detection
|12 Dic 2002
|17 Jul 2003
|Pelly Jason Charles
|Data processing apparatus and method
|3 Sep 2002
|4 Mar 2004
|Koninklijke Philips Electronics N.V.
|Copy protection via redundant watermark encoding
|28 Feb 2003
|6 May 2004
|Kaleidescape, A Corporation
|Recovering from de-synchronization attacks against watermarking and fingerprinting
|15 Ene 2004
|29 Jul 2004
|Victor Company Of Japan, Ltd.
|Recording and reproduction apparatus, recording and reproduction method, recording and reproduction program for imperceptible information to be embedded in digital image data
|7 May 2004
|6 Ene 2005
|Cornog Katherine H.
|11 May 2004
|13 Ene 2005
|Levy Kenneth L.
|Digital watermarking systems and methods
|23 Ago 2004
|3 Feb 2005
|Mediasec Technologies Gmbh
|Apparatus and methods for improving detection of watermarks in content that has undergone a lossy transformation
|1 Jun 2004
|17 Mar 2005
|Rhoads Geoffrey B.
|Identification document including multiple watermarks
|17 Nov 2004
|28 Abr 2005
|Haitsma Jaap A.
|Watermark detection
|3 Nov 2004
|12 May 2005
|Kddi Corporation
|Digital watermarking system and drift compensating system
|1 Jun 2005
|5 Ene 2006
|Reed Alastair M
|Conditioning imagery to better receive steganographic encoding
|14 Jun 2005
|12 Ene 2006
|Reed Alastair M
|Low visible digital watermarks
|14 May 2003
|25 May 2006
|Jian Zhao
|Visible authentication patterns for printed document
|8 Sep 2005
|3 Ago 2006
|Nielsen Media Research
|Digital data insertion apparatus and methods for use with compressed audio/video data
|26 Abr 2005
|26 Oct 2006
|Verance Corporation
|Security enhancements of digital watermarks for multi-media content
|26 Abr 2005
|26 Oct 2006
|Verance Corporation
|Methods and apparatus for enhancing the robustness of watermark extraction from digital host content
|23 Jun 2006
|26 Oct 2006
|Kayvan Najarian
|Automated digital watermarking methods using neural networks
|26 Sep 2006
|22 Feb 2007
|Arun Ramaswamy
|Data insertion apparatus and methods for use with compressed audio/video data
|20 Oct 2006
|1 Mar 2007
|Levy Kenneth L
|Associating First and Second Watermarks with Audio or Video Content
|24 Oct 2006
|1 Mar 2007
|Rhoads Geoffrey B
|Methods and Apparatus to Process Media
|5 Dic 2006
|3 May 2007
|Levy Kenneth L
|Digital Watermarking Applications
|10 Ene 2007
|26 Jul 2007
|Rhoads Geoffrey B
|Methods to Evaluate Images, Video and Documents
|2 Ago 2006
|9 Ago 2007
|Hannigan Brett T
|Perceptual modeling of media signals for data hiding
|16 Feb 2007
|11 Oct 2007
|Kaleidescape, Inc., A Corporation
|Recovering from de-synchronization attacks against watermarking and fingerprinting
|9 Dic 2005
|27 Dic 2007
|Venugopal Srinivasan
|Method and apparatus for embedding watermarks
|14 Sep 2005
|16 Oct 2008
|Peng Yin
|Video Codec With Weighted Prediction Utilizing Local Brightness Variation
|4 Jul 2006
|27 Nov 2008
|Commonwealth Scientific And Industrial Research Organization
|Image Watermarking
|30 Jul 2009
|Fuji Xerox Co., Ltd.
|Document management device, document management method, computer readable recording medium and data signal
|27 Ene 2009
|20 Ago 2009
|Hannigan Brett T
|Perceptual Modeling of Media Signals for Data Hiding
|9 Dic 2010
|Cornog Katherine H
|Watermarking of motion pictures
|9 Dic 2010
|Levy Kenneth L
|Associating first and second watermarks with audio or video content
|3 Mar 2011
|Arun Ramaswamy
|Data insertion apparatus and methods for use with compressed audio/video data
|23 Jun 2011
|Hannigan Brett T
|Perceptual Modeling of Media Signals for Data Hiding
|20 Oct 2005
|22 Ago 2007
|Digital watermark method capable of resisting geometric attack and conventional attack
|16 Oct 2006
|24 Sep 2008
|Robust two-value text image multi-watermark realizing method
|16 Oct 2006
|24 Sep 2008
|Method for local non-linear geometric attack resisting watermark based on image phase characteristic
|27 Ago 2003
|5 Nov 2008
|Copy protection via redundant watermark encoding
|11 Dic 2002
|2 Jul 2003
|Sony United Kingdom Limited
|Data processing apparatus and method
|11 Dic 2002
|9 Jul 2003
|Sony United Kingdom Limited
|Data processing apparatus and method
|30 Jul 2001
|7 Feb 2002
|Verizon Lab Inc
|Systems and methods for etching digital watermarks
|28 Ago 2002
|6 Mar 2003
|Univ North Carolina
|Automated digital watermarking methods using neural networks
|4 Jul 2006
|11 Ene 2007
|Commw Scient Ind Res Org
|Image watermarking
|Clasificación de EE.UU.
|Clasificación internacional
|Clasificación cooperativa
|Clasificación europea
|25 Feb 2002
|7 May 2002
|Certificate of correction
|26 Ene 2005
|Fee payment
Year of fee payment: 4
|23 Ene 2009
|Fee payment
Year of fee payment: 8
|23 Ene 2013
|Fee payment
Year of fee payment: 12


text:
Originally posted by AgentSmith
It's not a movie btw, it's a TV show. A TV show the writer's have admitted they made up as they went along to the point that they didn't even know where they were going with it anymore and it became completely absurd. Sound familiar?
Originally posted by BishopNGreen
Interesting. You may be reaching a little further than you can grasp. Fiction, both Lost and your Bible, is entertainment that is purposefully slanted for those of narrow mind...a simple, elegant trap. Good luck freeing yourself. It's a struggle we all must face for it is the human condition.
Originally posted by Consequence
Neither the show "LOST" or the content in the Bible is real.
Originally posted by EnochWasRight
Can an image be the real thing?


text:
If you pay attention to our society, you'll realize that we're all forced to constantly judge our windows of freedom. We say we're free, and we might even think we're free, but the truth is that we have all become adept at operating within our window of possibilities--according to the dictation of authority. In this episode of The Axiom Amnesia Theory, Heit & Cheri have a candid conversation about the reality of our apparent lack of freedoms and the subsequent judgement of others in the process.
Topics discussed include debate over homeowners' front yard gardens, property and land ownership, limited choices and lack of personal freedoms, desire to control people and things that don't affect you, sagging pants, judging people by the content of their character versus how they dress, making a good point for a bad argument, people trying to control the physical appearance and behavior of others, Shorty Lo and his baby mommas, judging character and respectability based on physical appearance, people wanting to be like the rich elites, non-participation in the wrongheaded ideals as a compromise, vilification of natural hair and sagging pants, and more!
Released January 15, 2013


text: Not much needs to be said. This is one of the best sushi spots I've been to date! The food is freshly made and the waiter catered to our every need. He ensured that we were served exacted what we wanted and the chef had gone above and beyond to make a great variety of sushi of us. We will... read more


text:
Shaq Threw Down This Monster Two Hand Dunk After Charles Barkley Called Him Out
Charles Barkley bet that Shaq didn't have it in him to hit a two hand dunk at his age. This didn't end well.UPROXX
- lifecellSponsored
How Older Men Tighten Their Skin
Men, reduce the look of wrinkles, sagging skin and fine lines with this affordable and effective skin tightening treatment without leaving your home.
Kevin Hart Got Robbed In His Ridiculous 3-Point Shootout Against Draymond Green
Hart tied DRAY! WE need a do-over!UPROXX
There's A New Three-Point Shootout King In The Splash Brother Family
Klay Thompson dethroned Steph Curry with an epic final round performance.UPROXX
John Calipari ejected less than three minutes into Saturday's win
The Kentucky coach's outburst inspired one of the Wildcats' best efforts of the season at South Carolina.The Dagger
Raikkonen back in the hotseat
With Ferrari's 2016 Formula 1 car launch set to happen in the next few weeks, Kimi Raikkonen was at Maranello to test out an important component of the set-up - the seat.Omnisport Video
- auto-insurance-discountsSponsored
Do NOT pay your insurance until you try this.
If you drive less than 55 miles/day OR have no DUI's you can get auto insurance for as low as $29/ Month! See if you qualify.
U.S. women move closer to Olympics with controversial victory over Mexico
Carli Lloyd's late goal gave the USWNT a 1-0 victory over El Tri and left them one win from qualifying for the Rio Games.FC Yahoo
It was all fun and games until Kevin Hart tied Draymond Green in a 3-point contest
When Kevin Hart challenged Warriors forward Draymond Green to a 3-point contest last week, we all had a good laugh.Ball Don't Lie
Klay Thompson downs Stephen Curry to win the Three-Point Shootout
The two teammates absolutely went off in the final round.Ball Don't Lie
Stardust Crashed Stephen Amell's Panel At Dallas Comic Con
UPDATE: WWE has just posted full video of the event.During a Stephen Amell spotlight panel at this year's Dallas Comic Con, fans in attendance got an unexpected panelist who joined the festivities in WWE Superstar, Stardust.BREAKING: @StardustWWE just crashed @amellywood's panel at [...]Comicbook.com
- American Express®Sponsored
Starwood Credit Card
Earn 25,000 Bonus Starpoints®! Use toward Award Nights or Flights.
American Pharoah has 1st date; breeding career is on
The first date is over for Triple Crown winner American Pharoah. An 11-year-old mare named Untouched Talent was the lucky first lady at Coolmore's Ashford Stud in Versailles, Kentucky, on Friday morning as thoroughbred racing's breeding season opened on a Valentine's weekend. The mare that is in…The Associated Press
Venus claims inaugural Taiwan Open
Venus Williams claimed her 49th career title as she took out the inaugural Taiwan Open with a straight-sets win over Misaki Doi.Omnisport
Mickelson regrets driver change at Pebble
Phil Mickelson regrets changing drivers at the 2016 AT&T Pebble Beach Pro-Am.NBC on Yahoo Sports
The Time Kobe Bryant Almost Cracked Gregg Popovich In The Face With His Elbow
Pop learned first-hand how hard it is to defend Kobe on Saturday.UPROXX
- FetchaRateSponsored
Attn Home Owners Who Never Miss a Payment.
Home Owners who have not missed a payment in 3 years or more need to read this. If you owe less than $625,000 on your home there is a solution.
Pogba aims to emulate Messi
Lionel Messi has been giving Paul Pogba advice as the Juventus star dreams of winning the Ballon d'Or at some stage in his career.Omnisport
Watch this drone pull a full grown man and witness the humble beginnings of Droneboarding
Snowboarding's new mod is getting a lot of attention. Drone builder and Youtuber Valplushka has been touted as introducing the sport to the world in one of his posted videos. That's not exactly true. A YouTuber by the name of Kaspars Balamovskis posted an arguably more awesome adult version of the…Digital Trends
Here's Why The Washington Redskins Are Opening Their Own Restaurant
If you live in Loudoun County Virginia, you're about to get a brand new dining establishment courtesy of Dan Snyder and the Redskins.UPROXX
Russell Westbrook dishes on Iverson, Los Angeles and the Golden State Warriors
Oklahoma City Thunder guard Russell Westbrook explains why Los Angeles is his favorite road city, Allen Iverson's impact on the league and matching up with the Golden State Warriors.Sports Illustrated Videos
- FetchaRateSponsored
Banks Are Worried Homeowners Will Do This.
Homeowners are surprised and furious. If you owe less than $625,000 on your home, you better read this.
Australian shepherd wins agility at Westminster
NEW YORK (AP) — A high-leaping Australian shepherd named Holster scrambled and sprang to take the Westminster Kennel Club agility title Saturday, seeming undaunted by anything the obstacle course could throw at him.Associated Press
I almost didn't pick Welbeck, reveals Wenger
Match-winner Danny Welbeck was almost left out of Arsenal's squad against Leicester City, Arsene Wenger has confirmed.Omnisport
The FBI Questioned Jeremy Shockey About An Insane Gambling And Drug Ring
Jeremy Shockey was a friend of a former USC football player arrested for running an illegal crime ring, and now the FBI has some questions.UPROXX


text:
Results 1 to 2 of 2
Thread: The new rams punter..Big Jessie
-08-13-2004 #1general counsel Guest
The new rams punter..Big Jessie
Many of us have lamented the fact that our current punter has been around so long that when he started in the NFL, the single wing was the most popular offensive formation.
I was pretty impressed with jesse nicasso last night. He hit a few boomers, even with the repeated penalties forcing him to kick consecutively.
Is he by any chance related to ron jessie?
If the kid keeps kicking like he did last night, i say that we waive landetta.
ramming speed to all
general counsel
-08-14-2004 #2JellyOpal Guest
Re: The new rams punter..Big Jessie
Martz has been unhappy with the players in the punter position for a few years now. He seemed content with Landeta's punting, but I never was. I thought Nicassio's performance on Thursday was outstanding. I hope Martz stopped yelling at Smoker long enough to notice.
Similar Threads
Rams Playoff HistoryBy OldRamsfan in forum RAM TALKReplies: 17Last Post: -02-09-2009, 10:14 AM
RamView, 12/11/2006: Bears 42, Rams 27 (Long)By MFranke in forum RAM TALKReplies: 5Last Post: -12-13-2006, 11:53 PM
RamView, 11/12/2006: Seahawks 24, Rams 22 (Long)By MFranke in forum RAM TALKReplies: 2Last Post: -11-13-2006, 04:04 PM
RamView, 9/11/2005: ***** 28, Rams 25 (Long)By MFranke in forum RAM TALKReplies: 0Last Post: -09-12-2005, 09:06 AM
Falcons Should Not Underestimate RamsBy RamDez in forum RAM TALKReplies: 0Last Post: -01-15-2005, 03:24 PM


text:
AdBlock blows! Please disable the add-on to ensure you get the most out of Tube8's features and functionality. Read about why you shouldn't use AdBlock. Close
Add to Favorite List:
Create a new folder:
Next »
Squirting with her Panties On
Recognize a pornstar in this video?
Help make pornstars easier to find on Tube8 by telling us who is in this video.
Thanks! The pornstar names will be added to this video when enough users submit the same names.
You must enter a pornstar name that already exists in our database.
- Description: Watch as she fingers her Pussy to make it Wet n Juicy and then Squirts
- Tags: homemade, real, squirt, fingers
- Pornstars: Add Pornstar
- Favorite by: 104
- Featured: 2 years ago
- Report This Video
Video Comments
All Video Comments (1)
1 year ago
1 year ago
Take your fingers out and let me put my cock in. AND cum all over me. I love squirting cunt
- 0 people liked this -


text:
AdBlock blows! Please disable the add-on to ensure you get the most out of Tube8's features and functionality. Read about why you shouldn't use AdBlock. Close
Add to Favorite List:
Create a new folder:
Next »
EroticaX Young couple feeling up to Real Orgasm
Recognize a pornstar in this video?
Help make pornstars easier to find on Tube8 by telling us who is in this video.
Thanks! The pornstar names will be added to this video when enough users submit the same names.
You must enter a pornstar name that already exists in our database.
- Description: Young couple fucking turns into real orgasm
- Tags: outside, raven, petite, fingering, jerking
- Pornstars: Add Pornstar
- Favorite by: 368
- Featured: 1 year ago
- Report This Video
Video Comments
Top Video Comments
All Video Comments (4)
11 months ago
11 months ago
One hell of a squirt at the end, it was all round her neck. Strange how one minute the suns setting and then it appears to be day light?
- 0 people liked this -
1 year ago
1 year ago
Good vid til he pulls out and cums on her stomach...too fucking lame!! Just jerk off next time!
- 0 people liked this -


text:
With the new EDs and the good charisma sorcs can achieve, they can preform some wizard tasks in epic hards.
But then again, wizards can now blast for 6k-15k damage AoE.
I honestly don't think there's much room to compare between those two classes, even if they cast the same spells.
It's a matter of play style and nothing more.
Personally I was aiming to build an EE ready sorc with all the casters PL, but I stopped the second I TRed into a wizard because I remembered how fun it is. Sure, a bazooka will kill everything, but it's way more fun to kill them with an army knife.
I prefer Crowd control over direct damage, so i play wizards. I've never been a huge fan of evokers, any newbie can play a direct damage character.
6 months... I believe this counts as a thread necro? ^^
I can honestly say I dislike playing wizards as they are now. I'm looking forward to the changes we can see on Lamannia right now, as those will get me to try one out in earnest (tasty tasty lich shroud...)
What I do enjoy is playing a sorcerer and being capable of nuking the overloving **** out of everything in my immediate vicinity. It's nothing if not satisfying, and I can probably end up with 3600-3800 SP by level 25, possibly more if I pony up the cost for a stat tome. that's worth it enough to me.
Last edited by Halia; 07-08-2013 at 06:21 AM.
This form's session has expired. You need to reload the page.Reload


text:
Burr grew up in Rochester, NY and got his start in
comedy by placing third in the 1994 "Funniest
Person in
Rochester Contest". He has since gone on to
become a
favorite at comedy clubs and college campuses
across the United
States and Canada and also makes regular
trips overseas to
entertain US troops stationed in places such
as Iraq, Kuwait,
Afghanistan and Japan.
addition to his stand-up career, Steve is the host of his own
iTunes podcast show, "The
Threesome Show", has traveled the country as the face of
the webisode series, "Odd America" and
is also the creator/producer/MC of the annual fund-raising
event, "Comics Against Cancer".
that when people go to a comedy show they are there for one
reason...to laugh, Steve
naturally gets them to do just that. Combining great story
telling, everyday observations,
with the audience and the simple desire to have fun, he brings
the complete comedy
to the stage. Steve likes to give everyone a night away
from it all and uses his personal
of hilarity to do just that. He always seems to be having
the best time on stage and with his
antics you can't help but like him. So if you're looking
for some good, clean fun, something a
different than anything you've experienced before, spend some
time with Steve Burr and let
roller coaster ride begin.
© 2011-2014 Steve Burr
All Rights Reserved Bio
| Resume | Schedule |
| Store | Media |
Blog | Podcast
| Home