CN113518079A - Data feature-based segmented information embedding method and system - Google Patents

Data feature-based segmented information embedding method and system Download PDF

Info

Publication number
CN113518079A
CN113518079A CN202110674023.0A CN202110674023A CN113518079A CN 113518079 A CN113518079 A CN 113518079A CN 202110674023 A CN202110674023 A CN 202110674023A CN 113518079 A CN113518079 A CN 113518079A
Authority
CN
China
Prior art keywords
data
bits
byte
information
preprocessing
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.)
Granted
Application number
CN202110674023.0A
Other languages
Chinese (zh)
Other versions
CN113518079B (en
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.)
Xian Institute of Space Radio Technology
Original Assignee
Xian Institute of Space Radio Technology
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 Xian Institute of Space Radio Technology filed Critical Xian Institute of Space Radio Technology
Priority to CN202110674023.0A priority Critical patent/CN113518079B/en
Publication of CN113518079A publication Critical patent/CN113518079A/en
Application granted granted Critical
Publication of CN113518079B publication Critical patent/CN113518079B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
    • H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
    • H04L63/0464—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload using hop-by-hop encryption, i.e. wherein an intermediate entity decrypts the information and re-encrypts it before forwarding it
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/06—Protocols specially adapted for file transfer, e.g. file transfer protocol [FTP]

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Hardware Design (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Editing Of Facsimile Originals (AREA)

Abstract

The invention provides a segmented information embedding method and system based on data characteristics. According to the characteristics of data such as images, texts and voice, the redundancy of the segment is increased by performing operations such as feature analysis and interval mapping on the segmented data, so that the segment can be embedded with more information, and the original carrier data and the embedded information can be recovered without damage. The invention enlarges the redundancy range of the segmented data, increases the information embedding amount and is suitable for various data transmission systems of different types.

Description

Data feature-based segmented information embedding method and system
Technical Field
The invention relates to a data communication and transmission method, in particular to a method for embedding information into any type of data for lossless transmission, and belongs to the technical field of data communication.
Background
With the expansion of the connection scale of the space network, the service volume in the satellite data transmission system is increased rapidly, the types of transmission services are more and more, the transmission requirements of various types of services are higher and higher, and if the services are not distinguished, the difficulty in data processing is high, the efficiency is low, and the service quality requirements of the services are difficult to guarantee.
Various data such as images, texts, voice and the like in a communication and transmission system have the characteristics of large variance, discrete data distribution and the like, the information redundancy is small, and the data embedding difficulty is high. For a set of data, if the difference between the maximum and minimum values of the set of data is 2n(e.g., 2, 4, 8, 16, 32, 64, 128), then by simple calculation processing, the high 8-n bits of all data in the group of data can be made to be 0, and information can be embedded as redundant bits; but if the difference between the maximum and minimum is not 2nBut is less than 2nIn this case, 0 can only be found in the upper 8-n bits. Due to the randomness of data distribution, the probability of occurrence of the situation is limited, and the redundancy and embedding rate of the data are necessarily reduced.
Disclosure of Invention
The technical problem solved by the invention is as follows: the method expands the redundancy range of the segmented data, embeds sensitive information into transmission information under the condition of not increasing the transmission capacity of a channel, recovers the original information and the embedded information without loss, and improves the system capacity.
The technical solution of the invention is as follows:
a data feature-based segmentation information embedding method comprises the following steps:
analyzing and calculating original data according to different segment lengths, selecting a segment length with the largest information embedding amount as an optimal segment length, and segmenting the original data;
step two, preprocessing the data in each segment to obtain preprocessed carrier data;
thirdly, preprocessing the secret information according to the data characteristics of the carrier;
and step four, embedding the preprocessed secret information into the preprocessed carrier data to realize the segmented information embedding based on the data characteristics.
Further, the method for determining the optimal slice length in the first step specifically includes:
performing characteristic analysis on each segment, traversing different segment lengths, calculating the information embedding amount of the whole data under each segment, and selecting the segment mode with the maximum information embedding amount as the optimal segment length;
assuming that the difference between the maximum value and the minimum value in a certain segment is D, the segment length is L, the lossless embedding additional information is 12 bits, the number of data appearing most in the segment is T, and m is a specific value, according to different ranges of D, the specific calculation method of the segment information embedding amount is as follows:
(1) if the D is less than 3, then,
when L is 3 × k, k is a positive integer, the segmentation information embedding amount M is 19 × k-12;
when L is 3 × k +1, k is a positive integer, the segmentation information embedding amount M is 19 × k-6;
when L is 3 × k +2, k is a positive integer, the segmentation information embedding amount M is 19 × k;
(2) if D is<m, m is between 2nAnd 2n+1And satisfies the condition m2≤2n×2n+1When n is more than or equal to 2 and less than or equal to 7;
when L is 2 × k, k is a positive integer, the segmentation information embedding amount M is (15-2n) × k-12;
when L is 2 × k +1, k is a positive integer, the segmentation information embedding amount M is (15-2n) × k-7; (3) if D < 181;
when L is 2 × k or L is 2 × k +1 and T-8> k, k is a positive integer, the segmentation information embedding amount M is T-20;
when L ═ 2 × k or L ═ 2 × k +1 and T-8 ≦ k, k is a positive integer, then the segmentation information embedding amount M ═ k-12;
(4) if D >181 and T-8>12, the segment information embedding amount M is T-20;
(5) if D is<2n1And n1 is more than or equal to 0 and less than or equal toWhen 7, the segment information embedding quantity M is (8-n1) multiplied by L-12;
(6) in other cases, M is equal to 0, which indicates that the segment cannot be hidden, and four bits of identification information need to be reserved for the total embedding amount M.
Further, the preprocessing method for each segmented data in the step two specifically includes:
assuming that the difference between the maximum value and the minimum value in the segmented group of data is D, adopting different preprocessing methods according to different ranges of D:
(1) when D is present<2n1And n1 is more than or equal to 0 and less than or equal to 7, information embedding is carried out on the high (8-n1) bit of each byte, and the specific preprocessing process is as follows:
first, each byte in the set of data is subtracted by the minimum in the set of data, so that all data values lie between 0 and D, since D<2n1Then the high (8-n1) bit of each byte of the group of data is zero for embedding 8-n1 bits of information;
(2) when D is present<m, m satisfies the condition m2≤2n×2n+1And when n is more than or equal to 7 and more than or equal to 2, embedding (15-2n) bit information into every two bytes, wherein the specific processing process is as follows:
first, each byte in the group of data is subtracted by the minimum value in the group of data to make all data values between 0 and D, then the data is byte-calculated in two byte groups in sequence to make the 1 st byte data between 0 and 2n+1In between, the second byte data is between 0 and 2nAfter preprocessing, the 1 st byte data is embedded with (8-n) bit information, and the 2 nd byte data can be embedded with (7-n) bit information;
if 2n<m<2n+1Then, the pretreatment is carried out according to the following method:
step one, subtracting the minimum value in the group of data from all data to ensure that all data are positioned in a [0, m-1] interval;
secondly, dividing the data into a group of two in sequence, marking as [ T1, T2] to carry out byte calculation, and mapping to corresponding intervals according to different m values;
after preprocessing, the first byte is located at [0,2]n-1]The second byte is located at [0,2]n+1-1]Embedding (15-2n) bitsAnd (4) information.
Further, when the m value is specifically selected, the m value needs to satisfy the following condition:
1) m is located in [ 2]n，2n+1]Within the interval;
2)m2≤2n×2n+1and n is more than or equal to 7 and more than or equal to 2;
the optimal m values which can be selected are 5, 11, 22, 45, 90 and 181.
Further, the performing byte calculation specifically includes:
1) when m is 5, namely the difference value of the group of data is D < 5;
firstly, subtracting the minimum value in the group of data from all data to ensure that all data are positioned in a [0, 4] interval;
then, dividing the data into two groups in sequence, which are denoted as [ T1, T2], decomposing the data according to 5 × 5, and mapping the data into 4 × 8 intervals, that is, 5 × 5 ═ 4 × 4+4 × 1+1 × 4+1 × 1; the specific calculation method comprises the following steps:
when T2 is located at [0, 3] and T1 is located at [0, 4], T1 is T1, T2 is T2, T1 is located at [0, 4], T2 is located at [0, 3 ];
when T2 is 4 and T1 is located at [0, 3], T1 is 5, T2 is T1, making T1 [5], T2 is located at [0, 3 ];
when T2 is 4 and T1 is 4, T1 is 6, T2 is 3;
after preprocessing, the first byte is positioned at [0, 7] and 5 bits of information can be embedded; the second byte is positioned at [0, 3] and can be embedded with 6 bits of information;
2) when m is 11, namely the difference value of the group of data is D < 11;
firstly, subtracting the minimum value in the group of data from all data to ensure that all data are positioned in a [0, 10] interval;
then, dividing the data into two groups in sequence, which are denoted as [ T1, T2], decomposing the data according to 11 × 11, and mapping the data to an 8 × 16 interval, that is, 11 × 11 ═ 11 × 8+8 × 3+2 × 3+1 × 3; the specific calculation method comprises the following steps:
when T2 is located at [0, 7] and T1 is located at [0, 10], T1 is T1, T2 is T2, T1 is located at [0, 10], T2 is located at [0, 7 ];
when T2 is located at [8, 10] and T1 is located at [0, 7], T2 ═ T1, T1 ═ T2+3, T1 is located at [11, 13], T2 is located at [0, 7 ];
when T2 is located at [8, 10] and T1 is located at [8, 9], T2 ═ T2-3, T1 ═ T1+6, T1 is located at [14, 15], T2 is located at [5, 7 ];
when T2 is located at [8, 10] and T1 is [10], T2 is T2-6, T1 is T1+5, T1 is located at [15], and T2 is located at [2, 4 ];
after preprocessing, the first byte is positioned at [0, 15] and 4 bits of information can be embedded; the second byte is positioned at [0, 7] and can be embedded with 5 bits of information;
3) when m is 22, namely the difference value of the group of data is D < 22;
firstly, subtracting the minimum value in the group of data from all data to ensure that all data are positioned in a [0, 21] interval;
then, the data is divided into two groups in sequence, remembering [ T1, T2], the data is decomposed according to 22 × 22 and mapped to a 16 × 32 interval, that is, 22 × 22 ═ 16 × 22+6 × 16+6 × 4+6 × 2; the specific calculation method comprises the following steps:
when T2 is located at [0, 15] and T1 is located at [0, 21], T1 is T1, T2 is T2, T1 is located at [0, 21], T2 is located at [0, 15 ];
when T2 is located at [16, 21] and T1 is located at [0, 15], T2 ═ T1, T1 ═ T2+6, T1 is located at [22, 27], T2 is located at [0, 15 ];
when T2 is located at [16, 21] and T1 is located at [16, 19], T2 ═ T2-16, T1 ═ T1+12, T1 is located at [28, 31], T2 is located at [0, 5 ];
when T2 is located at [16, 21] and T1 is located at [20, 21], T2 ═ T2-10, T1 ═ T1+8, T1 is located at [28, 29], T2 is located at [6, 11 ];
after preprocessing, the first byte is positioned at [0, 31] and 3 bits of information can be embedded; the second byte is positioned at [0, 15] and can be embedded with 4 bits of information;
4) when m is 45, i.e. the difference of the set of data is D < 45;
firstly, subtracting the minimum value in the group of data from all data to ensure that all data are positioned in a [0, 44] interval;
then, the data is divided into two groups in sequence, remembering [ T1, T2], the data is decomposed according to 45 × 45 and mapped to a 32 × 64 interval, that is, 45 × 45 ═ 45 × 32+32 × 13+6 × 13+6 × 13+1 × 6+1 × 6+1 × 1; the specific calculation method comprises the following steps:
when T2 is located at [0, 31] and T1 is located at [0, 44], T1 is T1, T2 is T2, T1 is located at [0, 44], T2 is located at [0, 31 ];
when T2 is located at [32, 44] and T1 is located at [0, 31], T2 ═ T1, T1 ═ T2+13, T1 is located at [45, 57], T2 is located at [0, 31 ];
when T2 is located at [32, 44] and T1 is located at [32, 37], T2 ═ T2-32, T1 ═ T1+26, with T1 located at [58, 63], T2 located at [0,12 ];
when T2 is located at [32, 44] and T1 is located at [38, 43], T1 is T1+20, T2 is T2-19, T1 is located at [58, 63], T2 is located at [13, 25 ];
when T1 ═ 44 and T2 are located at [32, 37], T1 ═ T2+26 and T2 ═ 26, such that T1 is located at [58, 63] and T2 is 26;
when T1 ═ 44, T2 is located [38, 43], T1 ═ T2+20, T2 ═ 27, making T1 located [58, 63], T2 is 27;
when T1-44, T2-44, T1-58, T2-28;
after preprocessing, the first byte is positioned at [0, 63] and 2 bits of information can be embedded; the second byte is positioned at [0, 31] and can be embedded with 3 bits of information;
5) when m is 90, i.e. the difference of the set of data is D < 90;
firstly, subtracting the minimum value in the group of data from all data to ensure that all data are positioned in a [0, 89] interval;
then, the data is divided into two groups in sequence, and [ T1, T2] is memorized, the data is decomposed according to 90 × 90 and mapped to a 64 × 128 interval, that is, 90 × 90 ═ 90 × 64+64 × 26+12 × 26+12 × 26+2 × 12+2 × 12+2 × 2; the specific calculation method comprises the following steps:
when T2 is located at [0, 63] and T1 is located at [0, 89], T1 is T1, T2 is T2, T1 is located at [0, 89], T2 is located at [0, 63 ];
when T2 is located at [64, 89] and T1 is located at [0, 63], T1 is T2+26, T2 is T1, T1 is located at [90, 115], T2 is located at [0, 63 ];
when T2 is located at [64, 89] and T1 is located at [64, 75], T1 ═ T1+52, T2 ═ T2-64, let T1 be located at [116, 127], T2 be located at [0, 25 ];
when T2 is located at [64, 89] and T1 is located at [76, 87], T1 is T1+40, T2 is T2-38, T1 is located at [116, 127], T2 is located at [26, 51 ];
when T1 is located at [88, 89] and T2 is located at [64, 75], T1 is T2+52, T2 is T1-36, T1 is located at [116, 127], T2 is located at [52, 53 ];
when T1 is located at [88, 89] and T2 is located at [76, 87], T1 is T2+40, T2 is T1-34, T1 is located at [116, 127], T2 is located at [54, 55 ];
when T1 is located at [88, 89] and T2 is located at [88, 89], T1 is T2+28, T2 is T1-32, T1 is located at [116, 117], T2 is located at [56, 57 ];
after preprocessing, the first byte is positioned at [0,127], and 1-bit information can be embedded; the second byte is positioned at [0, 63] and can be embedded with 2 bits of information;
6) when m is 181, that is, the difference value of the group of data is D < 181;
firstly, subtracting the minimum value in the group of data from all data to ensure that all data are positioned in a [0, 180] interval;
then, the data is divided into two groups in sequence, remembers [ T1, T2], and is decomposed according to 181 × 181 and mapped to 128 × 256 intervals, namely
181×181＝181×128+128×53+22×53+22×53+9×22+9×22+9×4+9×4+4×1+4×1+1×1；
The specific calculation method comprises the following steps:
when T2 is located at [0,127] and T1 is located at [0, 180], T1 is T1, T2 is T2, T1 is located at [0, 180], T2 is located at [0,127 ];
when T2 is located at [128, 180] and T1 is located at [0,127], T1 ═ T2+53, T2 ═ T1, such that T1 is located at [181, 233], T2 is located at [0,127 ];
when T2 is located at [128, 180] and T1 is located at [128, 149], T1 is T1+106, T2 is T2-128, such that T1 is located at [234, 255], T2 is located at [0, 52 ];
when T2 is located at [128, 180] and T1 is located at [150, 171], T1 ═ T1+84, T2 ═ T2-75, with T1 located at [234, 255], T2 located at [53, 105 ];
when T2 is located at [128, 149] and T1 is located at [172, 180], T1 is T2+106, T2 is T1-66, T1 is located at [234, 255], T2 is located at [106, 114 ];
when T2 is located at [150, 171] and T1 is located at [172, 180], T2 is T2+84, T2 is T1-57, T1 is located at [234, 255], T2 is located at [115, 123 ];
when T2 is located at [172, 175] and T1 is located at [172, 180], T1 is T1+62, T2 is T2-48, T1 is located at [234, 242], T2 is located at [124, 127 ];
when T2 is located at [176, 179] and T1 is located at [172, 180], T1 is T1+71, T2 is T2-72, T1 is located at [243, 251], T2 is located at [124, 127 ];
when T2 is 180 and T1 is located at [172, 175], T1 is T1+80 and T2 is 124, so that T1 is located at [252, 255] and T2 is 124;
when T2 is 180 and T1 is located at [176, 179], T1 is T1+76 and T2 is 125, such that T1 is located at [252, 255] and T2 is 125;
when T2 is 180, T1 is 180, T1 is 252, T2 is 126, so that T1 is 252 and T2 is at 126;
after preprocessing, the first byte is located at [0, 255 ]; the second byte is located at [0,127] and can embed 1 bit of information.
Further, the method for preprocessing the secret information in the third step comprises the following steps:
according to the preprocessing result of the carrier data, performing segmented calculation on the secret information to be embedded to complete the preprocessing of the secret information, so that the processed secret information corresponds to the preprocessed carrier data;
assuming that the length of the preprocessed carrier data segment is N and the ith segment embedded information is M _ i bits, segmenting the secret information according to the M _ i value and combining the difference value of the maximum value and the minimum value of each segment;
firstly, calculating the embeddable information quantity M _ i of the current segment;
secondly, calculating additional information quantity F _ i required by the segmentation for information embedding according to the numerical interval after the segmentation preprocessing;
and finally, combining the embeddable information quantity M _ i and the additional information quantity F _ i to obtain the segment embeddable secret information quantity S _ i, and segmenting the secret information according to the information quantity.
Further, in the fourth step, the preprocessed secret information is embedded into the preprocessed carrier data, and the specific method is as follows:
converting each byte data in the segment into eight-bit binary data, identified as [ D7, D6, D5, D4, D3, D2, D1, D0], the segment having n2 bytes; and the additional information mark and the preprocessed embeddable secret information form new secret information S1; adopting different information embedding methods according to different ranges of the preprocessed data:
1) when all data are located at [0,1] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely, the bits D7, D6, D5 and D4, new secret information S1 is embedded into the bits D3, D2 and D1 of the 1 st byte and the upper seven bits of the 3 rd to the n2 th bytes, namely, the bits D7, D6, D5, D4, D3, D2 and D1 in turn, and other bit data are not changed;
2) when all data are located at [0,2] after the segmentation preprocessing, an embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, new secret information S1 is embedded into the D3, D2 bits of the 1 st byte, the upper five bits of the 3 rd byte, namely D7, D6, D5, D4 and D3 bits, and the three bytes from the 4 th byte to the n2 byte form a group, and the upper seven bits of the 1 st byte, namely D7, D6, D5, D4, D3, D2 and D1 bits, and the upper six bits of the 2 rd and 3 bytes, namely D7, D6, D5, D4, D3 and D2 bits are embedded with information, and other bit data are not changed;
3) when all data are located at [0, 3] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, new secret information S1 is embedded into the upper six bits of the 1 st byte, namely D3 and D2 bits and the upper six bits of the 3 rd to the n2 th bytes, namely D7, D6, D5, D4, D3 and D2 bits in sequence according to bits, and other bit data are not changed;
4) when all data are located at [0, 4] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, new secret information S1 is embedded into the D3 and D2 bits of the 1 st byte and two bytes from the 3 rd byte to the n2 byte in sequence in a group, and the information embedding is carried out on the upper six bits of the 1 st byte, namely D7, D6, D5, D4, D3 and D2 bits and the upper five bits of the 2 nd byte, namely D7, D6, D5, D4 and D3 bits in sequence, and other bit data are not changed;
5) when all data are located at [0, 7] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely the D7, D6, D5 and D4 bits, new secret information S1 is embedded into the D3 bit of the 1 st byte and the upper five bits of the 3 rd byte to the n2 th byte, namely the D7, D6, D5, D4 and D3 bits in sequence by bit, and other bit data are not changed;
6) when all data are located at [0, 10] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, new secret information S1 is embedded into the D3 bits of the 1 st byte in sequence by bit, two bytes from the 3 rd byte to the n2 th byte form a group, and information embedding is carried out on the upper five bits of the 1 st byte, namely D7, D6, D5, D4, D3 bits and the upper four bits of the 2 nd byte, namely D7, D6, D5 and D4 bits in sequence by bit, and other bit data are not changed;
7) when all data are located at [0, 15] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, new secret information S1 is embedded in the upper four bits of the 3 rd byte to the n2 th byte in sequence by bit, namely D7, D6, D5 and D4 bits, and other bit data are not changed;
8) when all data are located at [0, 21] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, two bytes from the 3 rd byte to the n2 th byte of the carrier data are grouped, new secret information S1 is embedded into the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, and the upper three bits of the 2 nd byte, namely D7, D6 and D5 bits in turn according to bits, and other bit data are not changed;
9) when all data are located at [0, 31] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, new secret information S1 is embedded into the upper three bits of the 3 rd byte to the n2 th byte in sequence according to the bits, namely D7, D6 and D5 bits, and other bit data are not changed;
10) when all data are located at [0, 44] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, two bytes from the 3 rd byte to the n2 th byte of the carrier data are grouped, new secret information S1 is embedded into the upper three bits of the 1 st byte, namely D7, D6 and D5 bits, of each group in sequence according to bits, and the upper two bits of the 2 nd byte, namely D7 and D6 bits, and other bit data are not changed;
11) when all data are located at [0, 63] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, new secret information S1 is embedded into the upper two bits of the 3 rd byte to the n2 th byte in sequence according to the bits, namely D7 and D6 bits, and other bit data are not changed;
12) when all data are located at [0, 89] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, two bytes from the 3 rd byte to the n2 th byte of the carrier data are grouped, new secret information S1 is embedded into the upper two bits of the 1 st byte, namely D7 and D6 bits, the highest bit of the 2 nd byte, namely D7 bits, of each group in sequence according to bits, and other bit data are not changed;
13) when all data are located at [0,127] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, new secret information S1 is embedded into the highest bits of the 3 rd byte to the n2 th byte, namely D7 bits, according to the bits, and other bit data are not changed;
14) when all data are located at [0, 180] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, two bytes from the 3 rd byte to the n2 th byte of the carrier data are grouped, new secret information S1 is embedded into the highest bit of the 1 st byte of each group in sequence according to the bit, namely D7 bits, and other bit data are not changed;
15) when the difference value between the maximum value and the minimum value of the segment is larger than 128 and the number of the repeated data in the segment is larger than N/2, selecting the data with the most repeated number for hiding; the embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, new secret information S1 is embedded into the segment repeated data in sequence according to the bits, if the secret information is '1', the original data is not changed, if the secret information is '0', the original data is changed into the embedded data, and other data are not changed.
Further, the embedded type is 4 bits in total, specifically:
0000: no information is embedded in the segment;
0001: all data are located at [0,1] after the segmentation preprocessing;
0010: all data are located at [0,2] after the segmentation preprocessing;
0011: all data are located at [0, 3] after the segmentation preprocessing;
0100: all data are located at [0, 4] after the segmentation preprocessing;
0101: all data are located at [0, 7] after the segmentation preprocessing;
0110: all data are located at [0, 10] after the segmentation preprocessing;
0111: all data are located at [0, 15] after the segmentation preprocessing;
1000: all data are located at [0, 21] after the segmentation preprocessing;
1001: all data after the segmentation preprocessing are located at [0, 31 ];
1010: all data after the segmentation preprocessing are located at [0, 44 ];
1011: all data after the segmentation preprocessing are located at [0, 63 ];
1100: all data after the segmentation preprocessing are located in [0, 89 ];
1101: all data after the segmentation preprocessing are located at [0,127 ];
1110: all data after the segmentation preprocessing are located at [0, 180 ];
1111: the segment is embedded with information using duplicate data.
Further, the additional information identifier is specifically:
1) when all the data after the segmented preprocessing are located in [0,1], the additional information is marked as the lowest bit data D0 of the 1 st byte of the preprocessed carrier data;
2) when all the data after the segmented preprocessing are positioned at [0,2], the additional information is marked as the lower two-bit data D1 and D0 of the 2 nd byte of the preprocessed carrier data;
3) when all the data after the segmented preprocessing are positioned at [0, 3], the additional information is marked as the lower two-bit data D1 and D0 of the 2 nd byte of the preprocessed carrier data;
4) when all the data after the segmented preprocessing are positioned at [0, 4], the additional information is marked as low three-bit data D2, D1 and D0 of the 2 nd byte of the preprocessed carrier data;
5) when all the data after the segmented preprocessing are positioned at [0, 7], the additional information is marked as low three-bit data D2, D1 and D0 of the 2 nd byte of the preprocessed carrier data;
6) when all the data after the segmented preprocessing are positioned at [0, 10], the additional information is marked as low four-bit data D3, D2, D1 and D0 of the 2 nd byte of the preprocessed carrier data;
7) when all the data after the segment preprocessing are positioned at [0, 15], the additional information is marked as low four-bit data D3, D2, D1 and D0 of the 2 nd byte of the preprocessed carrier data;
8) when all the data after the segment preprocessing are positioned at [0, 21], the additional information is marked as lower five bits data D4, D3, D2, D1 and D0 of the 2 nd byte of the preprocessed carrier data;
9) when all the data after the segment preprocessing are located at [0, 31], the additional information is marked as D4 bit of the 1 st byte, and the lower five bits of data D4, D3, D2, D1 and D0 of the preprocessed carrier data;
10) when all the data after the segmented preprocessing are located at [0, 44], the additional information is marked as D4 bit of the 1 st byte of the preprocessed carrier data, and lower six bits of data D5, D4, D3, D2, D1 and D0 of the 2 nd byte;
11) when all the data after the segmented preprocessing are located at [0, 63], the additional information is marked as D5 and D4 bits of the 1 st byte of the preprocessed carrier data, and lower six-bit data D5, D4, D3, D2, D1 and D0 of the 2 nd byte;
12) when all the data after the segmented preprocessing are located at [0, 89], the additional information is marked as D5 and D4 bits of the 1 st byte of the preprocessed carrier data, and lower seven-bit data D6, D5, D4, D3, D2, D1 and D0 of the 2 nd byte;
13) when all the data after the segmented preprocessing are located at [0,127], the additional information is marked as D6, D5 and D4 bits of the 1 st byte of the preprocessed carrier data, and lower seven-bit data of the 2 nd byte, such as D6, D5, D4, D3, D2, D1 and D0;
14) when all the data after the segmented preprocessing are located at [0, 180], the additional information is marked as D6, D5 and D4 bits of the 1 st byte of the preprocessed carrier data, and lower seven-bit data of the 2 nd byte, such as D7, D6, D5, D4, D3, D2, D1 and D0;
15) when the difference value between the maximum value and the minimum value of the segment is larger than 128 and the number of the repeated data in the segment is larger than N/2, the additional information is marked as D7, D6, D5 and D4 bits of the first byte of the preprocessed carrier data and all bits of the second byte and the third byte.
Further, the present invention also provides an information embedding system, including:
an optimal fragment length determination module: analyzing and calculating the original data according to different segment lengths, selecting a segment length with the largest information embedding amount as the optimal segment length, and segmenting the original data;
a segmented data pre-processing module: preprocessing the data in each segment to obtain preprocessed carrier data;
secret information preprocessing module: preprocessing the secret information according to the data characteristics of the carrier;
an information embedding module: and embedding the preprocessed secret information into the preprocessed carrier data to realize the segment information embedding based on the data characteristics.
Compared with the prior art, the invention has the beneficial effects that:
(1) when information is embedded, the file is segmented, the original data is analyzed and calculated according to different segment lengths, and finally a segment length with the largest information embedding amount is selected.
(2) The invention expands the redundancy range of the segmented data and increases the information embedding amount by analyzing and preprocessing the characteristics of the segmented data.
Assuming a group of data with length of L, when information is embedded by using the conventional method, if all data are less than 2n, the group of data embedding amount Q1 is (8-n) × L;
when the method of the present invention is adopted, if the difference between the maximum value and the minimum value of the group of data is D, and D is<m(2n-1<m<2n)；
When n is 2 and m is 3, the group data embedding quantity Q2 is more than 19 × L/3, and Q1 is 6 × L, i.e., Q2 is more than Q1;
when n >2, the set of data embedding amount Q2> (17-2n) × L/3, and Q1 ═ 8-n) × L, i.e., Q2> Q1;
(3) the invention can embed the secret information into multimedia media such as text, image, audio and the like, thereby avoiding arousing the attention of malicious attackers on the Internet and enhancing the security of data transmission.
(4) The invention provides an information lossless embedding method based on data characteristics, which is characterized in that each group of data characteristics is analyzed, all data is recombined according to a certain rule, and the distribution of each group of data tends to be concentrated, so that the redundancy of the segment is increased, more information can be embedded into the segment, and the original carrier data and the embedded information can be restored in a lossless manner.
(5) When the information is embedded, the file is segmented, the original data is analyzed and calculated according to different segment lengths, and the selected optimal segment length can ensure the maximum information embedding amount. By analyzing and preprocessing the characteristics of segmented data and combining a multi-byte joint coding and interval mapping method, the redundancy range of the segmented data is expanded, the information embedding amount is increased, and the lossless embedding of information is realized.
(6) The method of the invention has the characteristics of information lossless embedding and independence on types, and meanwhile, the secret information can be embedded into multimedia media such as texts, images, audio and the like, thereby avoiding the attention of malicious attackers on the Internet and enhancing the safety of data transmission.
Drawings
FIG. 1 is a flow chart of an information embedding method.
Fig. 2 is a specific implementation process of a segmentation information embedding method based on data characteristics.
Detailed Description
The following detailed description is to be read with reference to the drawings and the detailed description.
Typically, when the difference between the maximum and minimum values in a set of data sets is less than 2n1(0. ltoreq. n 1. ltoreq.7), the group dataBy preprocessing, 8-n1 bits of information can be embedded in each byte. The invention analyzes the characteristics of each group of data, and enlarges the redundancy of each group of data by combining two or three bytes for calculation and interval mapping, so that the difference between the maximum value and the minimum value in the data set is less than m (2)n<m<2n+1N is more than or equal to 2 and less than or equal to 7), more information can be embedded.
As shown in fig. 1 and 2, the method for embedding the segmented information based on the data characteristics provided by the present invention includes the following specific steps:
step one, analyzing and calculating the original data according to different segment lengths, selecting a segment length with the largest information embedding amount, and segmenting the original data.
And performing characteristic analysis on each segment, traversing different segment lengths, calculating the information embedding amount of the whole data under each segment, and selecting the segment mode with the maximum information embedding amount as the optimal segment length.
Assuming that the difference between the maximum value and the minimum value in the segment is D, the segment length is L, the lossless embedding additional information is 12 bits, and the number of data with the most occurrence in the segment is T, according to different ranges of D, the specific calculation method of the segment information embedding amount is as follows:
(1) if the D is less than 3, then,
when L is 3 × k, k is a positive integer, the segmentation information embedding amount M is 19 × k-12;
when L is 3 × k +1, k is a positive integer, the segmentation information embedding amount M is 19 × k-6;
when L is 3 × k +2, k is a positive integer, the segmentation information embedding amount M is 19 × k;
(2) if D is<m, m is between 2nAnd 2n+1And satisfies the condition m2≤2n×2n+1(n is more than or equal to 2 and less than or equal to 7),
when L is 2 × k, k is a positive integer, the segmentation information embedding amount M is (15-2n) × k-12;
when L is 2 × k +1, k is a positive integer, the segmentation information embedding amount M is (15-2n) × k-7;
(3) if the D is less than 181, then,
when L is 2 × k or L is 2 × k +1 and T-8> k, k is a positive integer, the segmentation information embedding amount M is T-20;
when L ═ 2 × k or L ═ 2 × k +1 and T-8 ≦ k, k is a positive integer, then the segmentation information embedding amount M ═ k-12;
(4) if D >181 and T-8>12, the segment information embedding amount M is T-20;
(5) if D is<2n1When n1 is not less than 0 and not more than 7, the segment information embedding amount M is (8-n1) × L-12;
(6) in other cases, M is equal to 0, which indicates that the segment cannot be hidden, and four bits of identification information need to be reserved for the total embedding amount M.
Step two, carrying out research on data distribution in each section, analyzing data characteristics, and carrying out pretreatment according to methods such as multi-byte joint calculation and interval mapping;
and assuming that the difference between the maximum value and the minimum value in the segmented group of data is D, adopting different preprocessing methods according to different ranges of D.
2.1 when D is 2n1When the byte is not less than 0 and not more than n1 and not more than 7, the information embedding can be carried out on the high (8-n1) bit of each byte, and the specific preprocessing method comprises the following steps:
first, each byte in the set of data is subtracted by the minimum value in the set of data, so that all data values lie between 0 and D, since D is 2n1Then the high (8-n1) bit of each byte of the group of data is zero and can be used to embed 8-n1 bits of information;
2.2 when D <3, 19 bits of information can be embedded in every three bytes, and the specific preprocessing method is as follows:
firstly, subtracting the minimum value in the group of data from all data to ensure that all data are positioned in a [0,2] interval;
then, data is divided into a group of three in sequence, and byte calculation is performed by recording the group as [ T1, T2 and T3], wherein the specific calculation method comprises the following steps:
1) when T3 is located at [0,1], T1 is located at [0,2], and T2 is located at [0,2], T1 ═ T1, T2 ═ T2, T3 ═ T3, T1 is located at [0, 3], T2 is located at [0, 3], and T3 is located at [0,1 ];
2) when T3 is 2, T1 is located at [0,1], and T2 is located at [0,2], T3 is T1, T1 is 3, and T2 is T2, so that T1 is 3, T2 is located at [0,2], and T3 is located at [0,1 ];
3) when T3 is 2, T1 is 2, and T2 is located at [0,1], T1 is T1, T3 is T2, T2 is 3, T1 is 2, T2 is 3, and T3 is located at [0,1 ];
4) when T3 is 2, T1 is 2, and T2 is 2, T3 is T3-2, T1 is 3, and T2 is 3, T1 is 3, T2 is 3, and T3 is located at [0,1 ];
2.3 when D<m, m satisfies the condition m2≤2n×2n+1And when n is more than or equal to 2 and less than or equal to 7, 15-2n bit information can be embedded into every two bytes.
In the present invention, the optimum m values are selected to be 5, 11, 22, 45, 90, 181; the specific pretreatment method corresponding to different m values is as follows:
1) when m is 5, namely the difference value of the group of data is D < 5;
firstly, subtracting the minimum value in the group of data from all data to ensure that all data are positioned in a [0, 4] interval;
then, dividing the data into two groups in sequence, which are denoted as [ T1, T2], decomposing the data according to 5 × 5, and mapping the data into 4 × 8 intervals, that is, 5 × 5 ═ 4 × 4+4 × 1+1 × 4+1 × 1; the specific calculation method comprises the following steps:
when T2 is located at [0, 3] and T1 is located at [0, 4], T1 is T1, T2 is T2, T1 is located at [0, 4], T2 is located at [0, 3 ];
when T2 is 4 and T1 is located at [0, 3], T1 is 5, T2 is T1, making T1 [5], T2 is located at [0, 3 ];
when T2 is 4 and T1 is 4, T1 is 6 and T2 is 3.
After preprocessing, the first byte is positioned at [0, 7] and 5 bits of information can be embedded; the second byte is located at [0, 3] and 6 bits of information can be embedded.
2) When m is 11, namely the difference value of the group of data is D < 11;
firstly, subtracting the minimum value in the group of data from all data to ensure that all data are positioned in a [0, 10] interval;
then, dividing the data into two groups in sequence, which are denoted as [ T1, T2], decomposing the data according to 11 × 11, and mapping the data to an 8 × 16 interval, that is, 11 × 11 ═ 11 × 8+8 × 3+2 × 3+1 × 3; the specific calculation method comprises the following steps:
when T2 is located at [0, 7] and T1 is located at [0, 10], T1 is T1, T2 is T2, T1 is located at [0, 10], T2 is located at [0, 7 ];
when T2 is located at [8, 10] and T1 is located at [0, 7], T2 ═ T1, T1 ═ T2+3, T1 is located at [11, 13], T2 is located at [0, 7 ];
when T2 is located at [8, 10] and T1 is located at [8, 9], T2 ═ T2-3, T1 ═ T1+6, T1 is located at [14, 15], T2 is located at [5, 7 ];
when T2 is located at [8, 10] and T1 is [10], T2 is T2-6, T1 is T1+5, T1 is located at [15], and T2 is located at [2, 4 ];
after preprocessing, the first byte is positioned at [0, 15] and 4 bits of information can be embedded; the second byte is located at [0, 7], and 5 bits of information can be embedded.
3) When m is 22, namely the difference value of the group of data is D < 22;
firstly, subtracting the minimum value in the group of data from all data to ensure that all data are positioned in a [0, 21] interval;
then, the data is divided into two groups in sequence, remembering [ T1, T2], the data is decomposed according to 22 × 22 and mapped to a 16 × 32 interval, that is, 22 × 22 ═ 16 × 22+6 × 16+6 × 4+6 × 2; the specific calculation method comprises the following steps:
when T2 is located at [0, 15] and T1 is located at [0, 21], T1 is T1, T2 is T2, T1 is located at [0, 21], T2 is located at [0, 15 ];
when T2 is located at [16, 21] and T1 is located at [0, 15], T2 ═ T1, T1 ═ T2+6, T1 is located at [22, 27], T2 is located at [0, 15 ];
when T2 is located at [16, 21] and T1 is located at [16, 19], T2 ═ T2-16, T1 ═ T1+12, T1 is located at [28, 31], T2 is located at [0, 5 ];
when T2 is located at [16, 21] and T1 is located at [20, 21], T2 ═ T2-10, T1 ═ T1+8, T1 is located at [28, 29], T2 is located at [6, 11 ];
after preprocessing, the first byte is positioned at [0, 31] and 3 bits of information can be embedded; the second byte is positioned at [0, 15] and can be embedded with 4 bits of information;
4) when m is 45, i.e. the difference of the set of data is D < 45;
firstly, subtracting the minimum value in the group of data from all data to ensure that all data are positioned in a [0, 44] interval;
then, the data is divided into two groups in sequence, remembering [ T1, T2], the data is decomposed according to 45 × 45 and mapped to a 32 × 64 interval, that is, 45 × 45 ═ 45 × 32+32 × 13+6 × 13+6 × 13+1 × 6+1 × 6+1 × 1; the specific calculation method comprises the following steps:
when T2 is located at [0, 31] and T1 is located at [0, 44], T1 is T1, T2 is T2, T1 is located at [0, 44], T2 is located at [0, 31 ];
when T2 is located at [32, 44] and T1 is located at [0, 31], T2 ═ T1, T1 ═ T2+13, T1 is located at [45, 57], T2 is located at [0, 31 ];
when T2 is located at [32, 44] and T1 is located at [32, 37], T2 ═ T2-32, T1 ═ T1+26, with T1 located at [58, 63], T2 located at [0,12 ];
when T2 is located at [32, 44] and T1 is located at [38, 43], T1 is T1+20, T2 is T2-19, T1 is located at [58, 63], T2 is located at [13, 25 ];
when T1 ═ 44 and T2 are located at [32, 37], T1 ═ T2+26 and T2 ═ 26, such that T1 is located at [58, 63] and T2 is 26;
when T1 ═ 44, T2 is located [38, 43], T1 ═ T2+20, T2 ═ 27, making T1 located [58, 63], T2 is 27;
when T1-44, T2-44, T1-58, T2-28;
after preprocessing, the first byte is positioned at [0, 63] and 2 bits of information can be embedded; the second byte is positioned at [0, 31] and can be embedded with 3 bits of information;
5) when m is 90, i.e. the difference of the set of data is D < 90;
firstly, subtracting the minimum value in the group of data from all data to ensure that all data are positioned in a [0, 89] interval;
then, the data is divided into two groups in sequence, and [ T1, T2] is memorized, the data is decomposed according to 90 × 90 and mapped to a 64 × 128 interval, that is, 90 × 90 ═ 90 × 64+64 × 26+12 × 26+12 × 26+2 × 12+2 × 12+2 × 2; the specific calculation method comprises the following steps:
when T2 is located at [0, 63] and T1 is located at [0, 89], T1 is T1, T2 is T2, T1 is located at [0, 89], T2 is located at [0, 63 ];
when T2 is located at [64, 89] and T1 is located at [0, 63], T1 is T2+26, T2 is T1, T1 is located at [90, 115], T2 is located at [0, 63 ];
when T2 is located at [64, 89] and T1 is located at [64, 75], T1 ═ T1+52, T2 ═ T2-64, let T1 be located at [116, 127], T2 be located at [0, 25 ];
when T2 is located at [64, 89] and T1 is located at [76, 87], T1 is T1+40, T2 is T2-38, T1 is located at [116, 127], T2 is located at [26, 51 ];
when T1 is located at [88, 89] and T2 is located at [64, 75], T1 is T2+52, T2 is T1-36, T1 is located at [116, 127], T2 is located at [52, 53 ];
when T1 is located at [88, 89] and T2 is located at [76, 87], T1 is T2+40, T2 is T1-34, T1 is located at [116, 127], T2 is located at [54, 55 ];
when T1 is located at [88, 89] and T2 is located at [88, 89], T1 is T2+28, T2 is T1-32, T1 is located at [116, 117], T2 is located at [56, 57 ];
after preprocessing, the first byte is positioned at [0,127], and 1-bit information can be embedded; the second byte is positioned at [0, 63] and can be embedded with 2 bits of information;
6) when m is 181, that is, the difference value of the group of data is D < 181;
firstly, subtracting the minimum value in the group of data from all data to ensure that all data are positioned in a [0, 180] interval;
then, the data is divided into two groups in sequence, remembers [ T1, T2], and is decomposed according to 181 × 181 and mapped to 128 × 256 intervals, namely
181×181＝181×128+128×53+22×53+22×53+9×22+9×22+9×4+9×4+4×1+4×1+1×1；
The specific calculation method comprises the following steps:
when T2 is located at [0,127] and T1 is located at [0, 180], T1 is T1, T2 is T2, T1 is located at [0, 180], T2 is located at [0,127 ];
when T2 is located at [128, 180] and T1 is located at [0,127], T1 ═ T2+53, T2 ═ T1, such that T1 is located at [181, 233], T2 is located at [0,127 ];
when T2 is located at [128, 180] and T1 is located at [128, 149], T1 is T1+106, T2 is T2-128, such that T1 is located at [234, 255], T2 is located at [0, 52 ];
when T2 is located at [128, 180] and T1 is located at [150, 171], T1 ═ T1+84, T2 ═ T2-75, with T1 located at [234, 255], T2 located at [53, 105 ];
when T2 is located at [128, 149] and T1 is located at [172, 180], T1 is T2+106, T2 is T1-66, T1 is located at [234, 255], T2 is located at [106, 114 ];
when T2 is located at [150, 171] and T1 is located at [172, 180], T2 is T2+84, T2 is T1-57, T1 is located at [234, 255], T2 is located at [115, 123 ];
when T2 is located at [172, 175] and T1 is located at [172, 180], T1 is T1+62, T2 is T2-48, T1 is located at [234, 242], T2 is located at [124, 127 ];
when T2 is located at [176, 179] and T1 is located at [172, 180], T1 is T1+71, T2 is T2-72, T1 is located at [243, 251], T2 is located at [124, 127 ];
when T2 is 180 and T1 is located at [172, 175], T1 is T1+80 and T2 is 124, so that T1 is located at [252, 255] and T2 is 124;
when T2 is 180 and T1 is located at [176, 179], T1 is T1+76 and T2 is 125, such that T1 is located at [252, 255] and T2 is 125;
when T2 is 180, T1 is 180, T1 is 252, T2 is 126, so that T1 is 252 and T2 is at 126;
after preprocessing, the first byte is located at [0, 255 ]; the second byte is located at [0,127] and can embed 1 bit of information.
Thirdly, preprocessing the secret information according to the data characteristics of the carrier;
and according to the preprocessing result of the carrier data, performing segmented calculation on the secret information to be embedded to complete the preprocessing of the secret information, so that the processed secret information corresponds to the preprocessed carrier data.
Assuming that the length of the preprocessed carrier data segment is N, the embeddable information of the ith segment is M _ i bits, the secret information is segmented according to the M _ i value and the difference value of the maximum value and the minimum value of each segment is combined.
Firstly, calculating the embeddable information quantity M _ i of the current segment according to the method in the step one;
secondly, calculating additional information quantity F _ i required by the segmentation for information embedding according to the numerical interval after the segmentation preprocessing;
and finally, combining the embeddable information quantity M _ i and the additional information quantity F _ i to obtain the segment embeddable secret information quantity S _ i, and segmenting the secret information according to the information quantity. The calculation method in this step is the same as that in the first step.
And step four, embedding the secret information into the preprocessed carrier data.
Converting each byte data in the segment into eight-bit binary data, identified as [ D7, D6, D5, D4, D3, D2, D1, D0], for a total of n2 bytes; and the additional information identification and the preprocessed embeddable secret information are combined to form new secret information S1. Different information embedding methods are adopted according to different ranges of the preprocessed data, and the embedding at the high bits of the original carrier data is taken as an example for description, and the carrier data low bit embedding methods are consistent.
1) When all data are located at [0,1] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte (namely, the bits D7, D6, D5 and D4), new secret information S1 is embedded in the bits D3, D2 and D1 of the 1 st byte and the upper seven bits of the 3 rd to the n2 th bytes (namely, the bits D7, D6, D5, D4, D3, D2 and D1), and other bit data are not changed.
2) When all data are located at [0,2] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte (namely, D7, D6, D5 and D4 bits), new secret information S1 is embedded into the D3, D2 bits of the 1 st byte, the upper five bits of the 3 rd byte (namely, D7, D6, D5, D4 and D3 bits), three bytes from the 4 th byte to the n2 byte form a group, and the information is embedded into the upper seven bits of the 1 st byte (namely, D7, D6, D5, D4, D3, D2 and D1 bits) of each group in a bit-by-bit mode, the upper six bits of the 2 rd and 3 bytes (namely, D7, D6, D5, D4, D3 and D2 bits) and other bit data are not changed.
3) When all data are located at [0, 3] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte (i.e., D7, D6, D5, D4 bits), new secret information S1 is embedded bit by bit in the D3, D2 bits of the 1 st byte, and the upper six bits of the 3 rd to n2 th bytes (i.e., D7, D6, D5, D4, D3, D2 bits), and the other bit data are not changed.
4) When all data are located at [0, 4] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte (namely, D7, D6, D5 and D4 bits), new secret information S1 is embedded into the D3, D2 bits of the 1 st byte in sequence by bit, two bytes from the 3 rd byte to the n2 byte form a group, the embedding information is carried out on the upper six bits of the 1 st byte (namely, D7, D6, D5, D4, D3 and D2 bits) in sequence by bit, the upper five bits of the 2 nd byte (namely, D7, D6, D5, D4 and D3 bits), and other bit data are not changed.
5) When all data are located at [0, 7] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte (i.e., D7, D6, D5, D4 bits), new secret information S1 is embedded in the D3 bits of the 1 st byte and the upper five bits of the 3 rd byte to the n2 th byte in sequence by bit (i.e., D7, D6, D5, D4, D3 bits), and other bit data are not changed.
6) When all data are located at [0, 10] after the segmentation preprocessing, the embedding type is placed in the upper four bits (namely, D7, D6, D5 and D4 bits) of the 1 st byte, new secret information S1 is embedded into the D3 bits of the 1 st byte in sequence by bit, two bytes from the 3 rd byte to the n2 th byte form a group, the embedding is carried out on the upper five bits (namely, D7, D6, D5, D4 and D3 bits) of the 1 st byte and the upper four bits (namely, D7, D6, D5 and D4 bits) of the 2 nd byte in sequence by bit, and other bit data are not changed.
7) When all data are located at [0, 15] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte (namely, D7, D6, D5 and D4 bits), new secret information S1 is embedded in the upper four bits of the 3 rd byte to the n2 th byte in sequence by bit (namely, D7, D6, D5 and D4 bits), and other bit data are not changed.
8) When all data are located at [0, 21] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte (namely, D7, D6, D5 and D4 bits), two bytes from the 3 rd byte to the n2 th byte of the carrier data are grouped, new secret information S1 is embedded in the upper four bits of the 1 st byte (namely, D7, D6, D5 and D4 bits) of each group in sequence according to bits, the upper three bits of the 2 nd byte (namely, D7, D6 and D5 bits) and other bit data are not changed.
9) When all data are located at [0, 31] after the segmentation preprocessing, the embedding type is placed in the upper four bits (namely, D7, D6, D5 and D4 bits) of the 1 st byte, new secret information S1 is embedded in the upper three bits (namely, D7, D6 and D5 bits) of the 3 rd byte to the n2 th byte in sequence by bit, and other bit data are not changed.
10) When all data are located at [0, 44] after the segmentation preprocessing, the embedding type is placed in the upper four bits (namely, D7, D6, D5 and D4 bits) of the 1 st byte, two bytes from the third byte to the n2 th byte of the carrier data are grouped, new secret information S1 is embedded into the upper three bits (namely, D7, D6 and D5 bits) of the 1 st byte of each group and the upper two bits (namely, D7 and D6 bits) of the 2 nd byte in sequence according to bits, and other bit data are not changed.
11) When all data are located at [0, 63] after the segmentation preprocessing, the embedding type is placed in the upper four bits (namely, D7, D6, D5 and D4 bits) of the 1 st byte, new secret information S1 is embedded in the upper two bits (namely, D7 and D6 bits) of the 3 rd byte to the n2 th byte in sequence by bit, and other bit data are not changed.
12) When all data are located at [0, 89] after the segmentation preprocessing, the embedding type is placed in the upper four bits (namely, D7, D6, D5 and D4 bits) of the 1 st byte, two bytes from the third byte to the n2 th byte of the carrier data are grouped, new secret information S1 is embedded into the upper two bits (namely, D7 and D6 bits) of the 1 st byte and the highest bit (namely, D7 bit) of the 2 nd byte in sequence according to bits, and other bit data are not changed.
13) When all data are located at [0,127] after the segmentation preprocessing, the embedding type is placed in the upper four bits (namely, D7, D6, D5 and D4 bits) of the 1 st byte, new secret information S1 is embedded in the highest bits (namely, D7 bits) of the 3 rd byte to the n2 th byte in sequence by bit, and other bit data are not changed.
14) When all data are located at [0, 180] after the segmentation preprocessing, the embedding type is placed in the upper four bits (namely D7, D6, D5 and D4 bits) of the 1 st byte, two bytes from the third byte to the n2 th byte of the carrier data are grouped, new secret information S1 is embedded into the highest bit (D7 bits) of the 1 st byte of each group in sequence according to bits, and other bit data are not changed.
15) And when the difference value between the maximum value and the minimum value of the segment is larger than 128 and the number of the repeated data in the segment is larger than N/2, selecting the data with the most repeated number for hiding. The embedding type is placed in the upper four bits (namely D7, D6, D5 and D4 bits) of the 1 st byte, new secret information S1 is embedded in the segment repeated data in sequence according to the bits, if the secret information is '1', the original data is not changed, if the secret information is '0', the original data is changed into the embedded data, and other data are not changed.
At this point, the segmentation information embedding process based on the data characteristics is completed.
In the above process, the embedded type is 4 bits in total, specifically:
0000: no information is embedded in the segment;
0001: all data are located at [0,1] after the segmentation preprocessing;
0010: all data are located at [0,2] after the segmentation preprocessing;
0011: all data are located at [0, 3] after the segmentation preprocessing;
0100: all data are located at [0, 4] after the segmentation preprocessing;
0101: all data are located at [0, 7] after the segmentation preprocessing;
0110: all data are located at [0, 10] after the segmentation preprocessing;
0111: all data are located at [0, 15] after the segmentation preprocessing;
1000: all data are located at [0, 21] after the segmentation preprocessing;
1001: all data after the segmentation preprocessing are located at [0, 31 ];
1010: all data after the segmentation preprocessing are located at [0, 44 ];
1011: all data after the segmentation preprocessing are located at [0, 63 ];
1100: all data after the segmentation preprocessing are located in [0, 89 ];
1101: all data after the segmentation preprocessing are located at [0,127 ];
1110: all data after the segmentation preprocessing are located at [0, 180 ];
1111: the segment is embedded with information using duplicate data.
The additional information identifier is specifically:
1) when all the data after the segmented preprocessing are located in [0,1], the additional information is marked as the lowest bit data D0 of the 1 st byte of the preprocessed carrier data;
2) when all the data after the segmented preprocessing are positioned at [0,2], the additional information is marked as the lower two-bit data D1 and D0 of the 2 nd byte of the preprocessed carrier data;
3) when all the data after the segmented preprocessing are positioned at [0, 3], the additional information is marked as the lower two-bit data D1 and D0 of the 2 nd byte of the preprocessed carrier data;
4) when all the data after the segmented preprocessing are positioned at [0, 4], the additional information is marked as low three-bit data D2, D1 and D0 of the 2 nd byte of the preprocessed carrier data;
5) when all the data after the segmented preprocessing are positioned at [0, 7], the additional information is marked as low three-bit data D2, D1 and D0 of the 2 nd byte of the preprocessed carrier data;
6) when all the data after the segmented preprocessing are positioned at [0, 10], the additional information is marked as low four-bit data D3, D2, D1 and D0 of the 2 nd byte of the preprocessed carrier data;
7) when all the data after the segment preprocessing are positioned at [0, 15], the additional information is marked as low four-bit data D3, D2, D1 and D0 of the 2 nd byte of the preprocessed carrier data;
8) when all the data after the segment preprocessing are positioned at [0, 21], the additional information is marked as lower five bits data D4, D3, D2, D1 and D0 of the 2 nd byte of the preprocessed carrier data;
9) when all the data after the segment preprocessing are located at [0, 31], the additional information is marked as D4 bit of the 1 st byte, and the lower five bits of data D4, D3, D2, D1 and D0 of the preprocessed carrier data;
10) when all the data after the segmented preprocessing are located at [0, 44], the additional information is marked as D4 bit of the 1 st byte of the preprocessed carrier data, and lower six bits of data D5, D4, D3, D2, D1 and D0 of the 2 nd byte;
11) when all the data after the segmented preprocessing are located at [0, 63], the additional information is marked as D5 and D4 bits of the 1 st byte of the preprocessed carrier data, and lower six-bit data D5, D4, D3, D2, D1 and D0 of the 2 nd byte;
12) when all the data after the segmented preprocessing are located at [0, 89], the additional information is marked as D5 and D4 bits of the 1 st byte of the preprocessed carrier data, and lower seven-bit data D6, D5, D4, D3, D2, D1 and D0 of the 2 nd byte;
13) when all the data after the segmented preprocessing are located at [0,127], the additional information is marked as D6, D5 and D4 bits of the 1 st byte of the preprocessed carrier data, and lower seven-bit data of the 2 nd byte, such as D6, D5, D4, D3, D2, D1 and D0;
14) when all the data after the segmented preprocessing are located at [0, 180], the additional information is marked as D6, D5 and D4 bits of the 1 st byte of the preprocessed carrier data, and lower seven-bit data of the 2 nd byte, such as D7, D6, D5, D4, D3, D2, D1 and D0;
15) when the difference value between the maximum value and the minimum value of the segment is larger than 128 and the number of the repeated data in the segment is larger than N/2, the additional information is marked as D7, D6, D5 and D4 bits of the first byte of the preprocessed carrier data and all bits of the second byte and the third byte.
The invention enlarges the redundancy of the original carrier data and increases the information embedding amount by analyzing and preprocessing the carrier data characteristics, is suitable for data with any format (such as original images, compressed images, voice, compressed voice, texts, compressed text data, video data, compressed video data and the like), has the carrier information embedding amount superior to that of the original data, and can completely recover the original carrier data and the embedded data without loss under the condition of not increasing the channel capacity.
In summary, the present invention is inventive, and the present invention can improve the transmission capacity of the system without increasing channel resources, and is suitable for various types of data transmission systems. Therefore, the invention is suitable for being used in a spatial information network, particularly in a satellite communication system and a navigation system, and has wide application prospect and practicability.
The invention is not described in detail and is within the knowledge of a person skilled in the art.

