Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Huafei Sun

dblp:32/10590 · DBLP profile ↗
← Back
12ranked-venue papers
0as first author
3since 2021 · last 2025
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 5 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3Artificial intelligence and machine learning · 2 · 1 since 2021Computer networks · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Mathematical optimization · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization › continuous optimization › convex optimization › first-order methods › gradient-based optimization
natural gradient
0.212016
Optimal control on special Euclidean group via natural gradient algorithm · Sci. China Inf. Sci. 2016
Mathematical optimization › control theory
optimal control
0.212016
Optimal control on special Euclidean group via natural gradient algorithm · Sci. China Inf. Sci. 2016
Mathematical optimization › gradient descent
projected gradient descent
0.012013
Principal whitened gradient-projection algorithm for distribution control · Sci. China Inf. Sci. 2013

Methods — techniques the papers use, named apart from their topics

optimal control · 0.2natural gradient · 0.2principal whitened gradient-projection · 0.2
YearPublicationVenuePosition
2025 A Novel Gaussian Process Approach for Prediction of University Academic Evaluation
abstract
In the globalized academic landscape, university academic evaluation plays a crucial role. However, predicting university academic evaluation in time series prediction poses significant challenges due to its nonlinearity and nonstationarity. In this article, we propose a novel method to address the prediction problem in scenarios characterized by limited data volume. By leveraging the properties of Gaussian processes, our method constructs nonstationary kernels that are fully trainable. The time series data is decomposed into trend and seasonal components, which are then inputted into an independent Gaussian process model equipped with trainable parameters. The core of our method lies in the trend Gaussian process model, which consists of classical kernel functions and multilayer perceptron stacks. This combination enhances the model’s capacity to capture long-term dependencies and improves prediction accuracy. To evaluate the effectiveness of our novel method, experiments were conducted on both the M4 dataset and an academic indicator dataset. The experimental results demonstrate significant improvements in prediction accuracy and stability compared with traditional time series prediction methods. Additionally, comparative experiments were performed to contrast our method against other popular time series prediction methods, consistently affirming the superior predictive performance of our approach.
Daohua Yu, Zhendong Niu, Huafei Sun
IEEE Trans. Comput. Soc. Syst.5
2023 LDA-MIG Detectors for Maritime Targets in Nonhomogeneous Sea Clutter
abstract
This article deals with the problem of detecting maritime targets embedded in nonhomogeneous sea clutter, where the limited number of secondary data is available due to the heterogeneity of sea clutter. A class of linear discriminant analysis (LDA)-based matrix information geometry (MIG) detectors is proposed in the supervised scenario. As customary, Hermitian positive-definite (HPD) matrices are used to model the observational sample data, and the clutter covariance matrix of the received dataset is estimated as the geometric mean of the secondary HPD matrices. Given a set of training HPD matrices with class labels, which are elements of a higher dimensional HPD matrix manifold, the LDA manifold projection learns a mapping from the higher dimensional HPD matrix manifold to a lower dimensional one subject to maximum discrimination. In this study, the LDA manifold projection, with the cost function maximizing between-class distance while minimizing within-class distance, is formulated as an optimization problem in the Stiefel manifold. Four robust LDA-MIG detectors corresponding to different geometric measures are proposed. Numerical results based on both simulated radar clutter with interferences and real IPIX radar data show the advantage of the proposed LDA-MIG detectors against their counterparts without using LDA and the state-of-the-art maritime target detection methods in nonhomogeneous sea clutter.
Xiaoqiang Hua, Linyu Peng, Weijian Liu 0001, Yongqiang Cheng 0002, Hongqiang Wang 0001, Huafei Sun, Zhenghua Wang
IEEE Trans. Geosci. Remote. Sens.6
2021 Efficient Weingarten map and curvature estimation on manifolds
abstract
In this paper, we propose an efficient method to estimate the Weingarten map for point cloud data sampled from manifold embedded in Euclidean space. A statistical model is established to analyze the asymptotic property of the estimator. In particular, we show the convergence rate as the sample size tends to infinity. We verify the convergence rate through simulated data and apply the estimated Weingarten map to curvature estimation and point cloud simplification to multiple real data sets.
Yueqi Cao, Didong Li, Huafei Sun, Amir H. Assadi, Shiqiang Zhang
Mach. Learn.3
2020 Application of gradient descent algorithms based on geodesic distances
Xiaomin Duan, Huafei Sun, Linyu Peng
Sci. China Inf. Sci.2
2018 MU-MIMO Communications With MIMO Radar: From Co-Existence to Joint Transmission
abstract
Beamforming techniques are proposed for a joint multi-input-multi-output (MIMO) radar-communication (RadCom) system, where a single device acts as radar and a communication base station (BS) by simultaneously communicating with downlink users and detecting radar targets. Two operational options are considered, where we first split the antennas into two groups, one for radar and the other for communication. Under this deployment, the radar signal is designed to fall into the null-space of the downlink channel. The communication beamformer is optimized such that the beampattern obtained matches the radar's beampattern while satisfying the communication performance requirements. To reduce the optimizations' constraints, we consider a second operational option, where all the antennas transmit a joint waveform that is shared by both radar and communications. In this case, we formulate an appropriate probing beampattern, while guaranteeing the performance of the downlink communications. By incorporating the SINR constraints into objective functions as penalty terms, we further simplify the original beamforming designs to weighted optimizations, and solve them by efficient manifold algorithms. Numerical results show that the shared deployment outperforms the separated case significantly, and the proposed weighted optimizations achieve a similar performance to the original optimizations, despite their significantly lower computational complexity.
Fan Liu 0005, Christos Masouros, Ang Li 0003, Huafei Sun, Lajos Hanzo
IEEE Trans. Wirel. Commun.4
2017 An Efficient Manifold Algorithm for Constructive Interference Based Constant Envelope Precoding
abstract
In this letter, we propose a novel manifold-based algorithm to solve the constant envelope (CE) precoding problem with interference exploitation. For a given power budget, we design the precoded symbols subject to the CE constraints, such that the constructive effect of the multiuser interference is maximized. While the objective function for the original problem is not complex differentiable, we consider the smooth approximation of its real representation, and map it onto a Riemannian manifold. By using the Riemmanian conjugate gradient algorithm, a local minimizer can be efficiently found. The complexity of the algorithm is analytically derived in terms of floating-points operations (flops) per iteration. Simulations show that the proposed algorithm outperforms the conventional methods on both symbol error rate and computational complexity.
Fan Liu 0005, Christos Masouros, Pierluigi Vito Amadori, Huafei Sun
IEEE Signal Process. Lett.4
2016 A brain signals-based interface between drivers and in-vehicle devices
abstract
In this paper, we propose a novel interface between drivers and in-vehicle devices by using steady-state visual evoked potential (SSVEP) of brain signals. The SSVEP is detected by a canonical correlation analysis (CCA) classifier and applied to turn on and turn off in-vehicle devices. The proposed interface is built and tested online in a driving simulator by requiring drivers to use the interface to interact with the in-vehicle device while performing the primary driving tasks including lane keeping and obstacle avoidance. The pilot experimental results show the feasibility of the proposed interface.
Tenghuan He, Luzheng Bi, Jinling Lian, Huafei Sun
Intelligent Vehicles Symposium4
2016 Optimal control on special Euclidean group via natural gradient algorithm
Erchuan Zhang, Lin Jiu, Huafei Sun
Sci. China Inf. Sci.4
2016 Wireless sensor networks localization based on graph embedding with polynomial mapping
Huafei Sun, Yongqiang Cheng 0002
Comput. Networks2
2016 Image representation by harmonic transforms with parameters in SL(2, R)
Bing-Zhao Li 0001, Huafei Sun
J. Vis. Commun. Image Represent.3
2015 Image watermarking using polar harmonic transform with parameters in SL(2, r)
Bing-Zhao Li 0001, Huafei Sun
Signal Process. Image Commun.3
2013 Principal whitened gradient-projection algorithm for distribution control
Huafei Sun
Sci. China Inf. Sci.2