Jing Zhao

Jing Zhao

Auto-generated profile, based on publicly available information

Jing Zhao

School of Artificial Intelligence (School of Software) Yanshan University Qinhuangdao People's Republic of China

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 June 2017 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
WCWei Chen
Wei Chen
FZFei Zhu
Fei Zhu
JZJing Zhao
Jing Zhao
SLSheng Li
Sheng Li
GWGuoping Wang
Guoping Wang

3 April 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
JWJiayan Wang
Jiayan Wang
DWDeyang Wu
Deyang Wu
LLLi Li
Li Li
JZJing Zhao
Jing Zhao
HWHanzhou Wu
Hanzhou Wu
YTYong Tang
Yong Tang

9 July 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
DWDeyang Wu
Deyang Wu
JWJiayan Wang
Jiayan Wang
JZJing Zhao
Jing Zhao
Li LiLi Li
Li Li
Zichi WangZichi Wang
Zichi Wang
HWHanzhou Wu
Hanzhou Wu
An efficient and reliable digital watermarking scheme is needed in a complex network environment to solve image copyright disputes. However, most existing digital watermarking technologies can only resist common image processing and perform poorly against complex attacks. To this end, an adaptive robust watermarking for resisting multiple distortions in real scenes is proposed in this work. First, to reduce the impact of common attacks on the robustness of the algorithm, two-level stationary wavelet transform (SWT) is applied to extract low-frequency sub-band of host image, which is subsequently divided into nonoverlapping sub-blocks. Then, a circular sub-block method is designed for watermark embedding. Moreover, an improved Schur decomposition is proposed to control the variation range of eigenvalues. Meanwhile, an adaptive robust factor and embedding strength strategy are proposed to ensure image reconstruction in real number field, thereby balancing the invisibility and robustness of the watermark. Finally, the logistic encryption and repetition code are performed on the watermark to improve the security and error correction capabilities of the watermark. Extensive experiments demonstrate that the proposed scheme has higher performance than some representative watermarking schemes in complex combined attacks and real-world scenarios.

26 February 2024 in Materials Science and Engineering: A
Verified
Journal Article
Closed access
XHXiaohong Hao
Xiaohong Hao
XSXiaowen Sun
Xiaowen Sun
TZTing Zhao
Ting Zhao
MZMengya Zhang
Mengya Zhang
YWYuefeng Wang
Yuefeng Wang
TWTiansheng Wang
Tiansheng Wang

18 July 2016 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
FZFei Zhu
Fei Zhu
JZJing Zhao
Jing Zhao
SLSheng Li
Sheng Li
YTYong Tang
Yong Tang
GWGuoping Wang
Guoping Wang

20 December 2021 in Security and Communication Networks
Verified
Journal Article
Open access
PDF file
DWDeyang Wu
Deyang Wu
MWMiaomiao Wang
Miaomiao Wang
JZJing Zhao
Jing Zhao
JWJiayan Wang
Jiayan Wang
MZMeiyu Zhong
Meiyu Zhong
CQChangbo Qu
Changbo Qu
With the widespread use of medical images in telemedicine, personal information may be leaked. The traditional zero-watermarking technology has poor robustness under large-scale attacks. At the same time, most of the zero-watermarking information generated is a binary sequence with a single information structure. In order to effectively solve the poor robustness problem of traditional zero-watermarking under large-scale attacks, a color zero-watermarking algorithm for medical images based on bidimensional empirical mode decomposition (BEMD)-Schur decomposition and color visual cryptography is proposed. Firstly, the color carrier image and the color copyright logo are decomposed into R, G, and B three color components, respectively, and the feature value of each sub-block are extracted by wavelet transform, BEMD decomposition, block operation, and Schur decomposition. Then, the R, G, and B components of the copyright logo are scrambled by Arnold scramble and converted into binary watermark information. Finally, a color visual cryptography scheme is proposed to generate two color shared images based on the carrier characteristics and copyright information. One shared image is used to generate a color zero-watermark, and the other is used for copyright authentication phase. Experimental results show that this algorithm has strong robustness and stability in resisting large-scale noise attacks, filtering attacks, JPEG compression, cropping attacks, and translation attacks at different positions. Compared with similar zero-watermarking algorithms, the robust performance is improved by about 10%, and it can adapt to more complex network environments.