杰 桂

杰 桂

orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
23 November 2021 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
杰桂杰 桂
杰 桂
ZSZhenan Sun
Zhenan Sun
YWYonggang Wen
Yonggang Wen
DTDacheng Tao
Dacheng Tao
JYJieping Ye
Jieping Ye
Generative adversarial networks (GANs) have recently become a hot research topic; however, they have been studied since 2014, and a large number of algorithms have been proposed. Nevertheless, few comprehensive studies explain the connections among different GAN variants and how they have evolved. In this paper, we attempt to provide a review of the various GAN methods from the perspectives of algorithms, theory, and applications. First, the motivations, mathematical representations, and structures of most GAN algorithms are introduced in detail, and we compare their commonalities and differences. Second, theoretical issues related to GANs are investigated. Finally, typical applications of GANs in image processing and computer vision, natural language processing, music, speech and audio, the medical field, and data science are discussed.

17 June 2024 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
杰桂杰 桂
杰 桂
TCTuo Chen
Tuo Chen
JZJing Zhang
Jing Zhang
QCQiong Cao
Qiong Cao
ZSZhenan Sun
Zhenan Sun
DTDacheng Tao
Dacheng Tao
Deep supervised learning algorithms typically require a large volume of labeled data to achieve satisfactory performance. However, the process of collecting and labeling such data can be expensive and time-consuming. Self-supervised learning (SSL), a subset of unsupervised learning, aims to learn discriminative features from unlabeled data without relying on human-annotated labels. SSL has garnered significant attention recently, leading to the development of numerous related algorithms. However, there is a dearth of comprehensive studies that elucidate the connections and evolution of different SSL variants. This paper presents a review of diverse SSL methods, encompassing algorithmic aspects, application domains, three key trends, and open research questions. First, we provide a detailed introduction to the motivations behind most SSL algorithms and compare their commonalities and differences. Second, we explore representative applications of SSL in domains such as image processing, computer vision, and natural language processing. Lastly, we discuss the three primary trends observed in SSL research and highlight the open questions that remain.

22 April 2016 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Open access
杰桂杰 桂
杰 桂
ZSZhenan Sun
Zhenan Sun
SJShuiwang Ji
Shuiwang Ji
DTDacheng Tao
Dacheng Tao
TTTieniu Tan
Tieniu Tan
Feature selection (FS) is an important component of many pattern recognition tasks. In these tasks, one is often confronted with very high-dimensional data. FS algorithms are designed to identify the relevant feature subset from the original features, which can facilitate subsequent analysis, such as clustering and classification. Structured sparsity-inducing feature selection (SSFS) methods have been widely studied in the last few years, and a number of algorithms have been proposed. However, there is no comprehensive study concerning the connections between different SSFS methods, and how they have evolved. In this paper, we attempt to provide a survey on various SSFS methods, including their motivations and mathematical representations. We then explore the relationship among different formulations and propose a taxonomy to elucidate their evolution. We group the existing SSFS methods into two categories, i.e., vector-based feature selection (feature selection based on lasso) and matrix-based feature selection (feature selection based on l r,p -norm). Furthermore, FS has been combined with other machine learning algorithms for specific applications, such as multitask learning, multilabel learning, multiview learning, classification, and clustering. This paper not only compares the differences and commonalities of these methods based on regression and regularization strategies, but also provides useful guidelines to practitioners working in related fields to guide them how to do feature selection.

7 March 2017 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Open access
杰桂杰 桂
杰 桂
TLTongliang Liu
Tongliang Liu
ZSZhenan Sun
Zhenan Sun
DTDacheng Tao
Dacheng Tao
TTTieniu Tan
Tieniu Tan
Learning-based hashing algorithms are “hot topics” because they can greatly increase the scale at which existing methods operate. In this paper, we propose a new learning-based hashing method called “fast supervised discrete hashing” (FSDH) based on “supervised discrete hashing” (SDH). Regressing the training examples (or hash code) to the corresponding class labels is widely used in ordinary least squares regression. Rather than adopting this method, FSDH uses a very simple yet effective regression of the class labels of training examples to the corresponding hash code to accelerate the algorithm. To the best of our knowledge, this strategy has not previously been used for hashing. Traditional SDH decomposes the optimization into three sub-problems, with the most critical sub-problem - discrete optimization for binary hash codes - solved using iterative discrete cyclic coordinate descent (DCC), which is time-consuming. However, FSDH has a closed-form solution and only requires a single rather than iterative hash code-solving step, which is highly efficient. Furthermore, FSDH is usually faster than SDH for solving the projection matrix for least squares regression, making FSDH generally faster than SDH. For example, our results show that FSDH is about 12-times faster than SDH when the number of hashing bits is 128 on the CIFAR-10 data base, and FSDH is about 151-times faster than FastHash when the number of hashing bits is 64 on the MNIST data-base. Our experimental results show that FSDH is not only fast, but also outperforms other comparative methods.

16 February 2024 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
YLYunan Liu
Yunan Liu
CWChunpeng Wang
Chunpeng Wang
MLMingyu Lu
Mingyu Lu
JYJian Yang
Jian Yang
杰桂杰 桂
杰 桂
SZShanshan Zhang
Shanshan Zhang
Human parsing has attracted considerable research interest due to its broad potential applications in the computer vision community. In this paper, we explore several useful properties, including high-resolution representation, auxiliary guidance, and model robustness, which collectively contribute to a novel method for accurate human parsing in both simple and complex scenes. Starting from simple scenes: we propose the boundary-aware hybrid resolution network (BHRN), an advanced human parsing network. BHRN utilizes deconvolutional layers and multi-scale supervision to generate rich high-resolution representations. Additionally, it includes an edge perceiving branch designed to enhance the fineness of part boundaries. Building on BHRN, we construct a dual-task mutual learning (DTML) framework. It not only provides implicit guidance to assist the parser by incorporating boundary features, but also explicitly maintains the high-order consistency between the parsing prediction and the ground truth. Toward complex scenes: we develop a domain transform method to enhance the model robustness. By transforming the input space from the spatial domain to the polar harmonic Fourier moment domain, the mapping relationship to the output semantic space is highly stable. This transformation yields robust representations for both clean and corrupted data. When evaluated on standard benchmark datasets, our method achieves superior performance compared to state-of-the-art human parsing methods. Furthermore, our domain transform strategy significantly improves the robustness of DTML dramatically in most complex scenes.

19 March 2020 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
YWYu Wang
Yu Wang
杰桂杰 桂
杰 桂
YYYue Yin
Yue Yin
JWJuan Wang
Juan Wang
JSJinlong Sun
Jinlong Sun
FAFumiyuki Adachi
Fumiyuki Adachi
Automatic modulation classification (AMC) is considered as one of the most critical technologies for the non-cooperative communication systems. Recently, deep learning (DL) based AMC (DL-AMC) methods have been attracted intensely attentions due to their preferable performance. However, most of DL-AMC methods are concentrated in the single-input and single-output (SISO) systems, while there are few works on DL-based AMC methods in multiple-input and multiple-output (MIMO) systems. Hence, we propose a convolutional neural network (CNN) and zero-forcing equalization-based AMC (ZF-AMC) method for MIMO systems. Simulation results demonstrate that the CNN-based ZF-AMC method achieves better performance than the artificial neural network (ANN) and high order cumulants (HOC)-based AMC method under the condition of the perfect channel statement information (CSI). Moreover, we also explore the impact of the imperfect CSI on the performance of the ZF-AMC method, due to its difficult acquisition of the perfect CSI. Simulation results demonstrated that the classification performance is not only influenced by the channel error, but also associated with the number of the transmitted and received antennas.