CN107426465A - Image Hiding based on pretreatment mechanism - Google Patents

Image Hiding based on pretreatment mechanism Download PDF

Info

Publication number
CN107426465A
CN107426465A CN201710441829.9A CN201710441829A CN107426465A CN 107426465 A CN107426465 A CN 107426465A CN 201710441829 A CN201710441829 A CN 201710441829A CN 107426465 A CN107426465 A CN 107426465A
Authority
CN
China
Prior art keywords
image
data
information
node
secret
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201710441829.9A
Other languages
Chinese (zh)
Inventor
张迎周
赵莲
陈星昊
王星
尹秀
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing Post and Telecommunication University
Nanjing University of Posts and Telecommunications
Original Assignee
Nanjing Post and Telecommunication University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nanjing Post and Telecommunication University filed Critical Nanjing Post and Telecommunication University
Priority to CN201710441829.9A priority Critical patent/CN107426465A/en
Publication of CN107426465A publication Critical patent/CN107426465A/en
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N1/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
    • H04N1/32144—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
    • H04N1/32149—Methods relating to embedding, encoding, decoding, detection or retrieval operations
    • H04N1/32288—Multiple embedding, e.g. cocktail embedding, or redundant embedding, e.g. repeating the additional information at a plurality of locations in the image
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N1/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
    • H04N1/32144—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
    • H04N1/32149—Methods relating to embedding, encoding, decoding, detection or retrieval operations
    • H04N1/32203—Spatial or amplitude domain methods

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Facsimile Transmission Control (AREA)

Abstract

The present invention discloses a kind of Image Hiding based on pretreatment mechanism, including load information, structure Octree index, data compression, encryption information, embedding information and image transmitting.Compression efficiency is improved, also further increases the disguise of Information Hiding Algorithms, the probability that secret information is cracked is reduced, realizes safer image watermarking.

Description

