Miao Yu

Miao Yu

Auto-generated profile, based on publicly available information

Miao Yu

Zhongyuan University of Technology

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
14 October 2024 in IEEE Transactions on Biometrics, Behavior, and Identity Science
Verified
Journal Article
Closed access
CLChunlei Li
Chunlei Li
RBRenwei Ba
Renwei Ba
XWXueping Wang
Xueping Wang
MYMiao Yu
Miao Yu
XLXiao Li
Xiao Li
DHDi Huang
Di Huang
The subtle and slight motions of micro-expressions (MEs) leave few effective features to micro-expression recognition (MER), making MER a challenging task. Existing works mainly focus on constructing strong representations from entire videos, individual frames, or redundant structural graphs, however, spatial structure feature learning of MEs leaves much space for further improvement. To solve the issue, this paper introduces a novel two-stream network for MER without any prior knowledge called Focusing on Few Discriminative Information Network (FFDIN). Specifically, in the temporal stream, the difference between the Apex and Onset frames is utilized as input to reduce redundant information and aggregate temporal information. Meanwhile, spatial attention is incorporated into the CNN stream to encourage the network to focus on salient features. In the structural stream, the Adaptively Select Strategy (ADSS) is proposed to automatically locate few effective regions of MEs by selecting the strong long-term dependent cropped patches and corresponding adjacency matrix. Then, the Graph Nodes Generation (GNG) module is designed to capture local and global information in tiny cropped patches and project the feature maps into graph nodes. Extensive experiments conducted on the CASME II, SAMM, and SMIC datasets demonstrate that the proposed network can achieve superior performance than the state-of-the-art methods.

15 September 2016 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
MYMiao Yu
Miao Yu
SSShuhan Shen
Shuhan Shen
ZHZhanyi Hu
Zhanyi Hu
Graph cuts are widely used in computer vision. To speed up the optimization process and improve the scalability for large graphs, Strandmark and Kahl introduced a splitting method to split a graph into multiple subgraphs for parallel computation in both shared and distributed memory models. However, this parallel algorithm (the parallel BK-algorithm) does not have a polynomial bound on the number of iterations and is found to be non-convergent in some cases due to the possible multiple optimal solutions of its sub-problems. To remedy this non-convergence problem, in this paper, we first introduce a merging method capable of merging any number of those adjacent sub-graphs that can hardly reach agreement on their overlapping regions in the parallel BK-algorithm. Based on the pseudo-boolean representations of graph cuts, our merging method is shown to be effectively reused all the computed flows in these sub-graphs. Through both splitting and merging, we further propose a dynamic parallel and distributed graph cuts algorithm with guaranteed convergence to the globally optimal solutions within a predefined number of iterations. In essence, this paper provides a general framework to allow more sophisticated splitting and merging strategies to be employed to further boost performance. Our dynamic parallel algorithm is validated with extensive experimental results.

16 May 2017 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
MYMiao Yu
Miao Yu
SSShuhan Shen
Shuhan Shen
ZHZhan-Yi Hu
Zhan-Yi Hu
This paper aims at bridging the two important trends in efficient graph cuts in the literature, the one is to decompose a graph into several smaller subgraphs to take the advantage of parallel computation, the other is to reuse the solution of the max-flow problem on a residual graph to boost the efficiency on another similar graph. Our proposed parallel dynamic graph cuts algorithm takes the advantages of both, and is extremely efficient for certain dynamically changing MRF models in computer vision. The performance of our proposed algorithm is validated on two typical dynamic graph cuts problems: the foreground-background segmentation in video, where similar graph cuts problems need to be solved in sequential and GrabCut, where graph cuts are used iteratively.

