Kunlei Jing

Dr. Kunlei Jing

Software Engineering, Xi'an Jiaotong University, Xi'an, China
orcid
Open for cooperation

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
6 May 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
JWJingjing Wang
Jingjing Wang
XZXinman Zhang
Xinman Zhang
Kunlei JingKunlei Jing
Kunlei Jing
CZCong Zhang
Cong Zhang

9 August 2021 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
Kunlei JingKunlei Jing
Kunlei Jing
XZXinman Zhang
Xinman Zhang
XXXuebin Xu
Xuebin Xu
Robustness enhancement and feature selection are the two crucial issues to be resolved in robust palmprint recognition. However, existing regression-based methods are insufficient to handle outliers and select significant features. From a statistical viewpoint, we present a general framework to intrinsically resolve the two issues. By investigating the role of outliers in the formation of coding errors, we devise a double-Laplacian mixture-error model to faithfully fit the error distribution. Additionally, we design a supervised group-sparse regularizer to enforce the locality and group sparsity of the codes. Integrating the two parts into the framework produces a nonconvex constrained problem, for which we develop an iteratively reweighted ${l} _{ {1}}$ - ${l} _{{1}}$ minimization algorithm by combining the majorization-minimization strategy and the alternating direction method of multipliers. The weighted vector learned from the error model and the local group sparsity enforced by the regularizer enable our method to better handle outliers and select more significant features than the state-of-the-art methods. Extensive experimental results verify the flexibility and robustness of our method to various contaminations.

28 August 2023 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
Kunlei JingKunlei Jing
Kunlei Jing
XZXinman Zhang
Xinman Zhang
CZChen Zhang
Chen Zhang
WLWanyu Lin
Wanyu Lin
HMHebo Ma
Hebo Ma
BWBihan Wen
Bihan Wen
Unconstrained Palmprint Recognition (UPR) shows engaging potential owing to its high hygiene and privacy. The unconstrained acquisition usually produces wide variations, against which deep methods resort to large samples that are unavailable in practice, however. We focus on Few-Shot UPR (FS-UPR), a more general problem, recognizing query samples given a few support samples per class. Because scarce samples insufficiently represent potential variations, the augmentation methods train independent hallucinators on large samples to generate more ones. Whereas, the hallucinators trained independently of Few-Shot Learning (FSL) are blind of generating promising samples to boost the downstream FSL. Moreover, training hallucinators requires large samples per class, unavailable from unconstrained palmprint databases. We aim to address FS-UPR via contrastive augmentation merely on the support samples. Observing the variations to be transferable across samples, we exploit low-rank representation to disentangle support samples into principles and variations in embedding space and augment features by variation transfer. To this end, we devise an end-to-end Deep Low-Rank Representation Feature Augmentation Network (DLRR-FAN) to simultaneously learn the embedding space and augmentation features with guaranteed reality and diversity . Furthermore, a Contrastive Recognition Regularizer (CRR) is tailored to secure the discriminability of augmentation features. During each training episode, the task motivates DLRR-FAN to augment such features that correct the biased prototypes towards upcoming query samples with variations unseen in the support samples, namely task-driven prototype correction. Extensive experiments on both the typical and extended FS-UPR tasks demonstrate the efficacy of DLRR-FAN versus the state-of-the-art methods.

12 November 2020 in Mobile Information Systems
Verified
Journal Article
Open access
XZXinman Zhang
Xinman Zhang
Kunlei JingKunlei Jing
Kunlei Jing
GSGuokun Song
Guokun Song
The security problems of online transactions by smartphones reveal extreme demand for reliable identity authentication systems. With a lower risk of forgery, richer texture, and more comfortable acquisition mode, compared with face, fingerprint, and iris, palmprint is rarely adopted for identity authentication. In this paper, we develop an effective and full-function palmprint authentication system regarding the application on an Android smartphone, which bridges the algorithmic study and application of palmprint authentication. In more detail, an overall system framework is designed with complete functions, including palmprint acquisition, key points location, ROI segmentation, feature extraction, and feature coding. Basically, we develop a palmprint authentication system having user-friendly interfaces and good compatibility with the Android smartphone. Particularly, on the one hand, to guarantee the effectiveness and efficiency of the system, we exploit the practical Log-Gabor filter for feature extraction and discuss the impact of filtering direction, downsampling ratio, and discriminative feature coding to propose an improved algorithm. On the other hand, after exploring the hardware components of the smartphone and the technical development of the Android system, we provide an open technology to extend the biometric methods to real-world applications. On the public PolyU databases, simulation results suggest that the improved algorithm outperforms the original one with a promising accuracy of 100% and a good speed of 0.041 seconds. In real-world authentication, the developed system achieves an accuracy of 98.40% and a speed of 0.051 seconds. All the results verify the accuracy and timeliness of the developed system.

