Tai-Ming Huang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Tai-Ming Huang has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Kai-Lung Hua
National Taiwan University of Science and Technology
5 shared publications - Jilyan Dy
Department of Computer Science and Information Engineering, National Taiwan University of Science and Technology, Taipei, Taiwan
2 shared publications - Julianne Tan
National Taiwan University of Science and Technology,Dept. CSIE.,Taipei,Taiwan,106
2 shared publications - Jun-Cheng Chen
Academia Sinica, Taipei, Taiwan
2 shared publications - Ernie Chu
Academia Sinica
1 shared publication - Junichi Yamagishi
National Institute of Informatics, Tokyo, Japan
1 shared publication
Latest Publications
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 17814-17820
A Two-Stage Agentic Framework for Explainable Deepfake Detection in the 2026 ACM Multimedia TRIDENT Image Track
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 17814-17820
Open AccessA Two-Stage Agentic Framework for Explainable Deepfake Detection in the 2026 ACM Multimedia TRIDENT Image Track
- 4 December 2024
- Published by Springer Nature
- p. 194-210
Generalized Image-Based Deepfake Detection Through Foundation Model Adaptation
- 4 December 2024
- Published by Springer Nature
- p. 194-210
Generalized Image-Based Deepfake Detection Through Foundation Model Adaptation
- 6 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 407-408
A Data Hiding Scheme Based On Absolute Moment Block Truncation Coding and Lookup Table
This research proposes a data hiding scheme which uses absolute moment block truncation coding (AMBTC) for image compression, and generates a reference lookup table which has a one-to-many relationship between the hidden data and the candidate bitmaps of the compressed image. When embedding data, the candidate blocks that match the hidden data are filtered through mean square error (MSE) function to select the optimal block. From the preliminary experiments, we prove that the proposed method is superior to other data hiding method in terms of data hiding ability and image visual quality.
- 6 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 407-408
A Data Hiding Scheme Based On Absolute Moment Block Truncation Coding and Lookup Table
This research proposes a data hiding scheme which uses absolute moment block truncation coding (AMBTC) for image compression, and generates a reference lookup table which has a one-to-many relationship between the hidden data and the candidate bitmaps of the compressed image. When embedding data, the candidate blocks that match the hidden data are filtered through mean square error (MSE) function to select the optimal block. From the preliminary experiments, we prove that the proposed method is superior to other data hiding method in terms of data hiding ability and image visual quality.
- 24 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE MultiMedia
- Vol. 29 (4) , 59-68
Unpaired Image-to-Image Translation Using Negative Learning for Noisy Patches
Unpaired image-to-image translation finds a mapping between two domains that do not have paired data. One approach is patchwise contrastive learning, a one-sided translation that maximizes mutual information between corresponding input and output patches. Non-corresponding patches are treated as negatives. Previous approaches randomly select non-corresponding patches, resulting in semantically similar patches incorrectly labeled as negatives. Inspired by negative learning, we propose the novel patch-wise negative learning loss to address this issue. We do not naively minimize mutual information between all non-corresponding ones, unlike prior methods. Instead, we choose one non-corresponding patch and maximize dissimilarity with the query patch. The selected non-corresponding patch reduces the chance of choosing false negatives that contain high mutual information. By further maximizing dissimilarity with that single negative, we discourage our model from fitting on noisy negative patches. We demonstrate the capabilities of our model against other prominent image translation methods on the selfie2anime, horse2zebra, and cat2dog datasets.
- 24 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE MultiMedia
- Vol. 29 (4) , 59-68
Unpaired Image-to-Image Translation Using Negative Learning for Noisy Patches
Unpaired image-to-image translation finds a mapping between two domains that do not have paired data. One approach is patchwise contrastive learning, a one-sided translation that maximizes mutual information between corresponding input and output patches. Non-corresponding patches are treated as negatives. Previous approaches randomly select non-corresponding patches, resulting in semantically similar patches incorrectly labeled as negatives. Inspired by negative learning, we propose the novel patch-wise negative learning loss to address this issue. We do not naively minimize mutual information between all non-corresponding ones, unlike prior methods. Instead, we choose one non-corresponding patch and maximize dissimilarity with the query patch. The selected non-corresponding patch reduces the chance of choosing false negatives that contain high mutual information. By further maximizing dissimilarity with that single negative, we discourage our model from fitting on noisy negative patches. We demonstrate the capabilities of our model against other prominent image translation methods on the selfie2anime, horse2zebra, and cat2dog datasets.
- 24 March 2022
- Published by Springer Nature in Neural Computing and Applications
- Vol. 34 (15) , 12861-12874
VDNet: video deinterlacing network based on coarse adaptive module and deformable recurrent residual network
- 24 March 2022
- Published by Springer Nature in Neural Computing and Applications
- Vol. 34 (15) , 12861-12874
VDNet: video deinterlacing network based on coarse adaptive module and deformable recurrent residual network