Mingjie Li

Mingjie Li

Auto-generated profile, based on publicly available information

Mingjie Li

School of Computer Science and Cyber Engineering, Guangzhou University, Guangzhou, China

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
3 April 2019 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
WLWen Li
Wen Li
YZYing Zhang
Ying Zhang
YSYifang Sun
Yifang Sun
WWWei Wang
Wei Wang
MLMingjie Li
Mingjie Li
XLXuemin Lin
Xuemin Lin
Nearest neighbor search (ANNS) is fundamental and essential operation in applications from many domains, such as databases, machine learning, multimedia, and computer vision. Although many algorithms have been continuously proposed in the literature in the above domains each year, there is no comprehensive evaluation and analysis of their performances. In this paper, we conduct a comprehensive experimental evaluation of many state-of-the-art methods for approximate nearest neighbor search. Our study (1) is cross-disciplinary (i.e., including 16 algorithms in different domains, and from practitioners) and (2) has evaluated a diverse range of settings, including 20 datasets, several evaluation metrics, and different query workloads. The experimental results are carefully reported and analyzed to understand the performance results. Furthermore, we propose a new method that achieves both high query efficiency and high recall empirically on majority of the datasets under a wide range of settings.

24 September 2024 in Expert Systems with Applications
Verified
Journal Article
Closed access
YRYu Ran
Yu Ran
AZAo-Xiang Zhang
Ao-Xiang Zhang
MLMingjie Li
Mingjie Li
WTWeixuan Tang
Weixuan Tang
YWYuan-Gen Wang
Yuan-Gen Wang

21 August 2023 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
YRYu Ran
Yu Ran
WWWeijia Wang
Weijia Wang
MLMingjie Li
Mingjie Li
LLLin-Cheng Li
Lin-Cheng Li
YWYuan-Gen Wang
Yuan-Gen Wang
JLJin Li
Jin Li
Recent studies have shown that deep learning-based classifiers are vulnerable to malicious inputs, i.e., adversarial examples. A practical solution is to construct a perceptible but localized perturbation called patch, making the well-trained models misclassified. However, most existing patch-based adversarial attacks focus on designing patches with localized rectangles, squares, or grids, ignoring the effect of the non-local patch. In this paper, we propose a novel cross-shaped patch attack paradigm (CSPA), a simple yet efficient and effective adversarial attack in Black-box scenarios. Specifically, the cross-shaped patch consists of two line segments intersected and perpendicular to each other at the midpoint. These two line segments are designed to be sufficiently thin and long to reach the four corners of the input image nearly. Thus, the patch has a globalized perturbation capacity while preserving its continuousness. The content and location of cross-shaped patch are then iteratively optimized by a carefully contrived random search-based algorithm to maximize this global property. Comprehensive experiments are conducted on four benchmark datasets against various victim networks. The results show that the proposed CSPA outperforms the existing patch-based attacks regarding both attack success rate and query efficiency by a large margin. Specifically, compared with the baselines, CSPA increases the success rate by up to 20% on ImageNet and reaches 100% on the CIFAR-100 and CIFAR-10 datasets. Meanwhile, CSPA reduces the average number of queries by up to 7 times. Even for the white-box attack scenario, our designed cross-shaped patch can still be applicable, achieving state-of-the-art performance.

8 November 2022 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
MLMingjie Li
Mingjie Li
YWYuan-Gen Wang
Yuan-Gen Wang
PZPeng Zhang
Peng Zhang
HWHanpin Wang
Hanpin Wang
Lisheng FanLisheng Fan
Lisheng Fan
WWWei Wang
Wei Wang
Approximate nearest neighbour search (ANNS) in high-dimensional space is an essential and fundamental operation in many applications from many domains such as multimedia database, information retrieval and computer vision. With the rapidly growing volume of data and the dramatically increasing demands of users, traditional heuristic-based ANNS solutions have been facing great challenges in terms of both efficiency and accuracy. Inspired by the recent successes of deep learning in many fields, substantial efforts have been devoted to applying deep learning techniques to ANNS for learning to index and learning to search, resulting in numerous algorithms that achieve state-of-the-art performance compared with conventional methods. In this survey paper, we comprehensively review the different types of deep learning-based ANNS methods according to two learning paradigms: learning to index and learning to search . We provide a comprehensive overview and analysis of these methods in a systematic manner. Based on the overview, we point out that end-to-end learning will be a new and promising research direction for deep learning-based ANNS, i.e., applying deep learning techniques to jointly learn the indexing and searching together, such that the underlying knowledge learned from data can directly contribute to the final searching performance. Finally, we conduct experiments and provide general performance analyses for the representative deep learning-based ANNS algorithms.

27 December 2024 in IEEE Transactions on Broadcasting
Verified
Journal Article
Closed access
FXFengchuang Xing
Fengchuang Xing
MLMingjie Li
Mingjie Li
YWYuan-Gen Wang
Yuan-Gen Wang
GZGuopu Zhu
Guopu Zhu
XCXiaochun Cao
Xiaochun Cao
In learning vision-language representations from Web-scale data, the contrastive language-image pre-training (CLIP) mechanism has demonstrated a remarkable performance in many vision tasks. However, its application to the widely studied video quality assessment (VQA) task is still an open issue. In this paper, we propose an efficient and effective CLIP-based Transformer method for the VQA problem (CLIPVQA). Specifically, we first design an effective video frame perception paradigm with the goal of extracting the rich spatiotemporal quality and content information among video frames. Then, the spatiotemporal quality features are adequately integrated together using a self-attention mechanism to yield video-level quality representation. To utilize the quality language descriptions of videos for supervision, we develop a CLIP-based encoder for language embedding, which is then fully aggregated with the generated content information via a cross-attention module for producing video-language representation. Finally, the video-level quality and video-language representations are fused together for final video quality prediction, where a vectorized regression loss is employed for efficient end-to-end optimization. Comprehensive experiments are conducted on eight in-the-wild video datasets with diverse resolutions to evaluate the performance of CLIPVQA. The experimental results show that the proposed CLIPVQA achieves new state-of-the-art VQA performance and up to 37% better generalizability than existing benchmark VQA methods. A series of ablation studies are also performed to validate the effectiveness of each module in CLIPVQA.

13 May 2018
Verified
Book Chapter
Closed access
PDF file
MLMingjie Li
Mingjie Li
YZYing Zhang
Ying Zhang
YSYifang Sun
Yifang Sun
WWWei Wang
Wei Wang
ITIvor Tsang
Ivor Tsang
XLXuemin Lin
Xuemin Lin