Tyng-Luh Liu

Tyng-Luh Liu

Auto-generated profile, based on publicly available information

Tyng-Luh Liu

Academia Sinica

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

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

Representative Publications

View All Publications
1 November 2022
Verified
Book Chapter
Closed access
PDF file
CYChun-Hsiao Yeh
Chun-Hsiao Yeh
CHCheng-Yao Hong
Cheng-Yao Hong
YHYen-Chi Hsu
Yen-Chi Hsu
TLTyng-Luh Liu
Tyng-Luh Liu
YCYubei Chen
Yubei Chen
YLYann LeCun
Yann LeCun

3 November 2022
Verified
Book Chapter
Closed access
PDF file
JWJhih-Ciang Wu
Jhih-Ciang Wu
HHHe-Yen Hsieh
He-Yen Hsieh
DCDing-Jie Chen
Ding-Jie Chen
CFChiou-Shann Fuh
Chiou-Shann Fuh
TLTyng-Luh Liu
Tyng-Luh Liu

1 June 2007
Verified
Conference Paper
Closed access
YLYen-Yu Lin
Yen-Yu Lin
TLTyng-Luh Liu
Tyng-Luh Liu
CFChiou-Shann Fuh
Chiou-Shann Fuh
This paper describes a local ensemble kernel learning technique to recognize/classify objects from a large number of diverse categories. Due to the possibly large intraclass feature variations, using only a single unified kernel-based classifier may not satisfactorily solve the problem. Our approach is to carry out the recognition task with adaptive ensemble kernel machines, each of which is derived from proper localization and regularization. Specifically, for each training sample, we learn a distinct ensemble kernel constructed in a way to give good classification performance for data falling within the corresponding neighborhood. We achieve this effect by aligning each ensemble kernel with a locally adapted target kernel, followed by smoothing out the discrepancies among kernels of nearby data. Our experimental results on various image databases manifest that the technique to optimize local ensemble kernels is effective and consistent for object recognition.

11 July 2023 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
YHYen-Chi Hsu
Yen-Chi Hsu
CHCheng-Yao Hong
Cheng-Yao Hong
MLMing-Sui Lee
Ming-Sui Lee
Davi GeigerDavi Geiger
Davi Geiger
TLTyng-Luh Liu
Tyng-Luh Liu
Image classification for real-world applications often involves complicated data distributions such as fine-grained and long-tailed. To address the two challenging issues simultaneously, we propose a new regularization technique that yields an adversarial loss to strengthen the model learning. Specifically, for each training batch, we construct an adaptive batch prediction (ABP) matrix and establish its corresponding adaptive batch confusion norm (ABC-Norm). The ABP matrix is a composition of two parts, including an adaptive component to class-wise encode the imbalanced data distribution, and the other component to batch-wise assess the softmax predictions. The ABC-Norm leads to a norm-based regularization loss, which can be theoretically shown to be an upper bound for an objective function closely related to rank minimization. By coupling with the conventional cross-entropy loss, the ABC-Norm regularization could introduce adaptive classification confusion and thus trigger adversarial learning to improve the effectiveness of model learning. Different from most of state-of-the-art techniques in solving either fine-grained or long-tailed problems, our method is characterized with its simple and efficient design, and most distinctively, provides a unified solution. In the experiments, we compare ABC-Norm with relevant techniques and demonstrate its efficacy on several benchmark datasets, including (CUB-LT, iNaturalist2018); (CUB, CAR, AIR); and (ImageNet-LT), which respectively correspond to the real-world, fine-grained, and long-tailed scenarios.

14 October 2005 in International Journal of Computer Vision
Verified
Journal Article
Closed access
PDF file
HCHwann-Tzong Chen
Hwann-Tzong Chen
TLTyng-Luh Liu
Tyng-Luh Liu
CFChiou-Shann Fuh
Chiou-Shann Fuh

11 April 2025 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
PHPei-Kai Huang
Pei-Kai Huang
JCJun-Xiong Chong
Jun-Xiong Chong
CCCheng-Hsuan Chiang
Cheng-Hsuan Chiang
TCTzu-Hsien Chen
Tzu-Hsien Chen
TLTyng-Luh Liu
Tyng-Luh Liu
CHChiou-Ting Hsu
Chiou-Ting Hsu
Face anti-spoofing (FAS) plays a pivotal role in ensuring the security and reliability of face recognition systems. With advancements in vision-language pretrained (VLP) models, recent two-class FAS techniques have leveraged the advantages of using VLP guidance, while this potential remains unexplored in one-class FAS methods. The one-class FAS focuses on learning intrinsic liveness features solely from live training images to differentiate between live and spoof faces. However, the lack of spoof training data can lead one-class FAS models to inadvertently incorporate domain information irrelevant to the live/spoof distinction (\eg, facial content), causing performance degradation when tested with a new application domain. To address this issue, we propose a novel framework called Spoof-aware one-class face anti-spoofing with Language Image Pretraining (SLIP). Given that live faces should ideally not be obscured by any spoof-attack-related objects (\eg, paper, or masks) and are assumed to yield zero spoof cue maps, we first propose an effective language-guided spoof cue map estimation to enhance one-class FAS models by simulating whether the underlying faces are covered by attack-related objects and generating corresponding nonzero spoof cue maps. Next, we introduce a novel prompt-driven liveness feature disentanglement to alleviate live/spoof-irrelative domain variations by disentangling live/spoof-relevant and domain-dependent information. Finally, we design an effective augmentation strategy by fusing latent features from live images and spoof prompts to generate spoof-like image features and thus diversify latent spoof features to facilitate the learning of one-class FAS. Our extensive experiments and ablation studies support that SLIP consistently outperforms previous one-class FAS methods.