IP Library Patent Application 11750591
Patent Application
App. No. 11/750,591

GENERALIZED LOSSLESS DATA HIDING USING MULTIPLE PREDICTORS

Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US None
App. No.
11/750,591
Abstract

A system and methodology for encoding or decoding hidden data, such as a digital watermark, in visual raster media is provided. The lossless data hiding methodology uses multiple predictors to choose an embedding location to be either a low variance region or a high variance region. Bijective mirror mapping is used to encode hidden data at an embedding location and bijective pixel value shifting is performed to ensure reversibility back to the original image without additional information. The system and methodology can be used either in the spatial domain or the wavelet domain. The Peak Signal to Noise Ratio and the payload capacity are relatively high with the methodology.

Claims (49)

1 . A method of data hiding for raster images, comprising:

for each pixel of at least two pixels of an original raster image,

determining a first predicted value for the pixel based on a first predictor;

determining a second predicted value for the pixel based on a second predictor;

determining if the pixel is a candidate position based at least in part on a difference between the first predicted value and the second predicted value; and

if the pixel is a candidate position,

encoding at least one hidden bit using bijective mirror mapping; or

using bijective pixel value shifting to ensure reversibility back to the original raster image when decoded.

2 . The method of claim 1 , wherein the encoding includes encoding at least one digital watermark.

3 . The method of claim 1 , wherein the determining if the pixel is a candidate position includes determining if the pixel is a high variance region.

4 . The method of claim 1 , wherein the determining if the pixel is a candidate position includes determining if the pixel is a low variance region.

5 . The method of claim 1 , wherein the first predictor and the second predictor are the same predictor and wherein the determining of the candidate position based at least in part on a difference between the first predicted value and the second predicted value includes determining an embedding location based at least in part on a difference between the first predicted value and the second predicted value plus or minus a predetermined constant.

6 . The method of claim 1 , wherein the encoding includes encoding at least one hidden bit using bijective mirror mapping when the value of the pixel is within a range of a pre-defined function of the first predicted value and the second predicted value.

7 . The method of claim 1 , wherein at least one of the determining a first predicted value for the pixel based on a first predictor or the determining of the second predicted value for the pixel based on a second predictor includes determining a value for the pixel based on a casual neighborhood.

8 . The method of claim 1 , wherein the at least two pixels of the original raster image includes all pixels of the original raster image except for the first row of the original raster image and the first column of the original raster image.

9 . The method of claim 1 , further comprising:

receiving an indication of the first predictor and the second predictor.

10 . The method of claim 1 , further comprising:

for each pixel of at least two pixels of an original raster image,

determining a third predicted value for the pixel based on a third predictor;

determining a fourth predicted value for the pixel based on a fourth predictor; and

determining if the pixel is a candidate position based at least in part on a difference between the third predicted value and the fourth predicted value.

11 . A computer-readable medium containing computer-executable operations for performing the method of claim 1 .

12 . A digital watermarking system comprising:

a plurality of predictor components, each predictor component configured to determine a predicted value of a unit of a raster image;

a bijective mirror mapping component configured to embed hidden data in the raster image by using bijective mirror mapping;

a bijective pixel value shifting component configured to use bijective pixel value shifting to ensure reversibility back to the raster image without hidden data;

a candidate position component configured to determine candidate positions based at least in part on the difference between predicted values determined by the plurality of predictor components; and

a scan component configured to scan each of at least two units of the raster image.

13 . The system of claim 12 , wherein the unit is a coefficient and further comprising a transformation component configured to perform wavelet transform on the raster image.

14 . A method of recovering a digital watermark in a raster image, comprising:

for each of at least two units of a watermarked raster image,

determining a first predicted value for the unit based on a first predictor;

determining a second predicted value for the unit based on a second predictor;

determining if the unit is an altered unit location based at least in part on the first predicted value, the second predicted value, and an actual value of the unit; and

when the unit is an altered unit location,

determining if the altered unit location is an embedding location; and

extracting at least one watermark bit if the altered unit location is an embedding location.

15 . The method of claim 14 , further comprising:

receiving an indication of the first predictor, the second predictor, and one or more variables used in determining if the altered unit location is an embedding location.

16 . The method of claim 14 wherein the unit is a pixel.

17 . The method of claim 14 , further comprising:

if the unit is an altered pixel location,

using inverse bijective mirror mapping if the altered unit location is an embedding location; and

using inverse bijective pixel value shifting if the altered unit location is not an embedding location.

18 . The method of claim 14 , further comprising:

indicating whether the at least one extracted watermark bit matches at least one predetermined watermark bit.

19 . The method of claim 14 , wherein the determining if the altered unit location is an embedding location includes determining whether the actual unit value is less than a result of applying a pre-defined function to a difference between the first predicted value and the second predicted value.

20 . A computer-readable medium containing computer-executable operations for performing the method of claim 14 .

Assignments (5)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 31, 2010
From: HONG KONG TECHNOLOGIES GROUP LIMITED
To: WONG TECHNOLOGIES L.L.C.
Reel/Frame 024921/0068 →
CONFIRMATORY ASSIGNMENT Recorded Apr 15, 2010
From: AU, OSCAR CHI LIM; YIP, SHU KEI
To: THE HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY
Reel/Frame 024238/0014 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 11, 2010
From: THE HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY
To: HONG KONG TECHNOLOGIES GROUP LIMITED
Reel/Frame 024067/0623 →
CORRECTIVE ASSIGNMENT TO CORRECT THE ASSIGNEE INFORMATION PREVIOUSLY RECORDED ON REEL 019314 AND FRAME 0848. Recorded Jun 11, 2007
From: AU, OSCAR CHI LIM; YIP, SHU KEI
To: HONG KONG UNIVERISTY OF SCIENCE AND TECHNOLOGY, THE
Reel/Frame 019413/0393 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 18, 2007
From: AU, OSCAR CHI LIM; YIP, SHU KEI
To: MICROSOFT CORPORATION
Reel/Frame 019314/0848 →