Jiawei Li

Jiawei Li

Auto-generated profile, based on publicly available information

Jiawei Li

Department of Computer Science, Hong Kong Baptist University, Hong Kong

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
14 January 2019 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
Mang YeMang Ye
Mang Ye
JLJiawei Li
Jiawei Li
AMAndy J. Ma
Andy J. Ma
LZLiang Zheng
Liang Zheng
PYPong C. Yuen
Pong C. Yuen
Cross-camera label estimation from a set of unlabeled training data is an extremely important component in the unsupervised person re-identification (re-ID) systems. With the estimated labels, the existing advanced supervised learning methods can be leveraged to learn discriminative re-ID models. In this paper, we utilize the graph matching technique for accurate label estimation due to its advantages in optimal global matching and intra-camera relationship mining. However, the graph structure constructed with non-learned similarity measurement cannot handle the large cross-camera variations, which leads to noisy and inaccurate label outputs. This paper designs a dynamic graph matching (DGM) framework, which improves the label estimation process by iteratively refining the graph structure with better similarity measurement learned from the intermediate estimated labels. In addition, we design a positive re-weighting strategy to refine the intermediate labels, which enhances the robustness against inaccurate matching output and noisy initial training data. To fully utilize the abundant video information and reduce false matchings, a co-matching strategy is further incorporated into the framework. Comprehensive experiments conducted on three video benchmarks demonstrate that DGM outperforms the state-of-the-art unsupervised re-ID methods and yields the competitive performance to fully supervised upper bounds.

27 March 2018 in International Journal of Computer Vision
Verified
Journal Article
Closed access
PDF file
JLJiawei Li
Jiawei Li
AMAndy J. Ma
Andy J. Ma
PYPong C. Yuen
Pong C. Yuen

27 November 2002
Verified
Conference Paper
Closed access
XLXuemin Liu
Xuemin Liu
PLPeng Liang
Peng Liang
JLJiawei Li
Jiawei Li
YXYuru Xu
Yuru Xu

1 December 2012
Verified
Conference Paper
Closed access
JLJiawei Li
Jiawei Li
ZYZilu Ying
Zilu Ying
In this paper, we propose a new algorithm for facial expression recognition (FER) based on rotation invariant Local Phase Quantization (RI-LPQ) and sparse representation. Firstly, Expression features are extracted using RI-LPQ descriptor. Then, Sparse Representation-based Classification (SRC) method is used to represent the test expression image by the linear combination of the training expression images. Facial expressions are discriminated by the residue analysis of sparse representation. The proposed method is experimented on Japanese Female Facial Expression (JAFFE) database. The new algorithms are assessed in comparison with the well known algorithms such as 2DPCA+SVM, LDA+SVM etc. The results illustrate that the proposed method has better performance than those traditional algorithms. In addition, in the case of expression images with different occlusion, recognition rate of the proposed method also gets better result.

27 September 2017 in arXiv
Verified
Preprint
Open access
PDF file
Mang YeMang Ye
Mang Ye
JMJinhua Ma
Jinhua Ma
LZLiang Zheng
Liang Zheng
JLJiawei Li
Jiawei Li
PYP C Yuen
P C Yuen
Label estimation is an important component in an unsupervised person re-identification (re-ID) system. This paper focuses on cross-camera label estimation, which can be subsequently used in feature learning to learn robust re-ID models. Specifically, we propose to construct a graph for samples in each camera, and then graph matching scheme is introduced for cross-camera labeling association. While labels directly output from existing graph matching methods may be noisy and inaccurate due to significant cross-camera variations, this paper proposes a dynamic graph matching (DGM) method. DGM iteratively updates the image graph and the label estimation process by learning a better feature space with intermediate estimated labels. DGM is advantageous in two aspects: 1) the accuracy of estimated labels is improved significantly with the iterations; 2) DGM is robust to noisy initial training data. Extensive experiments conducted on three benchmarks including the large-scale MARS dataset show that DGM yields competitive performance to fully supervised baselines, and outperforms competing unsupervised learning methods.

1 January 2019 in The Electronic Journal of Linear Algebra
Verified
Journal Article
Open access
PDF file
ZCZhi Chen
Zhi Chen
JLJiawei Li
Jiawei Li
LYLizhen Yang
Lizhen Yang
ZZZelin Zhu
Zelin Zhu
LCLei Cao
Lei Cao
In this paper, some inequalities for permanents and permanental minors of row substochastic matrices are proved. The convexity of the permanent function on the interval between the identity matrix and an arbitrary row substochastic matrix is also proved. In addition, a conjecture about the permanent and permanental minors of square row substochastic matrices with fixed row and column sums is formulated.