Claims (10)

1. A data feature-based segmentation information embedding method is characterized by comprising the following steps:
analyzing and calculating original data according to different segment lengths, selecting a segment length with the largest information embedding amount as an optimal segment length, and segmenting the original data;
step two, preprocessing the data in each segment to obtain preprocessed carrier data;
thirdly, preprocessing the secret information according to the data characteristics of the carrier;
and step four, embedding the preprocessed secret information into the preprocessed carrier data to realize the segmented information embedding based on the data characteristics.
2. The data feature-based segmentation information embedding method according to claim 1, wherein: the method for determining the optimal fragment length in the first step specifically comprises the following steps:
performing characteristic analysis on each segment, traversing different segment lengths, calculating the information embedding amount of the whole data under each segment, and selecting the segment mode with the maximum information embedding amount as the optimal segment length;
assuming that the difference between the maximum value and the minimum value in a certain segment is D, the segment length is L, the lossless embedding additional information is 12 bits, the number of data appearing most in the segment is T, and m is a specific value, according to different ranges of D, the specific calculation method of the segment information embedding amount is as follows:
(1) if the D is less than 3, then,
when L is 3 × k, k is a positive integer, the segmentation information embedding amount M is 19 × k-12;
when L is 3 × k +1, k is a positive integer, the segmentation information embedding amount M is 19 × k-6;
when L is 3 × k +2, k is a positive integer, the segmentation information embedding amount M is 19 × k;
(2) if D is<m, m is between 2nAnd 2n+1And satisfies the condition m2≤2n×2n+1When n is more than or equal to 2 and less than or equal to 7;
when L is 2 × k, k is a positive integer, the segmentation information embedding amount M is (15-2n) × k-12;
when L is 2 × k +1, k is a positive integer, the segmentation information embedding amount M is (15-2n) × k-7; (3) if D < 181;
when L is 2 × k or L is 2 × k +1 and T-8> k, k is a positive integer, the segmentation information embedding amount M is T-20;
when L ═ 2 × k or L ═ 2 × k +1 and T-8 ≦ k, k is a positive integer, then the segmentation information embedding amount M ═ k-12;
(4) if D >181 and T-8>12, the segment information embedding amount M is T-20;
(5) if D is<2n1When n1 is not less than 0 and not more than 7, the segment information embedding amount M is (8-n1) × L-12;
(6) in other cases, M is equal to 0, which indicates that the segment cannot be hidden, and four bits of identification information need to be reserved for the total embedding amount M.
3. The data feature-based segmentation information embedding method according to claim 1, wherein: the method for preprocessing each segment data in the second step specifically comprises the following steps:
assuming that the difference between the maximum value and the minimum value in the segmented group of data is D, adopting different preprocessing methods according to different ranges of D:
(1) when D is present<2n1And n1 is more than or equal to 0 and less than or equal to 7, information embedding is carried out on the high (8-n1) bit of each byte, and the specific preprocessing process is as follows:
first, each byte in the set of data is subtracted by the minimum in the set of data, so that all data values lie between 0 and D, since D<2n1Then the high (8-n1) bit of each byte of the group of data is zero for embedding 8-n1 bits of information;
(2) when D is present<m, m satisfies the condition m2≤2n×2n+1And when n is more than or equal to 7 and more than or equal to 2, embedding (15-2n) bit information into every two bytes, wherein the specific processing process is as follows:
first, each byte in the group of data is subtracted by the minimum value in the group of data to make all data values between 0 and D, then the data is byte-calculated in two byte groups in sequence to make the 1 st byte data between 0 and 2n+1In between, the second byte data is between 0 and 2nAfter preprocessing, the 1 st byte data is embedded with (8-n) bit information, and the 2 nd byte data can be embedded(7-n) bit information;
if 2n<m<2n+1Then, the pretreatment is carried out according to the following method:
step one, subtracting the minimum value in the group of data from all data to ensure that all data are positioned in a [0, m-1] interval;
secondly, dividing the data into a group of two in sequence, marking as [ T1, T2] to carry out byte calculation, and mapping to corresponding intervals according to different m values;
after preprocessing, the first byte is located at [0,2]n-1]The second byte is located at [0,2]n+1-1]And (15-2n) bit information is embedded.
4. The data feature-based segmentation information embedding method according to claim 3, wherein: when the m value is specifically selected, the m value needs to satisfy the following conditions:
1) m is located in [ 2]n，2n+1]Within the interval;
2)m2≤2n×2n+1and n is more than or equal to 7 and more than or equal to 2;
the optimal m values which can be selected are 5, 11, 22, 45, 90 and 181.
5. The data feature-based segmentation information embedding method according to claim 4, wherein: the byte calculation specifically includes:
1) when m is 5, namely the difference value of the group of data is D < 5;
firstly, subtracting the minimum value in the group of data from all data to ensure that all data are positioned in a [0, 4] interval;
then, dividing the data into two groups in sequence, which are denoted as [ T1, T2], decomposing the data according to 5 × 5, and mapping the data into 4 × 8 intervals, that is, 5 × 5 ═ 4 × 4+4 × 1+1 × 4+1 × 1; the specific calculation method comprises the following steps:
when T2 is located at [0, 3] and T1 is located at [0, 4], T1 is T1, T2 is T2, T1 is located at [0, 4], T2 is located at [0, 3 ];
when T2 is 4 and T1 is located at [0, 3], T1 is 5, T2 is T1, making T1 [5], T2 is located at [0, 3 ];
when T2 is 4 and T1 is 4, T1 is 6, T2 is 3;
after preprocessing, the first byte is positioned at [0, 7] and 5 bits of information can be embedded; the second byte is positioned at [0, 3] and can be embedded with 6 bits of information;
2) when m is 11, namely the difference value of the group of data is D < 11;
firstly, subtracting the minimum value in the group of data from all data to ensure that all data are positioned in a [0, 10] interval;
then, dividing the data into two groups in sequence, which are denoted as [ T1, T2], decomposing the data according to 11 × 11, and mapping the data to an 8 × 16 interval, that is, 11 × 11 ═ 11 × 8+8 × 3+2 × 3+1 × 3; the specific calculation method comprises the following steps:
when T2 is located at [0, 7] and T1 is located at [0, 10], T1 is T1, T2 is T2, T1 is located at [0, 10], T2 is located at [0, 7 ];
when T2 is located at [8, 10] and T1 is located at [0, 7], T2 ═ T1, T1 ═ T2+3, T1 is located at [11, 13], T2 is located at [0, 7 ];
when T2 is located at [8, 10] and T1 is located at [8, 9], T2 ═ T2-3, T1 ═ T1+6, T1 is located at [14, 15], T2 is located at [5, 7 ];
when T2 is located at [8, 10] and T1 is [10], T2 is T2-6, T1 is T1+5, T1 is located at [15], and T2 is located at [2, 4 ];
after preprocessing, the first byte is positioned at [0, 15] and 4 bits of information can be embedded; the second byte is positioned at [0, 7] and can be embedded with 5 bits of information;
3) when m is 22, namely the difference value of the group of data is D < 22;
firstly, subtracting the minimum value in the group of data from all data to ensure that all data are positioned in a [0, 21] interval;
then, the data is divided into two groups in sequence, remembering [ T1, T2], the data is decomposed according to 22 × 22 and mapped to a 16 × 32 interval, that is, 22 × 22 ═ 16 × 22+6 × 16+6 × 4+6 × 2; the specific calculation method comprises the following steps:
when T2 is located at [0, 15] and T1 is located at [0, 21], T1 is T1, T2 is T2, T1 is located at [0, 21], T2 is located at [0, 15 ];
when T2 is located at [16, 21] and T1 is located at [0, 15], T2 ═ T1, T1 ═ T2+6, T1 is located at [22, 27], T2 is located at [0, 15 ];
when T2 is located at [16, 21] and T1 is located at [16, 19], T2 ═ T2-16, T1 ═ T1+12, T1 is located at [28, 31], T2 is located at [0, 5 ];
when T2 is located at [16, 21] and T1 is located at [20, 21], T2 ═ T2-10, T1 ═ T1+8, T1 is located at [28, 29], T2 is located at [6, 11 ];
after preprocessing, the first byte is positioned at [0, 31] and 3 bits of information can be embedded; the second byte is positioned at [0, 15] and can be embedded with 4 bits of information;
4) when m is 45, i.e. the difference of the set of data is D < 45;
firstly, subtracting the minimum value in the group of data from all data to ensure that all data are positioned in a [0, 44] interval;
then, the data is divided into two groups in sequence, remembering [ T1, T2], the data is decomposed according to 45 × 45 and mapped to a 32 × 64 interval, that is, 45 × 45 ═ 45 × 32+32 × 13+6 × 13+6 × 13+1 × 6+1 × 6+1 × 1; the specific calculation method comprises the following steps:
when T2 is located at [0, 31] and T1 is located at [0, 44], T1 is T1, T2 is T2, T1 is located at [0, 44], T2 is located at [0, 31 ];
when T2 is located at [32, 44] and T1 is located at [0, 31], T2 ═ T1, T1 ═ T2+13, T1 is located at [45, 57], T2 is located at [0, 31 ];
when T2 is located at [32, 44] and T1 is located at [32, 37], T2 ═ T2-32, T1 ═ T1+26, with T1 located at [58, 63], T2 located at [0,12 ];
when T2 is located at [32, 44] and T1 is located at [38, 43], T1 is T1+20, T2 is T2-19, T1 is located at [58, 63], T2 is located at [13, 25 ];
when T1 ═ 44 and T2 are located at [32, 37], T1 ═ T2+26 and T2 ═ 26, such that T1 is located at [58, 63] and T2 is 26;
when T1 ═ 44, T2 is located [38, 43], T1 ═ T2+20, T2 ═ 27, making T1 located [58, 63], T2 is 27;
when T1-44, T2-44, T1-58, T2-28;
after preprocessing, the first byte is positioned at [0, 63] and 2 bits of information can be embedded; the second byte is positioned at [0, 31] and can be embedded with 3 bits of information;
5) when m is 90, i.e. the difference of the set of data is D < 90;
firstly, subtracting the minimum value in the group of data from all data to ensure that all data are positioned in a [0, 89] interval;
then, the data is divided into two groups in sequence, and [ T1, T2] is memorized, the data is decomposed according to 90 × 90 and mapped to a 64 × 128 interval, that is, 90 × 90 ═ 90 × 64+64 × 26+12 × 26+12 × 26+2 × 12+2 × 12+2 × 2; the specific calculation method comprises the following steps:
when T2 is located at [0, 63] and T1 is located at [0, 89], T1 is T1, T2 is T2, T1 is located at [0, 89], T2 is located at [0, 63 ];
when T2 is located at [64, 89] and T1 is located at [0, 63], T1 is T2+26, T2 is T1, T1 is located at [90, 115], T2 is located at [0, 63 ];
when T2 is located at [64, 89] and T1 is located at [64, 75], T1 ═ T1+52, T2 ═ T2-64, let T1 be located at [116, 127], T2 be located at [0, 25 ];
when T2 is located at [64, 89] and T1 is located at [76, 87], T1 is T1+40, T2 is T2-38, T1 is located at [116, 127], T2 is located at [26, 51 ];
when T1 is located at [88, 89] and T2 is located at [64, 75], T1 is T2+52, T2 is T1-36, T1 is located at [116, 127], T2 is located at [52, 53 ];
when T1 is located at [88, 89] and T2 is located at [76, 87], T1 is T2+40, T2 is T1-34, T1 is located at [116, 127], T2 is located at [54, 55 ];
when T1 is located at [88, 89] and T2 is located at [88, 89], T1 is T2+28, T2 is T1-32, T1 is located at [116, 117], T2 is located at [56, 57 ];
after preprocessing, the first byte is positioned at [0,127], and 1-bit information can be embedded; the second byte is positioned at [0, 63] and can be embedded with 2 bits of information;
6) when m is 181, that is, the difference value of the group of data is D < 181;
firstly, subtracting the minimum value in the group of data from all data to ensure that all data are positioned in a [0, 180] interval;
then, the data is divided into two groups in sequence, remembers [ T1, T2], and is decomposed according to 181 × 181 and mapped to 128 × 256 intervals, namely
181×181＝181×128+128×53+22×53+22×53+9×22+9×22+9×4+9×4+4×1+4×1+1×1；
The specific calculation method comprises the following steps:
when T2 is located at [0,127] and T1 is located at [0, 180], T1 is T1, T2 is T2, T1 is located at [0, 180], T2 is located at [0,127 ];
when T2 is located at [128, 180] and T1 is located at [0,127], T1 ═ T2+53, T2 ═ T1, such that T1 is located at [181, 233], T2 is located at [0,127 ];
when T2 is located at [128, 180] and T1 is located at [128, 149], T1 is T1+106, T2 is T2-128, such that T1 is located at [234, 255], T2 is located at [0, 52 ];
when T2 is located at [128, 180] and T1 is located at [150, 171], T1 ═ T1+84, T2 ═ T2-75, with T1 located at [234, 255], T2 located at [53, 105 ];
when T2 is located at [128, 149] and T1 is located at [172, 180], T1 is T2+106, T2 is T1-66, T1 is located at [234, 255], T2 is located at [106, 114 ];
when T2 is located at [150, 171] and T1 is located at [172, 180], T2 is T2+84, T2 is T1-57, T1 is located at [234, 255], T2 is located at [115, 123 ];
when T2 is located at [172, 175] and T1 is located at [172, 180], T1 is T1+62, T2 is T2-48, T1 is located at [234, 242], T2 is located at [124, 127 ];
when T2 is located at [176, 179] and T1 is located at [172, 180], T1 is T1+71, T2 is T2-72, T1 is located at [243, 251], T2 is located at [124, 127 ];
when T2 is 180 and T1 is located at [172, 175], T1 is T1+80 and T2 is 124, so that T1 is located at [252, 255] and T2 is 124;
when T2 is 180 and T1 is located at [176, 179], T1 is T1+76 and T2 is 125, such that T1 is located at [252, 255] and T2 is 125;
when T2 is 180, T1 is 180, T1 is 252, T2 is 126, so that T1 is 252 and T2 is at 126;
after preprocessing, the first byte is located at [0, 255 ]; the second byte is located at [0,127] and can embed 1 bit of information.
6. The data feature-based segmentation information embedding method according to claim 1, wherein: the method for preprocessing the secret information in the third step comprises the following steps:
according to the preprocessing result of the carrier data, performing segmented calculation on the secret information to be embedded to complete the preprocessing of the secret information, so that the processed secret information corresponds to the preprocessed carrier data;
assuming that the length of the preprocessed carrier data segment is N and the ith segment embedded information is M _ i bits, segmenting the secret information according to the M _ i value and combining the difference value of the maximum value and the minimum value of each segment;
firstly, calculating the embeddable information quantity M _ i of the current segment;
secondly, calculating additional information quantity F _ i required by the segmentation for information embedding according to the numerical interval after the segmentation preprocessing;
and finally, combining the embeddable information quantity M _ i and the additional information quantity F _ i to obtain the segment embeddable secret information quantity S _ i, and segmenting the secret information according to the information quantity.
7. The data feature-based segmentation information embedding method according to claim 1, wherein: in the fourth step, the preprocessed secret information is embedded into the preprocessed carrier data, and the specific method comprises the following steps:
converting each byte data in the segment into eight-bit binary data, identified as [ D7, D6, D5, D4, D3, D2, D1, D0], the segment having n2 bytes; and the additional information mark and the preprocessed embeddable secret information form new secret information S1; adopting different information embedding methods according to different ranges of the preprocessed data:
1) when all data are located at [0,1] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely, the bits D7, D6, D5 and D4, new secret information S1 is embedded into the bits D3, D2 and D1 of the 1 st byte and the upper seven bits of the 3 rd to the n2 th bytes, namely, the bits D7, D6, D5, D4, D3, D2 and D1 in turn, and other bit data are not changed;
2) when all data are located at [0,2] after the segmentation preprocessing, an embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, new secret information S1 is embedded into the D3, D2 bits of the 1 st byte, the upper five bits of the 3 rd byte, namely D7, D6, D5, D4 and D3 bits, and the three bytes from the 4 th byte to the n2 byte form a group, and the upper seven bits of the 1 st byte, namely D7, D6, D5, D4, D3, D2 and D1 bits, and the upper six bits of the 2 rd and 3 bytes, namely D7, D6, D5, D4, D3 and D2 bits are embedded with information, and other bit data are not changed;
3) when all data are located at [0, 3] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, new secret information S1 is embedded into the upper six bits of the 1 st byte, namely D3 and D2 bits and the upper six bits of the 3 rd to the n2 th bytes, namely D7, D6, D5, D4, D3 and D2 bits in sequence according to bits, and other bit data are not changed;
4) when all data are located at [0, 4] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, new secret information S1 is embedded into the D3 and D2 bits of the 1 st byte and two bytes from the 3 rd byte to the n2 byte in sequence in a group, and the information embedding is carried out on the upper six bits of the 1 st byte, namely D7, D6, D5, D4, D3 and D2 bits and the upper five bits of the 2 nd byte, namely D7, D6, D5, D4 and D3 bits in sequence, and other bit data are not changed;
5) when all data are located at [0, 7] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely the D7, D6, D5 and D4 bits, new secret information S1 is embedded into the D3 bit of the 1 st byte and the upper five bits of the 3 rd byte to the n2 th byte, namely the D7, D6, D5, D4 and D3 bits in sequence by bit, and other bit data are not changed;
6) when all data are located at [0, 10] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, new secret information S1 is embedded into the D3 bits of the 1 st byte in sequence by bit, two bytes from the 3 rd byte to the n2 th byte form a group, and information embedding is carried out on the upper five bits of the 1 st byte, namely D7, D6, D5, D4, D3 bits and the upper four bits of the 2 nd byte, namely D7, D6, D5 and D4 bits in sequence by bit, and other bit data are not changed;
7) when all data are located at [0, 15] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, new secret information S1 is embedded in the upper four bits of the 3 rd byte to the n2 th byte in sequence by bit, namely D7, D6, D5 and D4 bits, and other bit data are not changed;
8) when all data are located at [0, 21] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, two bytes from the 3 rd byte to the n2 th byte of the carrier data are grouped, new secret information S1 is embedded into the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, and the upper three bits of the 2 nd byte, namely D7, D6 and D5 bits in turn according to bits, and other bit data are not changed;
9) when all data are located at [0, 31] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, new secret information S1 is embedded into the upper three bits of the 3 rd byte to the n2 th byte in sequence according to the bits, namely D7, D6 and D5 bits, and other bit data are not changed;
10) when all data are located at [0, 44] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, two bytes from the 3 rd byte to the n2 th byte of the carrier data are grouped, new secret information S1 is embedded into the upper three bits of the 1 st byte, namely D7, D6 and D5 bits, of each group in sequence according to bits, and the upper two bits of the 2 nd byte, namely D7 and D6 bits, and other bit data are not changed;
11) when all data are located at [0, 63] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, new secret information S1 is embedded into the upper two bits of the 3 rd byte to the n2 th byte in sequence according to the bits, namely D7 and D6 bits, and other bit data are not changed;
12) when all data are located at [0, 89] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, two bytes from the 3 rd byte to the n2 th byte of the carrier data are grouped, new secret information S1 is embedded into the upper two bits of the 1 st byte, namely D7 and D6 bits, the highest bit of the 2 nd byte, namely D7 bits, of each group in sequence according to bits, and other bit data are not changed;
13) when all data are located at [0,127] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, new secret information S1 is embedded into the highest bits of the 3 rd byte to the n2 th byte, namely D7 bits, according to the bits, and other bit data are not changed;
14) when all data are located at [0, 180] after the segmentation preprocessing, the embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, two bytes from the 3 rd byte to the n2 th byte of the carrier data are grouped, new secret information S1 is embedded into the highest bit of the 1 st byte of each group in sequence according to the bit, namely D7 bits, and other bit data are not changed;
15) when the difference value between the maximum value and the minimum value of the segment is larger than 128 and the number of the repeated data in the segment is larger than N/2, selecting the data with the most repeated number for hiding; the embedding type is placed in the upper four bits of the 1 st byte, namely D7, D6, D5 and D4 bits, new secret information S1 is embedded into the segment repeated data in sequence according to the bits, if the secret information is '1', the original data is not changed, if the secret information is '0', the original data is changed into the embedded data, and other data are not changed.
8. The method for embedding information into preprocessed data according to claim 7, wherein: the embedding type is 4 bits in total, specifically:
0000: no information is embedded in the segment;
0001: all data are located at [0,1] after the segmentation preprocessing;
0010: all data are located at [0,2] after the segmentation preprocessing;
0011: all data are located at [0, 3] after the segmentation preprocessing;
0100: all data are located at [0, 4] after the segmentation preprocessing;
0101: all data are located at [0, 7] after the segmentation preprocessing;
0110: all data are located at [0, 10] after the segmentation preprocessing;
0111: all data are located at [0, 15] after the segmentation preprocessing;
1000: all data are located at [0, 21] after the segmentation preprocessing;
1001: all data after the segmentation preprocessing are located at [0, 31 ];
1010: all data after the segmentation preprocessing are located at [0, 44 ];
1011: all data after the segmentation preprocessing are located at [0, 63 ];
1100: all data after the segmentation preprocessing are located in [0, 89 ];
1101: all data after the segmentation preprocessing are located at [0,127 ];
1110: all data after the segmentation preprocessing are located at [0, 180 ];
1111: the segment is embedded with information using duplicate data.
9. The method for embedding information into preprocessed data according to claim 7, wherein: the additional information identifier is specifically:
1) when all the data after the segmented preprocessing are located in [0,1], the additional information is marked as the lowest bit data D0 of the 1 st byte of the preprocessed carrier data;
2) when all the data after the segmented preprocessing are positioned at [0,2], the additional information is marked as the lower two-bit data D1 and D0 of the 2 nd byte of the preprocessed carrier data;
3) when all the data after the segmented preprocessing are positioned at [0, 3], the additional information is marked as the lower two-bit data D1 and D0 of the 2 nd byte of the preprocessed carrier data;
4) when all the data after the segmented preprocessing are positioned at [0, 4], the additional information is marked as low three-bit data D2, D1 and D0 of the 2 nd byte of the preprocessed carrier data;
5) when all the data after the segmented preprocessing are positioned at [0, 7], the additional information is marked as low three-bit data D2, D1 and D0 of the 2 nd byte of the preprocessed carrier data;
6) when all the data after the segmented preprocessing are positioned at [0, 10], the additional information is marked as low four-bit data D3, D2, D1 and D0 of the 2 nd byte of the preprocessed carrier data;
7) when all the data after the segment preprocessing are positioned at [0, 15], the additional information is marked as low four-bit data D3, D2, D1 and D0 of the 2 nd byte of the preprocessed carrier data;
8) when all the data after the segment preprocessing are positioned at [0, 21], the additional information is marked as lower five bits data D4, D3, D2, D1 and D0 of the 2 nd byte of the preprocessed carrier data;
9) when all the data after the segment preprocessing are located at [0, 31], the additional information is marked as D4 bit of the 1 st byte, and the lower five bits of data D4, D3, D2, D1 and D0 of the preprocessed carrier data;
10) when all the data after the segmented preprocessing are located at [0, 44], the additional information is marked as D4 bit of the 1 st byte of the preprocessed carrier data, and lower six bits of data D5, D4, D3, D2, D1 and D0 of the 2 nd byte;
11) when all the data after the segmented preprocessing are located at [0, 63], the additional information is marked as D5 and D4 bits of the 1 st byte of the preprocessed carrier data, and lower six-bit data D5, D4, D3, D2, D1 and D0 of the 2 nd byte;
12) when all the data after the segmented preprocessing are located at [0, 89], the additional information is marked as D5 and D4 bits of the 1 st byte of the preprocessed carrier data, and lower seven-bit data D6, D5, D4, D3, D2, D1 and D0 of the 2 nd byte;
13) when all the data after the segmented preprocessing are located at [0,127], the additional information is marked as D6, D5 and D4 bits of the 1 st byte of the preprocessed carrier data, and lower seven-bit data of the 2 nd byte, such as D6, D5, D4, D3, D2, D1 and D0;
14) when all the data after the segmented preprocessing are located at [0, 180], the additional information is marked as D6, D5 and D4 bits of the 1 st byte of the preprocessed carrier data, and lower seven-bit data of the 2 nd byte, such as D7, D6, D5, D4, D3, D2, D1 and D0;
15) when the difference value between the maximum value and the minimum value of the segment is larger than 128 and the number of the repeated data in the segment is larger than N/2, the additional information is marked as D7, D6, D5 and D4 bits of the first byte of the preprocessed carrier data and all bits of the second byte and the third byte.
10. An information embedding system implemented by the information embedding method according to the preprocessed data of any one of claims 1-9, comprising:
an optimal fragment length determination module: analyzing and calculating the original data according to different segment lengths, selecting a segment length with the largest information embedding amount as the optimal segment length, and segmenting the original data;
a segmented data pre-processing module: preprocessing the data in each segment to obtain preprocessed carrier data;
secret information preprocessing module: preprocessing the secret information according to the data characteristics of the carrier;
an information embedding module: and embedding the preprocessed secret information into the preprocessed carrier data to realize the segment information embedding based on the data characteristics.
CN202110674023.0A 2021-06-17 2021-06-17 Data feature-based segmented information embedding method and system Active CN113518079B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110674023.0A CN113518079B (en) 2021-06-17 2021-06-17 Data feature-based segmented information embedding method and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110674023.0A CN113518079B (en) 2021-06-17 2021-06-17 Data feature-based segmented information embedding method and system

