Ming Yin

Ming Yin

Auto-generated profile, based on publicly available information

Ming Yin

School of Electronic Science and Engineering, South China Normal University, Foshan, China

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

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

Representative Publications

View All Publications
29 July 2015 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
MYMing Yin
Ming Yin
JGJunbin Gao
Junbin Gao
ZLZhouchen Lin
Zhouchen Lin
Low-rank representation (LRR) has recently attracted a great deal of attention due to its pleasing efficacy in exploring low-dimensional subspace structures embedded in data. For a given set of observed data corrupted with sparse errors, LRR aims at learning a lowest-rank representation of all data jointly. LRR has broad applications in pattern recognition, computer vision and signal processing. In the real world, data often reside on low-dimensional manifolds embedded in a high-dimensional ambient space. However, the LRR method does not take into account the non-linear geometric structures within data, thus the locality and similarity information among data may be missing in the learning process. To improve LRR in this regard, we propose a general Laplacian regularized low-rank representation framework for data representation where a hypergraph Laplacian regularizer can be readily introduced into, i.e., a Non-negative Sparse Hyper-Laplacian regularized LRR model (NSHLRR). By taking advantage of the graph regularizer, our proposed method not only can represent the global low-dimensional structures, but also capture the intrinsic non-linear geometric information in data. The extensive experimental results on image clustering, semi-supervised image classification and dimensionality reduction tasks demonstrate the effectiveness of the proposed method.

23 June 2022 in IEEE Reviews in Biomedical Engineering
Verified
Journal Article
Closed access
TSToufique Ahmed Soomro
Toufique Ahmed Soomro
Lihong ZhengLihong Zheng
Lihong Zheng
Ahmed J. AfifiAhmed J. Afifi
Ahmed J. Afifi
AAAhmed Ali
Ahmed Ali
SSShafiullah Soomro
Shafiullah Soomro
JGJunbin Gao
Junbin Gao
Magnetic Resonance Imaging (MRI) has commonly been used to detect and diagnose brain disease and monitor treatment as non-invasive imaging technology. MRI produces three-dimensional images that help neurologists to identify anomalies from brain images precisely. However, this is a time-consuming and labor-intensive process. The improvement in machine learning and efficient computation provides a computer-aid solution to analyze MRI images and identify the abnormality quickly and accurately. Image segmentation has become a hot and research-oriented area in the medical image analysis community. The computer-aid system for brain abnormalities identification provides the possibility for quickly classifying the disease for early treatment. This article presents a review of the research papers (from 1998 to 2020) on brain tumors segmentation from MRI images. We examined the core segmentation algorithms of each research paper in detail. This article provides readers with a complete overview of the topic and new dimensions of how numerous machine learning and image segmentation approaches are applied to identify brain tumors. By comparing the state-of-the-art and new cutting-edge methods, the deep learning methods are more effective for the segmentation of the tumor from MRI images of the brain.

27 July 2018 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
MYMing Yin
Ming Yin
JGJunbin Gao
Junbin Gao
SXShengli Xie
Shengli Xie
Yi GuoYi Guo
Yi Guo
The ubiquitous information from multiple-view data, as well as the complementary information among different views, is usually beneficial for various tasks, for example, clustering, classification, denoising, and so on. Multiview subspace clustering is based on the fact that multiview data are generated from a latent subspace. To recover the underlying subspace structure, a successful approach adopted recently has been sparse and/or low-rank subspace clustering. Despite the fact that existing subspace clustering approaches may numerically handle multiview data, by exploring all possible pairwise correlation within views, high-order statistics that can only be captured by simultaneously utilizing all views are often overlooked. As a consequence, the clustering performance of the multiview data is compromised. To address this issue, in this paper, a novel multiview clustering method is proposed by using t-product in the third-order tensor space. First, we propose a novel tensor construction method to organize multiview tensorial data, to which the tensor-tensor product can be applied. Second, based on the circular convolution operation, multiview data can be effectively represented by a t-linear combination with sparse and low-rank penalty using “self-expressiveness.” Our extensive experimental results on face, object, digital image, and text data demonstrate that the proposed method outperforms the state-of-the-art methods for a range of criteria.

24 August 2015 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
MYMing Yin
Ming Yin
JGJunbin Gao
Junbin Gao
ZLZhouchen Lin
Zhouchen Lin
QSQinfeng Shi
Qinfeng Shi
YGYi Guo
Yi Guo
Low-rank representation (LRR) has received considerable attention in subspace segmentation due to its effectiveness in exploring low-dimensional subspace structures embedded in data. To preserve the intrinsic geometrical structure of data, a graph regularizer has been introduced into LRR framework for learning the locality and similarity information within data. However, it is often the case that not only the high-dimensional data reside on a non-linear low-dimensional manifold in the ambient space, but also their features lie on a manifold in feature space. In this paper, we propose a dual graph regularized LRR model (DGLRR) by enforcing preservation of geometric information in both the ambient space and the feature space. The proposed method aims for simultaneously considering the geometric structures of the data manifold and the feature manifold. Furthermore, we extend the DGLRR model to include non-negative constraint, leading to a parts-based representation of data. Experiments are conducted on several image data sets to demonstrate that the proposed method outperforms the state-of-the-art approaches in image clustering.

11 April 2018 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
MYMing Yin
Ming Yin
SXShengli Xie
Shengli Xie
ZWZongze Wu
Zongze Wu
YZYun Zhang
Yun Zhang
JGJunbin Gao
Junbin Gao
By using a sparse representation or low-rank representation of data, the graph-based subspace clustering has recently attracted considerable attention in computer vision, given its capability and efficiency in clustering data. However, the graph weights built using the representation coefficients are not the exact ones as the traditional definition is in a deterministic way. The two steps of representation and clustering are conducted in an independent manner, thus an overall optimal result cannot be guaranteed. Furthermore, it is unclear how the clustering performance will be affected by using this graph. For example, the graph parameters, i.e., the weights on edges, have to be artificially pre-specified while it is very difficult to choose the optimum. To this end, in this paper, a novel subspace clustering via learning an adaptive low-rank graph affinity matrix is proposed, where the affinity matrix and the representation coefficients are learned in a unified framework. As such, the pre-computed graph regularizer is effectively obviated and better performance can be achieved. Experimental results on several famous databases demonstrate that the proposed method performs better against the state-of-the-art approaches, in clustering.

1 June 2016
Verified
Conference Paper
Closed access
MYMing Yin
Ming Yin
YGYi Guo
Yi Guo
JGJunbin Gao
Junbin Gao
ZHZhaoshui He
Zhaoshui He
SXShengli Xie
Shengli Xie
Sparse subspace clustering (SSC), as one of the most successful subspace clustering methods, has achieved notable clustering accuracy in computer vision tasks. However, SSC applies only 10 vector data in Euclidean space. Unfortunately there is still no satisfactory approach to solve subspace clustering by self-expressive principle f or symmetric positive definite (SPD) matrices which is very useful, in computer vision. In this paper, by embedding the SPD matrices into a Reproducing Kernel Hilbert Space (RKHS), a kernel subspace clustering method is constructed un the SPD manifold through an appropriate Log-Euclidean kernel, termed as kernel sparse subspace clustering on the SPD Riemannian manifold(KSSCR). By exploiting the intrinsic Riemannian geometry within data, KSSCR can effectively characterize the geodesic distance between SPD matrices to uncover the underlying subspace structure. Experimental results Oft several famous datasets demonstrate that the proposed method achieves better clustering results than the state-of-the-art approaches.