Min Huang

Dr. Min Huang

orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
11 January 2024 in ACM Transactions on Multimedia Computing, Communications, and Applications
Verified
Journal Article
Open access
YZYazhou Zhang
Yazhou Zhang
YYYang Yu
Yang Yu
MWMengyao Wang
Mengyao Wang
MHMin Huang
Min Huang
MHMohammad Anwar Hossain
Mohammad Anwar Hossain
Sentiment and sarcasm are intimate and complex, as sarcasm often deliberately elicits an emotional response in order to achieve its specific purpose. Current challenges in multi-modal sentiment and sarcasm joint detection mainly include multi-modal representation fusion and the modeling of the intrinsic relationship between sentiment and sarcasm. To address these challenges, we propose a single-input stream self-adaptive representation learning model (SRLM) for sentiment and sarcasm joint recognition. Specifically, we divide the image into blocks to learn its serialized features and fuse textual feature as input to the target model. Then, we introduce an adaptive representation learning network using a gated network approach for sarcasm and sentiment classification. In this framework, each task is equipped with its dedicated expert network responsible for learning task-specific information, while the shared expert knowledge is acquired and weighted through the gating network. Finally, comprehensive experiments conducted on two publicly available datasets, namely Memotion and MUStARD, demonstrate the effectiveness of the proposed model when compared to state-of-the-art baselines. The results reveal a notable improvement on the performance of sentiment and sarcasm tasks.

7 November 2024 in Aerospace
Verified
Journal Article
Open access
PDF file
PHPujie Han
Pujie Han
WHWt H
Wt H
ZZZhengjun Zhai
Zhengjun Zhai
MHMin Huang
Min Huang
ARINC 653 Part 1 Supplement 5 (ARINC 653P1-5) provides temporal partitioning capabilities for real-time applications running on the multicore processors in Integrated Modular Avionics (IMAs) systems. However, it is difficult to schedule a set of ARINC 653 multicore partitions to achieve a minimum processor occupancy. This paper proposes a model-based optimization method for ARINC 653 multicore partition scheduling. The IMA multicore processing system is modeled as a network of timed automata in UPPAAL. A parallel genetic algorithm is employed to explore the solution space of the IMA system. Owing to a lack of priori information for the system model, the configuration of genetic operators is self-adaptively controlled by a Q-learning algorithm. During the evolution, each individual in a population is evaluated independently by compositional model checking, which verifies each partition in the IMA system and combines all the schedulability results to form a global fitness evaluation. The experiments show that our model-based method outperforms the traditional analytical methods when handling the same task loads in the ARINC 653 multicore partitions, while alleviating the state space explosion of model checking via parallelization acceleration.

18 June 2025 in Algorithms
Verified
Journal Article
Open access
PDF file
SZShizheng Zhang
Shizheng Zhang
KWKunpeng Wang Wang
Kunpeng Wang Wang
ZLZhihao Liu
Zhihao Liu
MHMin Huang
Min Huang
Sheng HuangSheng Huang
Sheng Huang
The accurate detection and classification of pavement damage are critical for ensuring timely maintenance and extending the service life of road infrastructure. In this study, we propose a novel pavement damage recognition model based on the Swin Transformer architecture, specifically designed to address the challenges inherent in pavement imagery, such as low damage visibility, varying illumination conditions, and highly similar surface textures. Unlike the original Swin Transformer, the proposed model incorporates two key components: a fine feature extraction module and a multi-head self-attention re-embedding module. These additions enhance the model’s ability to capture subtle and complex damage patterns. Experimental evaluations demonstrate that the proposed model achieves a 2.07% improvement in classification accuracy and a 0.97% increase in F1 score compared to the baseline while maintaining comparable computational complexity. Overall, the model significantly outperforms the baseline Swin Transformer in pavement damage detection and classification, highlighting its practical applicability.

