Toggle navigation
Home
About
About Journal
Historical Evolution
Indexed In
Awards
Reference Index
Editorial Board
Journal Online
Archive
Project Articles
Most Download Articles
Most Read Articles
Instruction
Contribution Column
Author Guidelines
Template
FAQ
Copyright Agreement
Expenses
Academic Integrity
Contact
Contact Us
Location Map
Subscription
Advertisement
中文
Journals
Publication Years
Keywords
Search within results
(((MU Dejun[Author]) AND 1[Journal]) AND year[Order])
AND
OR
NOT
Title
Author
Institution
Keyword
Abstract
PACS
DOI
Please wait a minute...
For Selected:
Download Citations
EndNote
Ris
BibTeX
Toggle Thumbnails
Select
Low-density 3D model information hiding algorithm based on multple fusion states
REN Shuai, XU Zhenchao, WANG Zhen, HE Yuan, ZHANG Tao, SU Dongxu, MU Dejun
Journal of Computer Applications 2019, 39 (
4
): 1100-1105. DOI:
10.11772/j.issn.1001-9081.2018091855
Abstract
(
623
)
PDF
(929KB)(
297
)
Knowledge map
Save
Aiming at the problem that the existing 3D model information hiding algorithms cannot effectively resist uneven compression, a multi-carrier low-density information hiding algorithm based on multiple fusion states was proposed. Firstly, multiple 3D models were positioned, oriented and stereotyped by translation and scaling. Secondly, the 3D models were rotated at different angles and merged by using the center point as merging point to obtain multiple fusion states. Thirdly, local height and Mean Shift clustering analysis were used to divide the energy of the vertices of the fusion state model, obtaining the vertices with different energies. Finally, by changing the vertex coordinates, the secret information changed by Arnold scrambling was quickly hidden in multiple fusion states and 3D models. Experimental results show that the proposed algorithm is robust against uneven compression attacks and has high invisibility.
Reference
|
Related Articles
|
Metrics
Select
Information hiding algorithm based on spherical segmentation of 3D model
REN Shuai, ZHANG Tao, YANG Tao, SUO Li, MU Dejun
Journal of Computer Applications 2017, 37 (
9
): 2576-2580. DOI:
10.11772/j.issn.1001-9081.2017.09.2576
Abstract
(
589
)
PDF
(779KB)(
521
)
Knowledge map
Save
Aiming at the problem of weak robustness to geometric attack in 3D model information hiding algorithms, an information hiding algorithm based on 3D model spherical segmentation was proposed. Firstly, the 3D model was preprocessed by principal component analysis, spherical coordinate transformation, spherical segmentation and partition sorting. Then, the points with larger normal vector in stereo partition are taken as feature points. The feature points were carried out wavelet transform according to the amount of secret information to be embedded. Finally, the secret information after scrambled operation was embedded into the pre-processed carrier to generate the secret 3D model. The experimental results show that the algorithm is invisible and has good robustness to random noise, heavy mesh and other common attacks.
Reference
|
Related Articles
|
Metrics
Select
Information hiding algorithm based on 3D high efficiency video coding background
REN Shuai, SUO Li, ZHANG Tao, YANG Tao, MU Dejun
Journal of Computer Applications 2017, 37 (
6
): 1616-1619. DOI:
10.11772/j.issn.1001-9081.2017.06.1616
Abstract
(
598
)
PDF
(663KB)(
663
)
Knowledge map
Save
In order to solve the problems of security and capacity of confidential information during public network transmission, an information hiding algorithm based on the High Efficiency Video Coding (HEVC) background was proposed. The background image of multi-view images in HEVC was used as the carrier. Firstly, the background image was decomposed into three gray-scale components by using
lαβ
color space theory. Then, the image components such as
α
and
β
were transformed by Discrete Cosine Transform (DCT) method. Finally, the confidential information was embedded into the region of carrier repeatedly. With relative low energy weight, the mid-frequency coefficient regions of
α
and
β
components after DCT were both chosen as the hidden regions to be embedded repeatedly with the confidential information, which makes the proposed algorithm have good invisibility and robustness. The experimental results show that, compared with the algorithms based on intra-frame and inter-frame, the invisibility of the proposed algorithm was improved respectively by about 16.1% and 11.4% while the robustness of the proposed algorithm was increased respectively by about 55.5% and 20.2%.
Reference
|
Related Articles
|
Metrics