Zhonghong Ou

Dr. Zhonghong Ou

orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
19 January 2023 in EBioMedicine
Verified
Journal Article
Open access
ZWZhenyu Wei
Zhenyu Wei
SWShigeng Wang
Shigeng Wang
ZWZhiqun Wang
Zhiqun Wang
YZYang Zhang
Yang Zhang
KCKexin Chen
Kexin Chen
QLQingfeng Liang
Qingfeng Liang
Fungal keratitis (FK) is a leading cause of corneal blindness in developing countries due to poor clinical recognition and laboratory identification. Here, we aimed to identify the distinct clinical signature of FK and develop a diagnostic model to differentiate FK from other types of infectious keratitis. We reviewed the electronic health records (EHRs) of all patients with suspected infectious keratitis in Beijing Tongren Hospital from January 2011 to December 2021. Twelve clinical signs of slit-lamp images were assessed by Lasso regression analysis and collinear variables were excluded. Three models based on binary logistic regression, random forest classification, and decision tree classification were trained for FK diagnosis and employed for internal validation. Independent external validation of the models was performed in a cohort of 420 patients from seven different ophthalmic centers to evaluate the accuracy, specificity, and sensitivity in real world. Three diagnostic models of FK based on binary logistic regression, random forest classification, and decision tree classification were established and internal validation were achieved with the mean AUC of 0.916, 0.920, and 0.859, respectively. The models were well-calibrated by external validation using a prospective cohort including 210 FK and 210 non-FK patients from seven eye centers across China. The diagnostic model with the binary logistic regression algorithm classified the external validation dataset with a sensitivity of 0.907 (0.774, 1.000), specificity 0.899 (0.750, 1.000), accuracy 0.905 (0.805, 1.000), and AUC 0.903 (0.808, 0.998). Our model enables rapid identification of FK, which will help ophthalmologists to establish a preliminary diagnosis and to improve the diagnostic accuracy in clinic. The Open Research Fund from the National Key Research and Development Program of China (2021YFC2301000) and the Open Research Fund from Beijing Advanced Innovation Center for Big Data-Based Precision Medicine, Beijing Tongren Hospital, Beihang University &Capital Medical University (BHTR-KFJJ-202001) supported this study.

19 October 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
ZOZhonghong Ou
Zhonghong Ou
ZWZhaofengnian Wang
Zhaofengnian Wang
FXFenrui Xiao
Fenrui Xiao
BXBaiqiao Xiong
Baiqiao Xiong
HZHongxing Zhang
Hongxing Zhang
PHPan Hui
Pan Hui
With the large-scale commercialization of 5G networks, Internet of Things (IoT) applications keep on emerging in recent years. Real-time environmental awareness is an essential part of various IoT applications, e.g., self-driving vehicles. Object detection plays a fundamental role in real-time environmental awareness, which is responsible for acquiring valuable object information from the environment automatically. Despite of the fast progress for object detection in general, small object detection still faces challenges. Because of the restricted scales, small objects are only capable of generating relatively week features after multiple convolutional layers, thus causing low detection accuracy. Existing schemes mostly focus on extracting rich multiscale features, e.g., generating high-resolution features through generative adversarial networks (GANs), or generating multiscale features through feature combination. Nevertheless, these schemes require complex network implementation, and usually suffer from high processing delay because of high-resolution images. To resolve the problems mentioned above, we propose an adaptive dynamic neural network (AD-RCNN) that consists of three fundamental improvements. We first propose a dynamic region proposal network to improve the quality of region proposals. We then introduce a visual attention scheme to generate features of regions. Finally, we put forward an adaptive dynamic training module to optimize final detection results. Experimental results demonstrate that AD-RCNN outperforms the state-of-the-art from the perspectives of mAP and frames per second (FPS). Specifically, at the resolution of 1024 of TT100K data set, AD-RCNN achieves 68.8% mAP, which outperforms the baseline Faster RCNN by 8.52%.

