Julianne Tan

Julianne Tan

Auto-generated profile, based on publicly available information

Julianne Tan

National Taiwan University of Science and Technology,Dept. CSIE.,Taipei,Taiwan,106

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
24 May 2022 in IEEE MultiMedia
Verified
Journal Article
Closed access
YHYu-Hsiang Hung
Yu-Hsiang Hung
JTJulianne Tan
Julianne Tan
THTai-Ming Huang
Tai-Ming Huang
SHShang-Che Hsu
Shang-Che Hsu
YCYi-Ling Chen
Yi-Ling Chen
KHKai-Lung Hua
Kai-Lung Hua
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.

6 July 2022
Verified
Conference Paper
Closed access
TYTing-Kai Yang
Ting-Kai Yang
SCShang-Fu Chen
Shang-Fu Chen
THTai-Ming Huang
Tai-Ming Huang
JTJulianne Tan
Julianne Tan
JDJilyan Dy
Jilyan Dy
KHKai-Lung Hua
Kai-Lung Hua
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.