Binary image fragile watermark embedding and extraction method based on topology structure

A binary image and topology technology, applied in image data processing, image data processing, instruments, etc., can solve the problems of being easily tampered, unrecognizable, troublesome, etc., and achieve the effect of ensuring visual hiding effect and fast hiding effect.

Inactive Publication Date: 2011-02-16
NANKAI UNIV
View PDF5 Cites 18 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The information hiding and extraction schemes that require the original image can often provide higher information hiding capacity, but it is relatively troublesome.
The information hiding and extraction scheme that ...

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Binary image fragile watermark embedding and extraction method based on topology structure
  • Binary image fragile watermark embedding and extraction method based on topology structure
  • Binary image fragile watermark embedding and extraction method based on topology structure

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0078] figure 2 A flow chart of an M200 embodiment for performing fragile watermark embedding processing on binary images according to the method of the present invention is given.

[0079] Such as figure 2 As shown, the method M200 starts at step S210.

[0080] In step S220, a basic file in bitmap format (BMP) is obtained from files in different formats of the binary image. At this time, each pixel has one bit to represent its black and white information. Next, we divide the image into the spatial domain and divide it into small blocks of equal size. Note that the small block does not have to be a square, it can be of size n 1 ×n 2 , 21 , n 2 <10 rectangles. We won't have to deal with the excess on the sides. Those skilled in the art will recognize that the size of the tiles is readily applicable to more than 3x3 tiles.

[0081] Then in step S230, we select a part from the several small blocks of the image divided above as blocks that meet the requirements and can e...

Embodiment 2

[0091] Pic 4-1 Algorithm 1 for generating hidden chains that can be embedded into information blocks according to the method of the present invention is given, and for 3×3 blocks, an example of block hidden chains generated according to Algorithm 1 is given. From image 3 In the example of , we conclude that flipping pixels with the same topology (one-stroke property) has a good visual hiding effect. According to Euler's basic research results on one-stroke painting, in fact, we only need to pay attention to the parity of the degree of vertices, and investigate whether the addition of vertices still conforms to the nature of one-stroke painting. Considering the need to extract information, the blocks after hiding information must still be in the set of embedded information blocks, so we can derive a block change chain of hidden information from a block that can embed information. In order to generate a set of blocks that can embed information, a generation chain can be deri...

Embodiment 3

[0093] Figure 5-1 Algorithm 2 of the embeddable information block set generated according to the method of the present invention is given, and an example of the embeddable information block set generated according to Algorithm 2 is given for a 3×3 block.

[0094] According to method M500, at first in step S510 adopt depth-first or breadth-first search (basic algorithm in graph theory) to generate a weight Those satisfying the properties i, ii, and iii above can be embedded in the set S of information blocks; then in step S520, select a block in S, and generate a chain of embeddable information blocks according to Algorithm 1. If the generated block is re- Appears to stop. Finally, all embeddable information block chains are merged to obtain the final set of embeddable information blocks. In order to make the algorithm flow easy to understand, here is an example, see Figure 5-2 . Thus we get a collection of blocks that can embed information that meets the requirements: ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to a binary image fragile watermark embedding and extraction method based on a topology structure, comprising the following steps: blocking an original image, selecting hidden blocks capable of embedding information, turning white (or black) pixel points through a hidden method based on topology principle, and embedding hidden information required to be embedded to corresponding blocks. Through the invention, hidden information can be rapidly embedded and extracted, thus realizing required hidden information capacity and visual hidden effect. In the invention, blind extract can be realized, and more embedded hidden information capacity can be provided through the auxiliary of the original image under the condition of ensuring the same level of visual distortion effect. The invention also provides copyright protection at a certain security level, and further can provide strengthened security protection. By using the invention, copyright mark and integrity testing can be carried out on binary images in various types, such as calligraphy, woodblock prints, scanning images, handwritten signatures and the like, therefore, the invention can play roles in copyright protection, copyright control and certification at a certain level.

Description

【Technical field】: [0001] The invention belongs to the technical fields of digital watermarking, digital copyright identification and protection and information security, and specifically relates to a binary image fragile watermark embedding and extraction method based on topological structure. 【Background technique】: [0002] In order to solve the problems of copyright protection, copyright control and authentication of digital media such as images, audio and video, digital watermarking and data hiding technologies emerged as the times require. In terms of image digital watermarking, many previous popular research works have focused on color images or grayscale images. Such image formats often have a large capacity (each pixel has one byte representation or multiple byte representations), So hiding information is relatively easy. Typical techniques in this regard include LSB information hiding (Least Significant Information Bit Concealment) technology; spread spectrum conc...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06T1/00
Inventor 苏明高铁牛
Owner NANKAI UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap