23 May 2023 in IEEE Transactions on Circuits and Systems for Video Technology
Robust reversible watermarking (RRW) is one of the most popular areas in information hiding. Existing schemes have two drawbacks: 1) schemes that can resist conventional attacks often fail to resist geometric attacks, and 2) schemes that can resist geometric attacks often are not robust against conventional attacks and have poor stability. Inspired by the high robustness of fractional-order orthogonal moments (FoOM) and the good feature of resistance to geometric attacks of Zernike moments and pseudo-Zernike moments (ZM/PZM), in this research, FoOM is used to optimize ZM/PZM to obtain FoZM/FoPZM (namely, fractional-order Zernike moments and fractional-order pseudo-Zernike moments). Furthermore, a denoiser is proposed to preprocess the watermarks to improve the robustness against geometric and conventional attacks, the amount of extracted auxiliary information is decreases and the extraction process of auxiliary information is designed to be more stable. Specifically, first, the source of the difference between the watermarked image and the carrier image is identified, that difference is represented with less information, and then that information is embedded into the cover image as auxiliary information. Second, the watermark is embedded in the low-order FoZM/FoPZM component. Finally, the watermarked image is denoised using a denoiser before extracting the watermark. The experimental results show that the scheme has good stability and strong robustness. Compared with existing methods, the proposed scheme has a small and stable auxiliary information size, strong robustness to noise attacks such as Gaussian noise and salt-and-pepper noise attacks, and better resistance to geometric attacks such as rotation and scaling attacks.
21 February 2024 in IEEE Access
With the rapid development of the Internet of Vehicles, a large amount of vehicle network data is being generated. The large amount of data presents network communication security challenges. Although intrusion detection technology can assist in safeguarding the system from malicious attacks, the substantial data generated within the vehicle network poses time-consuming detection challenges. Thus, we propose an intrusion detection model for the Internet of Vehicles, utilizing Gaussian random incremental principal component analysis (GRIPCA) and optimal weighted extreme learning machine (OWELM). First, we utilize GRIPCA to reduce data redundancy by projecting high-dimensional data into a low-dimensional space, thus reducing storage costs. Then, we utilize the dynamic inertia weight particle swarm optimization (DPSO) to optimize the parameters of the weighted extreme learning machine (WELM) to achieve the best performance. We utilize the NSL-KDD and CIC-IDS-2017 datasets to perform experiments and compare the results with other techniques. The experimental results show the excellence of the proposed model, achieving an accuracy rate of 91.02% on the NSL KDD dataset and 94.67% on the CIC-IDS-2017 dataset.
16 June 2023 in IEEE Transactions on Circuits and Systems for Video Technology
Pairwise modification is one of the most effective ways to solve the critical issues of balancing the embedding capacity, image distortion, and file expansion in JPEG reversible data hiding (RDH). To design a satisfactory scheme based on pairwise modification, existing schemes focus on improving pairing rules, two-dimensional (2D) mappings, or ordering strategies separately while neglecting the connections between them. As a result, once pairing rules are changed, the correlative 2D mapping and ordering strategies are no longer available. To address such issues, this study proposes a framework that automatically generates optimal 2D mappings and efficient ordering strategies only by carefully initializing pairing rules. To construct optimal 2D mappings, a 2D mapping mathematical model is built to form a feasible 2D mapping solution space, in which optimal solutions are found, to assign efficient mappings for pairs with high probability. To design efficient ordering strategies, all frequencies are ranked according to an embedding evaluation model to determine more suitable ACs for data embedding. To initialize better pairing rules, this study selects nonzero ACs within ±2 for interblock pairing to form a more centralized pairwise histogram. The experimental results show that the proposed scheme introduces minor file expansion and obtains better visual quality than existing JPEG RDH schemes when the payload is the same as.
16 February 2026 in IEEE Transactions on Circuits and Systems for Video Technology
Reversible data hiding in JPEG images is critical for secure multimedia applications, while, existing histogram modification schemes are confined to fixed 1D or 2D dimensions. These methods fail to adapt to the characteristics of cover images and the demands of embedded data, resulting in suboptimal trade-offs among embedding capacity, image quality, and file size. To address these issues, this study proposes a Multi-Dimensional Histogram Modification Framework that advances histograms from "fixed dimension" to "variable dimension" and extends them to high-dimensional structures. Our key contributions are as follows: first, we propose an adaptive dimension selection strategy that dynamically determines the optimal histogram dimension by evaluating the capacity and distortion for each cover image and embedding task; second, we develop a high-dimensional histogram construction method that combines AC coefficients with absolute values of 1 and 2 at the same frequency to enhance the utilization of coefficient correlation; third, we design an optimized mapping algorithm that searches for the optimal mapping matrix to minimize both distortion and file expansion. Experimental results show that the proposed method outperforms existing 1D and 2D histogram modification schemes. On average, it increases the embedding capacity by 5000 bits, improves the image quality by 0.2 dB, and reduces the file size by 4000 bits.