CN109887518A - Secret information transmission method based on complete orthogonal basis - Google Patents
Secret information transmission method based on complete orthogonal basis Download PDFInfo
- Publication number
- CN109887518A CN109887518A CN201910159932.3A CN201910159932A CN109887518A CN 109887518 A CN109887518 A CN 109887518A CN 201910159932 A CN201910159932 A CN 201910159932A CN 109887518 A CN109887518 A CN 109887518A
- Authority
- CN
- China
- Prior art keywords
- multimedia
- secret information
- orthogonal basis
- secret
- information transmission
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Abstract
The invention discloses the secret information transmission methods based on complete orthogonal basis, the model research and demonstration of secret information transmission are completed using principal component analysis method, partial orthogonality base is constructed using multimedia itself principal component, it realizes on the basis of largely retaining multimedia messages, completes secret information transmission.The experimental verification validity and feasibility of the model, while the secret information of the model constructs flexible form, information capacity is larger, has more apparent advantage.
Description
Technical field
The present invention relates to secret information transmission method fields, specially based on the secret information transmission side of complete orthogonal basis
Method.
Background technique
Carrying out secret communication as carrier using multimedia at present is research hotspot, and cooperative communication side how to be allowed to receive concealed letter
Breath, is always the emphasis of research without being discovered and being parsed easily by non-cooperative communication side.Tradition is based on information such as sound, images
File and multimedia file feature complete steganography work, due to mostly using direct stacking method, cause distortion characteristics excessively obvious,
It can be easier to analyze the presence of secret information in subjective assessment or grey level histogram distribution from image.
Summary of the invention
The object of the present invention is to provide the secret information transmission methods based on complete orthogonal basis, to solve the more matchmakers of the prior art
Secret information is easy to be acquired and the problem of receiving end is not easy by undistorted recovery in the transmission of body information.
In order to achieve the above object, the technical scheme adopted by the invention is as follows:
Secret information transmission method based on complete orthogonal basis, it is characterised in that: including transmitting terminal plus secret and receiving end solution
It is secret, in which:
Transmitting terminal add it is secret the following steps are included:
(a1), by principal component analysis method, original multimedia bearer data matrix C is solvedM×NOrthogonal basis ΦN×N, with
And multimedia bearer data matrix CM×NIn orthogonal basis ΦN×NOn projection components HM×N, orthogonal basis ΦN×NIn element ΦiIt is that
This is orthogonal, Φi∈ΦN×N；
(a2), according to principal component analysis method, retain component HM×NThe middle biggish element H of modulus valueiSet and element Hi
In orthogonal basis ΦN×NIn corresponding element, and with the biggish element H of modulus valueiSet as multimedia principal component；
(a3), by component HM×NIn secret information S substitution after the lesser part coding of the modulus value given up, contained with synthesis
The multimedia transmission data A of secret informationM×N；
Receiving end solution it is secret the following steps are included:
(b1), by principal component analysis method, multimedia transmission data A is solvedM×NOrthogonal basis Φ 'N×NAnd multimedia
Transmit data AM×NIn orthogonal basis Φ 'N×NOn projection components H 'M×N；
(b2), according to the coding rule of secret information S, retain [| H 'i|]≤[Si∈S]max, wherein H ' is component H 'M×N
In element, H 'i∈H′M×N, SiFor the element in secret information S, Si∈ S, then secret information S=[| H '1||H′2|…|H
′N-K], K < N.
The secret information transmission method based on complete orthogonal basis, it is characterised in that: the process in step (a1) is such as
Under:
(1), by original multimedia bearer data matrix CM×NIt is standardized to obtain C 'M×N；
(2), to C 'M×NRelated coefficient is solved, matrix R is obtainedN×N；
(3), solution matrix RN×NEigenvalue λNWith feature vector ΦN×NAnd multimedia bearer data matrix CM×N?
Feature vector ΦN×NOn projection components HM×N, wherein obtained feature vector ΦN×NAs orthogonal basis ΦN×NIf λiFor spy
Any one in value indicative, λi∈λN, ΦiFor feature vector ΦN×NElement, Φi∈ΦN×N, i < N, then λiWith ΦiOne is a pair of
It answers, component HM×N=CM×NΦN×N。
The secret information transmission method based on complete orthogonal basis, it is characterised in that: the process in step (a2) is such as
Under:
Given threshold hthreshold, reservation component [| Hi∈HM×N|]≥hthresholdAnd element HiIn feature vector ΦN×N
In corresponding element, and by reverse multimedia synthetic method, after part component is cast out in judgement, the multimedia of synthesis whether with
The variation of initial multimedia carrier, reduces h if changing greatlythreshold, increase h if variation is smallerthreshold, until synthesis
Multimedia and until initial multimedia carrier difference reaches requirement.
The secret information transmission method based on complete orthogonal basis, it is characterised in that: the multimedia of synthesis with it is original
The difference of multimedia bearer refers to the general characteristics extracting method handled using multimedia analysis, respectively to the multimedia of synthesis and original
The difference that beginning multimedia bearer is analyzed.
The secret information transmission method based on complete orthogonal basis, it is characterised in that: by component H in step (a3)M×N
In secret information S substitution after the lesser part coding of the modulus value given up process it is as follows:
If the component vector that multimedia retains is HK×N, wherein K < M, by secret information SM-K=[S1S2…S(M-K)] carry out
Coding, selects suitable system number to ensure [Si∈S]max≤[|Hi|]min, wherein Hi∈HK×N。
The secret information transmission method based on complete orthogonal basis, it is characterised in that: synthesis is containing hidden in step (a3)
The multimedia transmission data A of secret informationM×NAre as follows:
AM×N=([SM-K|0K]IM[Φ(M-K)×N|0K×N]+HM×N[ΦK×N|0(N-K)×N])ΦN×N,
Wherein
The secret information transmission method based on complete orthogonal basis, it is characterised in that: secret information S uses ASCII
Coding mode encoded.
The present invention constructs orthogonal basis using multimedia self-characteristic, constructs multimedia bearer using different orthogonal base vectors
With the autonomous channel of secret information, illustrate the relationship between multimedia bearer correlated characteristic and secret information without independent code key,
Secret information is smaller to the change of initial multimedia simultaneously, is not easy to be discovered by non-cooperation recipient, can preferably complete concealed logical
The task of letter.
Detailed description of the invention
Fig. 1 is that transmitting terminal adds secret implementation flow chart.
Fig. 2 is that receiving end solves secret implementation flow chart.
Fig. 3 is multimedia bearer grayscale image.
Fig. 4 is greater than hthreshold=256 component reconstruct image.
Fig. 5 is the result figure of the superposition secret information of confirmatory experiment.
Specific embodiment
Present invention will be further explained below with reference to the attached drawings and examples.
As shown in Figure 1 and Figure 2, based on the secret information transmission method of complete orthogonal basis, including transmitting terminal plus secret and receiving end
It solves secret, in which:
Transmitting terminal add it is secret the following steps are included:
(a1), by principal component analysis method, original multimedia bearer data matrix C is solvedM×NOrthogonal basis ΦN×N, with
And multimedia bearer data matrix CM×NIn orthogonal basis ΦN×NOn projection components HM×N, orthogonal basis ΦN×NIn element ΦiIt is that
This is orthogonal, Φi∈ΦN×N；
(a2), according to principal component analysis method, retain component HM×NThe middle biggish element H of modulus valueiSet and element Hi
In orthogonal basis ΦN×NIn corresponding element, and with the biggish element H of modulus valueiSet as multimedia principal component；
(a3), by component HM×NIn secret information S substitution after the lesser part coding of the modulus value given up, contained with synthesis
The multimedia transmission data A of secret informationM×N；
Receiving end solution it is secret the following steps are included:
(b1), by principal component analysis method, multimedia transmission data A is solvedM×NOrthogonal basis Φ 'N×NAnd multimedia
Transmit data AM×NIn orthogonal basis Φ 'N×NOn projection components H 'M×N；
(b2), according to the coding rule of secret information S, retain [| H 'i|]≤[Si∈S]max, wherein H ' is component H 'M×N
In element, H 'i∈H′M×N, SiFor the element in secret information S, Si∈ S, then secret information S=[| H '1||H′2|…|H
′N-K], K < N.
Process in step (a1) is as follows:
(1), by original multimedia bearer data matrix CM×NIt is standardized to obtain C 'M×N；
(2), to C 'M×NRelated coefficient is solved, matrix R is obtainedN×N；
(3), solution matrix RN×NEigenvalue λNWith feature vector ΦN×NAnd multimedia bearer data matrix CM×N?
Feature vector ΦN×NOn projection components HM×N, wherein obtained feature vector ΦN×NAs orthogonal basis ΦN×NIf λiFor spy
Any one in value indicative, λi∈λN, ΦiFor feature vector ΦN×NElement, Φi∈ΦN×N, i < N, then λiWith ΦiOne is a pair of
It answers, component HM×N=CM×NΦN×N。
Process in step (a2) is as follows:
Given threshold hthreshold, reservation component [| Hi∈HM×N|]≥hthresholdAnd element HiIn feature vector ΦN×N
In corresponding element, and by reverse multimedia synthetic method, after part component is cast out in judgement, the multimedia of synthesis whether with
The variation of initial multimedia carrier, reduces h if changing greatlythreshold, increase h if variation is smallerthreshold, until synthesis
Multimedia and until initial multimedia carrier difference reaches requirement.
The multimedia of synthesis and the difference of initial multimedia carrier refer to be extracted using the general characteristics that multimedia analysis is handled
Method, the difference that the multimedia of synthesis and initial multimedia carrier are analyzed respectively.
By component H in step (a3)M×NIn secret information S substitution after the lesser part coding of the modulus value given up mistake
Journey is as follows:
If the component vector that multimedia retains is HK×N, wherein K < M, by secret information SM-K=[S1S2…S(M-K)] carry out
Coding, selects suitable system number to ensure [Si∈S]max≤[|Hi|]min, wherein Hi∈HK×N。
The multimedia transmission data A containing secret information is synthesized in step (a3)M×NAre as follows:
AM×N=([SM-K|0K]IM[Φ(M-K)×N|0K×N]+HM×N[ΦK×N|0(N-K)×N])ΦN×N,
Wherein
Secret information S is encoded using the coding mode of ASCII.
Specific embodiment:
With data product --- " muscle " of the earth published in high-resolution earth observation systems key special subjects net
Grayscale image for, picture pixels 891*900.
Transmitting terminal plus secret process the following steps are included:
(1), by the data matrix C as the initial multimedia of carrier891×900；
(2), to C891×900It is handled by step (a1), (a2), obtains hthreshold=256, the conjunction after casting out part vector
It is as shown in Figure 4 at multimedia；
(3), secret information is 795 characters in famous novel " Pride and Prejudice " chapter 1, these characters are used
Octal system ASCII coding, acquires A by step (a3)891×900Image it is as shown in Figure 5.
The secret process of solution in receiving end the following steps are included:
(1) to received A891×900It is handled according to step (b1)；
(2) since character uses the octal code of ASCII, so [Si∈S]max=255, it is carried out according to step (b2)
Processing can obtain S795。
Claims (7)
1. the secret information transmission method based on complete orthogonal basis, it is characterised in that: it is secret including transmitting terminal plus secret and receiving end solution,
Wherein:
Transmitting terminal add it is secret the following steps are included:
(a1), by principal component analysis method, original multimedia bearer data matrix C is solvedM×NOrthogonal basis ΦN×N, Yi Jiduo
Media bearer data matrix CM×NIn orthogonal basis ΦN×NOn projection components HM×N, orthogonal basis ΦN×NIn element ΦiIt is each other just
It hands over, Φi∈ΦN×N；
(a2), according to principal component analysis method, retain component HM×NThe middle biggish element H of modulus valueiSet and element HiOrthogonal
Base ΦN×NIn corresponding element, and with the biggish element H of modulus valueiSet as multimedia principal component；
(a3), by component HM×NIn secret information S substitution after the lesser part coding of the modulus value given up, with synthesis containing secret
The multimedia transmission data A of informationM×N；
Receiving end solution it is secret the following steps are included:
(b1), by principal component analysis method, multimedia transmission data A is solvedM×NOrthogonal basis Φ 'N×NAnd multimedia transmission number
According to AM×NIn orthogonal basis Φ 'N×NOn projection components H 'M×N；
(b2), according to the coding rule of secret information S, retain [| H 'i|]≤[Si∈S]max, wherein H ' is component H 'M×NIn member
Element, H 'i∈H′M×N, SiFor the element in secret information S, Si∈ S, then secret information S=[| H '1||H'2|…|H'N-K|], K <
N。
2. the secret information transmission method according to claim 1 based on complete orthogonal basis, it is characterised in that: step (a1)
In process it is as follows:
(1), by original multimedia bearer data matrix CM×NIt is standardized to obtain C'M×N；
(2), to C'M×NRelated coefficient is solved, matrix R is obtainedN×N；
(3), solution matrix RN×NEigenvalue λNWith feature vector ΦN×NAnd multimedia bearer data matrix CM×NFeature to
Measure ΦN×NOn projection components HM×N, wherein obtained feature vector ΦN×NAs orthogonal basis ΦN×NIf λiIt is characterized in value
Any one, λi∈λN, ΦiFor feature vector ΦN×NElement, Φi∈ΦN×N, i < N, then λiWith ΦiIt corresponds, point
Measure HM×N=CM×NΦN×N。
3. the secret information transmission method according to claim 1 based on complete orthogonal basis, it is characterised in that: step (a2)
In process it is as follows:
Given threshold hthreshold, reservation component [| Hi∈HM×N|]≥hthresholdAnd element HiIn feature vector ΦN×NIn it is right
The element answered, and by reverse multimedia synthetic method, after part component is cast out in judgement, the multimedia of synthesis whether with it is original
The variation of multimedia bearer, reduces h if changing greatlythreshold, increase h if variation is smallerthreshold, more until synthesis
Until media and initial multimedia carrier difference reach requirement.
4. the secret information transmission method according to claim 3 based on complete orthogonal basis, it is characterised in that: synthesis it is more
The difference of media and initial multimedia carrier refers to the general characteristics extracting method handled using multimedia analysis, respectively to synthesis
The difference that multimedia and initial multimedia carrier are analyzed.
5. the secret information transmission method according to claim 1 based on complete orthogonal basis, it is characterised in that: step (a3)
It is middle by component HM×NIn secret information S substitution after the lesser part coding of the modulus value given up process it is as follows:
If the component vector that multimedia retains is HK×N, wherein K < M, by secret informationIt is compiled
Code, selects suitable system number to ensure [Si∈S]max≤[|Hi|]min, wherein Hi∈HK×N。
6. the secret information transmission method according to claim 1 based on complete orthogonal basis, it is characterised in that: step (a3)
Middle multimedia transmission data A of the synthesis containing secret informationM×NAre as follows:
AM×N=([SM-K|0K]IM[Φ(M-K)×N|0K×N]+HM×N[ΦK×N|0(N-K)×N])ΦN×N,
Wherein
7. according to claim 1 or 5 based on the secret information transmission method of complete orthogonal basis, it is characterised in that: concealed
Information S is encoded using the coding mode of ASCII.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910159932.3A CN109887518A (en) | 2019-03-04 | 2019-03-04 | Secret information transmission method based on complete orthogonal basis |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910159932.3A CN109887518A (en) | 2019-03-04 | 2019-03-04 | Secret information transmission method based on complete orthogonal basis |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109887518A true CN109887518A (en) | 2019-06-14 |
Family
ID=66930388
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910159932.3A Pending CN109887518A (en) | 2019-03-04 | 2019-03-04 | Secret information transmission method based on complete orthogonal basis |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109887518A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB2362240B (en) * | 1999-09-17 | 2004-04-28 | Ibm | Semi-fragile watermarks |
| CN101527030A (en) * | 2009-04-03 | 2009-09-09 | 中国科学院研究生院 | Safe watermark method based on side information |
| CN102184516A (en) * | 2011-04-18 | 2011-09-14 | 北京工业大学 | Digital watermarking method based on 2DPCA (two-dimensional principal component analysis) |
| CN104599225A (en) * | 2015-02-04 | 2015-05-06 | 河南师范大学 | Image watermarking embedding and extracting method based on singular value decomposition and principal component analysis |
| CN109345440A (en) * | 2018-09-25 | 2019-02-15 | 珠海格力电器股份有限公司 | Digital Media watermark handling method, computer equipment and storage medium |
-
2019
- 2019-03-04 CN CN201910159932.3A patent/CN109887518A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB2362240B (en) * | 1999-09-17 | 2004-04-28 | Ibm | Semi-fragile watermarks |
| CN101527030A (en) * | 2009-04-03 | 2009-09-09 | 中国科学院研究生院 | Safe watermark method based on side information |
| CN102184516A (en) * | 2011-04-18 | 2011-09-14 | 北京工业大学 | Digital watermarking method based on 2DPCA (two-dimensional principal component analysis) |
| CN104599225A (en) * | 2015-02-04 | 2015-05-06 | 河南师范大学 | Image watermarking embedding and extracting method based on singular value decomposition and principal component analysis |
| CN109345440A (en) * | 2018-09-25 | 2019-02-15 | 珠海格力电器股份有限公司 | Digital Media watermark handling method, computer equipment and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 陆红琳等: "一种基于PCA的数字音频信息隐秘传输方法", 《计算机工程》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109191409B (en) | Image processing method, network training method, device, electronic equipment and storage medium | |
| CN102968756B (en) | Color digital watermarking based on Fractional Order Hyperchaotic and DWT-SVD embeds and extracting method | |
| CN106303658A (en) | It is applied to exchange method and the device of net cast | |
| CN111598762A (en) | Generating type robust image steganography method | |
| CN107133991B (en) | A kind of bianry image steganography method based on disturbance distortion and pixel selection | |
| CN103414840B (en) | A kind of data-hiding method based on image set | |
| CN110312138B (en) | High-embedding-capacity video steganography method and system based on time sequence residual convolution modeling | |
| CN106503655A (en) | A kind of electric endorsement method and sign test method based on face recognition technology | |
| CN107332830B (en) | Video code conversion, video broadcasting method and device, computer equipment, storage medium | |
| CN110717555B (en) | Picture generation system and device based on natural language and generation countermeasure network | |
| CN113393359B (en) | Information hiding method and device based on convolutional neural network | |
| CN109887518A (en) | Secret information transmission method based on complete orthogonal basis | |
| CN104065969A (en) | Method for hiding high-capacity compression-resisting image information | |
| CN102315931B (en) | Method for hiding running coding of confidential information | |
| CN106209297A (en) | Radio frequency watermark embedding based on the modulation of QPSK signal and extracting method and system | |
| CN103971321B (en) | Method and system for steganalysis of JPEG compatibility | |
| CN108985082A (en) | A kind of medical image encryption method based on digital watermarking | |
| KR101827882B1 (en) | Method and Apparatus for supporting display field communication | |
| CN108898537B (en) | A kind of digital picture steganography method | |
| US20230066458A1 (en) | Steganography method | |
| Xintao et al. | Hide the image in fc-densenets to another image | |
| CN105721863A (en) | Video quality evaluation method | |
| Basak et al. | Steganography in grey scale animated GIF using hash based pixel value differencing | |
| CN115022649A (en) | Reversible neural network-based high-embedding-quantity and colorizable image steganography and recovery method | |
| JP7451159B2 (en) | Image processing device, image processing method, and program |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190614 |
|
| RJ01 | Rejection of invention patent application after publication |