Qidi Wu

Qidi Wu

Auto-generated profile, based on publicly available information

Qidi Wu

Guangzhou Garrison Eight Banners Education Research

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

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

Representative Publications

View All Publications
13 July 1998
Verified
Conference Paper
Open access
GHGary Hunter
Gary Hunter
PNPhilip Neudeck
Philip Neudeck
LCLiangyu Chen
Liangyu Chen
DMDarby Makel
Darby Makel
CLC. Liu
C. Liu
DKD. Knight
D. Knight

27 September 2018 in Mobile Networks and Applications
Verified
Journal Article
Closed access
PDF file
Yun LinYun Lin
Yun Lin
SWSen Wang
Sen Wang
QWQidi Wu
Qidi Wu
Lei ChenLei Chen
Lei Chen

24 May 2016 in Electric Power Components and Systems
Verified
Journal Article
Closed access
YHYantai Huang
Yantai Huang
LWLei Wang
Lei Wang
Qi KangQi Kang
Qi Kang
QWQidi Wu
Qidi Wu
This article describes a method for establishing an appliance scheduling scheme that can optimally coordinate a group of appliances in a consumer's premises. Finite-horizon scheduling optimizations are formulated to schedule the operation of appliances using a modeled predictive control method that incorporates both forecasts and newly updated information. A complex mixed discrete-continuous non-linear model is here in established, and a novel algorithm that hybridizes particle swarm optimization and constraint handing methods is proposed to derive optimum solutions within a limited computational time. Simulation results showed that the proposed algorithm can efficiently resolve real-life instances and can be embedded in resource limited devices.

5 March 2020 in IEEE Access
Verified
Journal Article
Open access
ALAo Li
Ao Li
YDYu Ding
Yu Ding
DCDeyun Chen
Deyun Chen
GSGuanglu Sun
Guanglu Sun
HJHailong Jiang
Hailong Jiang
QWQidi Wu
Qidi Wu
The cross-view multimedia are widely existed and attract many attentions in recent years. Nevertheless, it is noted that the phenomenon, that data in different classes from same view are more similar than that in same class from different views, is usually presented for cross-view multimedia data. The intrinsic imperfection leads disappointing performance for cross-view multimedia recognition or classification. To solve this problem, in this paper, we propose a novel discriminative learning framework with low-rank constraint, which can be applied for view-invariant low-dimensional subspace learning. The advantages of our framework include three aspects. Firstly, to unlock the latent class structure and view structure, a self-expressed model by dual low-rank constraints are presented, which can separate the two manifold structures in the learned subspace. Secondly, two effective discriminative graphs are constructed to guide the affinity relationship of data in the above two low-dimensional projected subspaces respectively. Finally, the joint semantic consensus constraint is designed to be integrated into the learning framework, which can explore the shared and view-specific information for enforcing the view-invariant character in semantic space. Experimental results on several public cross-view multimedia datasets demonstrate that our proposed method outperforms existing excellent subspace learning approaches.

19 March 2022 in Mobile Networks and Applications
Verified
Journal Article
Closed access
PDF file
ZCZhuoran Cai
Zhuoran Cai
YLYuqian Li
Yuqian Li
QWQidi Wu
Qidi Wu

6 April 2021 in IEEE Access
Verified
Journal Article
Open access
JCJinyong Chen
Jinyong Chen
QWQidi Wu
Qidi Wu
KSKang Sun
Kang Sun
Hyperspectral imagery(HSI) clustering aims to assign pixel-wise data with large amount of spectral bands into different groups, where each group indicates one of land-cover objects existed in HSI. Without available label information in clustering task, the clustering performance heavily depends on the reliability of unsupervised feature learned from HSI. Nevertheless,when HSI data are corrupted with noise,the conventional feature learning methods often failed. To address this problem, in this paper, a dual graph-based robust unsupervised feature extraction framework for HSI is proposed to realize reliable clustering. Firstly, low-rank reconstruction and projected learning are incorporated into the proposed framework to improve the data quality and obtain their robust structures. Then, a novel learning schemes is designed to learn two reliable graphs from the above robust structures respectively. We show that the scheme can reveals the latent similarity relationships while removing the noise influence. Meanwhile, the two reliable graphs are also integrated into a comprehensive graph with consistent constraint. At last, a joint learning framework is proposed, in which the data quality improvement, reliable graphs and consistent graph are learned iteratively to benefit from each other. After that, the normalized cut technique is applied to the learned consistent graph to obtain the final unsupervised feature. Several experiments are conducted on the two public HIS datasets to show advantage of our proposed method against the existing methods.