KeKun Huang

Prof. KeKun Huang


Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
29 October 2014 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
CRChuan-Xian Ren
Chuan-Xian Ren
DDDao-Qing Dai
Dao-Qing Dai
KHKeKun Huang
KeKun Huang
ZLZhao-Rong Lai
Zhao-Rong Lai
Face recognition under uncontrolled conditions, e.g., complex backgrounds and variable resolutions, is still challenging in image processing and computer vision. Although many methods have been proved well-performed in the controlled settings, they are usually of weak generality across different data sets. Meanwhile, several properties of the source domain, such as background and the size of subjects, play an important role in determining the final classification results. A transferrable representation learning model is proposed in this paper to enhance the recognition performance. To deeply exploit the discriminant information from the source domain and the target domain, the bioinspired face representation is modeled as structured and approximately stable characterization for the commonality between different domains. The method outputs a grouped boost of the features, and presents a reasonable manner for highlighting and sharing discriminant orientations and scales. Notice that the method can be viewed as a framework, since other feature generation operators and classification metrics can be embedded therein, and then, it can be applied to more general problems, such as low-resolution face recognition, object detection and categorization, and so forth. Experiments on the benchmark databases, including uncontrolled Face Recognition Grand Challenge v2.0 and Labeled Faces in the Wild show the efficacy of the proposed transfer learning algorithm.

15 February 2016 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
KHKeKun Huang
KeKun Huang
DDDao-Qing Dai
Dao-Qing Dai
CRChuan-Xian Ren
Chuan-Xian Ren
ZLZhao-Rong Lai
Zhao-Rong Lai
A sparse representation classifier (SRC) and a kernel discriminant analysis (KDA) are two successful methods for face recognition. An SRC is good at dealing with occlusion, while a KDA does well in suppressing intraclass variations. In this paper, we propose kernel extended dictionary (KED) for face recognition, which provides an efficient way for combining KDA and SRC. We first learn several kernel principal components of occlusion variations as an occlusion model, which can represent the possible occlusion variations efficiently. Then, the occlusion model is projected by KDA to get the KED, which can be computed via the same kernel trick as new testing samples. Finally, we use structured SRC for classification, which is fast as only a small number of atoms are appended to the basic dictionary, and the feature dimension is low. We also extend KED to multikernel space to fuse different types of features at kernel level. Experiments are done on several large-scale data sets, demonstrating that not only does KED get impressive results for nonoccluded samples, but it also handles the occlusion well without overfitting, even with a single gallery sample per subject.

1 April 2021 in Pattern Recognition
Verified
Journal Article
Closed access
KHKeKun Huang
KeKun Huang
CRChuan-Xian Ren
Chuan-Xian Ren
HLHui Liu
Hui Liu
ZLZhao-Rong Lai
Zhao-Rong Lai
YYYu-Feng Yu
Yu-Feng Yu
DDDao-Qing Dai
Dao-Qing Dai

17 October 2014 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
ZLZhao-Rong Lai
Zhao-Rong Lai
DDDao-Qing Dai
Dao-Qing Dai
CRChuan-Xian Ren
Chuan-Xian Ren
KHKeKun Huang
KeKun Huang
In this paper, we propose a novel discriminative and compact coding (DCC) for robust face recognition. It introduces multiple error measurements into regression model. They collaborate to tune regression codes of different properties (sparsity, compactness, high discriminating ability, etc.), to further improve robustness and adaptivity of the regression model. We propose two types of coding models: 1) multiscale error measurements that produces sparse and highly discriminative codes and 2) inspires within-class collaborative representation that produces sparse and compact codes. The update of codes and the combination of different errors are automatically processed. DCC is also robust to the choice of parameters, producing stable regression residuals which are crucial to classification. Extensive experiments on benchmark datasets show that DCC has promising performance and outperforms other state-of-the-art regression models.

10 November 2023 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
KHKeKun Huang
KeKun Huang
HYHao-Tian Yuan
Hao-Tian Yuan
CRChuan-Xian Ren
Chuan-Xian Ren
YHYue-En Hou
Yue-En Hou
Jieli DuanJieli Duan
Jieli Duan
ZYZhou Yang
Zhou Yang
Limited labeled training samples constitute a challenge in hyperspectral image classification, with much research devoted to cross-domain adaptation, where the classes of the source and target domains are different. Current cross-domain few-shot learning methods only use a small number of sample pairs to learn the discriminant features, which limits their performance. To address this problem, we propose a new framework for cross-domain few-shot learning, considering all possible positive and negative pairs in a training batch, and not just pairs between the support and query sets. Furthermore, we propose a new kernel triplet loss to characterize complex nonlinear relationships between samples and design appropriate feature extraction and discriminant networks. Specifically, the source data and target data are simultaneously fed into the same feature extraction network, then the proposed kernel triplet loss on the embedding feature and cross-entropy loss on the softmax output are used to learn discriminant features for both source and target data. Finally, an iterative adversarial strategy is employed to mitigate domain shift between source and target data. The proposed method significantly outperforms state-of-the-art methods in experiments on four target datasets and one source dataset. The code is available at https://github.com/kkcocoon/CFSL-KT.

7 June 2017 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
ZLZhao-Rong Lai
Zhao-Rong Lai
DDDao-Qing Dai
Dao-Qing Dai
CRChuan-Xian Ren
Chuan-Xian Ren
KHKeKun Huang
KeKun Huang
We propose a novel linear learning system based on the peak price tracking (PPT) strategy for portfolio selection (PS). Recently, the topic of tracking control attracts intensive attention and some novel models are proposed based on backstepping methods, such that the system output tracks a desired trajectory. The proposed system has a similar evolution with a transform function that aggressively tracks the increasing power of different assets. As a result, the better performing assets will receive more investment. The proposed PPT objective can be formulated as a fast backpropagation algorithm, which is suitable for large-scale and time-limited applications, such as high-frequency trading. Extensive experiments on several benchmark data sets from diverse real financial markets show that PPT outperforms other state-of-the-art systems in computational time, cumulative wealth, and risk-adjusted metrics. It suggests that PPT is effective and even more robust than some defensive systems in PS.