Huang Tianyu

Dr. Huang Tianyu

orcid

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
3 June 2019 in Symmetry
Verified
Journal Article
Open access
PDF file
ZWZhang Wenyuan
Zhang Wenyuan
XGXIjuan Guo
XIjuan Guo
HTHuang Tianyu
Huang Tianyu
JLJiale Liu
Jiale Liu
JCJun Chen
Jun Chen
The spatial constrained Fuzzy C-means clustering (FCM) is an effective algorithm for image segmentation. Its background information improves the insensitivity to noise to some extent. In addition, the membership degree of Euclidean distance is not suitable for revealing the non-Euclidean structure of input data, since it still lacks enough robustness to noise and outliers. In order to overcome the problem above, this paper proposes a new kernel-based algorithm based on the Kernel-induced Distance Measure, which we call it Kernel-based Robust Bias-correction Fuzzy Weighted C-ordered-means Clustering Algorithm (KBFWCM). In the construction of the objective function, KBFWCM algorithm comprehensively takes into account that the spatial constrained FCM clustering algorithm is insensitive to image noise and involves a highly intensive computation. Aiming at the insensitivity of spatial constrained FCM clustering algorithm to noise and its image detail processing, the KBFWCM algorithm proposes a comprehensive algorithm combining fuzzy local similarity measures (space and grayscale) and the typicality of data attributes. Aiming at the poor robustness of the original algorithm to noise and outliers and its highly intensive computation, a Kernel-based clustering method that includes a class of robust non-Euclidean distance measures is proposed in this paper. The experimental results show that the KBFWCM algorithm has a stronger denoising and robust effect on noise image.

7 August 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
MHMingxiang Hao
Mingxiang Hao
XSXiaochuan Sun
Xiaochuan Sun
YLYingqi Li
Yingqi Li
HTHuang Tianyu
Huang Tianyu
Cellular network traffic analysis can facilitate automated decision-making as a key enabler in the future of intelligent communication systems. The existing methods mainly devote to the temporal or spatial feature acquisitions of network traffic. However, it is difficult to effectively capture the corresponding multidimensional tendency behavior. To tackle this issue, this paper utilizes ordinal pattern translation networks (OPTN) to simulate the temporal and spatio-temporal trend characteristics of cellular network traffic, aiming to capture multidimensional latent features at both the series and image levels of cellular traffic. Overall, we have proposed an analytical framework comprising trend visualization and OPTN measures. First, the original traffic is modeled as a complex network for trend feature visualization via the ordinal pattern (OP) encoding, OP translation and OPTN generation. Furthermore, we suggest that some graph theoretic metrics quantify the trend features and complexity of cellular traffic and define a trend correlation (TC) metric to obtain conclusions on traffic similarity. The comprehensive analysis and discussion indicate that this OPTN spatio-temporal traffic analysis effectively simulates the complexity, predictability, and correlation of traffic. Additionally, the traffic prediction demonstration based on OPTN feature support achieved a 33.79% improvement in prediction performance compared to the baseline model. These findings underscore the potential of OPTN analysis in enhancing communication automation, including fault detection, predictability assessment, and predictive modeling guidance.

1 January 2019 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
WZWenyuan Zhang
Wenyuan Zhang
HTHuang Tianyu
Huang Tianyu
JCJun Chen
Jun Chen
This paper proposes a modified fuzzy C‐means (FCM) algorithm, which combines the local spatial information and the typicality of pixel data in a new fuzzy way. This new algorithm is called bias‐correction fuzzy weighted C‐ordered‐means (BFWCOM) clustering algorithm. It can overcome the shortcomings of the existing FCM algorithm and improve clustering performance. The primary task of BFWCOM is the use of fuzzy local similarity measures (space and grayscale). Meanwhile, this new algorithm adds a typical analysis of data attributes to membership, in order to ensure noise insensitivity and the preservation of image details. Secondly, the local convergence of the proposed algorithm is mathematically proved, providing a theoretical preparation for fuzzy classification. Finally, data classification and real image experiments show the effectiveness of BFWCOM clustering algorithm, having a strong denoising and robust effect on noise images.

