Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yu-Ting Chang

dblp:131/0013 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
1since 2021 · last 2021
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 5 · 3 first-authorArtificial intelligence and machine learning · 3 · 2 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Segmentation and scene understanding · 64% Face, body and person analysis · 36%
Databases, data mining, and information retrieval
2 papers
Recommender systems · 46% Data mining · 40% Web and social media mining · 14%
Computer graphics and multimedia
1 paper
Visual content generation and editing · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%

Topics — the 5 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Visual content generation and editing › image generation › stylized image generation
caricature generation
0.512021
Learning to Caricature via Semantic Shape Transform · Int. J. Comput. Vis. 2021
Computer vision › Segmentation and scene understanding
semantic segmentation
0.412020
Weakly-Supervised Semantic Segmentation via Sub-Category Exploration · CVPR 2020
Computer vision › Segmentation and scene understanding › semantic segmentation
weakly supervised semantic segmentation
0.412020
Weakly-Supervised Semantic Segmentation via Sub-Category Exploration · CVPR 2020
Recommender systems
fashion recommendation
0.312018
What Dress Fits Me Best?: Fashion Recommendation on the Clothing Style for Personal Body Shape · ACM Multimedia 2018
Data mining › spatiotemporal data mining
geo-tagged photo analysis
0.312017
Fashion World Map: Understanding Cities Through Streetwear Fashion · ACM Multimedia 2017

Methods — techniques the papers use, named apart from their topics

semantic correspondence · 1.0image warping · 1.0prize-collecting steiner tree · 0.6deep neural network · 0.6pseudo-labeling · 0.4clustering · 0.4
YearPublicationVenuePosition
2021 Learning to Caricature via Semantic Shape Transform
abstract
Abstract Caricature is an artistic drawing created to abstract or exaggerate facial features of a person. Rendering visually pleasing caricatures is a difficult task that requires professional skills, and thus it is of great interest to design a method to automatically generate such drawings. To deal with large shape changes, we propose an algorithm based on a semantic shape transform to produce diverse and plausible shape exaggerations. Specifically, we predict pixel-wise semantic correspondences and perform image warping on the input photo to achieve dense shape transformation. We show that the proposed framework is able to render visually pleasing shape exaggerations while maintaining their facial structures. In addition, our model allows users to manipulate the shape via the semantic map. We demonstrate the effectiveness of our approach on a large photograph-caricature benchmark dataset with comparisons to the state-of-the-art methods.
Wenqing Chu, Wei-Chih Hung, Yi-Hsuan Tsai, Yu-Ting Chang, Yijun Li 0001, Deng Cai 0001, Ming-Hsuan Yang 0001
Int. J. Comput. Vis.4
2020 Mixup-CAM: Weakly-supervised Semantic Segmentation via Uncertainty Regularization
Yu-Ting Chang, Qiaosong Wang, Wei-Chih Hung, Robinson Piramuthu, Yi-Hsuan Tsai, Ming-Hsuan Yang 0001
BMVC1
2020 Weakly-Supervised Semantic Segmentation via Sub-Category Exploration
abstract
Existing weakly-supervised semantic segmentation methods using image-level annotations typically rely on initial responses to locate object regions. However, such response maps generated by the classification network usually focus on discriminative object parts, due to the fact that the network does not need the entire object for optimizing the objective function. To enforce the network to pay attention to other parts of an object, we propose a simple yet effective approach that introduces a self-supervised task by exploiting the sub-category information. Specifically, we perform clustering on image features to generate pseudo sub-categories labels within each annotated parent class, and construct a sub-category objective to assign the network to a more challenging task. By iteratively clustering image features, the training process does not limit itself to the most discriminative object parts, hence improving the quality of the response maps. We conduct extensive analysis to validate the proposed method and show that our approach performs favorably against the state-of-the-art approaches.
Yu-Ting Chang, Qiaosong Wang, Wei-Chih Hung, Robinson Piramuthu, Yi-Hsuan Tsai, Ming-Hsuan Yang 0001
CVPR1
2020 Image Hashing via Linear Discriminant Learning
abstract
Hashing has attracted attention in recent years due to the rapid growth of image and video data on the web. Benefiting from recent advances in deep learning, deep supervised hashing has achieved promising results for image retrieval. However, existing methods are either less efficient in data usage or incapable of learning linearly discriminative binary codes. In this paper, we revisit linear discriminative analysis and propose a linear discriminative hashing (LDH) objective that is efficient in training and achieves better accuracy in retrieval. With the joint supervision of a classification loss, we design a robust deep network to obtain binary codes that are inter-class separable and intra-class compact, which provides better representations for image retrieval. We conduct extensive experiments on three benchmark datasets, and our LDH algorithm performs favorably against existing state-of-the-art deep supervised hashing methods.
Weixiang Hong 0001, Yu-Ting Chang, Haifang Qin, Wei-Chih Hung, Yi-Hsuan Tsai, Ming-Hsuan Yang 0001
WACV2
2018 What Dress Fits Me Best?: Fashion Recommendation on the Clothing Style for Personal Body Shape
abstract
Clothing is an integral part of life. Also, it is always an uneasy task for people to make decisions on what to wear. An essential style tip is to dress for the body shape, i.e., knowing one's own body shape (e.g., hourglass, rectangle, round and inverted triangle) and selecting the types of clothes that will accentuate the body's good features. In the literature, although various fashion recommendation systems for clothing items have been developed, none of them had explicitly taken the user's basic body shape into consideration. In this paper, therefore, we proposed a first framework for learning the compatibility of clothing styles and body shapes from social big data, with the goal to recommend a user about what to wear better in relation to his/her essential body attributes. The experimental results demonstrate the superiority of our proposed approach, leading to a new aspect for research into fashion recommendation.
Shintami Chusnul Hidayati, Cheng-Chun Hsu, Yu-Ting Chang, Kai-Lung Hua, Jianlong Fu, Wen-Huang Cheng
ACM Multimedia3
2017 Fashion World Map: Understanding Cities Through Streetwear Fashion
abstract
Fashion is an integral part of life. Streets as a social center for people's interaction become the most important public stage to showcase the fashion culture of a metropolitan area. In this paper, therefore, we propose a novel framework based on deep neural networks (DNN) for depicting the street fashion of a city by automatically discovering fashion items (e.g., jackets) in a particular look that are most iconic for the city, directly from a large collection of geo-tagged street fashion photos. To obtain a reasonable collection of iconic items, our task is formulated as the prize-collecting Steiner tree (PCST) problem, whereby a visually intuitive summary of the world's iconic street fashion can be created. To the best of our knowledge, this is the first work devoted to investigate the world's fashion landscape in modern times through the visual analytics of big social data. It shows how the visual impression of local fashion cultures across the world can be depicted, modeled, analyzed, compared, and exploited. In the experiments, our approach achieves the best performance (43.19%) on our large collected GSFashion dataset (170K photos), with an average of two times higher than all the other algorithms (FII: 20.13%, AP: 18.76%, DC: 17.90%), in terms of the users' agreement ratio on the discovered iconic fashion items of a city. The potential of our proposed framework for advanced sociological understanding is also demonstrated via practical applications.
Yu-Ting Chang, Wen-Huang Cheng, Bo Wu 0018, Kai-Lung Hua
ACM Multimedia1