Kai Jin

Kai Jin

Auto-generated profile, based on publicly available information

Kai Jin

College of Information Engineering, Capital Normal University, Beijing 100048, China

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
20 April 2018 in IEEE Transactions on Affective Computing
Verified
Journal Article
Closed access
XZXiuzhuang Zhou
Xiuzhuang Zhou
KJKai Jin
Kai Jin
YSYuanyuan Shang
Yuanyuan Shang
GGGuodong Guo
Guodong Guo
Recent evidence in mental health assessment have demonstrated that facial appearance could be highly indicative of depressive disorder. While previous methods based on the facial analysis promise to advance clinical diagnosis of depressive disorder in a more efficient and objective manner, challenges in visual representation of complex depression pattern prevent widespread practice of automated depression diagnosis. In this paper, we present a deep regression network termed DepressNet to learn a depression representation with visual explanation. Specifically, a deep convolutional neural network equipped with a global average pooling layer is first trained with facial depression data, which allows for identifying salient regions of input image in terms of its severity score based on the generated depression activation map (DAM). We then propose a multi-region DepressNet, with which multiple local deep regression models for different face regions are jointly leaned and their responses are fused to improve the overall recognition performance. We evaluate our method on two benchmark datasets, and the results show that our method significantly boosts state-of-the-art performance of the visual-based depression recognition. Most importantly, the DAM induced by our learned deep model may help reveal the visual depression pattern on faces and understand the insights of automated depression diagnosis.

1 August 2019 in Information Fusion
Verified
Journal Article
Closed access
XZXiuzhuang Zhou
Xiuzhuang Zhou
KJKai Jin
Kai Jin
MXMin Xu
Min Xu
GGGuodong Guo
Guodong Guo

1 March 2018 in Pattern Recognition
Verified
Journal Article
Closed access
XZXiuzhuang Zhou
Xiuzhuang Zhou
KJKai Jin
Kai Jin
QCQian Chen
Qian Chen
MXMin Xu
Min Xu
YSYuanyuan Shang
Yuanyuan Shang

1 August 2013 in Applied Mechanics and Materials
Verified
Journal Article
Closed access
PDF file
CZChi Zhang
Chi Zhang
JKJin Kai
Jin Kai
Feng HongFeng Hong
Feng Hong
TYTin Yang
Tin Yang
Missing data universally exists in various research fields and it results in bad computational performance and effcet. In order to improve the accuracy of filling in the missing data, a filling missing data algorithm of the nearest neighbor based on the cluster analysis is proposed by this paper. After clustering data analysis,the algorithm assigns weights according to the categories and improves calculation formula and filling value calculation based on the MGNN (Mahalanobis-Gray and Nearest Neighbor algorithm) algorithm.The experimental results show that the filling accuracy of the method is higher than traditional KNN algorithm and MGNN algorithm.

1 April 2021 in Neurocomputing
Verified
Journal Article
Closed access
HJHejun Jiang
Hejun Jiang
XTXiaolan Tang
Xiaolan Tang
KJKai Jin
Kai Jin
WCWenlong Chen
Wenlong Chen
JPJuhua Pu
Juhua Pu

1 December 2015
Verified
Conference Paper
Closed access
PDF file
MXMin Xu
Min Xu
YSYuanyuan Shang
Yuanyuan Shang
KJKai Jin
Kai Jin
In this paper, we propose a fast and accurate block-matching algorithm for motion estimation of human faces via Artificial Bee Colony (ABC) optimization. The mean square error (MSE) is often used as the matching metric in block matching, which, however, has the high computational cost in practice. By using ABC optimization, we introduce a novel and effective block-matching metric. We develop a block-matching algorithm based on the proposed matching metric to improve the motion estimation accuracy of human faces with lower computational cost. Experimental results show that our method could achieve significant improvements over state-of-the-art fast block matching methods for motion estimation, in terms of both estimation accuracy and computational complexity.