Image steganography method of reference matrix model based on mean square error evaluation
A reference matrix and mean square error technology, applied in the field of multimedia signal processing, can solve problems such as inability to solve algorithm limitations, inability to optimize image quality, etc., to avoid inherent defects, maintain image quality, and shorten computing time.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0169]Assume that the watermark information to be hidden is 512*512*3 / 2 bit streams composed of binary 0 and 1 values, such as {010011110...}, and the carrier image I is a grayscale image with a resolution of 512*512. An image steganography method based on a reference matrix model evaluated by mean square error, comprising the following steps:
[0170] Step 1, divide the number of watermark information digits by the number of pixels of the carrier image 1 to obtain a storage amount of each pixel as 3 / 2, determine the dimension of the reference matrix according to the storage amount of each pixel to be 2, and store the number of bits m is 3, ie RM_2D(2 m )=RM_2D(8);
[0171] Step 2, designing the reference matrix according to the dimension, the reference matrix satisfies the following formula:
[0172] RM(0,0)=S,(S∈{0,1,...,7})
[0173] RM(i+1,j)=(RM(i,j)+r 1 ) mod 8
[0174] RM(i,j+1)=(RM(i,j)+r 2 ) mod 8
[0175]
[0176] r 2 = 1
[0177] Among them, RM is a two-d...
Embodiment 2
[0201] Assume that the watermark information to be hidden is a bit stream consisting of 512*515 binary 0 and 1 values, such as {010011110...}, and the carrier image I is a grayscale image with a resolution of 512*512. This application is based on the mean square error An image steganography method for evaluating a reference matrix model consists of the following steps:
[0202] Step 1, divide the number of watermark information digits by the number of pixels of the carrier image I to obtain a storage amount of each pixel greater than 1 and less than 4 / 3, and determine that the dimension of the reference matrix is 3 according to the storage amount of each pixel. The number of input bits m is 4, that is, RM_3D(2 m )=RM_2D(16);
[0203] Step 2, designing the reference matrix according to the dimension, the reference matrix satisfies the following formula:
[0204] RM(0,0,0)=S(S∈{0,1,...,15})
[0205] RM(i+1,j,k)=(RM(i,j,k)+r 1 ) mod 16
[0206] RM(i,j+1,k)=(RM(i,j,k)+r 2 ...
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