Image Hiding based on pretreatment mechanism
Technical field
The invention belongs to Image Compression field, and in particular to the Image Hiding based on pretreatment mechanism.
Background technology
Now, Information Hiding Techniques are the study hotspots of information security.With the development of science and technology the swift and violent hair of the communication technology Exhibition so that increasing people and organization cause the data on network by the substantial amounts of data file of network transmission Pressure is increasing.At present, the subject matter of Information hiding field face is not only safety problem, and also mass data is super Transfers loads problem, how to accomplish can safe transmission and can improve efficiency of transmission, the problem of being current in the urgent need to address.
With network information explosive growth, Information hiding field face the challenge that big data is brought.For more matchmakers One of the biggest problem that body computer faces is exactly the transmission problem of mass data.By taking image as an example, the resolution ratio of image storage It is higher, take up space bigger, it is necessary to which bigger hiding carrier, low so as to cause information transfer slow for Information hiding The problems such as effect.It is therefore desirable to compressing data technology further to be studied.
The content of the invention
The purpose of the present invention is that the processing for hiding information is realized in pretreatment mechanism, and reaches and reduce information embedded quantity Purpose, and increase its security and improve efficiency of transmission purpose.
Based on the Image Hiding of pretreatment mechanism, comprise the following steps：
Step 1, loading secret information：Pending image information is read, pre-estimation goes out by pretreated information content Cm； Then carrier image is loaded, calculates the information content Cz that carrier image can accommodate；Compare Cm and Cz sizes, if the former is big, Secret information is then cut, if the latter is big, is continued executing with next step；
Step 2, data compression：Secret information is represented with three-dimensional matrice, then builds Octree index, and by related rope Draw storage into array of pointers, extracting simplified algorithm using central point carries out simplifying data；
Step 3, data encryption：The three-dimensional data matrix after compression is first converted into two-dimensional data matrix, then user selects Encryption section is taken, and user's selected areas is encrypted using Arnold scrambling algorithms, finally obtains the secret information after encryption；
Step 4, embedding information and image transmitting：Preceding 6 pixels of initial carrier image are chosen, by retouching for secret information State information storage wherein；Then secret information is embedded into carrier image using steganographic algorithm；After insertion, then it will carry close Safety of image is transferred to receiving terminal.
The present invention has advantages below：
1st, in secret information pretreatment mechanism, secret information is encrypted using Arnold conversion, so as to transmit During add one layer of safety curtain；
2nd, secret information lossy compression method is improved into embedded quantity indirectly using Octree index technology；
3rd, anti-attack ability is increased, so as to reach the purpose for improving transmission security；
4th, the function that user selects encryption orientation and region is added in AES, so as to improve the spirit of the algorithm Activity.
Brief description of the drawings
Fig. 1 is the flow chart of the embodiment of Image Hiding one based on pretreatment mechanism；
Fig. 2 is the flow that Octree index is built in Fig. 1 embodiments；
Fig. 3 is secret information compression process in Fig. 1 embodiments.
Embodiment
In order to make the purpose , technical scheme and advantage of the present invention be clearer, it is right below in conjunction with drawings and Examples The present invention is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, and It is not used in the restriction present invention.
In order to facilitate narration, the simple primary variables defined in algorithm：Hidden image A, carrier image I, generated after embedded Encrypted image I', wherein represent the height of image with height, width represents the width of image.I.width represents I images Width, I.height represent I images height.Image A is also same.
A kind of information concealing method based on pretreatment mechanism that the present embodiment proposes, it is main to include loading Secret Image mistake Journey, establish Octree Index process, data compression process, information ciphering process and secret information telescopiny etc.；
Comprise the following steps that：
Step 1) loads carrier image I, and estimates the maximum hiding information saturations of carrier image I：
Step 1.1) is by formulaCalculate the saturation Cz of maximum；
Step 1.2) loads Secret Image A, by formulaPre-estimation goes out pretreated secret Confidential information amount Cm, wherein n are compressibility factor；
If step 1.3) secret information amount Cm is not above Cz, next step is performed, otherwise, it is necessary to which user schemes to secret As being cut；
Step 1.4) is by Secret Image information according to coding format RGB, and by each pixel according to R, G, B points are three Component form (x, y, z)；And it is converted into three-dimensional matrice M.
Above-mentioned steps 1.1) in Cz solution
Wherein I.width, I.height are respectively the wide and high of carrier image I；
Assuming that embedding information needs to use B, R passages carry out embedding information, and embedded 1byte is secret in each 8 × 8 two-dimensional matrix Confidential information；
The number of 8 × 8 two-dimensional matrixs included in carrier image I is：Again because making With two passage embedding informations, thus can the two-dimensional matrix number of embedding information be：
In summary, open ended maximum fault information in carrier image
Above-mentioned steps 1.2) in compressibility factor n value determination need mass data experimental analysis obtain, therefore pass through Lot of experimental data is analyzed, and typically chooses n=2；
Step 2) establishes Octree Index process：
Step 2.1) establishes Octree root node according to three-dimensional data M external envelope cube, and wherein three-dimensional data M can table It is shown as mij=(xij,yij,zij),0≤i≤A.width-1,0≤j≤A.height；Therefore the cubical length of side L=max of external envelope {max(xij)-min(xij),max(yij)-min(yij),max(zij)-min(zij)
Step 2.2) carries out decile along the cubical X of root node, Y, Z-direction, is 8 small cubes by cube subdivision Body, therefore this 8 small cubes are referred to as 8 child nodes of root node
Step 2.3) is cutd open the three-dimensional data points in father node according to position during cube carries out subdivision Point, subdivision is sorted out into corresponding leaf node；The subdivision and index for completing the stage three-dimensional data points are established
Step 2.4) during successively subdivision, for j-th of node (cube) size in i layers and comprising three Dimension data point is differentiated, if node tijSize bijLess than defined threshold value b, or the three-dimensional included in the node The number number of data pointijLess than number (generally number is 1), then stop dissecting the node, the i.e. node As the leaf node of whole Octree, then step 2.5) is performed；If it is unsatisfactory for above-mentioned two condition, return to step 2.2)
Step 2.5) is successfully established one and rationally, efficiently optimizes Octree index, and index data is stored in into pointer In space S；
The cubical computational methods of external envelope described in step 2.1) are as follows
So-called external envelope cube seeks to the minimum cube for being included all three-dimensional data points；
If three-dimensional data points mij=(xij,yij,zij), wherein 0≤i≤A.width-1,0≤j≤A.height
Therefore the cubical length of side L of external envelope
L=max { max (xij)-min(xij),max(yij)-min(yij),max(zij)-min(zij)}
Cubical eight fixed points are as follows
(min(xij),min(yij),min(zij)),(min(xij),min(yij),max(zij))
(min(xij),max(yij),min(zij)),(min(xij),max(yij),max(zij))
(max(xij),min(yij),min(zij)),(max(xij),min(yij),max(zij))
(max(xij),max(yij),min(zij)),(max(xij),max(yij),max(zij))
Subdivision process described in step 2.3)
Recurrence subdivision is constantly carried out to all nodes and the three-dimensional point set included, when defined parameter is less than threshold value When, the stopping subdivision node, the node is the leaf node of whole Octree；
During Octree index is established, the first order has 8 cubes
The second level is up to 64 cubes
……
N-th grade be up to 8nIndividual cube
Then n-th grade of the cube length of sideWherein L is the cube length of side of whole Octree root node
Step 3) data compression process, three-dimensional data M is utilized into Octree index technology boil down to three-dimensional data D
Step 3.1) leaf node t known toijThe diagonal angular coordinate q1 of length of side L and two spaces of (cube)ij(x1ij, y1ij,z1ij),q2ij(x2ij,y2ij,z2ij), calculate cubical centre coordinate
Step 3.2) calculates point Qi jTo its residual point-group Nij=(Nnij(xnij,ynij,znij), n=1,2,3 ... n) in own The distance of pointN distance is calculated altogether；
Step 3.3) is from above-mentioned n dnijIt is middle to choose the corresponding point X of its minimum valueij(xij,yij,zij), then deleting should Other three-dimensional data points in node (cube), with point XijInstead of other points in cube, three dimensions of the node are completed According to simplification, by that analogy, all leaf nodes are all simplified into data using the method, and obtain the leaf of whole Octree The simplification of child node, final obtain simplify data D
Step 3.4) represents the form of pixel by data D is simplified, i.e., each pixel is made up of (x, y, z), by data D It is converted into the two-dimensional matrix P using pixel as element；
Step 3) data reduction specific algorithm is as follows：
Extracted using central point and simplify algorithm, its core concept is, when cube is sufficiently small, distance center point is nearest Point can substitute the point set in cube, complete the compression to interior point set in cube；
If the point set N=(N in certain cubei(xi,yi,zi), i=1,2,3 ... n), the cubical middle point coordinates P (x, y,z)
The distance of each point-to-point P in point set N is calculated first
Select d=max (di) corresponding to coordinate X (x ', y ', z '), i.e., all data points in point set N are replaced with point X, Complete the compression of data.
Operation is encrypted using Arnold scrambling algorithms in secret information after simplification, as two-dimensional matrix P by step 4)
The two-dimensional matrix P that step 4.1) sets secret information is m × n matrix, and wherein the size of secret information is P.width The bit of × P.height × 3, two-dimensional matrix P is encrypted, further increases its security and attack tolerant
Step 4.2) designer can define scramble number t according to user's request, wherein t is integer, is needed when going back original image It is to be understood that t values could correctly be recovered；
Step 4.3) sets user to select encrypted location, and user selects coordinate p (key_x, key_y) and len；Wherein need The information of encryption is the square formation P_user using p points as len × len of starting point；
Step 4.4) uses Arnold scrambling algorithms to secret information
Arnold conversion is formulated as follows：
Wherein x, y value are { 0,1,2 ..., N-1 }, and N is the exponent number of character matrix；
Secret information P_user is changed into ciphertext P1_user；Confidential information P_user wherein to be added, wherein P_user's is a certain The coordinate of data is (x, y), then new x coordinate and new y-coordinate are obtained after enciphering transformation, and its calculation formula is：X '= (x+y), y '=(x+2*y), then x ', y ' carry out complementation to secret information P_user width and height respectively：X '= x’mod len；Y '=y ' mod len；
Step 4.5) is obtained and the data message of original (x, y) coordinate is transformed into new seat after new coordinate (x ', y ') Mark (x ', y ') place；
Step 4.6) repeats step 4.4) to step 4.5) t times according to t numerical values recited；
The ciphering process that step 4.7) completes after changing for secret information t times terminates, and obtains scrambled matrix P1_ user。
Pretreated secret information P1_user relevant parameter is embedded into carrier image I by step 5)：
Step 5.1) chooses preceding 6 Pixel Informations in carrier image I, because each pixel of image is 3 bits, respectively It is channel B, G passages, R passages；6 pixels are used to store transmission key, the key includes key_x, key_y, len；
For step 5.2) in embedded transmission key, using channel B and R passages, therefore 9 pixels of selection can be used as secret letter The information of breath carrier amounts to 18byte.Most end 2bit due to changing each byte has no effect on the quality of image, therefore, each The most end 2bit of byte can be used for data storage.First by 3 pixels before secret information P width P.height deposits (i.e. Preceding 6 byte), wherein each byte can deposit 2bit data, therefore 12bit altogether, highest can deposit 212- 1=4095 pixels talls, are deposited Storage mode is that secret information P height P.height is stored in into 6 bytes before image in sequence per the assembling and dismantling of 2bit mono- point In；
Secret information P width P.width is stored in the 4th to 6 pixel by step 5.3)；Embedding grammar such as step 5.2) It is described；
Pretreated secret information P1_user is embedded in carrier image I by step 6), and it is secret to be transferred to recipient's acquisition Confidential information
Step 6.1) is as described in step 5.1), and each pixel is 3 bits, respectively channel B in carrier image, G passages, R Passage；Can an optional passage carry out the insertion of secret information
Step 6.2) assumes to choose R passages insertion secret information P1_user, using steganographic algorithm by secret information matrix P1_user is embedded into carrier image；
After the completion of step 6.3) is embedded, obtains and carry close image I, it then will carry close image and send recipient to；
After step 6.4) recipient receives the close image of load, the inverse process of above-mentioned encryption is utilized to obtain secret information P1_use And related parameter information key_x's, key_y, len and secret information P is wide and high；P1_user is passed through into Arnold inversions Scaling method, using after t times, obtain P.
Technological means disclosed in the present invention program is not limited only to the technological means disclosed in above-mentioned embodiment, in addition to Formed technical scheme is combined by above technical characteristic.

