Lenan Wu

Lenan Wu

Auto-generated profile, based on publicly available information

Lenan Wu

School of Information Science and Engineering, Southeast University, Nanjing 210096, China

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
4 September 2018 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
FMFan Meng
Fan Meng
Peng ChenPeng Chen
Peng Chen
LWLenan Wu
Lenan Wu
Xianbin WangXianbin Wang
Xianbin Wang
Automatic modulation classification (AMC), which plays critical roles in both civilian and military applications, is investigated in this paper through a deep learning approach. Conventional AMCs can be categorized into maximum likelihood (ML)-based (ML-AMC) and feature-based AMC. However, the practical deployment of ML-AMCs is difficult due to its high computational complexity, and the manually extracted features require expert knowledge. Therefore, an end-to-end convolution neural network (CNN)-based AMC (CNN-AMC) is proposed, which automatically extracts features from the long symbol-rate observation sequence along with the estimated signal-to-noise ratio (SNR). With CNN-AMC, a unit classifier is adopted to accommodate the varying input dimensions. The direct training of CNN-AMC is challenging with complicated model and complex tasks, so a novel two-step training is proposed, and the transfer learning is also introduced to improve the efficiency of retraining. Different digital modulation schemes have been considered in distinct scenarios, and the simulation results show that the CNNAMC can outperform the feature-based method, and obtain a closer approximation to the optimal ML-AMC. Besides, CNNAMCs have the certain robustness to estimation error on carrier phase offset and SNR. With parallel computation, the deep learning-based approach is about 40 to 1700 times faster than the ML-AMC regarding inference speed.

13 September 2012 in Sensors
Verified
Journal Article
Open access
PDF file
Yudong ZhangYudong Zhang
Yudong Zhang
LWLenan Wu
Lenan Wu
Automatic classification of fruits via computer vision is still a complicated task due to the various properties of numerous types of fruits. We propose a novel classification method based on a multi-class kernel support vector machine (kSVM) with the desirable goal of accurate and fast classification of fruits. First, fruit images were acquired by a digital camera, and then the background of each image was removed by a split-and-merge algorithm; Second, the color histogram, texture and shape features of each fruit image were extracted to compose a feature space; Third, principal component analysis (PCA) was used to reduce the dimensions of feature space; Finally, three kinds of multi-class SVMs were constructed, i.e., Winner-Takes-All SVM, Max-Wins-Voting SVM, and Directed Acyclic Graph SVM. Meanwhile, three kinds of kernels were chosen, i.e., linear kernel, Homogeneous Polynomial kernel, and Gaussian Radial Basis kernel; finally, the SVMs were trained using 5-fold stratified cross validation with the reduced feature vectors as input. The experimental results demonstrated that the Max-Wins-Voting SVM with Gaussian Radial Basis kernel achieves the best classification accuracy of 88.2%. For computation time, the Directed Acyclic Graph SVMs performs swiftest.

13 April 2011 in Entropy
Verified
Journal Article
Open access
PDF file
Yudong ZhangYudong Zhang
Yudong Zhang
LWLenan Wu
Lenan Wu
This paper proposes a global multi-level thresholding method for image segmentation. As a criterion for this, the traditional method uses the Shannon entropy, originated from information theory, considering the gray level image histogram as a probability distribution, while we applied the Tsallis entropy as a general information theory entropy formalism. For the algorithm, we used the artificial bee colony approach since execution of an exhaustive algorithm would be too time-consuming. The experiments demonstrate that: 1) the Tsallis entropy is superior to traditional maximum entropy thresholding, maximum between class variance thresholding, and minimum cross entropy thresholding; 2) the artificial bee colony is more rapid than either genetic algorithm or particle swarm optimization. Therefore, our approach is effective and rapid.

28 February 2021 in Sensors
Verified
Journal Article
Open access
PDF file
Shuran ShengShuran Sheng
Shuran Sheng
Peng ChenPeng Chen
Peng Chen
CZChen Zhimin
Chen Zhimin
LWLenan Wu
Lenan Wu
YYYuxuan Yao
Yuxuan Yao
Edge computing (EC) has recently emerged as a promising paradigm that supports resource-hungry Internet of Things (IoT) applications with low latency services at the network edge. However, the limited capacity of computing resources at the edge server poses great challenges for scheduling application tasks. In this paper, a task scheduling problem is studied in the EC scenario, and multiple tasks are scheduled to virtual machines (VMs) configured at the edge server by maximizing the long-term task satisfaction degree (LTSD). The problem is formulated as a Markov decision process (MDP) for which the state, action, state transition, and reward are designed. We leverage deep reinforcement learning (DRL) to solve both time scheduling (i.e., the task execution order) and resource allocation (i.e., which VM the task is assigned to), considering the diversity of the tasks and the heterogeneity of available resources. A policy-based REINFORCE algorithm is proposed for the task scheduling problem, and a fully-connected neural network (FCN) is utilized to extract the features. Simulation results show that the proposed DRL-based task scheduling algorithm outperforms the existing methods in the literature in terms of the average task satisfaction degree and success ratio.

7 September 2010 in Science China Information Sciences
Verified
Journal Article
Closed access
PDF file
Yudong ZhangYudong Zhang
Yudong Zhang
LWLeNan Wu
LeNan Wu
Shuihua WangShuihua Wang
Shuihua Wang
GWGeng Wei
Geng Wei

25 November 2008 in Sensors
Verified
Journal Article
Open access
PDF file
Yudong ZhangYudong Zhang
Yudong Zhang
LWLeNan Wu
LeNan Wu
In this paper a novel feature extraction method for image processing via PCNN and Tsallis entropy is presented. We describe the mathematical model of the PCNN and the basic concept of Tsallis entropy in order to find a recognition method for isolated objects. Experiments show that the novel feature is translation and scale independent, while rotation independence is a bit weak at diagonal angles of 45° and 135°. Parameters of the application on face recognition are acquired by bacterial chemotaxis optimization (BCO), and the highest classification rate is 72.5%, which demonstrates its acceptable performance and potential value.