21 January 2025 in IEEE Transactions on Biometrics, Behavior, and Identity Science
Verified
Journal Article
Closed access
CLChunlei Li
Chunlei Li
CCCan Cheng
Can Cheng
MYMiao Yu
Miao Yu
ZLZhoufeng Liu
Zhoufeng Liu
DHDi Huang
Di Huang
The action recognition task involves analyzing video content and temporal relationships between frames to identify actions. Crucial to this process are action representations that effectively capture varying temporal scales and spatial motion variations. To address these challenges, we propose the Joint Coarse to Fine-Grained Spatio-Temporal Modeling (JCFG-STM) approach, which is designed to capture robust spatio-temporal representations through three key components: the Temporal-enhanced Spatio-Temporal Perception (TSTP) module, the Positional-enhanced Spatio-Temporal Perception (PSTP) module, and the Fine-grained Spatio-Temporal Perception (FSTP) module. Specifically, TSTP is designed to fuse temporal information across both local and global spatial scales, while PSTP emphasizes the integration of spatial coordinate directions, both horizontal and vertical, with temporal dynamics. Meanwhile, FSTP focuses on combining spatial coordinate information with short-term temporal data by differentiating neighboring frames, enabling fine-grained spatio-temporal modeling. JCFG-STM effectively focuses on multi-granularity and complementary motion patterns associated with actions. Extensive experiments conducted on large-scale action recognition datasets, including Kinetics-400, Something-Something V2, Jester, and EgoGesture, demonstrate the effectiveness of our approach and its superiority over state-of-the-art methods.

30 November 2025 in Journal of Engineered Fibers and Fabrics
Verified
Journal Article
Open access
ZHZeliang Huang
Zeliang Huang
JWJunpu Wang
Junpu Wang
CLChunlei Li
Chunlei Li
MYMiao Yu
Miao Yu
In the textile industry, surface defects can greatly damage the value of fabric, but the coexistence of subtle defects and elongated defects poses a significant challenge to the localization of them. Existing convolutional neural networks-deep learning methods, especially the YOLO series, can present promising fabric defect detection. However, their performance is limited in simultaneously learning local and global features, leading to inaccurate localization results. To address this issue, this paper proposes a Fabric Defect Detection Network (FDDNet) based on Spatial Depth-Transforming Convolution (SDTC) and Multiscale Dilated Self-attention Fusion Module (MDSFM). Firstly, to enhance the local feature characterization capability of the backbone network, our FDDNet proposes spatial depth-transforming convolutions to preserve more fine-grained information. Subsequently, to effectively integrate global and local information and enhance global-local modeling capability, the multiscale dilated self-attention fusion module is introduced by combining self-attention mechanisms and dilated convolutions, thus enabling the model to percept scale changes and achieving multi-scale defect localization. Experiment results conducted on the publicly available Tianchi fabric dataset and a self-made denim dataset show that, the proposed FDDNet can achieve the AP50 of 54% and 56.8% respectively, which outperforms mainstream state-of-the-art methods.

29 September 2025 in Electronics
Verified
Journal Article
Open access
PDF file
XSXinnan Shao
Xinnan Shao
ZLZhoufeng Liu
Zhoufeng Liu
QHQihang He
Qihang He
MYMiao Yu
Miao Yu
CLChunlei Li
Chunlei Li
Few-shot object detection methods perform well in natural scenes, where meta-learners can effectively extract target features from limited support data. However, PCB defect detection faces unique challenges: scarce defect samples, low-resolution targets, and severe overfitting risks. Additionally, PCBs’ dense circuitry creates low-contrast defects that blend into background noise, while traditional meta-learning struggles to generate realistic synthetic defects under actual manufacturing constraints. To overcome these limitations, we propose SM-FSOD, a second-order meta-learning model featuring a defect-aware prototype network. Unlike conventional approaches, it dynamically emphasizes critical defect features when constructing class prototypes from few-shot samples. Our extensive few-shot experiments on the DeepPCB and DsPCBSD+ datasets demonstrate the performance of the SM-FSOD model. Comparative tests on the DeepPCB dataset show that, compared with the strong Meta-RCNN baseline, our model achieves a maximum performance improvement of 14.0% under the challenging five-shot setting, while still attaining a 7.6% accuracy gain in the more relaxed 50-shot setting. Similarly, evaluation on the DsPCBSD+ dataset reveals that our proposed method maintains an average accuracy improvement of 2.3% to 9.6% compared to the competitive DeFRCN model in complex scenarios, indicating the strong adaptability of SM-FSOD across various application environments. Ablation studies further demonstrate that incorporating the improved MOMP and DGPT modules individually yields average accuracy gains of 3.6% and 4.5%, respectively, under the five-shot setting compared to the baseline, confirming that these enhancements can orthogonally improve the detection precision in few-shot PCB scenarios.