Bo Ning

Prof. Bo Ning

orcid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
5 December 2018 in The Astrophysical Journal
Verified
Journal Article
Closed access
Bo NingBo Ning
Bo Ning
AWAngie Wolfgang
Angie Wolfgang
SGSujit Ghosh
Sujit Ghosh
A fundamental endeavor in exoplanetary research is to characterize the bulk compositions of planets via measurements of their masses and radii. With future sample sizes of hundreds of planets to come from TESS and PLATO, we develop a statistical method that can flexibly yet robustly characterize these compositions empirically, via the exoplanet M–R relation. Although the M–R relation has been explored in many prior works, they mostly use a power-law model, with assumptions that are not flexible enough to capture important features in current and future M–R diagrams. To address these shortcomings, a nonparametric approach is developed using a sequence of Bernstein polynomials. We demonstrate the benefit of taking the nonparametric approach by benchmarking our findings with previous work and showing that a power law can only reasonably describe the M–R relation of the smallest planets and that the intrinsic scatter can change non-monotonically with different values of a radius. We then apply this method to a larger data set, consisting of all the Kepler observations in the NASA Exoplanet Archive. Our nonparametric approach provides a tool to estimate the M–R relation by incorporating heteroskedastic measurement errors into the model. As more observations will be obtained in the near future, this approach can be used with the provided R code to analyze a larger data set for a better understanding of the M–R relation.

30 August 2019 in The Astrophysical Journal
Verified
Journal Article
Closed access
SKShubham Kanodia
Shubham Kanodia
AWAngie Wolfgang
Angie Wolfgang
GSGudmundur K. Stefansson
Gudmundur K. Stefansson
Bo NingBo Ning
Bo Ning
SMSuvrath Mahadevan
Suvrath Mahadevan

28 May 2025 in Applied Sciences
Verified
Journal Article
Open access
PDF file
TGTianchen Ge
Tianchen Ge
Bo NingBo Ning
Bo Ning
YXYiwu Xie
Yiwu Xie
Accurate detection of dangerous driving behaviors is crucial for improving the safety of intelligent transportation systems. However, existing methods often struggle with limited feature extraction capabilities and insufficient attention to multiscale and contextual information. To overcome these limitations, we propose YOLO-AFR (YOLO with Adaptive Feature Refinement) for dangerous driving behavior detection. YOLO-AFR builds upon the YOLOv12 architecture and introduces three key innovations: (1) the redesign of the original A2C2f module by introducing a Feature-Refinement Feedback Network (FRFN), resulting in a new A2C2f-FRFN structure that adaptively refines multiscale features, (2) the integration of self-calibrated convolution (SC-Conv) modules in the backbone to enhance multiscale contextual modeling, and (3) the employment of a SEAM-based detection head to improve global contextual awareness and prediction accuracy. These three modules combine to form a Calibration-Refinement Loop, which progressively reduces redundancy and enhances discriminative features layer by layer. We evaluate YOLO-AFR on two public driver behavior datasets, YawDD-E and SfdDD. Experimental results show that YOLO-AFR significantly outperforms the baseline YOLOv12 model, achieving improvements of 1.3% and 1.8% in mAP@0.5, and 2.6% and 12.3% in mAP@0.5:0.95 on the YawDD-E and SfdDD datasets, respectively, demonstrating its superior performance in complex driving scenarios while maintaining high inference speed.

21 January 2024 in Expert Systems with Applications
Verified
Journal Article
Closed access
DZDong Zhang
Dong Zhang
WFWenlong Feng
Wenlong Feng
ZWZonghang Wu
Zonghang Wu
GLGuanyu Li
Guanyu Li
Bo NingBo Ning
Bo Ning

23 October 2023 in Remote Sensing
Verified
Journal Article
Open access
PDF file
XZXIN ZHOU
XIN ZHOU
KTKun Tian
Kun Tian
ZZZihan Zhou
Zihan Zhou
Bo NingBo Ning
Bo Ning
Yanhao WangYanhao Wang
Yanhao Wang
Sonar images are inherently affected by speckle noise, which degrades image quality and hinders image exploitation. Despeckling is an important pre-processing task that aims to remove such noise so as to improve the accuracy of analysis tasks on sonar images. In this paper, we propose a novel transformer-based generative adversarial network named SID-TGAN for sonar image despeckling. In the SID-TGAN framework, transformer and convolutional blocks are used to extract global and local features, which are further integrated into the generator and discriminator networks for feature fusion and enhancement. By leveraging adversarial training, SID-TGAN learns more comprehensive representations of sonar images and shows outstanding performance in speckle denoising. Meanwhile, SID-TGAN introduces a new adversarial loss function that combines image content, local texture style, and global similarity to reduce image distortion and information loss during training. Finally, we compare SID-TGAN with state-of-the-art despeckling methods on one image dataset with synthetic optical noise and four real sonar image datasets. The results show that it achieves significantly better despeckling performance than existing methods on all five datasets.

24 April 2023 in Data Science and Engineering
Verified
Journal Article
Open access
PDF file
Bo NingBo Ning
Bo Ning
DZDeji Zhao
Deji Zhao
XZXinjian Zhang
Xinjian Zhang
CWChao Wang
Chao Wang
SSShuangyong Song
Shuangyong Song
Hierarchical Text Classification (HTC) is a formidable task which involves classifying textual descriptions into a taxonomic hierarchy. Existing methods, however, have difficulty in adequately modeling the hierarchical label structures, because they tend to focus on employing graph embedding methods to encode the hierarchical structure while disregarding the fact that the HTC labels are rooted in a tree structure. This is significant because, unlike a graph, the tree structure inherently has a directive that ordains information flow from one node to another—a critical factor when applying graph embedding to the HTC task. But in the graph structure, message-passing is undirected, which will lead to the imbalance of message transmission between nodes when applied to HTC. To this end, we propose a unidirectional message-passing multi-label generation model for HTC, referred to as UMP-MG. Instead of viewing HTC as a classification problem as previous methods have done, this novel approach conceptualizes it as a sequence generation task, introducing prior hierarchical information during the decoding process. This further enables the blocking of information flow in one direction to ensure that the graph embedding method is better suited for the HTC task and thus resulted in the enhanced tree structure representation. Results obtained through experimentation on both the public WOS dataset and an E-commerce user intent classification dataset demonstrate that our proposed model can achieve superlative results.