Wenqun Tan

Wenqun Tan

Auto-generated profile, based on publicly available information

Wenqun Tan

Jiangxi Province Key Laboratory of Water Information Cooperative Sensing and Intelligent Processing, Nanchang, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
13 June 2019 in Mobile Information Systems
Verified
Journal Article
Open access
XBXuecai Bao
Xuecai Bao
LHLongzhe Han
Longzhe Han
XHXun He
Xun He
WTWenqun Tan
Wenqun Tan
TFTanghuai Fan
Tanghuai Fan
Improving the quality of monitoring and guaranteeing target coverage and connectivity in energy harvesting wireless sensor networks (EH-WSNs) are important issues in near-perpetual environmental monitoring. Existing solutions only focus on the utility of coverage or energy efficient coverage by considering target connectivity for battery-powered WSNs. This paper focuses on optimizing the maximum monitoring frequency with guaranteed target coverage and connectivity in EH-WSNs. We first analyzed the factors affecting monitoring quality and the energy harvesting model. Thereafter, we presented the problem formulation and proposed the algorithm for maximizing monitoring frequency and guaranteeing target coverage and connectivity (MFTCC) that is based on graph theory. Furthermore, we presented the corresponding distributed implementation approach. On the basis of the existing energy harvesting prediction model, expensive simulations show that the proposed MFTCC algorithm achieves high average maximum monitoring frequency and energy usage ratio. Moreover, it obtains a higher throughput than existing target monitoring methods.

4 November 2019 in Remote Sensing Letters
Verified
Journal Article
Closed access
TPTianliang Peng
Tianliang Peng
WTWenqun Tan
Wenqun Tan
Hyperspectral unmixing (HU) has drawn remarkable attention because it can decompose mixed pixels into a set of endmembers and abundance fractions. And the nonnegative matrix factorization (NMF) algorithm has been widely used for solving hyperspectral spectral unmixing problem. This letter proposes a Hessian graph regularized NMF (HGNMF) algorithm, which relies upon the construction of a Hessian graph representation, to solve the hyperspectral unmixing problem. According to the HGNMF algorithm, the smoothness in the estimated abundance maps is well promoted. Moreover, the optimized problem of HGNMF algorithm is also solved by employing the multiplicative updating rules. Compared to other algorithms, the proposed HGNMF algorithm demonstrates lots of advantages based on the simulated results of the synthetic data and real data sets.