Psychology-based Unified Dynamic Framework for Curriculum Learning
Guangyu Meng, Qingkai Zeng, John P. Lalor, Hong Yu
Computational Linguistics Journal, 2025
A psychology-based curriculum learning framework that applies Item Response Theory to artificial crowds for model-independent difficulty quantification. Demonstrated effectiveness on both classification and generation tasks, achieving 69.68% faster training and 75.48% speedup over state-of-the-art methods on large language model fine-tuning.
Cell Instance Segmentation: The Devil Is in the Boundaries
Peixian Liang, Yifan Ding, Yizhe Zhang, Jianxu Chen, Hao Zheng, Hongxiao Wang, Yejia Zhang, Guangyu Meng, Tim Weninger, Michael Niemier, X. Sharon Hu, Danny Z. Chen
IEEE Transactions on Medical Imaging (TMI), 2025
Ceb, a boundary-aware approach to cell instance segmentation that clusters foreground pixels by classifying cell boundaries instead of relying on pixel-wise objectives, which often discard geometric properties such as shape, curvature, and convexity. Starting from semantic segmentation probability maps, Ceb generates candidate boundaries with a revised Watershed algorithm, encodes each as a novel "boundary signature," and trains a lightweight CNN to separate true from false boundaries; a temporal-consistency extension further improves performance on cell video datasets. Across six public datasets, Ceb consistently outperforms existing foreground pixel-clustering methods and is competitive with or better than state-of-the-art cell instance segmentation methods.
Efficient Approximation of Earth Mover's Distance Based on Nearest Neighbor Search
Guangyu Meng, Ruyu Zhou, Liu Liu, Peixian Liang, Fang Liu, Danny Z. Chen, Michael Niemier, X. Sharon Hu
IEEE Transactions on Multimedia (TMM), 2025
A GPU-accelerated Nearest Neighbor Search approximation algorithm achieving 44× to 135× speedup over exact Earth Mover's Distance computation while maintaining superior accuracy (91.88% on 20news, 93.24% on Amazon reviews). Includes comprehensive theoretical analysis of time complexity and error bounds, enabling scalable optimal transport for large-scale computer vision applications.