Bo Ou
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
Bo Ou has a total of 54 co-authors. Here are the top co-authors by number of shared publications:
- Cheng Zhang
College of Computer Science and Electronic Engineering, Hunan University, Changsha, China
4 shared publications - Fei Peng
School of Artificial Intelligence, Guangzhou University, Guangzhou, Guangdong, China
4 shared publications - Xin Liao
Hunan University
4 shared publications - Yao Zhao
Institute of Information Science, Beijing Jiaotong University, Beijing, China and Visual Intelligence + X International Joint Laboratory, Beijing, China
4 shared publications - Zheng Qin
Hunan University
3 shared publications - Chin-Chen Chang
Department of Computer Science and Information Engineering, National Chin-Yi University of Technology, Taichung, Taiwan
2 shared publications
Latest Publications
- 6 February 2026
- Published by Elsevier in Signal Processing: Image Communication
- Vol. 143
Dynamic reversible data hiding for relational database using attribute value ordering
- 6 February 2026
- Published by Elsevier in Signal Processing: Image Communication
- Vol. 143
Dynamic reversible data hiding for relational database using attribute value ordering
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 36  (5) , 7111-7124
AI-Assisted Reversible Data Hiding Using Reinforcement Learning
Recently, artificial intelligence (AI) algorithm has been extensively utilized as an optimization tool in digital watermarking. However, existing works seldom consider the reversibility of the embedding framework, thereby neglecting the protection of sensitive carriers. In this paper, we propose an AI-assisted reversible data hiding (RDH) method based on reinforcement learning. In our method, the Q-Learning algorithm is introduced to address the optimization problem of RDH, i.e., adaptive two-dimensional (2D) mapping generation, and it is designed to simulate pixel modifications in 2D space, employing a Markov decision process formulation within the reinforcement learning paradigm. The new reward function is given to evaluate the effectiveness of 2D mapping based on the estimated embedding capacity and the distortion-capacity ratio. To ensure reversibility, a mapping adjustment strategy is implemented to update the environmental states. Experimental results show that the proposed method outperforms conventional 2D RDH and demonstrates competitive performance compared to other state-of-the-art RDH methods.
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 36  (5) , 7111-7124
AI-Assisted Reversible Data Hiding Using Reinforcement Learning
Recently, artificial intelligence (AI) algorithm has been extensively utilized as an optimization tool in digital watermarking. However, existing works seldom consider the reversibility of the embedding framework, thereby neglecting the protection of sensitive carriers. In this paper, we propose an AI-assisted reversible data hiding (RDH) method based on reinforcement learning. In our method, the Q-Learning algorithm is introduced to address the optimization problem of RDH, i.e., adaptive two-dimensional (2D) mapping generation, and it is designed to simulate pixel modifications in 2D space, employing a Markov decision process formulation within the reinforcement learning paradigm. The new reward function is given to evaluate the effectiveness of 2D mapping based on the estimated embedding capacity and the distortion-capacity ratio. To ensure reversibility, a mapping adjustment strategy is implemented to update the environmental states. Experimental results show that the proposed method outperforms conventional 2D RDH and demonstrates competitive performance compared to other state-of-the-art RDH methods.
- 8 November 2025
- Published by Elsevier in Signal Processing
- Vol. 241
Video reversible data hiding using histogram shifting and matrix embedding for HEVC
- 8 November 2025
- Published by Elsevier in Signal Processing
- Vol. 241
Video reversible data hiding using histogram shifting and matrix embedding for HEVC
- 23 May 2025
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 92
Pixel-level compensation and quantization-preserving decoding for HEVC video reversible data hiding
- 23 May 2025
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 92
Pixel-level compensation and quantization-preserving decoding for HEVC video reversible data hiding
- 26 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 32  (10709908) , 696-700
A Traitor Tracing and Access Control Method for Encrypted 3D Models Based on CP-ABE and Fair Watermark
With the rapid development of the metaverse, massive amounts of 3D data are created and outsourced in the cloud, and ciphertext policy attribute-based encryption (CP-ABE) is widely used in fine-grained access control to achieve secure outsourced data sharing. However, the prominent security risk is due to the fact that authorized data users may later become traitors and illegally redistribute the 3D models to the public. To protect the rights of the creator, a traitor tracing and access control method for encrypted 3D models is proposed using CP-ABE and fair watermark to meet the security needs in the metaverse. First, a commutative watermark/encryption method based on the orthogonal operation domain is designed, and the 3D model is encrypted by CP-ABE. Then, a fair watermark protocol protects the rights of the parties. Finally, the blockchain acts as a trusted third party and records the authentication information for traitor tracing. The experimental results demonstrate the feasibility and safety of the proposed method.
- 26 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 32  (10709908) , 696-700
A Traitor Tracing and Access Control Method for Encrypted 3D Models Based on CP-ABE and Fair Watermark
With the rapid development of the metaverse, massive amounts of 3D data are created and outsourced in the cloud, and ciphertext policy attribute-based encryption (CP-ABE) is widely used in fine-grained access control to achieve secure outsourced data sharing. However, the prominent security risk is due to the fact that authorized data users may later become traitors and illegally redistribute the 3D models to the public. To protect the rights of the creator, a traitor tracing and access control method for encrypted 3D models is proposed using CP-ABE and fair watermark to meet the security needs in the metaverse. First, a commutative watermark/encryption method based on the orthogonal operation domain is designed, and the 3D model is encrypted by CP-ABE. Then, a fair watermark protocol protects the rights of the parties. Finally, the blockchain acts as a trusted third party and records the authentication information for traitor tracing. The experimental results demonstrate the feasibility and safety of the proposed method.
- 11 October 2024
- Published by Elsevier in Signal Processing
- Vol. 227
Video reversible data hiding: An evolution to local distortion-tolerance framework
- 11 October 2024
- Published by Elsevier in Signal Processing
- Vol. 227
Video reversible data hiding: An evolution to local distortion-tolerance framework
- Open Access
- 1 August 2024
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 7, 6048-6056
Dynamic Higher-Order Relations and Event-Driven Temporal Modeling for Stock Price Forecasting
In stock price forecasting, modeling the probabilistic dependence between stock prices within a time-series framework has remained a persistent and highly challenging area of research. We propose a novel model to explain the extreme co-movement in multivariate data with time-series dependencies. Our model incorporates a Hawkes process layer to capture abrupt co-movements, thereby enhancing the temporal representation of market dynamics. We introduce dynamic hypergraphs into our model adapting to higher-order (groupwise rather than pairwise) relationships within the stock market. Extensive experiments on real-world benchmarks demonstrate the robustness of our approach in predictive performance and portfolio stability.
- 1 August 2024
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 7, 6048-6056
Open AccessDynamic Higher-Order Relations and Event-Driven Temporal Modeling for Stock Price Forecasting
In stock price forecasting, modeling the probabilistic dependence between stock prices within a time-series framework has remained a persistent and highly challenging area of research. We propose a novel model to explain the extreme co-movement in multivariate data with time-series dependencies. Our model incorporates a Hawkes process layer to capture abrupt co-movements, thereby enhancing the temporal representation of market dynamics. We introduce dynamic hypergraphs into our model adapting to higher-order (groupwise rather than pairwise) relationships within the stock market. Extensive experiments on real-world benchmarks demonstrate the robustness of our approach in predictive performance and portfolio stability.
- Open Access
Are Watermarks Bugs for Deepfake Detectors? Rethinking Proactive Forensics
AI-generated content has accelerated the topic of media synthesis, particularly Deepfake, which can manipulate our portraits for positive or malicious purposes. Before releasing these threatening face images, one promising forensics solution is the injection of robust watermarks to track their own provenance. However, we argue that current watermarking models, originally devised for genuine images, may harm the deployed Deepfake detectors when directly applied to forged images, since the watermarks are prone to overlap with the forgery signals used for detection. To bridge this gap, we thus propose AdvMark, on behalf of proactive forensics, to exploit the adversarial vulnerability of passive detectors for good. Specifically, AdvMark serves as a plug-and-play procedure for fine-tuning any robust watermarking into adversarial watermarking, to enhance the forensic detectability of watermarked images; meanwhile, the watermarks can still be extracted for provenance tracking. Extensive experiments demonstrate the effectiveness of the proposed AdvMark, leveraging robust watermarking to fool Deepfake detectors, which can help improve the accuracy of downstream Deepfake detection without tuning the in-the-wild detectors. We believe this work will shed some light on the harmless proactive forensics against Deepfake.
Open AccessAre Watermarks Bugs for Deepfake Detectors? Rethinking Proactive Forensics
AI-generated content has accelerated the topic of media synthesis, particularly Deepfake, which can manipulate our portraits for positive or malicious purposes. Before releasing these threatening face images, one promising forensics solution is the injection of robust watermarks to track their own provenance. However, we argue that current watermarking models, originally devised for genuine images, may harm the deployed Deepfake detectors when directly applied to forged images, since the watermarks are prone to overlap with the forgery signals used for detection. To bridge this gap, we thus propose AdvMark, on behalf of proactive forensics, to exploit the adversarial vulnerability of passive detectors for good. Specifically, AdvMark serves as a plug-and-play procedure for fine-tuning any robust watermarking into adversarial watermarking, to enhance the forensic detectability of watermarked images; meanwhile, the watermarks can still be extracted for provenance tracking. Extensive experiments demonstrate the effectiveness of the proposed AdvMark, leveraging robust watermarking to fool Deepfake detectors, which can help improve the accuracy of downstream Deepfake detection without tuning the in-the-wild detectors. We believe this work will shed some light on the harmless proactive forensics against Deepfake.
- Open Access
- 9 April 2024
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 56  (7) , 1-33
A Survey on Reversible Data Hiding for Uncompressed Images
Reversible data hiding (RDH) has developed various theories and algorithms since the early 1990s. The existing works involve a large amount of specialized knowledge, making it difficult for researchers, especially primary learners, to have a good grounding in the basic ideas. In this survey, we will review the mainstream RDH algorithms in uncompressed images and analyze their unique features to provide readers with an introduction to basic topics in RDH. We analyze the most effective RDH frameworks and their common extensions. The classic techniques, including lossless compression-based RDH, difference expansion, integer transform, histogram shifting, prediction-error expansion (PEE), and their extensions, will be reviewed first. Then, three currently popular investigated schemes, i.e., multiple histograms modification, pairwise PEE, and pixel-value-ordering, are presented in detail. Four aspects of these mainstream techniques are reviewed and analyzed, including the evolution of embedding frameworks, detailed technological features, extensions, and the current state of the art. Furthermore, we look forward the possible future research based on early-age motivations.
- 9 April 2024
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 56  (7) , 1-33
Open AccessA Survey on Reversible Data Hiding for Uncompressed Images
Reversible data hiding (RDH) has developed various theories and algorithms since the early 1990s. The existing works involve a large amount of specialized knowledge, making it difficult for researchers, especially primary learners, to have a good grounding in the basic ideas. In this survey, we will review the mainstream RDH algorithms in uncompressed images and analyze their unique features to provide readers with an introduction to basic topics in RDH. We analyze the most effective RDH frameworks and their common extensions. The classic techniques, including lossless compression-based RDH, difference expansion, integer transform, histogram shifting, prediction-error expansion (PEE), and their extensions, will be reviewed first. Then, three currently popular investigated schemes, i.e., multiple histograms modification, pairwise PEE, and pixel-value-ordering, are presented in detail. Four aspects of these mainstream techniques are reviewed and analyzed, including the evolution of embedding frameworks, detailed technological features, extensions, and the current state of the art. Furthermore, we look forward the possible future research based on early-age motivations.
- 12 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 11  (3) , 4412-4425
Generative Steganography via Live Comments on Streaming Video Frames
Generative text steganography has received considerable attention in the covert communication community for the benefit of sending secret messages without the need to modify carriers. Existing methods typically choose the next word when generating a stego-text based on conditional probability encoding of candidates, which may lead to generating inadequate words for the underlying secret message. How to generate a semantically controllable stego-text with a high capacity on secure embedding of a secret message is a main challenge. We address this challenge by proposing a new paradigm to generative text steganography that takes advantage of certain social media through apparently normal behaviors from the sender. In particular, we make use of the live commenting feature provided by public video sharing platforms (PVSPs), which allow viewers to make comments on video scenes that will fly on screens when the scenes are shown. We show that this feature can be used to construct a generative steganographic system. The sender generates at random a number of distracting words and a certain invertible matrix called W- d matrix based on the total number of message words and distracting words. The sender then transforms a sequence of indexes of these words to a sequence, selects one or more videos with a sufficiently large number of total frames, and generates a comment on each frame in the sequence. The receiver extracts commented frame indexes, uses the shared stego-key to generate the same W- d matrix as the sender, and obtains the secret message using the inverse of the matrix. The stego-key consists of a vocabulary generator and a W- d matrix generator (WMG) based on pseudorandomly generated numbers. To generate comments on frames that conform to comments made by viewers, we devise a neural ResNet-LSTM model to generate a comment for an input image based on its content. Theoretical analysis shows that commented video frames (CVF) is covert, secure, efficient, and feasible to conceal any message of arbitrary length. We implement CVF and present evaluation results from multiple aspects that our work outperforms the existing stego-methods.
- 12 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 11  (3) , 4412-4425
Generative Steganography via Live Comments on Streaming Video Frames
Generative text steganography has received considerable attention in the covert communication community for the benefit of sending secret messages without the need to modify carriers. Existing methods typically choose the next word when generating a stego-text based on conditional probability encoding of candidates, which may lead to generating inadequate words for the underlying secret message. How to generate a semantically controllable stego-text with a high capacity on secure embedding of a secret message is a main challenge. We address this challenge by proposing a new paradigm to generative text steganography that takes advantage of certain social media through apparently normal behaviors from the sender. In particular, we make use of the live commenting feature provided by public video sharing platforms (PVSPs), which allow viewers to make comments on video scenes that will fly on screens when the scenes are shown. We show that this feature can be used to construct a generative steganographic system. The sender generates at random a number of distracting words and a certain invertible matrix called W- d matrix based on the total number of message words and distracting words. The sender then transforms a sequence of indexes of these words to a sequence, selects one or more videos with a sufficiently large number of total frames, and generates a comment on each frame in the sequence. The receiver extracts commented frame indexes, uses the shared stego-key to generate the same W- d matrix as the sender, and obtains the secret message using the inverse of the matrix. The stego-key consists of a vocabulary generator and a W- d matrix generator (WMG) based on pseudorandomly generated numbers. To generate comments on frames that conform to comments made by viewers, we devise a neural ResNet-LSTM model to generate a comment for an input image based on its content. Theoretical analysis shows that commented video frames (CVF) is covert, secure, efficient, and feasible to conceal any message of arbitrary length. We implement CVF and present evaluation results from multiple aspects that our work outperforms the existing stego-methods.