RJRuixia Jin

Ruixia Jin

*This is an algorithmically generated author record based on publicly available information.

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


Ruixia Jin has a total of 19 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Environmental Sound Recognition Based on Multi-scale Parallel Convolutional Network Model

    by Ruixia Jin, Yingge Zhao, Liang Chen, Zhichong Geng, Shuaibin Wang, Lixue Zheng

  • Open Access

    Multi-strategy synthetized equilibrium optimizer and application

    by Quandang Sun, Xinyu Zhang, Ruixia Jin, Xinming Zhang, Yuanyuan Ma

    Background: Improvement on the updating equation of an algorithm is among the most improving techniques. Due to the lack of search ability, high computational complexity and poor operability of equilibrium optimizer (EO) in solving complex optimization problems, an improved EO is proposed in this article, namely the multi-strategy on updating synthetized EO (MS-EO). Method: Firstly, a simplified updating strategy is adopted in EO to improve operability and reduce computational complexity. Secondly, an information sharing strategy updates the concentrations in the early iterative stage using a dynamic tuning strategy in the simplified EO to form a simplified sharing EO (SS-EO) and enhance the exploration ability. Thirdly, a migration strategy and a golden section strategy are used for a golden particle updating to construct a Golden SS-EO (GS-EO) and improve the search ability. Finally, an elite learning strategy is implemented for the worst particle updating in the late stage to form MS-EO and strengthen the exploitation ability. The strategies are embedded into EO to balance between exploration and exploitation by giving full play to their respective advantages. Result and Finding: Experimental results on the complex functions from CEC2013 and CEC2017 test sets demonstrate that MS-EO outperforms EO and quite a few state-of-the-art algorithms in search ability, running speed and operability. The experimental results of feature selection on several datasets show that MS-EO also provides more advantages.


  • Open Access

    Gain-Loss Evaluation-Based Generic Selection for Steganalysis Feature

    by Ruixia Jin, Yihao Wang, Yuanyuan Ma, Tao Li, Xintao Duan

    Fewer contribution feature components in the image high-dimensional steganalysis feature are able to increase the spatio-temporal complexity of detecting the stego images, and even reduce the detection accuracy. In order to maintain or even improve the detection accuracy while effectively reducing the dimension of the DCTR steganalysis feature, this paper proposes a new selection approach for DCTR feature. First, the asymmetric distortion factor and information gain ratio of each feature component are improved to measure the difference between the symmetric cover and stego features, which provides the theoretical basis for selecting the feature components that contribute to a great degree to detecting the stego images. Additionally, the feature components are arranged in descending order rely on the two measurement criteria, which provides the basis for deleting the components. Based on the above, removing feature components that are ranked larger differently according to two criteria. Ultimately, the preserved feature components are used as the final selected feature for training and detection. Comparison experiments with existing classical approaches indicate that this approach can effectively reduce the feature dimension while maintaining or even improving the detection accuracy. At the same time, it can reduce the detection spatio-temporal complexity of the stego images.

  • Open Access

    A Fast Selection Based on Similar Cross-Entropy for Steganalytic Feature

    by Ruixia Jin, Xinquan Yu, Yuanyuan Ma, Shuang Yin, Lige Xu

    The mutual confrontation between image steganography and steganalysis causes both to iterate continuously, and as a result, the dimensionality of the steganalytic features continues to increase, leading to an increasing spatio-temporal overhead. To this end, this paper proposes a fast steganalytic feature selection method based on a similar cross-entropy. Firstly, the properties of cross-entropy are investigated, through the discussion of different models, and the intra-class similarity criterion and inter-class similarity criterion based on cross-entropy are presented for the first time. Then, referring to the design principles of Fisher’s criterion, the criterion of feature contribution degree is further proposed. Secondly, the variation of the cross-entropy function of a univariate variable is analyzed in principle, thus determining the normalized range and simplifying the subsequent analysis. Then, within the normalized range, the variation of the cross-entropy function of a binary variable is investigated and the setting of important parameters is determined. Thirdly, the concept of similar cross-entropy is further presented by analyzing the changes in the value of the feature contribution measure under different circumstances, and based on this, the criterion for the feature contribution measure is updated to decrease the complexity of the calculation. Remarkably, the contribution measure criterion devised in this paper is a symmetrical structure, which equitably measures the contribution of features in different situations. Fourth, the feature component with the highest contribution is selected as the final selected feature based on the result of the feature metric. Finally, based on the Bossbase 1.01 image base that is a unique standard and recognized base in steganalysis, the feature selection on 8 kinds of low and high-dimensional steganalytic features is carried out. Through extensive experiments, comparison with several classic and state-of-the-art methods, the method designed in this paper attains competitive or even better performance in detection accuracy, calculation cost, storage cost and versatility.


  • Open Access

    Comprehensive Criteria-Based Generalized Steganalysis Feature Selection Method

    by Yihao Wang, Yuanyuan Ma, Ruixia Jin, Pei Liu, Ning Ruan

    Redundant steganalysis feature components in high-dimensional steganalysis feature of images increase the spatio-temporal complexity of steganalysis and even reduce the detection accuracy of the stego images. In order to reduce the image steganalysis feature dimension, improve the detection accuracy of the stego images and achieve fast feature selection, this paper proposes a general method for image steganalysis feature selection. Firstly, a feature metric algorithm based on the difference function is given, and this algorithm measures the difference of the steganalysis feature components between the cover image class and the stego image class, which provides the basis for selecting the steganalysis feature components contributing greatly to detect the stego images. Secondly, the Pearson correlation coefficient is improved and used to measure the correlation between the steganalysis feature components and the image classification results to provide the basis for removing the redundant steganalysis feature components. And then, by setting thresholds, the steganalysis feature components with a large difference function value are selected and with a small Pearson correlation coefficient are deleted. Finally, the steganalysis feature components retained are trained and detected as the final steganalysis feature. A series of experimental results indicate that this method can reduce the feature dimension effectively and the spatio-temporal complexity of steganalysis, while maintaining or even improving the detection accuracy of the stego images. Compared to existing steganalysis feature selection methods such as Fisher-GFR and Improved-Fisher, this method has a higher detection accuracy of the stego images after simplification.