Zhibin ZHAO

Zhibin ZHAO


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
22 September 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
YRYougui Ren
Yougui Ren
ZZZhibin ZHAO
Zhibin ZHAO
JJJunjian Jiang
Junjian Jiang
YJYuning Jiao
Yuning Jiao
YYYining Yang
Yining Yang
GYGe Yu
Ge Yu
With the rapid development of remote sensing image data, the efficient retrieval of target images of interest has become an important issue in various applications including computer vision and remote sensing. This research addressed the low-accuracy problem in traditional content-based image retrieval algorithms, which largely rely on comparing entire image features without capturing sufficient semantic information. We proposed a scene graph similarity-based remote sensing image retrieval algorithm. Firstly, a one-shot object detection algorithm was designed for remote sensing images based on Siamese networks and tailored to the objects of an unknown class in the query image. Secondly, a scene graph construction algorithm was developed, based on the objects and their attributes and spatial relationships. Several construction strategies were designed based on different relationships, including full connections, random connections, nearest connections, star connections, or ring connections. Thirdly, by making full use of edge features for scene graph feature extraction, a graph feature extraction network was established based on edge features. Fourthly, a neural tensor network-based similarity calculation algorithm was designed for graph feature vectors to obtain image retrieval results. Fifthly, a dataset named remote sensing images with scene graphs (RSSG) was built for testing, which contained 929 remote sensing images with their corresponding scene graphs generated by the developed construction strategies. Finally, through performance comparison experiments with remote sensing image retrieval algorithms AMFMN, MiLaN, and AHCL, in precision rates, Precision@1 improved by 10%, 7.2%, and 5.2%, Precision@5 improved by 3%, 5%, and 1.7%; and Precision@10 improved by 1.7%, 3%, and 0.6%. In recall rates, Recall@1 improved by 2.5%, 4.3%, and 1.3%; Recall@5 improved by 3.7%, 6.2%, and 2.1%; and Recall@10 improved by 4.4%, 7.7% and 1.6%.

31 August 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
YRYougui Ren
Yougui Ren
JLJialu Li
Jialu Li
YBYubin Bao
Yubin Bao
ZZZhibin ZHAO
Zhibin ZHAO
GYGe Yu
Ge Yu
In order to address the challenge of the small-scale, small-target, and complex scenes often encountered in offshore remote sensing image datasets, this paper employs an interpolation method to achieve super-resolution-assisted target detection. This approach aligns with the logic of popular GANs and generative diffusion networks in terms of super-resolution but is more lightweight. Additionally, the image count is expanded fivefold by supplementing the dataset with DOTA and data augmentation techniques. Framework-wise, based on the Faster R-CNN model, the combination of a residual backbone network and pyramid balancing structure enables our model to adapt to the characteristics of small-target scenarios. Moreover, the attention mechanism, random anchor re-selection strategy, and the strategy of replacing quantization operations with bilinear interpolation further enhance the model’s detection capability at a low cost. Ablation experiments and comparative experiments show that, with a simple backbone, the algorithm in this paper achieves a mAP of 71.2% on the dataset, an improvement in accuracy of about 10% compared to the Faster R-CNN algorithm.

1 June 2006
Verified
Conference Paper
Closed access
ZZZhibin ZHAO
Zhibin ZHAO
LYLan Yao
Lan Yao
BLBinyang Li
Binyang Li
XYXiaochun Yang
Xiaochun Yang
GYGe Yu
Ge Yu
This paper presents an efficient approach for top-k query processing in wireless sensor networks (WSN) called FaVN-K. Our approach is similar to the FILA proposed by Wu et al. in that each sensor node is assigned with a value range called filter. What is different is that in FaVN-K virtual node is introduced to solve the problem of overlapping ranges. FaVN-K can achieve exact top-k result if all the nodes follow the filtering rules strictly. The experimental results show that FaVN-K can reduce transmission volume dramatically, which is especially important to WSN