16 May 2025 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
Kunlei JingKunlei Jing
Kunlei Jing
HMHebo Ma
Hebo Ma
CZChen Zhang
Chen Zhang
LWLei Wen
Lei Wen
ZZZhaorui Zhang
Zhaorui Zhang
Semi-Supervised Few-Shot Learning (SSFSL) aims to address the data scarcity in few-shot learning by leveraging both a few labeled support data and abundant unlabeled data. In SSFSL, a classifier trained on scarce support data is often biased and thus assigns inaccurate pseudo-labels to the unlabeled data, which will mislead downstream learning tasks. To combat this issue, we introduce a novel method called Certainty-Aware Recursive Confidence Training (CARCT). CARCT hinges on the insight that selecting pseudo-labeled data based on confidence levels can yield more informative support data, which is crucial for retraining an unbiased classifier to achieve accurate pseudo-labeling—a process we term pseudo-labeling calibration. We observe that accurate pseudo-labels typically exhibit smaller certainty entropy, indicating high-confidence pseudo-labeling compared to those of inaccurate pseudo-labels. Accordingly, CARCT constructs a joint double-Gaussian model to fit the certainty entropies collected across numerous SSFSL tasks. Thereby, A semi-supervised Prior Confidence Distribution (ssPCD) is learned to aid in distinguishing between high-confidence and low-confidence pseudo-labels. During an SSFSL task, ssPCD guides the selection of both high-confidence and low-confidence pseudo-labeled data to retrain the classifier that then assigns more accurate pseudo-labels to the low-confidence pseudo-labeled data. Such recursive confidence training continues until the low-confidence ones are exhausted, terminating the pseudo-labeling calibration. The unlabeled data all receive accurate pseudo-labels to expand the few support data to generalize the downstream learning task, which in return meta-refines the classifier, named self-training, to boost the pseudo-labeling in subsequent tasks. Extensive experiments on basic and extended SSFSL setups showcase the superiority of CARCT versus state-of-the-art methods, and comprehensive ablation studies and visualizations justify our insight. The source code is available at https://github.com/Klein-JING/CARCT.

29 August 2024 in IEEE Transactions on Instrumentation and Measurement
Verified
Journal Article
Closed access
HDHao Deng
Hao Deng
SCShengmei Chen
Shengmei Chen
XZXuan Zhu
Xuan Zhu
BJBo Jiang
Bo Jiang
Kunlei JingKunlei Jing
Kunlei Jing
LWLin Wang
Lin Wang
Point cloud analysis has been significantly influenced by the PointNet family which has achieved remarkable accuracy across various benchmarks. However, enhancing the efficiency of these models without compromising performance remains a challenging task. In this paper, we investigate the efficiency of the state-of-the-art point-based method PointNeXt without degrading its performance and propose a more efficient and powerful network named Efficient PointNet (EP-Net). In particular, we propose a decoupled feature aggregation (DFA) module that decouples the learning of geometric and semantic features to capture more discriminative information, rather than the vanilla set abstraction (SA) module aggregating them for coarse joint processing. Besides, we develop a more effective sampling strategy for EP-Net, compressing processing complexity from O ( n log( n )) to linear. It selects points nearest to the center of each non-empty grid cell as the new sampling points. Impressively, we achieve a dual increase in both speed and accuracy, attributed to the more refined feature aggregation and more efficient sampling. Furthermore, we demonstrate the extensibility of our proposal towards other point cloud networks, from the perspective either of boost efficiency or performance prompt. Conditioned on extensive experiments on point cloud classification and segmentation tasks, EP-Net reports a state-of-the-art performance with 73.3% mean IoU on S3DIS Area5, boosting their baseline PointNeXt by 2.5%, with only 10.6% FLOPs and 37% parameters. On extensibility experiments, our strategy boosts PointMLP with an improvement of 0.9% mAcc on the ScanObjectNN dataset.