Min Meng

Dr. Min Meng


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
1 September 2017 in Neurocomputing
Verified
Journal Article
Closed access
MMMin Meng
Min Meng
YCYiting Jacqueline Chua
Yiting Jacqueline Chua
EWErwin Wouterson
Erwin Wouterson
COChin Peng Kelvin Ong
Chin Peng Kelvin Ong

24 November 2020 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
MMMin Meng
Min Meng
HWHaitao Wang
Haitao Wang
Jun YuJun Yu
Jun Yu
HCHui Chen
Hui Chen
JWJigang Wu
Jigang Wu
Hashing-based techniques have provided attractive solutions to cross-modal similarity search when addressing vast quantities of multimedia data. However, existing cross-modal hashing (CMH) methods face two critical limitations: 1) there is no previous work that simultaneously exploits the consistent or modality-specific information of multi-modal data; 2) the discriminative capabilities of pairwise similarity is usually neglected due to the computational cost and storage overhead. Moreover, to tackle the discrete constraints, relaxation-based strategy is typically adopted to relax the discrete problem to the continuous one, which severely suffers from large quantization errors and leads to sub-optimal solutions. To overcome the above limitations, in this paper, we present a novel supervised CMH method, namely Asymmetric Supervised Consistent and Specific Hashing (ASCSH). Specifically, we explicitly decompose the mapping matrices into the consistent and modality-specific ones to sufficiently exploit the intrinsic correlation between different modalities. Meanwhile, a novel discrete asymmetric framework is proposed to fully explore the supervised information, in which the pairwise similarity and semantic labels are jointly formulated to guide the hash code learning process. Unlike existing asymmetric methods, the discrete asymmetric structure developed is capable of solving the binary constraint problem discretely and efficiently without any relaxation. To validate the effectiveness of the proposed approach, extensive experiments on three widely used datasets are conducted and encouraging results demonstrate the superiority of ASCSH over other state-of-the-art CMH methods.

4 October 2020 in Machine Vision and Applications
Verified
Journal Article
Closed access
PDF file
XZXinpeng Zhang
Xinpeng Zhang
JWJigang Wu
Jigang Wu
MMMin Meng
Min Meng
YSYifei Sun
Yifei Sun
WSWeijun Sun
Weijun Sun

1 January 2025 in Pattern Recognition
Verified
Journal Article
Closed access
JXJunpeng Xu
Junpeng Xu
MMMin Meng
Min Meng
JLJigang Liu
Jigang Liu
JWJigang Wu
Jigang Wu

1 December 2023 in Virtual Reality & Intelligent Hardware
Verified
Journal Article
Open access
MWMingKang Wang
MingKang Wang
MMMin Meng
Min Meng
JLJigang Liu
Jigang Liu
JWJigang Wu
Jigang Wu

14 October 2021 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
MLMengcheng Lan
Mengcheng Lan
MMMin Meng
Min Meng
Jun YuJun Yu
Jun Yu
JWJigang Wu
Jigang Wu
In real-world applications, complete or incomplete multi-view data are common, which leads to the problem of generalized multi-view clustering. Recently, researchers attempt to learn the latent representation in the common subspace from heterogeneous data, which usually suffers from feature degeneration. Moreover, there are limited efforts on simultaneously revealing the underlying subspace structure and exploring the complementary information from incomplete multiple views. In this paper, we introduce a novel Generalized Multi-view Collaborative Subspace Clustering (GMCSC) framework to address the above issues, in which consensus subspace structure of all views and embedding subspaces for each view are jointly learned to benefit each other. Specifically, we develop a novel collaborative subspace learning strategy based on self-representation learning, which provides a brand-new way of pursuing the complete subspace structure directly from multi-view data. Furthermore, we explore complementary information by enforcing the consistency across different views and preserving the view-specific information of each view, which can alleviate the problem of feature degeneration and enhance the reasonability of using a consensus representation for multiple views. Experimental results on six benchmark datasets demonstrate that the proposed method can significantly outperform the state-of-the-art algorithms.