Yawei Li
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
Research Subjects
Yawei Li has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Hong Zhang
School of Astronautics, Beihang University, Beijing 100191, China
5 shared publications - Ding Yuan
Beihang University, Beijing, China
4 shared publications - Yifan Yang
Beihang University, Beijing, China
2 shared publications - Yujie Wu
Image Processing Centre, Beihang University, Beijing, China
2 shared publications Chen Hao
1 shared publication- Chenwei Deng
School of Information and Electronics, Beijing Institute of Technology, Beijing, China
1 shared publication
Latest Publications
- Open Access
- 30 May 2026
- Published by MDPI AG in Remote Sensing
- Vol. 18 (11) , 1753
Mask-Guided Feature Routing and Adaptive Context Modeling for Wide-FoV UAV Object Detection in IoT Remote Sensing
Object detection in wide-field-of-view (wide-FoV) unmanned aerial vehicle (UAV) imagery for Internet of Things (IoT) remote sensing applications requires accurate recognition of tiny objects under severe background redundancy and extreme scale variation. As the field of view expands, conventional dense detectors tend to waste substantial computation on non-informative regions, while feature downsampling and static receptive fields often cause the dilution of foreground information and scale confusion. To address these issues, we propose MFRC-Det, a unified framework built upon two complementary principles: mask-guided feature routing and adaptive context modeling. Specifically, a Superpixel-Masking Generator (SP-Masker) is introduced to estimate an image-space soft foreground prior by comparing Simple Linear Iterative Clustering (SLIC) superpixel histograms with a peripheral background reference, propagating the resulting scores on a superpixel adjacency graph, and projecting the refined region-level scores back to a pixel-level routing mask. Guided by these priors, a Greedy-Cutter (G-Cutter) converts dense feature maps into compact, foreground-focused patches without repeated backbone evaluation on cropped image regions, thereby reducing redundant background computation while preserving local structural coherence. On top of the retained regions, an Adaptive Receptive-field Selection Network (ARSNet) aggregates multi-scale contextual responses from several learnable receptive-field candidate branches. ARSNet predicts spatial selection weights conditioned on the input features, allowing each location to emphasize a suitable receptive-field response for object representation. Experimental results on VisDrone-DET and UAVDT demonstrate that MFRC-Det achieves competitive detection accuracy with favorable computational efficiency. Specifically, MFRC-Det obtains 36.1% AP, 60.4% , and 38.5 FPS on VisDrone-DET and 21.3% AP, 36.8% , and 37.4 FPS on UAVDT. These results validate the effectiveness of mask-guided feature routing and adaptive context modeling for wide-FoV UAV object detection and suggest their potential value for computation-efficient aerial perception in IoT remote sensing applications.- 30 May 2026
- Published by MDPI AG in Remote Sensing
- Vol. 18 (11) , 1753
Open AccessMask-Guided Feature Routing and Adaptive Context Modeling for Wide-FoV UAV Object Detection in IoT Remote Sensing
Object detection in wide-field-of-view (wide-FoV) unmanned aerial vehicle (UAV) imagery for Internet of Things (IoT) remote sensing applications requires accurate recognition of tiny objects under severe background redundancy and extreme scale variation. As the field of view expands, conventional dense detectors tend to waste substantial computation on non-informative regions, while feature downsampling and static receptive fields often cause the dilution of foreground information and scale confusion. To address these issues, we propose MFRC-Det, a unified framework built upon two complementary principles: mask-guided feature routing and adaptive context modeling. Specifically, a Superpixel-Masking Generator (SP-Masker) is introduced to estimate an image-space soft foreground prior by comparing Simple Linear Iterative Clustering (SLIC) superpixel histograms with a peripheral background reference, propagating the resulting scores on a superpixel adjacency graph, and projecting the refined region-level scores back to a pixel-level routing mask. Guided by these priors, a Greedy-Cutter (G-Cutter) converts dense feature maps into compact, foreground-focused patches without repeated backbone evaluation on cropped image regions, thereby reducing redundant background computation while preserving local structural coherence. On top of the retained regions, an Adaptive Receptive-field Selection Network (ARSNet) aggregates multi-scale contextual responses from several learnable receptive-field candidate branches. ARSNet predicts spatial selection weights conditioned on the input features, allowing each location to emphasize a suitable receptive-field response for object representation. Experimental results on VisDrone-DET and UAVDT demonstrate that MFRC-Det achieves competitive detection accuracy with favorable computational efficiency. Specifically, MFRC-Det obtains 36.1% AP, 60.4% , and 38.5 FPS on VisDrone-DET and 21.3% AP, 36.8% , and 37.4 FPS on UAVDT. These results validate the effectiveness of mask-guided feature routing and adaptive context modeling for wide-FoV UAV object detection and suggest their potential value for computation-efficient aerial perception in IoT remote sensing applications. - Open Access
- 17 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
- Vol. 16 (19391404) , 7749-7762
UAV Tracking Based on Correlation Filters With Dynamic Aberrance-Repressed Temporal Regularizations
As a significant research direction in remote sensing fields, unmanned aerial vehicles (UAVs) tracking has achieved rapid development in recent years. However, due to limited power and computation resources on aerial platforms, the tracking methods deployed on UAVs usually require high computational efficiency and performance. In addition, various challenges (i.e., similar object, background clutter and occlusion) have inevitably occurred during the UAV tracking phase. Therefore, considering the above issues comprehensively, this paper proposes a dynamic aberrance-repressed temporal regularized correlation filter to achieve stable tracking in UAV remote sensing videos. First, we have introduced the aberrance-repressed temporal regularizations into the discriminative correlation filter (DCF) framework. Second, a novel objective loss function is constructed to adjust the strength of each regularization for training the filter. Then, a new judgment mechanism based on the response variation is exploited to reflect the response fluctuation and applied to tune parameters of both regularizations. Finally, comprehensive experiments are done on three different UAV benchmarks, i.e., UAV123@10fps, UAVDT and VisDrone2018, to verify the performance of our tracker and have demonstrated that our tracker achieves superior performance against other total 25 state-of-the-art trackers while reaching $\sim$ 35 FPS on a single CPU.
- 17 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
- Vol. 16 (19391404) , 7749-7762
Open AccessUAV Tracking Based on Correlation Filters With Dynamic Aberrance-Repressed Temporal Regularizations
As a significant research direction in remote sensing fields, unmanned aerial vehicles (UAVs) tracking has achieved rapid development in recent years. However, due to limited power and computation resources on aerial platforms, the tracking methods deployed on UAVs usually require high computational efficiency and performance. In addition, various challenges (i.e., similar object, background clutter and occlusion) have inevitably occurred during the UAV tracking phase. Therefore, considering the above issues comprehensively, this paper proposes a dynamic aberrance-repressed temporal regularized correlation filter to achieve stable tracking in UAV remote sensing videos. First, we have introduced the aberrance-repressed temporal regularizations into the discriminative correlation filter (DCF) framework. Second, a novel objective loss function is constructed to adjust the strength of each regularization for training the filter. Then, a new judgment mechanism based on the response variation is exploited to reflect the response fluctuation and applied to tune parameters of both regularizations. Finally, comprehensive experiments are done on three different UAV benchmarks, i.e., UAV123@10fps, UAVDT and VisDrone2018, to verify the performance of our tracker and have demonstrated that our tracker achieves superior performance against other total 25 state-of-the-art trackers while reaching $\sim$ 35 FPS on a single CPU.
- Open Access
- 20 July 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (14) , 8388
NTPP-MVSNet: Multi-View Stereo Network Based on Neighboring Tangent Plane Propagation
Although learning-based multi-view stereo algorithms have produced exciting results in recent years, few researchers have explored the specific role of deep sampling in the network. We posit that depth sampling accuracy more directly impacts the quality of scene reconstruction. To address this issue, we proposed NTPP-MVSNet, which utilizes normal vector and depth information from neighboring pixels to propagate tangent planes. Based on this, we obtained a more accurate depth estimate through homography transformation. We used deformable convolution to acquire continuous pixel positions on the surface and 3D-UNet to account for the regression of depth and normal vector maps without consuming additional GPU memory. Finally, we applied homography transformation to complete the mapping of the imaging plane and the neighborhood surface tangent plane to generate a depth hypothesis. Experimental trials on the DTU and Tanks and Temples datasets demonstrate the feasibility of NTPP-MVSNet, and ablation experiments confirm the superior performance of our deep sampling methodology.
- 20 July 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (14) , 8388
Open AccessNTPP-MVSNet: Multi-View Stereo Network Based on Neighboring Tangent Plane Propagation
Although learning-based multi-view stereo algorithms have produced exciting results in recent years, few researchers have explored the specific role of deep sampling in the network. We posit that depth sampling accuracy more directly impacts the quality of scene reconstruction. To address this issue, we proposed NTPP-MVSNet, which utilizes normal vector and depth information from neighboring pixels to propagate tangent planes. Based on this, we obtained a more accurate depth estimate through homography transformation. We used deformable convolution to acquire continuous pixel positions on the surface and 3D-UNet to account for the regression of depth and normal vector maps without consuming additional GPU memory. Finally, we applied homography transformation to complete the mapping of the imaging plane and the neighborhood surface tangent plane to generate a depth hypothesis. Experimental trials on the DTU and Tanks and Temples datasets demonstrate the feasibility of NTPP-MVSNet, and ablation experiments confirm the superior performance of our deep sampling methodology.
- 14 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 28 (10709908) , 1565-1569
Dynamic Scene Video Deblurring Using Robust Incremental Weighted Fourier Aggregation
Motion blur is an inevitable problem when shooting a video in motion, and it will cause serious degradation of images. In this letter, we propose a new robust incremental weighted Fourier aggregation algorithm for dynamic scene video deblurring. This is motivated by the fact that existing multiframe aggregation methods usually require a tedious iterative process to obtain sharp information in distant frames. We propose to perform alignment and aggregation once for each frame using the current frame and the previous frame result, which includes the sharp information of all the previous frames. Moreover, a criterion for evaluating the alignment of blurred images is proposed. Based on this, a robust aggregation approach is also proposed to help reduce artifacts caused by image patch alignment failure. Specifically, we decompose the current frame into a series of image patches, find consistent image patches in the deblurring results of the previous frame by a coarse-to-fine alignment algorithm, and aggregate them in the Fourier domain. Experiments show that our method can obtain improved deblurring results and reduce the computational complexity compared to the traditional aggregation method.
- 14 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 28 (10709908) , 1565-1569
Dynamic Scene Video Deblurring Using Robust Incremental Weighted Fourier Aggregation
Motion blur is an inevitable problem when shooting a video in motion, and it will cause serious degradation of images. In this letter, we propose a new robust incremental weighted Fourier aggregation algorithm for dynamic scene video deblurring. This is motivated by the fact that existing multiframe aggregation methods usually require a tedious iterative process to obtain sharp information in distant frames. We propose to perform alignment and aggregation once for each frame using the current frame and the previous frame result, which includes the sharp information of all the previous frames. Moreover, a criterion for evaluating the alignment of blurred images is proposed. Based on this, a robust aggregation approach is also proposed to help reduce artifacts caused by image patch alignment failure. Specifically, we decompose the current frame into a series of image patches, find consistent image patches in the deblurring results of the previous frame by a coarse-to-fine alignment algorithm, and aggregate them in the Fourier domain. Experiments show that our method can obtain improved deblurring results and reduce the computational complexity compared to the traditional aggregation method.
- 1 January 2021
- Published by Journal of Applied Optics in Journal of Applied Optics
- Vol. 42 (6) , 1017-1024
FPGA-based real-time atmospheric turbulence image restoration algorithm and its implementation
Due to the influence of atmospheric turbulence, the images obtained by the remote optical imaging equipment will appear serious degradation phenomena, such as geometric distortion, motion blur and defocus blur, etc. At present, the mainstream turbulence restoration algorithms usually rely on the non-rigid registration, reconstruction or finding rare lucky regions from long-term video sequences. These methods require huge calculated amount or complete video data in advance, which cannot meet the real-time requirements of actual application scenarios. Therefore, a real-time turbulence restoration algorithm that could be implemented in field programmable gate array (FPGA) was proposed. This method used the randomness of atmospheric turbulence to filter the image in the time domain through the continuous frames and solved the problem of image geometric distortion. Then, the Wiener filter in the frequency domain was converted into a convolution in the spatial domain, which was easier to implement, and solved the problem of image blur. The experimental results show that the proposed algorithm not only meets the real-time requirements, but also effectively realizes the restoration of turbulence images.
- 1 January 2021
- Published by Journal of Applied Optics in Journal of Applied Optics
- Vol. 42 (6) , 1017-1024
FPGA-based real-time atmospheric turbulence image restoration algorithm and its implementation
Due to the influence of atmospheric turbulence, the images obtained by the remote optical imaging equipment will appear serious degradation phenomena, such as geometric distortion, motion blur and defocus blur, etc. At present, the mainstream turbulence restoration algorithms usually rely on the non-rigid registration, reconstruction or finding rare lucky regions from long-term video sequences. These methods require huge calculated amount or complete video data in advance, which cannot meet the real-time requirements of actual application scenarios. Therefore, a real-time turbulence restoration algorithm that could be implemented in field programmable gate array (FPGA) was proposed. This method used the randomness of atmospheric turbulence to filter the image in the time domain through the continuous frames and solved the problem of image geometric distortion. Then, the Wiener filter in the frequency domain was converted into a convolution in the spatial domain, which was easier to implement, and solved the problem of image blur. The experimental results show that the proposed algorithm not only meets the real-time requirements, but also effectively realizes the restoration of turbulence images.
- Open Access
- 18 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 208554-208565
Video Object Detection Guided by Object Blur Evaluation
In recent years, the excellent image-based object detection algorithms are transferred to the video object detection directly. These frame-by-frame processing methods are suboptimal owing to the degenerate object appearance such as motion blur, defocus and rare poses. The existing works for video object detection mostly focus on the feature aggregation at pixel level and instance level, but the blur impact in the aggregation process has not been exploited well so far. In this paper, we propose an end-to-end blur-aid feature aggregation network (BFAN) for video object detection. The proposed BFAN focuses on the aggregation process influenced by the blur including motion blur and defocus with high accuracy and little increased computation. In BFAN, we evaluate the object blur degree of each frame as the weight for aggregation. Noteworthy, the background is usually flat which has a negative impact on the object blur degree evaluation. Therefore, we introduce a light saliency detection network to alleviate the background interference. The experiments conducted on the ImageNet VID dataset show that BFAN achieves the state-of-the-art detection performance, exactly 79.1% mAP, with 3 points improvement compared to the video object detection baseline.
- 18 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 208554-208565
Open AccessVideo Object Detection Guided by Object Blur Evaluation
In recent years, the excellent image-based object detection algorithms are transferred to the video object detection directly. These frame-by-frame processing methods are suboptimal owing to the degenerate object appearance such as motion blur, defocus and rare poses. The existing works for video object detection mostly focus on the feature aggregation at pixel level and instance level, but the blur impact in the aggregation process has not been exploited well so far. In this paper, we propose an end-to-end blur-aid feature aggregation network (BFAN) for video object detection. The proposed BFAN focuses on the aggregation process influenced by the blur including motion blur and defocus with high accuracy and little increased computation. In BFAN, we evaluate the object blur degree of each frame as the weight for aggregation. Noteworthy, the background is usually flat which has a negative impact on the object blur degree evaluation. Therefore, we introduce a light saliency detection network to alleviate the background interference. The experiments conducted on the ImageNet VID dataset show that BFAN achieves the state-of-the-art detection performance, exactly 79.1% mAP, with 3 points improvement compared to the video object detection baseline.
- Open Access
- 7 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 9185-9195
BID: An Effective Blind Image Deblurring Scheme to Estimate the Blur Kernel for Various Scenarios
In recent years, image deblurring has been widely investigated. In order to solve this ill-posed problem, a variety of prior models have been proposed successively. The two-tone prior has been successfully applied to text images deblurring and achieved significant results. However, the natural image with rich color clusters does not meet the two-tone prior, which requires only two color clusters in the image. In this paper, a local two-tone prior is proposed for images with complex color clusters, which decomposes the image with complex color clusters into patches with simple color clusters. We also find that the process of image blurring is a weighted average of pixel values, which will lead to an increase of intermediate pixel values. Therefore, a new measure of the dynamic range of the image is proposed, which indicates the difference of the color cluster using the average value of the color cluster, and it is rigorously proved in mathematics. Besides, we analyze the effectiveness of the proposed prior in image deblurring in detail. Experimental results on the widely used datasets show that the proposed method performs favorably against the state-of-the-art algorithms, both qualitatively and quantitatively.
- 7 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 9185-9195
Open AccessBID: An Effective Blind Image Deblurring Scheme to Estimate the Blur Kernel for Various Scenarios
In recent years, image deblurring has been widely investigated. In order to solve this ill-posed problem, a variety of prior models have been proposed successively. The two-tone prior has been successfully applied to text images deblurring and achieved significant results. However, the natural image with rich color clusters does not meet the two-tone prior, which requires only two color clusters in the image. In this paper, a local two-tone prior is proposed for images with complex color clusters, which decomposes the image with complex color clusters into patches with simple color clusters. We also find that the process of image blurring is a weighted average of pixel values, which will lead to an increase of intermediate pixel values. Therefore, a new measure of the dynamic range of the image is proposed, which indicates the difference of the color cluster using the average value of the color cluster, and it is rigorously proved in mathematics. Besides, we analyze the effectiveness of the proposed prior in image deblurring in detail. Experimental results on the widely used datasets show that the proposed method performs favorably against the state-of-the-art algorithms, both qualitatively and quantitatively.
- 1 August 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1583-1587
A novel algorithm for abandoned object detection
Abandoned object detection is a crucial problem in many computer vision tasks. Traditional method based on foreground/background extraction techniques leads to a high false alarm rate. In this paper, we propose a novel detection algorithm based on change detection and blob separation. Our proposed approach suits more practical scenarios in which objects located near each other. Experiments are conducted on several well-known benchmarks to validate the efficacy of the algorithm proposed in this paper.
- 1 August 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1583-1587
A novel algorithm for abandoned object detection
Abandoned object detection is a crucial problem in many computer vision tasks. Traditional method based on foreground/background extraction techniques leads to a high false alarm rate. In this paper, we propose a novel detection algorithm based on change detection and blob separation. Our proposed approach suits more practical scenarios in which objects located near each other. Experiments are conducted on several well-known benchmarks to validate the efficacy of the algorithm proposed in this paper.