16 June 2025 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
XSXiaochuan Sun
Xiaochuan Sun
CWChangcheng Wu
Changcheng Wu
YLYingqi Li
Yingqi Li
HTHuang Tianyu
Huang Tianyu
JYJike Yu
Jike Yu
HZHaijun Zhang
Haijun Zhang
Automatic modulation recognition (AMR) is critical for enhancing communication system performance and spectrum utilization in complex environments. However, existing deep learning-based AMR methods face significant challenges under the low signal-to-noise ratio (LSNR) condition, where noise interference severely distorts modulation characteristics, reducing recognition accuracy. To address this issue, multi-stage feature extraction network (MFENet) is proposed, an interference-tolerant AMR model designed to improve LSNR performance. MFENet integrates Fast Fourier Transform and convolutional filters in the Modulation Signal Preprocessing (MSP) module to enhance spectral features. The Multi-stage Feature Extraction (MFE) module, incorporating multi-scale sandglass, feature extraction stem, and Res2-Attention Block, enables deep cross-scale feature fusion and extraction. Finally, the AMR classifier refines these features using channel attention and a multilayer perceptron. Experimental results on the RML2016.10a and RML2016.10b datasets demonstrate that MFENet significantly outperforms state-of-the-art models in recognition accuracy, especially under the LSNR condition.

6 April 2019 in Symmetry
Verified
Journal Article
Open access
PDF file
HTHuang Tianyu
Huang Tianyu
XGXIjuan Guo
XIjuan Guo
YZYue Zhang
Yue Zhang
Zheng ChangZheng Chang
Zheng Chang
Vehicle collaborative content downloading has become a hotspot in current vehicular ad-hoc network (VANET) research. However, in reality, the highly dynamic nature of VANET makes users lose resources easily, and the transmission of invalid segment data also wastes valuable bandwidth and storage of the users’ vehicles. In addition, the individual need of each customer vehicle should also be taken into consideration when selecting an agent vehicle for downloading. In this paper, a novel scheme is proposed for vehicle selection in the download of cooperative content from the Internet, by considering the basic evaluation information of the vehicle. To maximize the overall throughput of the system, a collaborative content downloading algorithm is proposed, which is based on fuzzy evaluation and a customer’s own expectations, in order to solve the problems of agent vehicle selection. With the premise of ensuring successful downloading and the selection preferences of customer vehicles, linear programming is used to optimize the distribution of agent vehicles and maximize customer’s satisfaction. Simulation results show that the proposed scheme works well in terms of average quality of service, average bandwidth efficiency, failure frequency, and average consumption.

1 January 2026 in Engineering Research Express
Verified
Journal Article
Closed access
MZMengrun Zhang
Mengrun Zhang
HTHuang Tianyu
Huang Tianyu
WCWeibin Chen
Weibin Chen
XSXiaochuan Sun
Xiaochuan Sun
XXXuelei Xi
Xuelei Xi
Accurate segmentation of colorectal polyps is essential for the early detection and prevention of colorectal cancer, as it directly influences the accuracy of risk assessment, treatment planning, and long-term patient outcomes. Federated learning (FL) provides a privacy-preserving approach to polyp segmentation. However, most existing methods rely on aggregation mechanisms that average the weights across clients, which fail to account for the non-independent and identically distributed (non-IID) data from different clients or the dynamic nature of clinical applications. This paper presents an Adaptive Weight Aggregation Federated Learning Framework (FedDW) for polyp segmentation tasks. Specifically, we first propose a medical value evaluation method based on fuzzy membership mapping, which achieves fair quantification of the contribution differences of different medical institutions through normalization of multidimensional indicators and the application of membership function mapping. Subsequently, we design a clinically-driven dual-path weight fusion mechanism based on real-time contribution membership degrees, which switches between client collaboration and lesion optimization strategies according to clinical needs, ensuring better adaptability to varying clinical scenarios. Finally, we develop a dynamic federated collaborative optimization strategy for global model aggregation, which fairly quantifies the clinical value of local model updates to dynamically generate server-side aggregation weights. It strengthens updates from high-quality clients while suppressing interference from low-quality clients, achieving coordination between the personalization of local models and the enhancement of global model performance. Experimental results demonstrate that the proposed framework significantly outperforms comparative methods in both segmentation accuracy and institutional consistency on polyp datasets, achieving a 2.19% higher Intersection over Union (IoU), a 2.04 mm lower Average Symmetric Surface Distance (ASSD), and a one-point reduction in the standard deviation of IoU compared to baseline approaches.