Kuan-Chuan Peng

Kuan-Chuan Peng

Auto-generated profile, based on publicly available information

Kuan-Chuan Peng

Mitsubishi Electric Research Laboratories

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
19 November 2020
Verified
Book Chapter
Closed access
PDF file
SVShashanka Venkataramanan
Shashanka Venkataramanan
KPKuan-Chuan Peng
Kuan-Chuan Peng
RSRajat Vikram Singh
Rajat Vikram Singh
AMAbhijit Mahalanobis
Abhijit Mahalanobis

6 October 2018
Verified
Book Chapter
Closed access
PDF file
KPKuan-Chuan Peng
Kuan-Chuan Peng
ZWZiyan Wu
Ziyan Wu
JEJan Ernst
Jan Ernst

23 February 2021 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
MKMohammed Kutbi
Mohammed Kutbi
KPKuan-Chuan Peng
Kuan-Chuan Peng
ZWZiyan Wu
Ziyan Wu
Domain Adaptation aims at adapting the knowledge learned from a domain (source-domain) to another (target-domain). Existing approaches typically require a portion of task-relevant target-domain data a priori. We propose an approach, zero-shot deep domain adaptation (ZDDA), which uses paired dual-domain task-irrelevant data to eliminate the need for task-relevant target-domain training data. ZDDA learns to generate common representations for source and target domains data. Then, either domain representation is used later to train a system that works on both domains or having the ability to eliminate the need to either domain in sensor fusion settings. Two variants of ZDDA have been developed: ZDDA for classification task (ZDDA-C) and ZDDA for metric learning task (ZDDA-ML). Another limitation in Existing approaches is that most of them are designed for the closed-set classification task, i.e., the sets of classes in both the source and target domains are ‘`known." However, ZDDA-C is also applicable to the open-set classification task where not all classes are ``known" during training. Moreover, the effectiveness of ZDDA-ML shows ZDDA’s applicability is not limited to classification tasks. ZDDA-C and ZDDA-ML are tested on classification and metric-learning tasks, respectively. Under most experimental conditions, ZDDA outperforms the baseline without using task-relevant target-domain-training data.

22 October 2022
Verified
Book Chapter
Closed access
PDF file
SASk Miraj Ahmed
Sk Miraj Ahmed
SLSuhas Lohit
Suhas Lohit
KPKuan-Chuan Peng
Kuan-Chuan Peng
MJMichael J. Jones
Michael J. Jones
ARAmit K. Roy-Chowdhury
Amit K. Roy-Chowdhury

11 September 2023 in arXiv
Verified
Preprint
Open access
PDF file
Anoop CherianAnoop Cherian
Anoop Cherian
KPKuan-Chuan Peng
Kuan-Chuan Peng
SLSuhas Lohit
Suhas Lohit
KSKevin A. Smith
Kevin A. Smith
JTJoshua B. Tenenbaum
Joshua B. Tenenbaum
Recent times have witnessed an increasing number of applications of deep neural networks towards solving tasks that require superior cognitive abilities, e.g., playing Go, generating art, ChatGPT, etc. Such a dramatic progress raises the question: how generalizable are neural networks in solving problems that demand broad skills? To answer this question, we propose SMART: a Simple Multimodal Algorithmic Reasoning Task and the associated SMART-101 dataset, for evaluating the abstraction, deduction, and generalization abilities of neural networks in solving visuo-linguistic puzzles designed specifically for children in the 6--8 age group. Our dataset consists of 101 unique puzzles; each puzzle comprises a picture and a question, and their solution needs a mix of several elementary skills, including arithmetic, algebra, and spatial reasoning, among others. To scale our dataset towards training deep neural networks, we programmatically generate entirely new instances for each puzzle, while retaining their solution algorithm. To benchmark performances on SMART-101, we propose a vision and language meta-learning model using varied state-of-the-art backbones. Our experiments reveal that while powerful deep models offer reasonable performances on puzzles in a supervised setting, they are not better than random accuracy when analyzed for generalization. We also evaluate the recent ChatGPT and other large language models on a subset of SMART-101 and find that while these models show convincing reasoning abilities, the answers are often incorrect.

17 July 2020 in arXiv
Verified
Preprint
Open access
PDF file
SVShashanka Venkataramanan
Shashanka Venkataramanan
KPKuan-Chuan Peng
Kuan-Chuan Peng
RSRajat Vikram Singh
Rajat Vikram Singh
AMAbhijit Mahalanobis
Abhijit Mahalanobis
Anomaly localization is an important problem in computer vision which involves localizing anomalous regions within images with applications in industrial inspection, surveillance, and medical imaging. This task is challenging due to the small sample size and pixel coverage of the anomaly in real-world scenarios. Most prior works need to use anomalous training images to compute a class-specific threshold to localize anomalies. Without the need of anomalous training images, we propose Convolutional Adversarial Variational autoencoder with Guided Attention (CAVGA), which localizes the anomaly with a convolutional latent variable to preserve the spatial information. In the unsupervised setting, we propose an attention expansion loss where we encourage CAVGA to focus on all normal regions in the image. Furthermore, in the weakly-supervised setting we propose a complementary guided attention loss, where we encourage the attention map to focus on all normal regions while minimizing the attention map corresponding to anomalous regions in the image. CAVGA outperforms the state-of-the-art (SOTA) anomaly localization methods on MVTec Anomaly Detection (MVTAD), modified ShanghaiTech Campus (mSTC) and Large-scale Attention based Glaucoma (LAG) datasets in the unsupervised setting and when using only 2% anomalous images in the weakly-supervised setting. CAVGA also outperforms SOTA anomaly detection methods on the MNIST, CIFAR-10, Fashion-MNIST, MVTAD, mSTC and LAG datasets.