Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
217 words
A method for applying a digital watermark to an image, comprising the steps of: (A) deriving from the image a plurality of component images, wherein each component image contains coefficients; (B) providing at least one look-up table containing a plurality of coefficients and corresponding values, wherein at least some of the look-up table coefficients match coefficients in said component images; (C) embedding said watermark in said image by performing the following substeps for at least some of said component images: (1) selecting a coefficient into which a marking value, representative of a corresponding portion of the watermark, is to be embedded; (2) using the value of the selected coefficient to identify a corresponding value in said look-up table(s); (3) leaving the selected coefficient unchanged if the corresponding value is the same as the marking value; and (4) changing the selected coefficient if the corresponding value is different from the marking value; further comprising the step of identifying selected coefficients as being unembeddable, wherein said unembeddable coefficients are not employed in step (C) to embed marking values, and wherein some of said coefficients are identified as DC coefficients, and said DC coefficients are considered unembeddable; and further comprising selecting a threshold value, wherein coefficients having a value below said threshold value are considered small valued and thus unembeddable.
Claim 2
Independent Claim
217 words
A method for applying a digital watermark to an image, comprising the steps of: (A) deriving from the image a plurality of component images, wherein each component image contains coefficients; (B) providing at least one look-up table containing a plurality of coefficients and corresponding values, wherein at least some of the look-up table coefficients match coefficients in said component images; (C) embedding said watermark in said image by performing the following substeps for at least some of said component images: (1) selecting a coefficient into which a marking value, representative of a corresponding portion of the watermark, is to be embedded; (2) using the value of the selected coefficient to identify a corresponding value in said look-up table(s); (3) leaving the selected coefficient unchanged if the corresponding value is the same as the marking value; and (4) changing the selected coefficient if the corresponding value is different from the marking value; further comprising the step of identifying selected coefficients as being unembeddable, wherein said unembeddable coefficients are not employed in step (C) to embed marking values, and wherein some of said coefficients are identified as DC coefficients, and said DC coefficients are considered unembeddable; and further comprising selecting a threshold value, wherein coefficients having a value below said threshold value are considered small valued and thus unembeddable.
Claim 3
Independent Claim
201 words
A method for applying a digital watermark to an image, comprising the steps of: (A) deriving from the image a plurality of component images, wherein each component image contains coefficients; (B) providing at least one look-up table containing a plurality of coefficients and corresponding values, wherein at least some of the look-up table coefficients match coefficients in said component images; and (C) embedding said watermark in said image by performing the following substeps for at least some of said component images: (1) selecting a coefficient into which a marking value, representative of a corresponding portion of the watermark, is to be embedded; (2) using the value of the selected coefficient to identify a corresponding value in said look-up table(s); (3) leaving the selected coefficient unchanged if the corresponding value is the same as the marking value; and (4) changing the selected coefficient if the corresponding value is different from the marking value; further comprising the step of identifying selected coefficients as being unembeddable, wherein said unembeddable coefficients are not employed in step (C) to embed marking values; and further comprising selecting a plurality of threshold values, wherein coefficients having values below said threshold values are considered small valued and thus unembeddable.
Claim 4
Independent Claim
201 words
A method for applying a digital watermark to an image, comprising the steps of: (A) deriving from the image a plurality of component images, wherein each component image contains coefficients; (B) providing at least one look-up table containing a plurality of coefficients and corresponding values, wherein at least some of the look-up table coefficients match coefficients in said component images; and (C) embedding said watermark in said image by performing the following substeps for at least some of said component images: (1) selecting a coefficient into which a marking value, representative of a corresponding portion of the watermark, is to be embedded; (2) using the value of the selected coefficient to identify a corresponding value in said look-up table(s); (3) leaving the selected coefficient unchanged if the corresponding value is the same as the marking value; and (4) changing the selected coefficient if the corresponding value is different from the marking value; further comprising the step of identifying selected coefficients as being unembeddable, wherein said unembeddable coefficients are not employed in step (C) to embed marking values; and further comprising selecting a plurality of threshold values, wherein coefficients having values below said threshold values are considered small valued and thus unembeddable.
Claim 5
Independent Claim
282 words
A method for applying a digital watermark to an image, comprising the steps of: (A) deriving from the image a plurality of component images, wherein each component image contains coefficients; (B) providing at least one look-up table containing a plurality of coefficients and corresponding values, wherein at least some of the look-up table coefficients match coefficients in said component images; (C) shuffling the coefficients prior to said embedding step; and (D) embedding said watermark in said image by performing the following substeps for at least some of said component images: (1) selecting a coefficient into which a marking value, representative of a corresponding portion of the watermark, is to be embedded; (2) using the value of the selected coefficient to identify a corresponding value in said look-up table(s); (3) leaving the selected coefficient unchanged if the corresponding value is the same as the marking value; and (4) changing the selected coefficient if the corresponding value is different from the marking value; wherein the image is divided into a plurality of component images of n×m pixels, wherein n and m are integers, and wherein each component image is transformed using the discrete cosine transform (DCT) into n×m transform coefficients; wherein the corresponding values in said look-up table(s) are binary-valued and are constrained to have a prescribed maximum run length of either binary value; wherein, in the embedding substep (D)(4), the selected coefficient is changed minimally to a value having a corresponding value in the look-up table(s) whose value is the same as the marking value, wherein the selected coefficient is changed minimally by changing its value to that of the nearest coefficient having a corresponding look-up table value equal to the marking value.
Claim 6
Independent Claim
282 words
A method for applying a digital watermark to an image, comprising the steps of: (A) deriving from the image a plurality of component images, wherein each component image contains coefficients; (B) providing at least one look-up table containing a plurality of coefficients and corresponding values, wherein at least some of the look-up table coefficients match coefficients in said component images; (C) shuffling the coefficients prior to said embedding step; and (D) embedding said watermark in said image by performing the following substeps for at least some of said component images: (1) selecting a coefficient into which a marking value, representative of a corresponding portion of the watermark, is to be embedded; (2) using the value of the selected coefficient to identify a corresponding value in said look-up table(s); (3) leaving the selected coefficient unchanged if the corresponding value is the same as the marking value; and (4) changing the selected coefficient if the corresponding value is different from the marking value; wherein the image is divided into a plurality of component images of n×m pixels, wherein n and m are integers, and wherein each component image is transformed using the discrete cosine transform (DCT) into n×m transform coefficients; wherein the corresponding values in said look-up table(s) are binary-valued and are constrained to have a prescribed maximum run length of either binary value; wherein, in the embedding substep (D)(4), the selected coefficient is changed minimally to a value having a corresponding value in the look-up table(s) whose value is the same as the marking value, wherein the selected coefficient is changed minimally by changing its value to that of the nearest coefficient having a corresponding look-up table value equal to the marking value.
Claim 7
Dependent Claim
22 words
A method as recited in claim 3 , wherein, prior to the embedding step (C), the image is compressed using JPEG compression.
Claim 8
Dependent Claim
57 words
A method as recited in claim 3 , further comprising the step of shuffling the coefficients prior to said embedding step, wherein said shuffling step comprises concatenating the coefficients of a plurality of component images into a string and shuffling the order of the coefficients in said string; and wherein, after embedding, the string is inverse shuffled.
Claim 9
Dependent Claim
34 words
A method as recited in claim 3 , wherein the marking value is embedded multiple times in each component image, whereby a majority voting process may be employed to decode the respective component images.
Claim 10
Dependent Claim
30 words
A method as recited in claim 3 , wherein the marking value is embedded using error correction encoding, and wherein error correction decoding is employed to extract the marking values.
Claim 11
Dependent Claim
30 words
A method as recited in claim 7 , wherein the error correction encoding comprises embedding of the marking value multiple times and the decoding comprises the use of majority voting.
Claim 12
Dependent Claim
32 words
A method as recited in claim 3 , wherein the marked image is decodable to determine whether it has been altered and, if so, where in the image such alterations were made.
Claim 13
Dependent Claim
21 words
A method as recited in claim 3 , further comprising the step of storing the marked image in a lossy-compression form.
Claim 14
Dependent Claim
19 words
A method as recited in claim 3 , wherein the method is used in a digital camera or camcorder.
Claim 15
Independent Claim
328 words
A method for applying a digital watermark to an image, comprising the steps of: (A) deriving from the image a plurality of component images, wherein each component image contains coefficients; (B) providing at least one look-up table containing a plurality of coefficients and corresponding values, wherein at least some of the look-up table coefficients match coefficients in said component images; (C) shuffling the coefficients; and (D) embedding said watermark in said image by performing the following substeps for at least some of said component images: (1) selecting a coefficient into which a marking value, representative of a corresponding portion of the watermark, is to be embedded; (2) using the value of the selected coefficient to identify a corresponding value in said look-up table(s); (3) leaving the selected coefficient unchanged if the corresponding value is the same as the marking value; and (4) changing the selected coefficient if the corresponding value is different from the marking value; wherein the image is divided into a plurality of component images of n×m pixels, wherein n and m are integers, and wherein each component image is transformed using the discrete cosine transform (DCT) into n×m transform coefficients; wherein the corresponding values in said look-up table(s) are binary-valued and are constrained to have a prescribed maximum run length of either binary value; wherein, in the embedding substep (C)(4), the selected coefficient is changed minimally to a value having a corresponding value in the look-up table(s) whose value is the same as the marking value, wherein the selected coefficient is changed minimally by changing its value to that of the nearest coefficient having a corresponding look-up table value equal to the marking value; and further comprising the step of identifying selected coefficients as being unembeddable, wherein said unembeddable coefficients are not employed in step (C) to embed marking values; wherein some of said coefficients are identified as DC coefficients that are considered unembeddable; and wherein coefficients having values below threshold values are considered unembeddable.
Claim 16
Independent Claim
328 words
A method for applying a digital watermark to an image, comprising the steps of: (A) deriving from the image a plurality of component images, wherein each component image contains coefficients; (B) providing at least one look-up table containing a plurality of coefficients and corresponding values, wherein at least some of the look-up table coefficients match coefficients in said component images; (C) shuffling the coefficients; and (D) embedding said watermark in said image by performing the following substeps for at least some of said component images: (1) selecting a coefficient into which a marking value, representative of a corresponding portion of the watermark, is to be embedded; (2) using the value of the selected coefficient to identify a corresponding value in said look-up table(s); (3) leaving the selected coefficient unchanged if the corresponding value is the same as the marking value; and (4) changing the selected coefficient if the corresponding value is different from the marking value; wherein the image is divided into a plurality of component images of n×m pixels, wherein n and m are integers, and wherein each component image is transformed using the discrete cosine transform (DCT) into n×m transform coefficients; wherein the corresponding values in said look-up table(s) are binary-valued and are constrained to have a prescribed maximum run length of either binary value; wherein, in the embedding substep (C)(4), the selected coefficient is changed minimally to a value having a corresponding value in the look-up table(s) whose value is the same as the marking value, wherein the selected coefficient is changed minimally by changing its value to that of the nearest coefficient having a corresponding look-up table value equal to the marking value; and further comprising the step of identifying selected coefficients as being unembeddable, wherein said unembeddable coefficients are not employed in step (C) to embed marking values; wherein some of said coefficients are identified as DC coefficients that are considered unembeddable; and wherein coefficients having values below threshold values are considered unembeddable.
Claim 17
Independent Claim
266 words
A method for applying a digital watermark to an image, comprising the steps of: (A) deriving from the image a plurality of component images, wherein each component image contains coefficients; (B) providing at least one look-up table containing a plurality of coefficients and corresponding values, wherein at least some of the look-up table coefficients match coefficients in said component images; (C) shuffling the coefficients prior to said embedding step; and (D) embedding said watermark in said image by performing the following substeps for at least some of said component images: (1) selecting a coefficient into which a marking value, representative of a corresponding portion of the watermark, is to be embedded; (2) using the value of the selected coefficient to identify a corresponding value in said look-up table(s); (3) leaving the selected coefficient unchanged if the corresponding value is the same as the marking value; and (4) changing the selected coefficient if the corresponding value is different from the marking value. wherein the image is divided into a plurality of component images of size n×m pixels, wherein n and m are integers, and wherein each component image is transformed into coefficients; further comprising the step of shuffling the coefficients prior to said embedding step; wherein said shuffling step comprises concatenating the coefficients of a plurality of component images into a string and shuffling the order of the coefficients in said string; and wherein the shuffled string of coefficients are put into a plurality of sub-strings and each sub-string is used to embed one watermark or is to be used for error detection or for error correction.
Claim 18
Independent Claim
266 words
A method for applying a digital watermark to an image, comprising the steps of: (A) deriving from the image a plurality of component images, wherein each component image contains coefficients; (B) providing at least one look-up table containing a plurality of coefficients and corresponding values, wherein at least some of the look-up table coefficients match coefficients in said component images; (C) shuffling the coefficients prior to said embedding step; and (D) embedding said watermark in said image by performing the following substeps for at least some of said component images: (1) selecting a coefficient into which a marking value, representative of a corresponding portion of the watermark, is to be embedded; (2) using the value of the selected coefficient to identify a corresponding value in said look-up table(s); (3) leaving the selected coefficient unchanged if the corresponding value is the same as the marking value; and (4) changing the selected coefficient if the corresponding value is different from the marking value. wherein the image is divided into a plurality of component images of size n×m pixels, wherein n and m are integers, and wherein each component image is transformed into coefficients; further comprising the step of shuffling the coefficients prior to said embedding step; wherein said shuffling step comprises concatenating the coefficients of a plurality of component images into a string and shuffling the order of the coefficients in said string; and wherein the shuffled string of coefficients are put into a plurality of sub-strings and each sub-string is used to embed one watermark or is to be used for error detection or for error correction.
Claim 19
Independent Claim
266 words
A method for applying a digital watermark to an image, comprising the steps of: (A) deriving from the image a plurality of component images, wherein each component image contains coefficients; (B) providing at least one look-up table containing a plurality of coefficients and corresponding values, wherein at least some of the look-up table coefficients match coefficients in said component images; (C) shuffling the coefficients prior to said embedding step; and (D) embedding said watermark in said image by performing the following substeps for at least some of said component images: (1) selecting a coefficient into which a marking value, representative of a corresponding portion of the watermark, is to be embedded; (2) using the value of the selected coefficient to identify a corresponding value in said look-up table(s); (3) leaving the selected coefficient unchanged if the corresponding value is the same as the marking value; and (4) changing the selected coefficient if the corresponding value is different from the marking value. wherein the image is divided into a plurality of component images of size n×m pixels, wherein n and m are integers, and wherein each component image is transformed into coefficients; further comprising the step of shuffling the coefficients prior to said embedding step; wherein said shuffling step comprises concatenating the coefficients of a plurality of component images into a string and shuffling the order of the coefficients in said string; and wherein the shuffled string of coefficients are put into a plurality of sub-strings and each sub-string is used to embed one watermark or is to be used for error detection or for error correction.
Claim 20
Independent Claim
266 words
A method for applying a digital watermark to an image, comprising the steps of: (A) deriving from the image a plurality of component images, wherein each component image contains coefficients; (B) providing at least one look-up table containing a plurality of coefficients and corresponding values, wherein at least some of the look-up table coefficients match coefficients in said component images; (C) shuffling the coefficients prior to said embedding step; and (D) embedding said watermark in said image by performing the following substeps for at least some of said component images: (1) selecting a coefficient into which a marking value, representative of a corresponding portion of the watermark, is to be embedded; (2) using the value of the selected coefficient to identify a corresponding value in said look-up table(s); (3) leaving the selected coefficient unchanged if the corresponding value is the same as the marking value; and (4) changing the selected coefficient if the corresponding value is different from the marking value. wherein the image is divided into a plurality of component images of size n×m pixels, wherein n and m are integers, and wherein each component image is transformed into coefficients; further comprising the step of shuffling the coefficients prior to said embedding step; wherein said shuffling step comprises concatenating the coefficients of a plurality of component images into a string and shuffling the order of the coefficients in said string; and wherein the shuffled string of coefficients are put into a plurality of sub-strings and each sub-string is used to embed one watermark or is to be used for error detection or for error correction.