Mingli Song

Mingli Song

Auto-generated profile, based on publicly available information

Mingli Song

Zhejiang University

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
6 June 2019 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
YJYongcheng Jing
Yongcheng Jing
YYYezhou Yang
Yezhou Yang
ZFZunlei Feng
Zunlei Feng
JYJingwen Ye
Jingwen Ye
YYYizhou Yu
Yizhou Yu
MSMingli Song
Mingli Song
The seminal work of Gatys et al. demonstrated the power of Convolutional Neural Networks (CNNs) in creating artistic imagery by separating and recombining image content and style. This process of using CNNs to render a content image in different styles is referred to as Neural Style Transfer (NST). Since then, NST has become a trending topic both in academic literature and industrial applications. It is receiving increasing attention and a variety of approaches are proposed to either improve or extend the original NST algorithm. In this paper, we aim to provide a comprehensive overview of the current progress towards NST. We first propose a taxonomy of current algorithms in the field of NST. Then, we present several evaluation methods and compare different NST algorithms both qualitatively and quantitatively. The review concludes with a discussion of various applications of NST and open problems for future research. A list of papers discussed in this review, corresponding codes, pre-trained models and more comparison results are publicly available at: https://osf.io/f8tu4/.

12 July 2022 in Chemical Science
Verified
Journal Article
Open access
PDF file
ZZZipeng Zhong
Zipeng Zhong
JSJie Song
Jie Song
ZFZunlei Feng
Zunlei Feng
TLTiantao Liu
Tiantao Liu
LJLingxiang Jia
Lingxiang Jia
MSMingli Song
Mingli Song
We propose the root-aligned SMILES (R-SMILES), which specifies a tightly aligned one-to-one mapping between the product and the reactant SMILES for more efficient sequence-based synthesis prediction.

26 September 2008 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Open access
DTDacheng Tao
Dacheng Tao
MSMingli Song
Mingli Song
XLXuelong Li
Xuelong Li
Jialie ShenJialie Shen
Jialie Shen
JSJimeng Sun
Jimeng Sun
SMStephen Maybank
Stephen Maybank
Effectively modeling a collection of three-dimensional (3-D) faces is an important task in various applications, especially facial expression-driven ones, e.g., expression generation, retargeting, and synthesis. These 3-D faces naturally form a set of second-order tensors-one modality for identity and the other for expression. The number of these second-order tensors is three times of that of the vertices for 3-D face modeling. As for algorithms, Bayesian data modeling, which is a natural data analysis tool, has been widely applied with great success; however, it works only for vector data. Therefore, there is a gap between tensor-based representation and vector-based data analysis tools. Aiming at bridging this gap and generalizing conventional statistical tools over tensors, this paper proposes a decoupled probabilistic algorithm, which is named Bayesian tensor analysis (BTA). Theoretically, BTA can automatically and suitably determine dimensionality for different modalities of tensor data. With BTA, a collection of 3-D faces can be well modeled. Empirical studies on expression retargeting also justify the advantages of BTA.

6 October 2018
Verified
Book Chapter
Closed access
PDF file
YJYongcheng Jing
Yongcheng Jing
YLYang Liu
Yang Liu
YYYezhou Yang
Yezhou Yang
ZFZunlei Feng
Zunlei Feng
YYYizhou Yu
Yizhou Yu
MSMingli Song
Mingli Song

3 May 2022 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
JSJie Song
Jie Song
YCYing Chen
Ying Chen
JYJingwen Ye
Jingwen Ye
MSMingli Song
Mingli Song
Knowledge distillation (KD) has become a well established paradigm for compressing deep neural networks. The typical way of conducting knowledge distillation is to train the student network under the supervision of the teacher network to harness the knowledge at one or multiple spots ( i.e. , layers) in the teacher network. The distillation spots, once specified, will not change for all the training samples, throughout the whole distillation process. In this work, we argue that distillation spots should be adaptive to training samples and distillation epochs. We thus propose a new distillation strategy, termed spot-adaptive KD (SAKD), to adaptively determine the distillation spots in the teacher network per sample, at every training iteration during the whole distillation period. As SAKD actually focuses on “where to distill” instead of “what to distill” that is widely investigated by most existing works, it can be seamlessly integrated into existing distillation methods to further improve their performance. Extensive experiments with 10 state-of-the-art distillers are conducted to demonstrate the effectiveness of SAKD for improving their distillation performance, under both homogeneous and heterogeneous distillation settings. Code is available at https://github.com/zju-vipa/spot-adaptive-pytorch .

29 July 2010 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
MSMingli Song
Mingli Song
DTDacheng Tao
Dacheng Tao
CCChun Chen
Chun Chen
XLXuelong Li
Xuelong Li
CCChang Wen Chen
Chang Wen Chen
Both commercial and scientific applications often need to transform color images into gray-scale images, e.g., to reduce the publication cost in printing color images or to help color blind people see visual cues of color images. However, conventional color to gray algorithms are not ready for practical applications because they encounter the following problems: 1) Visual cues are not well defined so it is unclear how to preserve important cues in the transformed gray-scale images; 2) some algorithms have extremely high time cost for computation; and 3) some require human-computer interactions to have a reasonable transformation. To solve or at least reduce these problems, we propose a new algorithm based on a probabilistic graphical model with the assumption that the image is defined over a Markov random field. Thus, color to gray procedure can be regarded as a labeling process to preserve the newly well--defined visual cues of a color image in the transformed gray-scale image. Visual cues are measurements that can be extracted from a color image by a perceiver. They indicate the state of some properties of the image that the perceiver is interested in perceiving. Different people may perceive different cues from the same color image and three cues are defined in this paper, namely, color spatial consistency, image structure information, and color channel perception priority. We cast color to gray as a visual cue preservation procedure based on a probabilistic graphical model and optimize the model based on an integral minimization problem. We apply the new algorithm to both natural color images and artificial pictures, and demonstrate that the proposed approach outperforms representative conventional algorithms in terms of effectiveness and efficiency. In addition, it requires no human-computer interactions.