Tianshuo Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Tianshuo Zhang has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Shanshan Liu
Heilongjiang Provincial Key Laboratory of Complex Intelligent System and Integration, School of Automation, Harbin University of Science and Technology, Harbin, China
2 shared publications - Cheng Lu
Department of Radiology, Guangdong Provincial People’s Hospital (Guangdong Academy of Medical Sciences), Southern Medical University, Guangzhou, China
1 shared publication - Erwei Yin
Defense Innovation Institute, Academy of Military Sciences, Beijing, China
1 shared publication - Gui Yang Li
Aerospace Research Institute of Materials & Processing Technology, Beijing 100076, China
1 shared publication - Haibin Ling
Westlake University
1 shared publication - Hao Chen
Key Laboratory of Experimental Marine Biology, Institute of Oceanology, Chinese Academy of Sciences, Qingdao 266071, China; University of Chinese Academy of Sciences, Beijing 100049, China
1 shared publication
Latest Publications
- 13 November 2026
- Published by Elsevier in Expert Systems with Applications
StegoAnything: Text-Guided Reversible Object Hiding with Zero-Latent Decoding
- 13 November 2026
- Published by Elsevier in Expert Systems with Applications
StegoAnything: Text-Guided Reversible Object Hiding with Zero-Latent Decoding
- 2 October 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 334
EGRel: Entropy-guided reliability modeling for feature matching
- 2 October 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 334
EGRel: Entropy-guided reliability modeling for feature matching
- Open Access
- 6 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 108746-108760
Stable Image Encryption Algorithm Based on Expanded One-Dimensional Chaotic Jumping and Parallel Encoding Operation Grouping
The current algorithm of encrypting images uses low-dimensional chaotic systems with a limited key space and poor security, while high-dimensional chaotic systems are difficult to implement and inefficient. Additionally, if image encryption algorithms use fixed DNA encoding rules, they could be cracked; dynamic coding can easily deviate from optimal solutions, thus causing algorithm instability. Based on this, a novel technique for image encryption is presented in this article. It is possible to avoid linear correlation of the chaotic sequence by randomly jumping on two uncorrelated one-dimensional chaoses. Meanwhile, numerous encryption results are generated in parallel by randomly grouping DNA encoding groups and encoding operations, and the optimal solution is then selected based on the encryption results, thereby minimizing ciphertext image instability to some extent. According to the experimental results, this algorithm produces high-security, plaintext-sensitive, and non-cracking encrypted images. Furthermore, this algorithm produces excellent encryption results both on color and sized images, and is applicable to a wide variety of applications.
- 6 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 108746-108760
Open AccessStable Image Encryption Algorithm Based on Expanded One-Dimensional Chaotic Jumping and Parallel Encoding Operation Grouping
The current algorithm of encrypting images uses low-dimensional chaotic systems with a limited key space and poor security, while high-dimensional chaotic systems are difficult to implement and inefficient. Additionally, if image encryption algorithms use fixed DNA encoding rules, they could be cracked; dynamic coding can easily deviate from optimal solutions, thus causing algorithm instability. Based on this, a novel technique for image encryption is presented in this article. It is possible to avoid linear correlation of the chaotic sequence by randomly jumping on two uncorrelated one-dimensional chaoses. Meanwhile, numerous encryption results are generated in parallel by randomly grouping DNA encoding groups and encoding operations, and the optimal solution is then selected based on the encryption results, thereby minimizing ciphertext image instability to some extent. According to the experimental results, this algorithm produces high-security, plaintext-sensitive, and non-cracking encrypted images. Furthermore, this algorithm produces excellent encryption results both on color and sized images, and is applicable to a wide variety of applications.
- 15 December 2022
- Published by Elsevier in Signal Processing
- Vol. 205
A hybrid NEQR image encryption cryptosystem using two-dimensional quantum walks and quantum coding
- 15 December 2022
- Published by Elsevier in Signal Processing
- Vol. 205
A hybrid NEQR image encryption cryptosystem using two-dimensional quantum walks and quantum coding
- Open Access
Safe Self-Refinement for Transformer-based Domain Adaptation
Unsupervised Domain Adaptation (UDA) aims to leverage a label-rich source domain to solve tasks on a related unlabeled target domain. It is a challenging problem especially when a large domain gap lies between the source and target domains. In this paper we propose a novel solution named SSRT (Safe Self-Refinement for Transformer-based domain adaptation), which brings improvement from two aspects. First, encouraged by the success of vision transformers in various vision tasks, we arm SSRT with a transformer backbone. We find that the combination of vision transformer with simple adversarial adaptation surpasses best reported Convolutional Neural Network (CNN)-based results on the challenging DomainNet benchmark, showing its strong transferable feature representation. Second, to reduce the risk of model collapse and improve the effectiveness of knowledge transfer between domains with large gaps, we propose a Safe Self-Refinement strategy. Specifically, SSRT utilizes predictions of perturbed target domain data to refine the model. Since the model capacity of vision transformer is large and predictions in such challenging tasks can be noisy, a safe training mechanism is designed to adaptively adjust learning configuration. Extensive evaluations are conducted on several widely tested UDA benchmarks and SSRT achieves consistently the best performances, including 85.43% on Office-Home, 88.76% on VisDA-2017 and 45.2% on DomainNet.
Open AccessSafe Self-Refinement for Transformer-based Domain Adaptation
Unsupervised Domain Adaptation (UDA) aims to leverage a label-rich source domain to solve tasks on a related unlabeled target domain. It is a challenging problem especially when a large domain gap lies between the source and target domains. In this paper we propose a novel solution named SSRT (Safe Self-Refinement for Transformer-based domain adaptation), which brings improvement from two aspects. First, encouraged by the success of vision transformers in various vision tasks, we arm SSRT with a transformer backbone. We find that the combination of vision transformer with simple adversarial adaptation surpasses best reported Convolutional Neural Network (CNN)-based results on the challenging DomainNet benchmark, showing its strong transferable feature representation. Second, to reduce the risk of model collapse and improve the effectiveness of knowledge transfer between domains with large gaps, we propose a Safe Self-Refinement strategy. Specifically, SSRT utilizes predictions of perturbed target domain data to refine the model. Since the model capacity of vision transformer is large and predictions in such challenging tasks can be noisy, a safe training mechanism is designed to adaptively adjust learning configuration. Extensive evaluations are conducted on several widely tested UDA benchmarks and SSRT achieves consistently the best performances, including 85.43% on Office-Home, 88.76% on VisDA-2017 and 45.2% on DomainNet.
- 1 January 2021
- Published by Begell House Inc. Publishers in Journal of Enhanced Heat Transfer
- Vol. 28 (8) , 1-19
KEY PARAMETER OPTIMIZATION AND EXPERIMENTAL VALIDATION OF INDUCTION HEATING FOR THE WELDING OF THERMOPLASTIC COMPOSITES
The magneto-thermal coupling analysis module of finite element numerical simulations was employed to explore the effects of coil parameters and process parameters on the effectiveness of high-frequency electromagnetic induction heating. Taking these key parameters as controlling factors, the influential degree of single factor on the induction heating through the control variable method was firstly analyzed and then the suitable parameters were screened out by comparing the influential degree of each factor. Next, based on the filtered results of single factor test experiment, the orthogonal design method and the principal component analysis (PCA) were applied to investigate the significance of each parameter on the induction heating and determine the best combination of multiple parameters for achieving high heating rate, large heating area and optimum temperature uniformity. Finally, the validity of the simulation results was verified through the analysis of the relative difference of the simulated peak temperatures and tested peak temperatures.
- 1 January 2021
- Published by Begell House Inc. Publishers in Journal of Enhanced Heat Transfer
- Vol. 28 (8) , 1-19
KEY PARAMETER OPTIMIZATION AND EXPERIMENTAL VALIDATION OF INDUCTION HEATING FOR THE WELDING OF THERMOPLASTIC COMPOSITES
The magneto-thermal coupling analysis module of finite element numerical simulations was employed to explore the effects of coil parameters and process parameters on the effectiveness of high-frequency electromagnetic induction heating. Taking these key parameters as controlling factors, the influential degree of single factor on the induction heating through the control variable method was firstly analyzed and then the suitable parameters were screened out by comparing the influential degree of each factor. Next, based on the filtered results of single factor test experiment, the orthogonal design method and the principal component analysis (PCA) were applied to investigate the significance of each parameter on the induction heating and determine the best combination of multiple parameters for achieving high heating rate, large heating area and optimum temperature uniformity. Finally, the validity of the simulation results was verified through the analysis of the relative difference of the simulated peak temperatures and tested peak temperatures.