Jianmin Li

Jianmin Li

Auto-generated profile, based on publicly available information

Jianmin Li

Tsinghua University

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
30 September 2020 in Frontiers in Robotics and AI
Verified
Journal Article
Open access
HCHaoran Chen
Haoran Chen
KLKe Lin
Ke Lin
AMAlexander Maye
Alexander Maye
JLJianmin Li
Jianmin Li
XHXiaolin Hu
Xiaolin Hu
Given the features of a video, recurrent neural networks can be used to automatically generate a caption for the video. Existing methods for video captioning have at least three limitations. First, semantic information has been widely applied to boost the performance of video captioning models, but existing networks often fail to provide meaningful semantic features. Second, the Teacher Forcing algorithm is often utilized to optimize video captioning models, but during training and inference, different strategies are applied to guide word generation, leading to poor performance. Third, current video captioning models are prone to generate relatively short captions that express video contents inappropriately. Toward resolving these three problems, we suggest three corresponding improvements. First of all, we propose a metric to compare the quality of semantic features, and utilize appropriate features as input for a semantic detection network (SDN) with adequate complexity in order to generate meaningful semantic features for videos. Then, we apply a scheduled sampling strategy that gradually transfers the training phase from a teacher-guided manner toward a more self-teaching manner. Finally, the ordinary logarithm probability loss function is leveraged by sentence length so that the inclination of generating short sentences is alleviated. Our model achieves better results than previous models on the YouTube2Text dataset and is competitive with the previous best model on the MSR-VTT dataset.

4 June 2020 in Gastric Cancer
Verified
Journal Article
Closed access
PDF file
FSFeng Su
Feng Su
YSYu Sun
Yu Sun
YHYajie Hu
Yajie Hu
PYPeijiang Yuan
Peijiang Yuan
XWXinyu Wang
Xinyu Wang
JJJiafu Ji
Jiafu Ji

1 June 2022
Verified
Conference Paper
Closed access
Hongyang GuHongyang Gu
Hongyang Gu
JLJianmin Li
Jianmin Li
GFGuangyuan Fu
Guangyuan Fu
CWChifong Wong
Chifong Wong
XCXinghao Chen
Xinghao Chen
JZJun Zhu
Jun Zhu
Person re-identification is a hot topic in computer vision, and the loss function plays a vital role in improving the discrimination of the learned features. However, most existing models utilize the hand-crafted loss functions, which are usually sub-optimal and challenging to be designed. In this paper, we propose a novel method, AutoLoss-GMS, to search the better loss function in the space of generalized margin-based softmax loss function for person reidentification automatically. Specifically, the generalized margin-based softmax loss function is first decomposed into two computational graphs and a constant. Then a general searching framework built upon the evolutionary algorithm is proposed to search for the loss function efficiently. The computational graph is constructed with a forward method, which can construct much richer loss function forms than the backward method used in existing works. In addition to the basic in-graph mutation operations, the cross-graph mutation operation is designed to further improve the offspring's diversity. The loss-rejection protocol, equivalence-check strategy and the predictor-based promising-loss chooser are developed to improve the search efficiency. Finally, experimental results demonstrate that the searched loss functions can achieve state-of-the-art performance and be transferable across different models and datasets in person re-identification.

10 November 2024
Verified
Book Chapter
Closed access
PDF file
DZDaichi Zhang
Daichi Zhang
ZXZihao Xiao
Zihao Xiao
SLShikun Li
Shikun Li
FLFanzhao Lin
Fanzhao Lin
JLJianmin Li
Jianmin Li
SGShiming Ge
Shiming Ge

20 January 2021 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
HLHan Liu
Han Liu
SZShifeng Zhang
Shifeng Zhang
KLKe Lin
Ke Lin
JWJing Wen
Jing Wen
JLJianmin Li
Jianmin Li
XHXiaolin Hu
Xiaolin Hu
Reinforcement learning (RL) algorithms have been shown to be efficient in training image captioning models. A critical step in RL algorithms is to assign credits to appropriate actions. There are mainly two classes of credit assignment methods in existing RL methods for image captioning, assigning a single credit for the whole sentence and assigning a credit to every word in the sentence. In this article, we propose a new credit assignment method which is orthogonal to the above two. It assigns every word in vocabulary an appropriate credit at each generation step. It is called vocabulary-wide credit assignment. Based on this we propose a Vocabulary-Critical Sequence Training (VCST). VCST can be incorporated into existing RL methods for training image captioning models to achieve better results. Extensive experiments with many popular models validated the effectiveness of VCST.

1 June 2017 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
SZShifeng Zhang
Shifeng Zhang
JLJianmin Li
Jianmin Li
MJMengqing Jiang
Mengqing Jiang
PYPeijiang Yuan
Peijiang Yuan
BZBo Zhang
Bo Zhang
The hashing method maps similar data of various types to binary hashcodes with smaller hamming distance, and it has received broad attention due to its low-storage cost and fast retrieval speed. However, the existing limitations make the present algorithms difficult to deal with for large-scale data sets: 1) discrete constraints are involved in the learning of the hash function and 2) pairwise or triplet similarity is adopted to generate efficient hashcodes, resulting in both time and space complexity greater than O(n 2 ). To address these issues, we propose a novel discrete supervised hash learning framework that can be scalable to large-scale data sets of various types. First, the discrete learning procedure is decomposed into a binary classifier learning scheme and binary codes learning scheme, which makes the learning procedure more efficient. Second, by adopting the asymmetric low-rank matrix factorization, we propose the fast clustering-based batch coordinate descent method, such that the time and space complexity are reduced to O(n). The proposed framework also provides a flexible paradigm to incorporate with arbitrary hash function, including deep neural networks and kernel methods, as well as any types of data to hash, including images and videos. Experiments on large-scale data sets demonstrate that the proposed method is superior or comparable with the state-of-the-art hashing algorithms.