4 November 2024 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
WLWeibin Liao
Weibin Liao
Yifan ZhuYifan Zhu
Yifan Zhu
YLYanyan Li
Yanyan Li
QZQi Zhang
Qi Zhang
ZOZhonghong Ou
Zhonghong Ou
XLXuesong Li
Xuesong Li
Acquiring reviewers for academic submissions is a challenging recommendation scenario. Recent graph learning-driven models have made remarkable progress in the field of recommendation, but their performance in the academic reviewer recommendation task may suffer from a significant false negative issue. This arises from the assumption that unobserved edges represent negative samples. In fact, the mechanism of anonymous review results in inadequate exposure of interactions between reviewers and submissions, leading to a higher number of unobserved interactions compared to those caused by reviewers declining to participate. Therefore, investigating how to better comprehend the negative labeling of unobserved interactions in academic reviewer recommendations is a significant challenge. This study aims to tackle the ambiguous nature of unobserved interactions in academic reviewer recommendations. Specifically, we propose an unsupervised Pseudo Neg-Label strategy to enhance graph contrastive learning (GCL) for recommending reviewers for academic submissions, which we call RevGNN. RevGNN utilizes a two-stage encoder structure that encodes both scientific knowledge and behavior using Pseudo Neg-Label to approximate review preference. Extensive experiments on three real-world datasets demonstrate that RevGNN outperforms all baselines across four metrics. Additionally, detailed further analyses confirm the effectiveness of each component in RevGNN.

22 September 2015 in Mobile Networks and Applications
Verified
Journal Article
Closed access
PDF file
HTHeyi Tang
Heyi Tang
YLYang Liu
Yang Liu
JDJiang Dong
Jiang Dong
ZOZhonghong Ou
Zhonghong Ou
YCYong Cui
Yong Cui
JWJianping Wu
Jianping Wu

12 December 2019 in IEEE Access
Verified
Journal Article
Open access
ZOZhonghong Ou
Zhonghong Ou
FXFenrui Xiao
Fenrui Xiao
BXBaiqiao Xiong
Baiqiao Xiong
SSShenda Shi
Shenda Shi
MSMeina Song
Meina Song
Traffic sign detection has achieved promising results in recent years. Nevertheless, there are still two problems remain to be overcome. One problem is the detection of small traffic signs, which usually occupy less than 2% of the image area. The other problem is fine-grained classification, with difficulties arising from similar appearances between traffic signs. For example, different speed-limit traffic signs have differences solely from the speed numbers. In this paper, we propose a Feature Aggregation MultiPath Network (FAMN) to tackle the problems simultaneously. First, we propose a Feature Aggregation (FA) structure to aggregate regional features from different feature maps by using element-wise Max, then convolution layers are used to extract rich semantic features. Accordingly, objects of different scales can choose the best features to improve performance of small object detection. Second, we propose a Multipath Network (MN) structure to obtain fine-grained features. The MN structure consists of three paths, extracting instance-level, part-level, and context-level features, respectively. The three types of features are then concatenated to form fine-grained features of the proposals. Experimental results demonstrate the effectiveness of our proposed FAMN. Specifically, FAMN is able to obtain an average F1-measure of 93.1% in TT100K dataset, 2.9% higher than the state-of-the-art.

12 August 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
YDYunfeng Duan
Yunfeng Duan
KXKaiwen Xue
Kaiwen Xue
HSHao Sun
Hao Sun
HBHaotong Bao
Haotong Bao
YWYadong Wei
Yadong Wei
ZOZhonghong Ou
Zhonghong Ou
With advancements in digital technologies such as 5G communications, big data, and cloud computing, the components of network operation systems have become increasingly complex, significantly complicating system monitoring and maintenance. Correspondingly, automated log anomaly detection has become a crucial means to ensure stable network operation and protect networks from malicious attacks or failures. Conventional machine learning and deep learning methods assume consistent distributions between the training and testing data, adhering to a closed-set recognition paradigm. Nevertheless, in realistic scenarios, systems may encounter new anomalies that were not present in the training data, especially in log anomaly detection. Inspired by evidential learning, we propose a novel anomaly detector called LogEDL, which supervises the training of the model through an evidential loss function. Unlike traditional loss functions, the evidential loss function not only focuses on correct classification but also quantifies the uncertainty of predictions. This enhances the robustness and accuracy of the model in handling anomaly detection tasks while achieving functionality similar to open-set recognition. To evaluate the proposed LogEDL method, we conduct extensive experiments on three datasets, i.e., HDFS, BGL, and Thunderbird, to detect anomalous log sequences. The experimental results demonstrate that our proposed LogEDL achieves state-of-the-art performance in anomaly detection.