Muxin Liao

Dr. Muxin Liao

School of Computer Science and Engineering, Jiangxi Agriculture University, Jiangxi, China
orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
23 December 2019 in IEEE Access
Verified
Journal Article
Open access
YPYingqiong Peng
Yingqiong Peng
Muxin LiaoMuxin Liao
Muxin Liao
YSYuxia Song
Yuxia Song
ZLZhichao Liu
Zhichao Liu
HHHuojiao He
Huojiao He
YWYinglong Wang
Yinglong Wang

22 June 2023 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
YZYuhang Zhang
Yuhang Zhang
STShishun Tian
Shishun Tian
Muxin LiaoMuxin Liao
Muxin Liao
GHGuoguang Hua
Guoguang Hua
WZWenbin Zou
Wenbin Zou
CXChen Xu
Chen Xu
Semantic segmentation assigns a category for each pixel and has achieved great success in a supervised manner. However, it fails to generalize well in new domains due to the domain gap. Domain adaptation is a popular way to solve this issue, but it needs target data and cannot handle unavailable domains. In domain generalization (DG), the model is trained without the target data and DG aims to generalize well in new unavailable domains. Recent works reveal that shape recognition is beneficial for generalization but still lack exploration in semantic segmentation. Meanwhile, the object shapes also exist a discrepancy in different domains, which is often ignored by the existing works. Thus, we propose a Shape-Invariant Learning (SIL) framework to focus on learning shape-invariant representation for better generalization. Specifically, we first define the structural edge, which considers both the object boundary and the inner structure of the object to provide more discrimination cues. Then, a shape perception learning strategy including a texture feature discrepancy reduction loss and a structural feature discrepancy enlargement loss is proposed to enhance the shape perception ability of the model by embedding the structural edge as a shape prior. Finally, we use shape deformation augmentation to generate samples with the same content and different shapes. Essentially, our SIL framework performs implicit shape distribution alignment at the domain-level to learn shape-invariant representation. Extensive experiments show that our SIL framework achieves state-of-the-art performance.

2 February 2023 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
GHGuoguang Hua
Guoguang Hua
Muxin LiaoMuxin Liao
Muxin Liao
STShishun Tian
Shishun Tian
YZYuhang Zhang
Yuhang Zhang
WZWenbin Zou
Wenbin Zou
Multi-task learning is a successful learning framework which improves the performance of prediction models by leveraging knowledge among related tasks. Referring expression comprehension (REC) and segmentation (RES) are highly relevant tasks, which both are language-guided visual recognition tasks. However, their relations have not yet been fully exploited in previous works. In this paper, a Multiple Relational Learning Network (MRLN) is proposed for multi-task learning of REC and RES. First, a feature-feature interaction learning module is introduced to handle the complicated interactions among features. Moreover, we propose a feature-task dependence learning module, which associates the related features with target tasks. Furthermore, a task-task relationship learning module is designed, which captures the relationships among tasks automatically and guides the REC and RES fine-tuning adaptively. To verify our proposed approach, experiments are conducted on three benchmark datasets, i.e., RefCOCO, RefCOCO+, and RefCOCOg. Extensive experiments demonstrate that the multiple relationships are more appealing since it alleviates the prediction inconsistency issue in multi-task setup. In addition, the experimental results report the significant performance gains of MRLN over most existing methods, i.e., up to 83.46 % for REC and 63.62 % for RES over state-of-the-art methods, which demonstrate the validity and superiority of MRLN.

11 March 2025 in Pattern Recognition
Verified
Journal Article
Closed access
Muxin LiaoMuxin Liao
Muxin Liao
WLWei Li
Wei Li
CYChengle Yin
Chengle Yin
YJYuling Jin
Yuling Jin
YPYingqiong Peng
Yingqiong Peng

12 June 2023 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
YZYuhang Zhang
Yuhang Zhang
STShishun Tian
Shishun Tian
Muxin LiaoMuxin Liao
Muxin Liao
ZZZhengyu Zhang
Zhengyu Zhang
WZWenbin Zou
Wenbin Zou
CXChen Xu
Chen Xu
Unsupervised domain adaptative semantic segmentation is a powerful solution for the distribution shift problem between the source and target domains. However, such methods need specified target domain data that may be unavailable in actual applications due to excess expensive collection. Generalizable semantic segmentation as a new paradigm appears in recent research, which aims to generalize well on distinct unseen domains only using source domain data. The existing methods focus on learning domain-invariant features by using global distribution alignment strategies, which may lead to a decreased discriminability of the model. To cope with this challenge, we propose a fine-grained self-supervision (FGSS) framework for generalizable semantic segmentation that takes into account both discriminability and generalizability from the perspective of the intra-class relationship. The FGSS framework contains single-view and multi-view versions. In the single-view version, we propose a fine-grained self-supervision strategy to distinguish the sub-parts of the semantic class for better class discriminability. In the multi-view version, we propose a class prototype feature enhancement strategy to generate another view (i.e. another representation of the original representation). Then, we propose a multi-view mutual supervision loss to enforce consistency between different views and further enhance the generalizability of the model. Experimental results on five widely-used datasets, i.e., GTAV, SYNTHIA, BDD100K, Cityscapes, and Mapillary, demonstrate that our FGSS framework achieves superior performance compared to state-of-the-art methods.

17 September 2024 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
Muxin LiaoMuxin Liao
Muxin Liao
STShishun Tian
Shishun Tian
YZYuhang Zhang
Yuhang Zhang
GHGuoguang Hua
Guoguang Hua
WZWenbin Zou
Wenbin Zou
XLXia Li
Xia Li
Prototypical contrastive learning (PCL) has been widely used to learn class-wise domain-invariant features for domain generalization semantic segmentation. These methods assume that the prototypes in different domains are invariant. However, the prototypes in different domains have discrepancies as well. First, the prototypes of the same class in different domains may be different. Second, the prototypes of different classes may be similar. To address these issues, a calibration-based multi-prototype contrastive learning (CMPCL) approach is proposed, which contains an uncertainty-guided multi-prototype contrastive learning (UMPCL) and a hard-weighted multi-prototype contrastive learning (HMPCL). Specifically, the UMPCL uses an uncertainty probability matrix, derived from element-wise discrepancies between the prototypes of the same class, to calibrate the weights of prototypes for alleviating the discrepancy between the prototypes of the same class in different domains. The HMPCL uses a hard-weighted matrix that is generated by the similarity between the prototypes of different classes, to calibrate the weights of the hard-aligned prototypes for alleviating the issue of similar prototypes between different classes, with hard-aligned prototypes referring to those exhibiting such similarity. Furthermore, since the learned class-wise domain-invariant features may overfit the prototype in the source domain, multi-prototype contrastive learning is used in the UMPCL and HMPCL to avoid this risk. Extensive experiments demonstrate that our approach achieves superior performance over current approaches on multiple benchmarks of domain generalization semantic segmentation. The source code has been released on https://github.com/seabearlmx/CMPCL.