Junli Zhao

Prof. Junli Zhao


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
2 August 2024 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
WCWenhao Cai
Wenhao Cai
JZJunli Zhao
Junli Zhao
RYRan Yi
Ran Yi
MYMinjing Yu
Minjing Yu
FDFuqing Duan
Fuqing Duan
YLYong-Jin Liu
Yong-Jin Liu
Facial expressions are an essential part of human emotional communication, and micro-expressions (MEs), as transient and imperceptible non-verbal signals, can potentially reveal real human emotions. However, subtle motion variations, limited and unbalanced samples make micro-expression recognition (MER) challenging. In this paper, we design a novel dual-branch learning framework of multi-level flow-driven attention for micro-expression recognition (MFDAN), which innovatively integrates optical flow prior to guide the attention learning in the image encoding branch, enabling the model to focus on the most discriminative facial regions for subtle motion patterns. Firstly, we extract optical flow information by an optical flow encoding module. Then, in the image coding module, we construct a Transformer structure containing an optical flow-driven attention mechanism, which can effectively locate the interest region of micro-expressions in the image according to the position information of optical flow to capture more sensitive and fine-grained micro-expressions. By interoperating prior knowledge with data learning, and introducing the Dropkey operation and Focal Loss, our method can handle subtle micro-expression features on small imbalanced datasets. Through extensive experiments on three independent datasets and a composite database, including SMIC-HS, SAMM, and CASME II, robust leave-one-subject-out (LOSO) evaluation results show that our method outperforms state-of-the-art methods especially on the composite database.

12 July 2023 in Computers & Graphics
Verified
Journal Article
Closed access
YLYong-Jin Liu
Yong-Jin Liu
BWBaodong Wang
Baodong Wang
LGLin Gao
Lin Gao
JZJunli Zhao
Junli Zhao
RYRan Yi
Ran Yi
XGXianfeng Gu
Xianfeng Gu

25 December 2023 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
XJXianhe Jiao
Xianhe Jiao
CLChenlei Lv
Chenlei Lv
RYRan Yi
Ran Yi
JZJunli Zhao
Junli Zhao
ZPZhenkuan Pan
Zhenkuan Pan
YLYong-Jin Liu
Yong-Jin Liu
As a significant geometric feature of 3D point clouds, sharp features play an important role in shape analysis, 3D reconstruction, registration, localization, etc. Current sharp feature detection methods are still sensitive to the quality of the input point cloud, and the detection performance is affected by random noisy points and non-uniform densities. In this paper, using the prior knowledge of geometric features, we propose a Multi-scale Laplace Network (MSL-Net), a new deep-learning-based method based on an intrinsic neighbor shape descriptor, to detect sharp features from 3D point clouds. First, we establish a discrete intrinsic neighborhood of the point cloud based on the Laplacian graph, which reduces the error of local implicit surface estimation. Then, we design a new intrinsic shape descriptor based on the intrinsic neighborhood, combined with enhanced normal extraction and cosine-based field estimation function. Finally, we present the backbone of MSL-Net based on the intrinsic shape descriptor. Benefiting from the intrinsic neighborhood and shape descriptor, our MSL-Net has simple architecture and is capable of establishing accurate feature prediction that satisfies the manifold distribution while avoiding complex intrinsic metric calculations. Extensive experimental results demonstrate that with the multi-scale structure, MSL-Net has a strong analytical ability for local perturbations of point clouds. Compared with state-of-the-art methods, our MSL-Net is more robust and accurate.

1 August 2019 in Computers & Graphics
Verified
Journal Article
Closed access
RHRuikun Huang
Ruikun Huang
JZJunli Zhao
Junli Zhao
FDFuqing Duan
Fuqing Duan
Xin LiXin Li
Xin Li
CLCelong Liu
Celong Liu
MZMingquan Zhou
Mingquan Zhou

1 June 2021 in Computers & Graphics
Verified
Journal Article
Closed access
BJBin Jia
Bin Jia
JZJunli Zhao
Junli Zhao
SXShiqing Xin
Shiqing Xin
FDFuqing Duan
Fuqing Duan
ZPZhenkuan Pan
Zhenkuan Pan
MZMingquan Zhou
Mingquan Zhou

5 October 2017 in PLOS ONE
Verified
Journal Article
Open access
PDF file
YCYucong Chen
Yucong Chen
JZJunli Zhao
Junli Zhao
QDQingqiong Deng
Qingqiong Deng
FDFuqing Duan
Fuqing Duan
Craniofacial registration is used to establish the point-to-point correspondence in a unified coordinate system among human craniofacial models. It is the foundation of craniofacial reconstruction and other craniofacial statistical analysis research. In this paper, a non-rigid 3D craniofacial registration method using thin-plate spline transform and cylindrical surface projection is proposed. First, the gradient descent optimization is utilized to improve a cylindrical surface fitting (CSF) for the reference craniofacial model. Second, the thin-plate spline transform (TPST) is applied to deform a target craniofacial model to the reference model. Finally, the cylindrical surface projection (CSP) is used to derive the point correspondence between the reference and deformed target models. To accelerate the procedure, the iterative closest point ICP algorithm is used to obtain a rough correspondence, which can provide a possible intersection area of the CSP. Finally, the inverse TPST is used to map the obtained corresponding points from the deformed target craniofacial model to the original model, and it can be realized directly by the correspondence between the original target model and the deformed target model. Three types of registration, namely, reflexive, involutive and transitive registration, are carried out to verify the effectiveness of the proposed craniofacial registration algorithm. Comparison with the methods in the literature shows that the proposed method is more accurate.