Bo Ou

Bo Ou

Auto-generated profile, based on publicly available information

Bo Ou

College of Computer Science and Electronic Engineering, Hunan University, Changsha, China

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
25 July 2018 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
BOBo Ou
Bo Ou
XLXiaolong Li
Xiaolong Li
WZWeiming Zhang
Weiming Zhang
YZYao Zhao
Yao Zhao
Pairwise prediction-error expansion (pairwise PEE) is a recent technique for high-dimensional reversible data hiding. However, in the absence of adaptive embedding, its potential has not been fully exploited. In this paper, we propose the adaptive pixel pairing (APP) and the adaptive mapping selection for the enhancement of pairwise PEE. Our motivation is twofold: building a sharper two-dimensional (2D) histogram and designing the effective 2D mapping for it. In APP, we consider to increase the similarity between pixels in a pair, by excluding rough pixels from pairing and only putting the smooth pixels into pairs. In this way, the pixels in a pair have a larger possibility of being equal, and thus the resulted 2D prediction-error histogram (PEH) has a lower entropy. Next, the adaptive mapping selection mechanism is introduced to properly determine the optimal modification, based on “whether it fits for the resulted PEH" rather than by the heuristic experience. The experimental results show that the proposed method has a significant improvement over the pairwise PEE.

26 October 2023
Verified
Conference Paper
Open access
XWXiaoshuai Wu
Xiaoshuai Wu
XLXin Liao
Xin Liao
BOBo Ou
Bo Ou
Malicious Deepfakes have led to a sharp conflict over distinguishing between genuine and forged faces. Although many countermeasures have been developed to detect Deepfakes ex-post, undoubtedly, passive forensics has not considered any preventive measures for the pristine face before foreseeable manipulations. To complete this forensics ecosystem, we thus put forward the proactive solution dubbed SepMark, which provides a unified framework for source tracing and Deepfake detection. SepMark originates from encoder-decoder-based deep watermarking but with two separable decoders. For the first time the deep separable watermarking, SepMark brings a new paradigm to the established study of deep watermarking, where a single encoder embeds one watermark elegantly, while two decoders can extract the watermark separately at different levels of robustness. The robust decoder termed Tracer that resists various distortions may have an overly high level of robustness, allowing the watermark to survive both before and after Deepfake. The semi-robust one termed Detector is selectively sensitive to malicious distortions, making the watermark disappear after Deepfake. Only SepMark comprising of Tracer and Detector can reliably trace the trusted source of the marked face and detect whether it has been altered since being marked; neither of the two alone can achieve this. Extensive experiments demonstrate the effectiveness of the proposed SepMark on typical Deepfakes, including face swapping, expression reenactment, and attribute editing. Code will be available at https://github.com/sh1newu/SepMark.

10 June 2019 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
BOBo Ou
Bo Ou
YZYao Zhao
Yao Zhao
Among various techniques of reversible data hiding (RDH), histogram modification has been mostly investigated and used in practice. Recently, a new histogram modification technique, namely, multiple histograms modification (MHM), has been proposed and received the increasing attentions. By MHM, multiple histograms can be modified differently to achieve an excellent embedding performance. However, as the maximum modification on each pixel value is 1, only one pair of bins in the prediction-error histogram (PEH) is allowed to be expanded for data embedding. This drawback leads to a low capacity and limits its extension for the high capacity scenario. To remedy this, we extend the MHM scheme and propose an efficient solution for the high capacity embedding. Specifically, instead of only selecting one pair of expansion bins in each PEH, in the proposed method, multiple pairs of bins are utilized for expansion in each PEH. Moreover, the embedding performance is optimized by an advisable expansion bin selection strategy. Consequently, the multiple PEHs are allowed to embed with different capacities according to the sharpness of distribution, i.e., the low-index PEH that consists of more smooth pixels is embedded with a larger capacity than the high-index one. Besides, a simplified parameter determination is developed to seek the optimal solution with a good computational efficiency. Experimental results show that the proposed method can achieve the high capacity and provide a better performance than some state-of-the-art RDH methods.

14 July 2023 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
GHGangyang Hou
Gangyang Hou
BOBo Ou
Bo Ou
MLMin Long
Min Long
Fei PengFei Peng
Fei Peng
Reversible data hiding in encrypted domain (RDH-ED) can perform data encryption to fulfill the privacy protection of original media and embed additional data for covert communication or access control. However, current researches are focusing on the encrypted images, and little attention is paid to encrypted three-dimensional (3D) models. In this paper, a high capacity separable RDH-ED method for encrypted 3D models is proposed based on octree spatial subdivision and multiple most significant bit (multi-MSB) prediction. Firstly, a 3D model is adaptively subdivided into non-overlapping subblocks by octree spatial subdivision, and the vertices in a subblock are classified into embedding set and reference set. To better utilize the spatial correlation of the two sets, the multi-MSB prediction error of the embedding set is used to embed the additional data, and the reference set is used to losslessly recover the embedded set. Then, the model is encrypted by a specified encrypted algorithm. At last, additional data is embedded into the reserved embedding room by multi-MSB substitution. Experimental results show that the proposed method can achieve a higher embedding capacity compared with the state-of-the-art methods, and guarantee the lossless recovery of the 3D model.

8 November 2021 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
CZCheng Zhang
Cheng Zhang
BOBo Ou
Bo Ou
Pairwise prediction-error expansion (pairwise PEE) is an efficient reversible data hiding technique based on two-dimensional (2D) histogram modification. However, without considering the image content, its embedding manner lacks adaptivity. In this paper, we propose the adaptive modification for multiple prediction-error histograms (PEHs). An iterative self-learning optimization algorithm is devised to adaptively generate the 2D mapping, based on the PEH and payload. A loss function is employed and the optimization can be solved linearly to reduce the time cost. To determine the appropriate expansion bins, we generate multiple 2D PEHs and establish multiple candidate mappings. The optimal combination of the adaptive 2D mappings is determined by using exhaustive searching. Our method is flexible as the 2D mapping generation has a broad dynamic range. The experimental results show that the proposed method can outperform the pairwise PEE and also provide a competitive performance compared with the other state-of-the-art 2D RDH methods.

1 March 2021 in Signal Processing: Image Communication
Verified
Journal Article
Closed access
JHJiacheng Hou
Jiacheng Hou
BOBo Ou
Bo Ou
HTHuawei Tian
Huawei Tian
ZQZheng Qin
Zheng Qin