Claims (6)

1. the Image Hiding based on pretreatment mechanism, it is characterised in that comprise the following steps：
Step 1, loading secret information：Pending image information is read, pre-estimation goes out by pretreated information content Cm；Then Carrier image is loaded, calculates the information content Cz that carrier image can accommodate；Compare Cm and Cz sizes, if the former is big, cut out Secret information is cut, if the latter is big, is continued executing with next step；
Step 2, data compression：Secret information is represented with three-dimensional matrice, then builds Octree index, and relative index is deposited Store up in array of pointers, extracting simplified algorithm using central point carries out simplifying data；
Step 3, data encryption：The three-dimensional data matrix after compression is first converted into two-dimensional data matrix, then user, which chooses, adds Close region, and user's selected areas is encrypted using Arnold scrambling algorithms, finally obtain the secret information after encryption；
Step 4, embedding information and image transmitting：Preceding 6 pixels of initial carrier image are chosen, the description of secret information is believed Breath storage is wherein；Then secret information is embedded into carrier image using steganographic algorithm；After insertion, then close image will be carried Safe transmission is to receiving terminal.
2. the Image Hiding according to claim 1 based on pretreatment mechanism, it is characterised in that step 1 Detailed process is：
Step 1.1 loads secret information A, and by formulaThe secret information is calculated by pre- place Information content Cm after reason；A.width represents Secret Image A width wherein in above formula, and A.height represents Secret Image A height Degree, n represent compressibility factor；
Step 1.2 loads carrier image I, and by formulaCalculating carrier image I can hold The maximum fault information Cz received, in above formula, I.width represents the width of I images, and I.height represents the height of I images；Compare Cm With Cz；If the former is larger, need to cut secret information A；If the latter is larger, meets to require, continue executing with In next step.
3. the Image Hiding according to claim 1 based on pretreatment mechanism, it is characterised in that the fork of structure eight Tree index comprises the following steps that：
Step 2.1 assumes 3-D data set M, and wherein data point is expressed as
mij=(xij,yij,zij),0≤i≤A.width-1,0≤j≤A.height
The root node of Octree is established according to the external envelope cube of all three-dimensional datas, therefore the cubical length of side L of external envelope:
L=max { max (xij)-min(xij),max(yij)-min(yij),max(zij)-min(zij)}
Then along the cubical X of root node, Y, Z-direction carries out decile, is 8 small cubes by external envelope cube subdivision Body；
Step 2.2 carries out subdivision during cube carries out subdivision, by the three-dimensional data in father node according to its position, cuts open Assign in corresponding leaf node, complete the foundation of the subdivision and index of three-dimensional data；
Step 2.3 judges its side length b for the cube of all subdivisionsiWhether threshold value b is less than；If satisfied, then Stop node Subdivision；Or judge the number number of the data point included in its leaf node cubeiWhether threshold value number is less than, If satisfied, then stopping the subdivision of the node, step 2.4 is performed；If not satisfied, then 2.1~step 2.2 of repeat step；
Step 2.4 is successfully established one and rationally, efficiently optimizes Octree index, and index data is stored in into pointer space S In.
4. the Image Hiding according to claim 3 based on pretreatment mechanism, it is characterised in that data compression The step of be：
Octree of the step 3.1 according to above-mentioned structure, according to the length of side L and two spaces pair of known leaf node (cube) Angle angular coordinate q1ij(x1ij,y1ij,z1ij),q2ij(x2ij,y2ij,z2ij), calculate cubical centre coordinate
Step 3.2 calculates point QijThe distance of the data point included into the node
Set up an office collection Nij=(Nnij(xnij,ynij,znij), n=1,2,3 ... n), its Point Set NijIn data point be known node Comprising all data points；
Calculate distance center point QijDistance
Step 3.3 is from above-mentioned n dnijIt is middle to choose the corresponding point X of its minimum valueij(xij,yij,zij), use XijInstead of the node In other data points, delete other three-dimensional data points in the node, complete the node three-dimensional data simplify；With such Push away, all leaf nodes are all simplified into data, obtain the simplification of the leaf node of whole Octree, final obtain simplifies data D；
Step 3.4 represents the form of pixel by data D is simplified, i.e., each pixel is made up of (x, y, z), data D is converted For the two-dimensional matrix P using pixel as element.
5. the Image Hiding according to claim 1 based on pretreatment mechanism, it is characterised in that the data The step of encryption is：
Step 4.1 user inputs key, chooses encryption section；User inputs the numerical value of 3 keys, key_x, key_y and len, It is positive integer, the parameter of input determines a piece of square area, i.e., the square top left co-ordinate is (key_x, key_ Y), length of side len；Encryption section, selected areas P_user are chosen to the secret information P keys inputted according to user；
Information after compression is encrypted using Arnold scrambling algorithms for step 4.2；
Arnold conversion is formulated as follows：
Wherein x, y value are { 0,1,2 ..., N-1 }, and N is digital information order of matrix number；
Using formula x '=x+y, y '=x+2*y, then the width to selected areas and height len carry out complementation：X '= x’mod len；Y '=y ' mod len；Calculate coordinate (x ', y '), by the data for being located at (x, y) place originally be put into coordinate (x ', Y ') place；Repeat the process t times, encryption is completed, and obtains encryption information P '.
6. the Image Hiding according to claim 1 based on pretreatment mechanism, it is characterised in that information is embedded in And the step of image transmitting, is：
The description information of secret information is stored in the head of carrier image by step 5.1,
Preceding 4 pixels storage hidden image A of carrier image height and width numerical value is chosen, each pixel shares 3byte, and And each byte end 2bit as storage location, 24bit data message can be deposited altogether；Wherein preceding 2 pixels Store the height value of Secret Image, the width value of rear 2 pixels storage Secret Image；Then choosing 2 pixel storage users Choose the parameter of encrypted location：key_x,key_y,len；
Pretreated secret information P ' is embedded into carrier image by step 5.2 using steganographic algorithm；
Carrier image I each pixel is made up of RGB component, i.e. tri- passages of R, G, B, and optional two passages are as embedded secret The carrier of information, secret information is embedded using steganographic algorithm, obtains and carry close image I ', and I ' is transferred to reception End.
CN201710441829.9A 2017-06-13 2017-06-13 Image Hiding based on pretreatment mechanism Pending CN107426465A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710441829.9A CN107426465A (en) 2017-06-13 2017-06-13 Image Hiding based on pretreatment mechanism

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710441829.9A CN107426465A (en) 2017-06-13 2017-06-13 Image Hiding based on pretreatment mechanism

