Jianxin Wang

Prof. Dr. Jianxin Wang


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
1 January 2017 in Computational Intelligence and Neuroscience
Verified
Journal Article
Open access
PDF file
GWGuan Wang
Guan Wang
YSYu Sun
Yu Sun
JWJianxin Wang
Jianxin Wang
Automatic and accurate estimation of disease severity is essential for food security, disease management, and yield loss prediction. Deep learning, the latest breakthrough in computer vision, is promising for fine-grained disease severity classification, as the method avoids the labor-intensive feature engineering and threshold-based segmentation. Using the apple black rot images in the PlantVillage dataset, which are further annotated by botanists with four severity stages as ground truth, a series of deep convolutional neural networks are trained to diagnose the severity of the disease. The performances of shallow networks trained from scratch and deep models fine-tuned by transfer learning are evaluated systemically in this paper. The best model is the deep VGG16 model trained with transfer learning, which yields an overall accuracy of 90.4% on the hold-out test set. The proposed deep learning model may have great potential in disease control for modern agriculture.

1 January 2015 in Journal of Immunology Research
Verified
Journal Article
Open access
PDF file
LWLuman Wang
Luman Wang
QMQiaochu Mo
Qiaochu Mo
JWJianxin Wang
Jianxin Wang
Most current gene coexpression databases support the analysis for linear correlation of gene pairs, but not nonlinear correlation of them, which hinders precisely evaluating the gene-gene coexpression strengths. Here, we report a new database, MIrExpress, which takes advantage of the information theory, as well as the Pearson linear correlation method, to measure the linear correlation, nonlinear correlation, and their hybrid of cell-specific gene coexpressions in immune cells. For a given gene pair or probe set pair input by web users, both mutual information (MI) and Pearson correlation coefficient (r) are calculated, and several corresponding values are reported to reflect their coexpression correlation nature, including MI andrvalues, their respective rank orderings, their rank comparison, and their hybrid correlation value. Furthermore, for a given gene, the top 10 most relevant genes to it are displayed with the MI,r, or their hybrid perspective, respectively. Currently, the database totally includes 16 human cell groups, involving 20,283 human genes. The expression data and the calculated correlation results from the database are interactively accessible on the web page and can be implemented for other related applications and researches.

31 January 2025 in Foods
Verified
Journal Article
Open access
PDF file
ZCZengzheng Chen
Zengzheng Chen
JWJianxin Wang
Jianxin Wang
YWYeru Wang
Yeru Wang
As a pivotal area of research in the field of computer vision, the technology for food identification has become indispensable across diverse domains including dietary nutrition monitoring, intelligent service provision in restaurants, and ensuring quality control within the food industry. However, recognizing food images falls within the domain of Fine-Grained Visual Classification (FGVC), which presents challenges such as inter-class similarity, intra-class variability, and the complexity of capturing intricate local features. Researchers have primarily focused on deep information in deep convolutional neural networks for fine-grained visual classification, often neglecting shallow and detailed information. Taking these factors into account, we propose a Multi-level Attention Feature Fusion Network (MAF-Net). Specifically, we use feature maps generated by the Convolutional Neural Networks (CNNs) backbone network at different stages as inputs. We apply a self-attention mechanism to identify local features on these feature maps and then stack them together. The feature vectors obtained through the attention mechanism are then integrated with the original input to enhance data augmentation. Simultaneously, to capture as many local features as possible, we encourage multi-scale features to concentrate on distinct local regions at each stage by maximizing the Kullback-Leibler Divergence (KL-divergence) between the different stages. Additionally, we present a novel approach called subclass center loss (SCloss) to implement label smoothing, minimize intra-class feature distribution differences, and enhance the model’s generalization capability. Experiments conducted on three food image datasets—CETH Food-101, Vireo Food-172, and UEC Food-100—demonstrated the superiority of the proposed model. The model achieved Top-1 accuracies of 90.22%, 89.86%, and 90.61% on CETH Food-101, Vireo Food-172, and UEC Food-100, respectively. Notably, our method not only outperformed other methods in terms of the Top-5 accuracy of Vireo Food-172 but also achieved the highest performance in the Top-1 accuracies of UEC Food-100.

13 April 2020 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
YGYanan Gao
Yanan Gao
JWJianxin Wang
Jianxin Wang
LZLiping Zhang
Liping Zhang

1 June 2006
Verified
Conference Paper
Closed access
JWJianxin Wang
Jianxin Wang
HWHongzhou Wang
Hongzhou Wang
GZGeng Zhao
Geng Zhao
The clustering approach forwarded by Klaus Julisch is considerably effectual in eliminating false positives and finding root causes among huge amount of security events. But the clustering problem was proved to be unfortunately an NP-hard one. In this paper, a GA-based algorithm is forwarded, which is much more effective than the original approximation algorithm by Julisch. The coding scheme and genetic operations including selection, crossover, and mutation are discussed in detail. To validate the quality of the newly-forwarded approach, a tree-version apriori is given, which is quite time-consuming but able to produce absolutely accurate solution used for comparison in a feasible period of time. The results show that the GA-based algorithm is valid and efficient and can find the optimal clusters that are very similar to the absolutely accurate ones

19 May 2025 in Computation
Verified
Journal Article
Open access
PDF file
DLDongbo Liu
Dongbo Liu
HCHao Chen
Hao Chen
JWJianxin Wang
Jianxin Wang
YWYeru Wang
Yeru Wang
Gene regulatory networks (GRNs) describe the interactions between transcription factors (TFs) and their target genes, playing a crucial role in understanding gene functions and how cells regulate gene expression under different conditions. Recent advancements in multi-omics technologies have provided new opportunities for more comprehensive GRN inference. Among these data types, gene expression and chromatin accessibility are particularly important, as they are key to distinguishing between direct and indirect regulatory relationships. However, existing methods primarily rely on gene expression data while neglecting biological information such as chromatin accessibility, leading to an increased occurrence of false positives in the inference results. To address the limitations of existing approaches, we propose MultiGNN, a supervised framework based on graph neural networks (GNNs). Unlike conventional GRN inference methods, MultiGNN leverages features extracted from both gene expression and chromatin accessibility data to predict regulatory interactions between genes. Experimental results demonstrate that MultiGNN consistently outperforms other methods across seven datasets. Additionally, ablation studies validate the effectiveness of our multi-omics feature integration strategy, offering a new direction for more accurate GRN inference.