3 October 2022 in Computational and Mathematical Methods in Medicine
Verified
Journal Article
Open access
PDF file
MHMin Huang
Min Huang
GRGuanyu Ren
Guanyu Ren
SZShizheng Zhang
Shizheng Zhang
QZQian Zheng
Qian Zheng
HNHuiyang Niu
Huiyang Niu
In recent years, deep learning has made successful applications and remarkable achievements in the field of medical image registration, and the method of medical image registration based on deep learning has become the current research hotspot. However, the performance of convolutional neural networks may not be fully exploited due to neglect of spatial relationships between distant locations in the image and incomplete updates of network parameters. To avoid this phenomenon, MHNet, a multiscale hierarchical deformable registration network for 3D brain MR images, was proposed in this paper. This network was an unsupervised end-to-end convolutional neural network. After training, the dense displacement vector field can be predicted almost in real-time for the unseen input image pairs, which saves a lot of time compared with the traditional algorithms of independent iterative optimization for each pair of images. On the basis of the encoder-decoder structure, this network introduced the improved Inception module for multiscale feature extraction and expanding the receptive field and the hierarchical forecast structure to promote the update of the parameters of the middle layers, which achieved the best performance on the augmented public dataset compared with the existing four excellent registration methods.

7 November 2023 in Electronics
Verified
Journal Article
Open access
PDF file
RCRui Chen
Rui Chen
KPKangning Pang
Kangning Pang
MHMin Huang
Min Huang
HLHui Liang
Hui Liang
SZShizheng Zhang
Shizheng Zhang
XKXiangjie Kong
Xiangjie Kong
With the rapid development of online social networks recently, more and more online users have participated in social network activities and rich social relationships are formed accordingly. These social relationships provide a rich data source and research basis for in-depth study on recommender systems (RSs), while also promoting the development of RSs based on social networks. To solve the problems of cold start and sparsity in RSs, many recommendation algorithms are constantly being proposed. Motivated by the availability of rich social connections in today’s RSs, a large number of recommendation techniques based on social relationships have been proposed recently, achieving good recommendation results, and have become the mainstream research direction in the field of RSs, attracting more and more researchers to engage in this research. In this study, we mainly review and summarize the social relationship-based recommendation methods and techniques in RSs, and study some recent deep social relationship recommendation methods and techniques based on deep learning (DL), including the latest social matrix factorization (MF)-based recommendation methods and graph neural network (GNN)-based recommendation methods. Finally, we discuss the potential impact that may improve the RS and future direction. In this article, we aim to introduce the recent recommendation techniques integrating social relationships to solve data sparsity and cold start, and provide a new perspective for improving the performance of RSs, thereby providing useful resources in the state-of-the-art research results for future researchers.

1 March 2025 in Data Intelligence
Verified
Journal Article
Open access
PDF file
YGYanbu Guo
Yanbu Guo
DPDenghao Pang
Denghao Pang
MHMin Huang
Min Huang
DZDongming Zhou
Dongming Zhou
Jinde CaoJinde Cao
Jinde Cao
Genomic signal prediction is a key component of computer-aided diagnosis, and it aims to obtain functional contextual patterns from raw signals. Many advanced algorithms overlook the crucial contextual interactions, limiting the applicability of genomic signals. In this work, a dual dynamic gated convolutional model is devised with interpretable pooling to conduct contextual information extraction from spatial and channel levels. The proposed model could enhance the robustness of genomic signal prediction via global expectation pooling and gated mechanisms. First, we design the novel spatial-gated and channel-gated modules to integrate spatial contextual representations of genomic signals adaptively. Second, an interpretable learning algorithm with probabilistic models is developed to capture the complex interaction patterns via an interpretable pooling. Moreover, the spatial gated module estimates essential spatial features via a dual dynamic transformation mechanism, and the channel-gated module detects the salient channel patterns via a gated normalization convolutional unit. By conducting extensive experiments, the prediction performance of our model surpasses the state-of-the-art models, which substantiates the exceptional efficacy in genomic signal prediction based on unsupervised k-mer embedding.