Maodong Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Maodong Li has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Bing Li
Wuhan University
4 shared publications - Jian Wang
School of Computer Science, Wuhan University, China
4 shared publications - Zhihao Wang
School of Computer Science, Wuhan University, Wuhan, China
2 shared publications - Chao Zheng
Wuhan University
1 shared publication - Jifeng Xuan
School of Computer Science, Wuhan University, Wuhan, China
1 shared publication Jingxiong Wang
School of Computer Science, Wuhan University, Wuhan, China
1 shared publication
Latest Publications
- 12 September 2026
- Published by Springer Nature
- p. 598-616
Proposal Score Realignment Guided by Semantic Completeness for Weakly Supervised Temporal Action Localization
- 12 September 2026
- Published by Springer Nature
- p. 598-616
Proposal Score Realignment Guided by Semantic Completeness for Weakly Supervised Temporal Action Localization
- 2 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 35 (10577149) , 5894-5909
Weakly Supervised Temporal Action Localization With Proposal-Level Action Consistency Learning
Existing weakly supervised temporal action localization (WTAL) methods typically follow a decoupled classification–localization pipeline: segment-level classifiers are trained first, and their predictions are then aggregated to score proposals at inference. Under this training–inference discrepancy, proposal scoring at inference relies on an additional aggregation step, which can accumulate errors from noisy segment responses and thus undermine score reliability. Moreover, proposal scores are often directly used as confidence without explicit score–quality modeling or quality-aware evaluation, further contributing to pronounced score–quality misalignment and thus widening the classification–localization gap. To address proposal score–quality misalignment, we propose ACL-Net, a framework for proposal score calibration. At its core is a dual-axis Proposal-level Action Consistency Learning (PACL) paradigm, implemented through two complementary modules: (i) a Semantic Consistency Module (SCM) that refines proposal representations by maintaining fused class centers to enforce compact and robust same-class features; within SCM, a cross-modal consistency–driven Classification Enhancement Module (CEM) denoises the fused class centers to mitigate error accumulation under weak supervision; and (ii) a Process Consistency Module (PCM) that derives geometry-aware reference scores from relative temporal relations among overlapping proposals, guiding the model to assess proposal quality in terms of relative process completeness and improve score–quality alignment. By jointly modeling semantic and process consistency to calibrate proposal scores, ACL-Net markedly improves localization accuracy. On THUMOS14 and ActivityNet1.3, it achieves state-of-the-art performance with uniform and substantial gains across multiple established baselines, while markedly lowering the expected calibration error (ECE).
- 2 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 35 (10577149) , 5894-5909
Weakly Supervised Temporal Action Localization With Proposal-Level Action Consistency Learning
Existing weakly supervised temporal action localization (WTAL) methods typically follow a decoupled classification–localization pipeline: segment-level classifiers are trained first, and their predictions are then aggregated to score proposals at inference. Under this training–inference discrepancy, proposal scoring at inference relies on an additional aggregation step, which can accumulate errors from noisy segment responses and thus undermine score reliability. Moreover, proposal scores are often directly used as confidence without explicit score–quality modeling or quality-aware evaluation, further contributing to pronounced score–quality misalignment and thus widening the classification–localization gap. To address proposal score–quality misalignment, we propose ACL-Net, a framework for proposal score calibration. At its core is a dual-axis Proposal-level Action Consistency Learning (PACL) paradigm, implemented through two complementary modules: (i) a Semantic Consistency Module (SCM) that refines proposal representations by maintaining fused class centers to enforce compact and robust same-class features; within SCM, a cross-modal consistency–driven Classification Enhancement Module (CEM) denoises the fused class centers to mitigate error accumulation under weak supervision; and (ii) a Process Consistency Module (PCM) that derives geometry-aware reference scores from relative temporal relations among overlapping proposals, guiding the model to assess proposal quality in terms of relative process completeness and improve score–quality alignment. By jointly modeling semantic and process consistency to calibrate proposal scores, ACL-Net markedly improves localization accuracy. On THUMOS14 and ActivityNet1.3, it achieves state-of-the-art performance with uniform and substantial gains across multiple established baselines, while markedly lowering the expected calibration error (ECE).
- Open Access
- 19 June 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 2 (FSE) , 1802-1823
TracePicker: Optimization-Based Trace Sampling for Microservice-Based Systems
Distributed tracing is a pivotal technique for software operators to understand and diagnose issues within microservice-based systems, offering a comprehensive view of user requests propagated through various services. However, the unprecedented volume of traces imposes expensive storage and analytical burdens on online systems. Conventional tracing approaches typically rely on random sampling with a fixed probability for each trace, which risks missing valuable traces. Several tail-based sampling methods have thus been proposed to sample traces based on their content. Nevertheless, these methods primarily evaluate traces on an individual basis, neglecting the collective attributes of the sample set in terms of comprehensiveness, balance, and consistency. To address these issues, we propose TracePicker, an optimization-based online sampler designed to enhance the quality of sampled data while mitigating storage burden. TracePicker employs a streaming anomaly detector to capture and retain anomalous traces that are crucial for troubleshooting. For normal traces, the sampling process is segmented into quota allocation and group sampling, both formulated as integer programming problems. By solving these problems using dynamic programming and evolution algorithms, TracePicker selects a high-quality subset of data, minimizing overall information loss. Experimental results demonstrate that TracePicker outperforms existing tail-based sampling methods in terms of both sampling quality and time consumption.
- 19 June 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 2 (FSE) , 1802-1823
Open AccessTracePicker: Optimization-Based Trace Sampling for Microservice-Based Systems
Distributed tracing is a pivotal technique for software operators to understand and diagnose issues within microservice-based systems, offering a comprehensive view of user requests propagated through various services. However, the unprecedented volume of traces imposes expensive storage and analytical burdens on online systems. Conventional tracing approaches typically rely on random sampling with a fixed probability for each trace, which risks missing valuable traces. Several tail-based sampling methods have thus been proposed to sample traces based on their content. Nevertheless, these methods primarily evaluate traces on an individual basis, neglecting the collective attributes of the sample set in terms of comprehensiveness, balance, and consistency. To address these issues, we propose TracePicker, an optimization-based online sampler designed to enhance the quality of sampled data while mitigating storage burden. TracePicker employs a streaming anomaly detector to capture and retain anomalous traces that are crucial for troubleshooting. For normal traces, the sampling process is segmented into quota allocation and group sampling, both formulated as integer programming problems. By solving these problems using dynamic programming and evolution algorithms, TracePicker selects a high-quality subset of data, minimizing overall information loss. Experimental results demonstrate that TracePicker outperforms existing tail-based sampling methods in terms of both sampling quality and time consumption.
- Open Access
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (5) , 4842-4850
Similar Modality Enhancement and Action Consistency Learning for Weakly Supervised Temporal Action Localization
Weakly-supervised temporal action localization (WTAL) aims to identify and localize action instances in untrimmed videos using only video-level labels. Existing methods typically rely on original features from frozen pre-trained encoders designed for trimmed action classification (TAC) tasks, which inevitably introduces task discrepancy. Additionally, these methods often overlook the importance of considering action consistency from multiple perspectives, specifically the consistency in action processes and action semantics, both of which are crucial for the model's understanding of actions. To address these issues, we propose a novel WTAL method based on similar modality enhancement and action consistency learning (SEAL). First, we construct global descriptors for each action category, and use the pseudo-labels generated based on these descriptors to guide the model in learning more consistent representations, thereby mitigating task discrepancy. Second, we design two types of losses to achieve action consistency learning: process consistency loss, which penalizes candidate proposals that deviate from the action center to ensure the completeness of the action process, and semantic consistency loss, which employs local descriptors to help proposals of the same action category (especially those with apparent semantic confusion) learn similar feature distributions. Extensive experiments on the THUMOS14 and ActivityNet datasets demonstrate the superior performance of the proposed method compared to state-of-the-art methods.
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (5) , 4842-4850
Open AccessSimilar Modality Enhancement and Action Consistency Learning for Weakly Supervised Temporal Action Localization
Weakly-supervised temporal action localization (WTAL) aims to identify and localize action instances in untrimmed videos using only video-level labels. Existing methods typically rely on original features from frozen pre-trained encoders designed for trimmed action classification (TAC) tasks, which inevitably introduces task discrepancy. Additionally, these methods often overlook the importance of considering action consistency from multiple perspectives, specifically the consistency in action processes and action semantics, both of which are crucial for the model's understanding of actions. To address these issues, we propose a novel WTAL method based on similar modality enhancement and action consistency learning (SEAL). First, we construct global descriptors for each action category, and use the pseudo-labels generated based on these descriptors to guide the model in learning more consistent representations, thereby mitigating task discrepancy. Second, we design two types of losses to achieve action consistency learning: process consistency loss, which penalizes candidate proposals that deviate from the action center to ensure the completeness of the action process, and semantic consistency loss, which employs local descriptors to help proposals of the same action category (especially those with apparent semantic confusion) learn similar feature distributions. Extensive experiments on the THUMOS14 and ActivityNet datasets demonstrate the superior performance of the proposed method compared to state-of-the-art methods.