Publications (2)

Publication Number Publication Date
CN113518079A true CN113518079A (en) 2021-10-19
CN113518079B CN113518079B (en) 2022-11-11

Family

ID=78065542

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110674023.0A Active CN113518079B (en) 2021-06-17 2021-06-17 Data feature-based segmented information embedding method and system

Country Status (1)

Country Link
CN (1) CN113518079B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115276990A (en) * 2022-09-28 2022-11-01 南通森淼船舶技术有限公司 Safe storage method for research and development information of ocean engineering equipment

Citations (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110249813A1 (en) * 2010-04-13 2011-10-13 National Chiao Tung University Method for embedding secret message into png image
CN104202294A (en) * 2014-07-23 2014-12-10 西安空间无线电技术研究所 Lossless information embedding and recovering method in format data stream
CN105227962A (en) * 2015-09-29 2016-01-06 西安空间无线电技术研究所 A kind of lossless information concealing method based on data difference
CN106791872A (en) * 2016-11-18 2017-05-31 南京邮电大学 Information concealing method based on SVD
CN108447492A (en) * 2018-03-13 2018-08-24 中山大学 A kind of self-adapting histogram translation reversible information hidden method based on segmentation
CN110324795A (en) * 2019-06-24 2019-10-11 西安空间无线电技术研究所 A kind of satellite short message and information synergism transmission method
CN110472202A (en) * 2019-08-12 2019-11-19 西安空间无线电技术研究所 A kind of information insertion and extracting method based on Unicode coding
CN111179144A (en) * 2019-12-09 2020-05-19 西安空间无线电技术研究所 Efficient information hiding method for multi-embedding of multi-system secret information
CN111669394A (en) * 2020-06-04 2020-09-15 西安空间无线电技术研究所 Method for hiding and transmitting image and voice information of satellite communication
CN111898136A (en) * 2020-06-12 2020-11-06 北京大学 High-fidelity reversible information hiding method and device based on prediction error value sequencing
EP3806071A1 (en) * 2018-05-25 2021-04-14 Nippon Telegraph And Telephone Corporation Secret collective approximation system, secret calculation device, secret collective approximation method, and program
US20210160221A1 (en) * 2019-11-26 2021-05-27 Adobe Inc. Privacy Preserving Document Analysis

Patent Citations (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110249813A1 (en) * 2010-04-13 2011-10-13 National Chiao Tung University Method for embedding secret message into png image
CN104202294A (en) * 2014-07-23 2014-12-10 西安空间无线电技术研究所 Lossless information embedding and recovering method in format data stream
CN105227962A (en) * 2015-09-29 2016-01-06 西安空间无线电技术研究所 A kind of lossless information concealing method based on data difference
CN106791872A (en) * 2016-11-18 2017-05-31 南京邮电大学 Information concealing method based on SVD
CN108447492A (en) * 2018-03-13 2018-08-24 中山大学 A kind of self-adapting histogram translation reversible information hidden method based on segmentation
EP3806071A1 (en) * 2018-05-25 2021-04-14 Nippon Telegraph And Telephone Corporation Secret collective approximation system, secret calculation device, secret collective approximation method, and program
CN110324795A (en) * 2019-06-24 2019-10-11 西安空间无线电技术研究所 A kind of satellite short message and information synergism transmission method
CN110472202A (en) * 2019-08-12 2019-11-19 西安空间无线电技术研究所 A kind of information insertion and extracting method based on Unicode coding
US20210160221A1 (en) * 2019-11-26 2021-05-27 Adobe Inc. Privacy Preserving Document Analysis
CN111179144A (en) * 2019-12-09 2020-05-19 西安空间无线电技术研究所 Efficient information hiding method for multi-embedding of multi-system secret information
CN111669394A (en) * 2020-06-04 2020-09-15 西安空间无线电技术研究所 Method for hiding and transmitting image and voice information of satellite communication
CN111898136A (en) * 2020-06-12 2020-11-06 北京大学 High-fidelity reversible information hiding method and device based on prediction error value sequencing

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Z. YI AND Z. QUAN: "An improved method for POCS superresolution image reconstruction", 《2011 INTERNATIONAL CONFERENCE ON ELECTRONICS, COMMUNICATIONS AND CONTROL (ICECC)》 *
魏峰等: "空间一致性邻域保留嵌入的高光谱数据特征提取", 《红外与激光工程》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115276990A (en) * 2022-09-28 2022-11-01 南通森淼船舶技术有限公司 Safe storage method for research and development information of ocean engineering equipment
CN115276990B (en) * 2022-09-28 2023-12-05 南通森淼船舶技术有限公司 Safety storage method for research and development information of ocean engineering equipment

Also Published As

Publication number Publication date
CN113518079B (en) 2022-11-11

Similar Documents

Publication Publication Date Title
Jo et al. A digital image watermarking scheme based on vector quantisation
Hou et al. Reversible data hiding based on multiple histograms modification and deep neural networks
CN107886962B (en) High-security steganography method for IP voice
CN113518079B (en) Data feature-based segmented information embedding method and system
WO2020000486A1 (en) Data processing method and device
CN111327785A (en) Information steganography communication method based on automatic image construction of countermeasure generation network
Li et al. Coverless Video Steganography Based on Frame Sequence Perceptual Distance Mapping.
Yu et al. A high-capacity reversible data hiding scheme using dual-channel audio
Weng et al. Reversible data hiding based on the local smoothness estimator and optional embedding strategy in four prediction modes
Sachnev et al. Reversible watermarking algorithm with distortion compensation
Sun et al. Data embedding in image-media using weight-function on modulo operations
Wang et al. High-capacity reversible data hiding in encrypted images based on prediction error compression and block selection
JP4184339B2 (en) Lossless data embedding
Lee et al. A data hiding scheme based on turtle-shell for AMBTC compressed images
KR100520711B1 (en) A Blind Watermarking Method by Grouping Codewords for VQ-Quantized Images
CN111343466B (en) Reversible video data hiding method based on two-dimensional histogram translation
SE527621C2 (en) Method and system for compressing image data
Muzaffar et al. Compressed Sensing for Security and Payload Enhancement in Digital Audio Steganography.
CN113643389B (en) Image lossless compression method based on segmentation
CN111816195A (en) Audio reversible steganography method, secret information extraction and carrier audio recovery method
CN112055217B (en) Method for carrying information in any byte data without loss
Al-Dmour et al. An efficient hybrid steganography method based on edge adaptive and tree based parity check
Wu et al. Modulation and multiplexing techniques for multimedia data hiding
CN111915473B (en) Reversible information hiding method based on AMBTC compression technology and Hamming distance
CN109448744B (en) MP3 audio information hiding method and system based on sign bit adaptive embedding

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant