Patent US6453053B1 successfully refreshed from Google Patents.
← Back to Patent Explorer
US6453053B1 Expired / Lapsed US ⏱️ 0.0 years remaining

Identification data insertion and detection system for digital data

Assignee: NEC Personal Computers Ltd
•
Filing: 1997-12-19
•
Granted: 2002-09-17
•
Expires: 2017-12-19
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The invention provides an identification data insertion and detection system for digital data which improves the detection ratio when an image is converted into frequency components and electronic watermark data are embedded in a portion of an image having a strong frequency component and besides allows a statistical similarly to be calculated with a higher degree of accuracy. The identification data insertion system for digital data includes a DCT calculator for extracting blocks of 8x8 pixels from within a current image and performing DCT (discrete cosine transform) calculation for the blocks, a quantizer for quantizing data outputted from the DCT calculator, a quantization table for being referred to when the quantizer performs quantization, an electronic watermark data insertion element for inserting electronic watermark data into data after quantization, and an encoder for encoding data outputted from the electronic watermark data insertion element to produce MPEG data in which the electronic watermark data are inserted and outputting the MPEG data.

Inventors

  • 👤 Yutaka Wakasu

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-05 12:54
CPC Classifications
G; G06; G06T; G06T1/00; G06T1/0021; G06T1/005; H; H04; H04N; H04N19/00; H04N19/10; H04N19/102; H04N19/124; H04N19/126; H04N19/60; H04N19/61; H04N21/00; H04N21/20; H04N21/23; H04N21/238; H04N21/2389; H04N21/23892; H04N21/80; H04N21/83; H04N21/835; H04N21/8358; H04N5/00; H04N5/76; H04N5/91; H04N5/913; G06T2201/00; G06T2201/005; G06T2201/0052; G06T2201/0065; H04N2005/91307; H04N2005/91335

Claims Analysis