Publications (1)

Publication Number Publication Date
CN107426465A true CN107426465A (en) 2017-12-01

Family

ID=60429581

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710441829.9A Pending CN107426465A (en) 2017-06-13 2017-06-13 Image Hiding based on pretreatment mechanism

Country Status (1)

Country Link
CN (1) CN107426465A (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102682103A (en) * 2012-04-28 2012-09-19 北京建筑工程学院 Three-dimensional space index method aiming at massive laser radar point cloud models
CN104902255A (en) * 2015-03-05 2015-09-09 华东师范大学 Data source generation method based on volume scanning three-dimensional display system
US20160203297A1 (en) * 2009-03-09 2016-07-14 The Nielsen Company (Us), Llc Systems and methods for payload encoding and decoding
CN105808672A (en) * 2016-03-01 2016-07-27 重庆市勘测院 Browser based mass three-dimensional point cloud data release method
CN106791872A (en) * 2016-11-18 2017-05-31 南京邮电大学 Information concealing method based on SVD

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160203297A1 (en) * 2009-03-09 2016-07-14 The Nielsen Company (Us), Llc Systems and methods for payload encoding and decoding
CN102682103A (en) * 2012-04-28 2012-09-19 北京建筑工程学院 Three-dimensional space index method aiming at massive laser radar point cloud models
CN104902255A (en) * 2015-03-05 2015-09-09 华东师范大学 Data source generation method based on volume scanning three-dimensional display system
CN105808672A (en) * 2016-03-01 2016-07-27 重庆市勘测院 Browser based mass three-dimensional point cloud data release method
CN106791872A (en) * 2016-11-18 2017-05-31 南京邮电大学 Information concealing method based on SVD

Similar Documents

Publication Publication Date Title
CN115297363B (en) Video data encryption transmission method based on Huffman coding
CN112035695B (en) Spatial data encryption method suitable for mobile terminal
CN115378693B (en) Hidden set intersection method for longitudinal federal learning data alignment
CN111327785B (en) Information steganography communication method based on automatic image construction of countermeasure generation network
Liu et al. Digital cardan grille: A modern approach for information hiding
CN115567186A (en) Chaos-optimized depth window scrambling encryption method
CN105162686A (en) Multi-form instant information hiding communication method and system based on image medium
CN114140309A (en) Novel image steganography method and system based on NICE model
Wang et al. Chaotic image encryption algorithm based on dynamic spiral scrambling transform and deoxyribonucleic acid encoding operation
CN115834060B (en) Electronic document security import and export method and system based on cryptography
CN111698222B (en) Covert communication method of special bitcoin address generated based on vanitygen
CN111161124B (en) Image steganography method of reference matrix model based on mean square error evaluation
CN112804046A (en) Carrier-free steganography method and system based on block chain private key mapping
CN102315931B (en) Method for hiding running coding of confidential information
CN108305298B (en) Image recoverable information hiding method based on Sudoku matrix index
CN115941855B (en) Safe storage method of social image data
CN107426465A (en) Image Hiding based on pretreatment mechanism
CN104599226B (en) Large-capacity steganography method
CN105279728B (en) Pretreated intelligent mobile terminal image latent writing method is encrypted based on secret information
CN115760126B (en) Financial transaction information encryption method
CN115906111A (en) Character string encryption method based on three-dimensional coordinate system
CN114241581A (en) Face generation type image steganography based on semantic features
CN111741184A (en) 3-dimensional reference matrix information hiding method based on mini-Didu matrix
Narayana et al. Video Frame based Prompt Compression Model with Steganography for Secure Data Transmission
Hussein et al. Randomized Information Hiding in RGB Images Using Genetic Algorithm and Huffman Coding.

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20171201