Method for embedding watermark image
A technology of watermark image and watermark embedding, applied in the field of image processing, can solve the problems of difficult blind extraction, reducing imperceptibility, and high difficulty in embedding
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1)
[0049] See Figure 1-3 , the embedding object of the watermark image in this embodiment is a matrix as The original carrier image (M=N=512, that is, the image whose length and width are 512 pixels), its format is an uncompressed 8-bit high-precision grayscale bitmap (bmp or tiff), and JPG format can also be selected image. The grayscale watermark image generally selects a trademark or copyright mark, and the total number of pixels n is required to be smaller than that of the carrier image (n<M / 8*N / 8). In the embodiment, a grayscale watermark with a pixel size of 40×49 is selected.
[0050] The steps of determining the embedding position of the carrier image and embedding the grayscale watermark information are as follows:
[0051] (1) Preprocessing of watermarked images. In order to ensure the security of the watermark, the watermark image is scrambled by some algorithms (such as chaotic sequence scrambling method, etc.), and the scrambled image is recorded as W, and the i...
Embodiment 2)
[0070] The recovery and authentication steps of the grayscale watermarked image are as follows:
[0071] (a) For the original carrier image matrix is , the watermarked image to be checked is , respectively divided into a corresponding number of 8×8 image blocks that do not cover each other, and perform DCT transformation on each image block, and extract the corresponding low-frequency and high-frequency data from each 8×8 image block according to the 8×8 template, and Construct a 3×3 matrix for the low-frequency and high-frequency data in each 8×8 image block in the original carrier image with a 6x6 matrix , for the low-frequency and high-frequency data in each 8×8 image block of the watermarked image, respectively form a matrix of 3×3 matrix with a 6x6 matrix , for the matrix , Separate singular value decomposition: , ;
[0072] (b) Solve the change value of watermark information in each 8×8 image block , , m is the total number of blocks that the origi...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com