Peng Wu

Dr. Peng Wu


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
24 April 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
PWPeng Wu
Peng Wu
ZLZhi Li
Zhi Li
TYTao Yan
Tao Yan
YLYingchun Li
Yingchun Li
With the rapid development of high-performance computing and parallel computing technology, by virtue of its cost-effectiveness, strong scalability, and easy programming, the multiprocessor system has gradually become the mainstream computing platform. Meanwhile, a growing number of researchers pay attention to the performance of multiprocessor systems, especially the task scheduling problem, which has an important impact on the system performance. Most of the current research works on task scheduling algorithms are based on the homogeneous computing environment. On the contrary, research works focusing on more complex performance asymmetric multiprocessor environments still remain rare. In this paper, we compare the effects of three earliest deadline first algorithms under different processor allocation strategies on performance asymmetric multiprocessors. We propose an efficient schedulability analysis for an allocation strategy that assigns high-priority tasks to the slowest idle processor. Experimental results show that the strategy of allocating processors with optimum speeds for high-priority tasks can schedule more task sets than the other two allocation strategies. The strategy that prioritizes the slowest processors for high-priority tasks has the smallest number of task migrations, and the strategy has the highest effective processor utilization.

7 September 2023 in Axioms
Verified
Journal Article
Open access
PDF file
YLYingchun Li
Yingchun Li
ZZZhengjie Zhou
Zhengjie Zhou
CCCheng Chen
Cheng Chen
PWPeng Wu
Peng Wu
ZZZhiquan Zhou
Zhiquan Zhou
In this paper, a modified high-efficiency Convolutional Neural Network (CNN) with a novel Supervised Contrastive Learning (SCL) approach is introduced to estimate direction-of-arrival (DOA) of multiple targets in low signal-to-noise ratio (SNR) regimes with uniform linear arrays (ULA). The model is trained using an on-grid setting, and thus the problem is modeled as a multi-label classification task. Simulation results demonstrate the robustness of the proposed approach in scenarios with low SNR and a small number of snapshots. Notably, the method exhibits strong capability in detecting the number of sources while estimating their DOAs. Furthermore, compared to traditional CNN methods, our refined efficient CNN significantly reduces the number of parameters by a factor of sixteen while still achieving comparable results. The effectiveness of the proposed method is analyzed through the visualization of latent space and through the advanced theory of feature learning.

31 December 2025 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
TYTao Yan
Tao Yan
YWYingying Wang
Yingying Wang
YQYuhua Qian
Yuhua Qian
JZJiangfeng Zhang
Jiangfeng Zhang
FLFeijiang Li
Feijiang Li
XGxiaoying guo
xiaoying guo
Microscopic 3D shape reconstruction using depth from focus (DFF) is crucial in precision manufacturing for 3D modeling and quality control. However, the absence of high-precision microscopic DFF datasets and the significant differences between existing DFF datasets and microscopic DFF data in optical design, imaging principles and scene characteristics hinder the performance of current DFF models in microscopic tasks. To address this, we introduce M3D, a novel microscopic DFF dataset, constructed using a self-developed microscopic device. It includes multi-focus image sequences of 1,952 scenes across five categories, with depth labels obtained through the 3D TFT algorithm applied to dense image sequences for initial depth estimation and calibration. All labels are then compared and analyzed against the design values, and those with large errors are eliminated. We also propose M3DNet, a frequency-aware end-to-end network, to tackle challenges like shallow depth-of-field (DoF) and weak textures. Results show that M3D compensates for the limitations of macroscopic DFF datasets and extends DFF applications to microscopic scenarios. M3DNet effectively captures rapid focus decay and improves performance on public DFF datasets by leveraging superior global feature extraction. Additionally, it exhibits strong robustness even in extreme conditions. Dataset and code are available at https://github.com/jiangfeng-Z/M3D.

22 January 2024 in Electronics Letters
Verified
Journal Article
Open access
PWPeng Wu
Peng Wu
CHChengzhuo Han
Chengzhuo Han
TYTao Yan
Tao Yan
LCLu Chen
Lu Chen
YLYingchun Li
Yingchun Li
To improve the performance of real‐time systems, heterogeneous asymmetric multiprocessors are proposed. Heterogeneous asymmetric multiprocessor architecture allows the system to better match computational resources to meet the needs and dynamic workload of each application. The benefits of system performance and reduced power consumption cannot be fully exploited unless proper task scheduling and task allocation methods are implemented at the operating system level.The EDZL scheduling algorithm has been shown to be a better scheduling algorithm in heterogeneous multiprocessor platforms. In this paper, the BSF‐EDZL (best speed fit for earliest deadline first until zero‐laxity) performance asymmetric multiprocessor scheduling algorithm is proposed, and an effective schedulability analysis is performed. The algorithm selects an appropriate processor for non‐zero relaxation highest priority task rather than the fastest processor when assigning tasks. Experimental results show that the proposed BSF‐EDZL scheduling algorithm can schedule a larger set of tasks than the ordinary EDZL scheduling algorithm.

7 August 2025 in IEEE Transactions on Cognitive and Developmental Systems
Verified
Journal Article
Closed access
LCLu Chen
Lu Chen
ZLZhuomao Li
Zhuomao Li
JYJing Yang
Jing Yang
ZLZhenyu Lu
Zhenyu Lu
PWPeng Wu
Peng Wu
Tianhua ChenTianhua Chen
Tianhua Chen
Detecting feasible graspable positions on object is crucial for robotic grasping. Existing methods generally evaluate grasp detection by comparing predicted grasps with limited ground truth data. However, since the labeled ground truth grasps are not exhaustive, this strategy lacks comprehensiveness of grasping features and may miss some feasible grasps. To solve this problem, we enhance grasp representation from isolated rectangles to consistent paths on objects, represented by single or multiple line segments, in this work. A novel grasp detection model is also proposed to predict feasible graspable regions by offering more varied selections, where multi-dimensional attention mechanism is integrated to highlight grasping-specific features. This facilitates automatic search of optimal grasp rectangles from numerous grasp regions as per the physical size of gripper and task-specific requirements. A Grasp Path Dataset using grasp paths to reveal the spatial distribution of viable grasps is constructed for the first time and experimental results taken on benchmark datasets as well as real-world scenarios demonstrate that the proposed grasp path representation can enhance detection accuracy in public datasets and success rates in practical robotic grasping tasks, providing a richer set of grasp candidates.

10 July 2026
Verified
Conference Paper
Open access
JZJianhao Zhu
Jianhao Zhu
YLYunhui Liang
Yunhui Liang
YCYan Chen
Yan Chen
PWPeng Wu
Peng Wu
CWChao Wen
Chao Wen
LDLiang Du
Liang Du