Total Claims: 8
Claim 1
Independent Claim 166 words
An electronic watermark insertion apparatus, comprising: conversion means for performing discrete cosine transform for an original image to convert the original image into data f(i) of frequency components, i being 1, 2, . . . , n; electronic watermark insertion means for multiplying a partial average of the data f(i) and electronic watermark data w(i) determined in advance for the individual factors (i), i being 1, 2, . . . , n, and adding the data f(i) to the results obtained by multiplying the results of the multiplication by a constant to determine an electronic watermark containing data F(i), i being 1, 2, . . . , n; quantization means for quantizing the data F(i) with a quantization step sizes Q(i), i being 1, 2, . . . , n; and coding means for compression coding the data after the quantization; the partial average of the data f(i) being given by (V(i−1)+V(i)+V(i+1))/3 where V(i−1)=|integral part of (f(i−1)/Q(i−1)×Q(i−1)|, V(i)=|integral part of (f(i)/Q(i)×Q(i)|, and V(i+1)=|integral part of (f(i+1)/Q(i+1)×Q(i+1)|.
Claim 2
Dependent Claim 166 words
An electronic watermark insertion apparatus, comprising: conversion means for performing discrete cosine transform for an original image to convert the original image into data f(i) of frequency components, i being 1, 2, . . . , n; electronic watermark insertion means for multiplying a partial average of the data f(i) and electronic watermark data w(i) determined in advance for the individual factors (i), i being 1, 2, . . . , n, and adding the data f(i) to the results obtained by multiplying the results of the multiplication by a constant to determine an electronic watermark containing data F(i), i being 1, 2, . . . , n; quantization means for quantizing the data F(i) with a quantization step sizes Q(i), i being 1, 2, . . . , n; and coding means for compression coding the data after the quantization; the partial average of the data f(i) being given by (V(i−1)+V(i)+V(i+1))/3 where V(i−1)=|integral part of (f(i−1)/Q(i−1)×Q(i−1)|, V(i)=|integral part of (f(i)/Q(i)×Q(i)|, and V(i+1)=|integral part of (f(i+1)/Q(i+1)×Q(i+1)|.
Claim 3
Dependent Claim 275 words
An electronic watermark detection apparatus to which data obtained by performing a discrete cosine transform for an original image to convert the original image into data f(i) of frequency components, i being 1, 2, . . . , n, multiplying a partial average of the data f(i) and electronic watermark data w(i) determined in advance for the individual factors (i), i being 1, 2, . . . , n, and adding the data f(i) to the results obtained by multiplying the results of the multiplication by a constant to determine electronic watermark containing data F(i), i being 1, 2, . . . , n, quantizing the data F(i) with quantizaiton step sizes Q(i), i being 1, 2, . . . , n, and then compression coding the data after the quantization, the partial average of the data f(i) being given by ( V ( i− 1)+ V ( i )+ V ( i+ 1))/3 where V(i−1)=|integral part of (f(i−1)/Q(i−1)×Q(i−1)|, V(i)=|integral part of (f(i)/Q(i)×Q(i)|, and V(i+1)=|integral part of (fi+1)/Q(i+1)×Q(i+1)|, the apparatus comprising: decoding means for decoding the compression coded data; dequantization means for dequantizing data F(i) obtained by the decoding, i being 1, 2, . . . , n; inverse discrete cosine transform means for performing an inverse discrete cosine transform for data obtained by the dequantization in order to restore the original image; and electronic watermark detection means for calculating a statistical similarity between values obtained by dividing the data F(i) by a partial average (|F(i−1)|+|F(i)|+|F(i+1)|)/3 of the data F(i) and the electronic watermark data to discriminate whether or not the electronic watermark is included in the data supplied to said electronic watermark detection apparatus.
Claim 4
Dependent Claim 275 words
An electronic watermark detection apparatus to which data obtained by performing a discrete cosine transform for an original image to convert the original image into data f(i) of frequency components, i being 1, 2, . . . , n, multiplying a partial average of the data f(i) and electronic watermark data w(i) determined in advance for the individual factors (i), i being 1, 2, . . . , n, and adding the data f(i) to the results obtained by multiplying the results of the multiplication by a constant to determine electronic watermark containing data F(i), i being 1, 2, . . . , n, quantizing the data F(i) with quantizaiton step sizes Q(i), i being 1, 2, . . . , n, and then compression coding the data after the quantization, the partial average of the data f(i) being given by ( V ( i− 1)+ V ( i )+ V ( i+ 1))/3 where V(i−1)=|integral part of (f(i−1)/Q(i−1)×Q(i−1)|, V(i)=|integral part of (f(i)/Q(i)×Q(i)|, and V(i+1)=|integral part of (fi+1)/Q(i+1)×Q(i+1)|, the apparatus comprising: decoding means for decoding the compression coded data; dequantization means for dequantizing data F(i) obtained by the decoding, i being 1, 2, . . . , n; inverse discrete cosine transform means for performing an inverse discrete cosine transform for data obtained by the dequantization in order to restore the original image; and electronic watermark detection means for calculating a statistical similarity between values obtained by dividing the data F(i) by a partial average (|F(i−1)|+|F(i)|+|F(i+1)|)/3 of the data F(i) and the electronic watermark data to discriminate whether or not the electronic watermark is included in the data supplied to said electronic watermark detection apparatus.
Claim 5
Dependent Claim 168 words
An electronic watermark insertion method, comprising: a conversion step of performing a discrete cosine transform for an original image in order to convert the original image into data f(i) of frequency components, i being 1, 2, . . . , n; an electronic watermark insertion step of multiplying a partial average of the data f(i) and electronic watermark data w(i) determined in advance for the individual factors (i), i being 1, 2, . . . , n, and adding the data f(i) to the results obtained by multiplying the results of the multiplication by a constant to determine an electronic watermark containing data F(i), i being 1, 2, . . . , n; a quantization step of quantizing the data F(i) with quantization step sizes Q(i), i being 1, 2, . . . , n; and a coding step of compression coding the data after the quantization; the partial average of the data f(i) being given by (V(i−1)+V(i)+V(i+1))/3 where V(i−1)=|integral part of (f(i−1)/Q(i−1)×Q(i−1)|, and V(i+1)=|integral part of (f(i+1)/Q(i+1)×Q(i−1)|.
Claim 6
Dependent Claim 168 words
An electronic watermark insertion method, comprising: a conversion step of performing a discrete cosine transform for an original image in order to convert the original image into data f(i) of frequency components, i being 1, 2, . . . , n; an electronic watermark insertion step of multiplying a partial average of the data f(i) and electronic watermark data w(i) determined in advance for the individual factors (i), i being 1, 2, . . . , n, and adding the data f(i) to the results obtained by multiplying the results of the multiplication by a constant to determine an electronic watermark containing data F(i), i being 1, 2, . . . , n; a quantization step of quantizing the data F(i) with quantization step sizes Q(i), i being 1, 2, . . . , n; and a coding step of compression coding the data after the quantization; the partial average of the data f(i) being given by (V(i−1)+V(i)+V(i+1))/3 where V(i−1)=|integral part of (f(i−1)/Q(i−1)×Q(i−1)|, and V(i+1)=|integral part of (f(i+1)/Q(i+1)×Q(i−1)|.
Claim 7
Dependent Claim 283 words
An electronic watermark detection method to which data obtained by performing a discrete cosine transform for an original image to convert the original image into data f(i) of frequency components, i being 1, 2, . . . , n, multiplying a partial average of the data f(i) and electronic watermark data w(i) determined in advance for the individual factors (i), i being 1, 2, . . . , n, and adding the data f(i) to the results obtained by multiplying the results of the multiplication by a constant in order to determine an electronic watermark containing data F(i), i being 1, 2, . . . , n, quantizing the data F(i) with quantization step sizes Q(i), i being 1, 2, . . . , n, and then compression coding the data after the quantization, the partial average of the data f(i) being given by ( V ( i− 1)+ V ( i )+ V ( i+ 1))/3 where V(i−1)=|integral part of (f(i−1)/Q(i)×Q(i−1)|, V(i)=integral part of (f(i)/Q(i)×Q(i)|, and V(i+1)=|integral part of (f(i+1)/Q(i+1)×Q(i+1)|, the method comprising: a decoding step of decoding the compression coded data; a dequantization step of dequantizing the data (i) obtained by the decoding, i being 1, 2, . . . , n; an inverse discrete cosine transform step of performing an inverse discrete cosine transform for data obtained by the dequantization in order to restore the original image; and an electronic watermark detection step of calculating a statistical similarity between values obtained by dividing the data F(i) by a partial average (|F(i−1)|+|F(i)|+|F(i+1)|)/3 of the data F(i) and the electronic watermark data to discriminate whether or not the electronic watermark is included in the data supplied to the electronic watermark detection method.
Claim 8
Dependent Claim 283 words
An electronic watermark detection method to which data obtained by performing a discrete cosine transform for an original image to convert the original image into data f(i) of frequency components, i being 1, 2, . . . , n, multiplying a partial average of the data f(i) and electronic watermark data w(i) determined in advance for the individual factors (i), i being 1, 2, . . . , n, and adding the data f(i) to the results obtained by multiplying the results of the multiplication by a constant in order to determine an electronic watermark containing data F(i), i being 1, 2, . . . , n, quantizing the data F(i) with quantization step sizes Q(i), i being 1, 2, . . . , n, and then compression coding the data after the quantization, the partial average of the data f(i) being given by ( V ( i− 1)+ V ( i )+ V ( i+ 1))/3 where V(i−1)=|integral part of (f(i−1)/Q(i)×Q(i−1)|, V(i)=integral part of (f(i)/Q(i)×Q(i)|, and V(i+1)=|integral part of (f(i+1)/Q(i+1)×Q(i+1)|, the method comprising: a decoding step of decoding the compression coded data; a dequantization step of dequantizing the data (i) obtained by the decoding, i being 1, 2, . . . , n; an inverse discrete cosine transform step of performing an inverse discrete cosine transform for data obtained by the dequantization in order to restore the original image; and an electronic watermark detection step of calculating a statistical similarity between values obtained by dividing the data F(i) by a partial average (|F(i−1)|+|F(i)|+|F(i+1)|)/3 of the data F(i) and the electronic watermark data to discriminate whether or not the electronic watermark is included in the data supplied to the electronic watermark detection method.

References Cited (Backward Citations)

US5848155A Cited
US5809139A Cited
US5915027A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2005-09-16 2006-03-18 2006-09-17 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2009-09-16 2010-03-18 2010-09-17 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2013-09-16 2014-03-18 2014-09-17 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag