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

Xin Zhao 0020

dblp:68/2766-20 · DBLP profile ↗
← Back
9ranked-venue papers
5as first author
1since 2021 · last 2026
0000-0001-5686-1975ORCID · conflict

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

Graphics, computer vision, multimedia, augmented reality and games · 7 · 4 first-authorArtificial intelligence and machine learning · 6 · 4 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
4 papers
Face, body and person analysis · 33% Representation and self-supervised learning · 31% Image recognition and object detection · 21%
Databases, data mining, and information retrieval
2 papers
Information retrieval · 100%
Computer graphics and multimedia
1 paper
Multimedia analysis and retrieval · 100%

Topics — the 10 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › Face, body and person analysis
pedestrian attribute recognition
0.722019
Recurrent Attention Model for Pedestrian Attribute Recognition · AAAI 2019
Grouping Attribute Recognition for Pedestrian with Joint Recurrent Learning · IJCAI 2018
Information retrieval
image retrieval
0.422018
On Trivial Solution and High Correlation Problems in Deep Supervised Hashing · AAAI 2018
TUCH: Turning Cross-view Hashing into Single-view Hashing via Generative Adversarial Nets · IJCAI 2017
Machine learning › Representation and self-supervised learning › representation learning › embedding learning
hash code learning
0.312018
On Trivial Solution and High Correlation Problems in Deep Supervised Hashing · AAAI 2018
Machine learning › Representation and self-supervised learning
hashing
0.312018
On Trivial Solution and High Correlation Problems in Deep Supervised Hashing · AAAI 2018
Machine learning › Transfer learning and domain adaptation › domain adaptation
unsupervised domain adaptation
0.312018
EmotionGAN: Unsupervised Domain Adaptation for Learning Discrete Probability Distributions of Image Emotions · ACM Multimedia 2018
Computer vision › Image recognition and object detection
visual emotion recognition
0.312018
EmotionGAN: Unsupervised Domain Adaptation for Learning Discrete Probability Distributions of Image Emotions · ACM Multimedia 2018
Information retrieval › hashing › supervised hashing
deep supervised hashing
0.312018
On Trivial Solution and High Correlation Problems in Deep Supervised Hashing · AAAI 2018
Multimedia analysis and retrieval
cross-modal retrieval
0.312017
TUCH: Turning Cross-view Hashing into Single-view Hashing via Generative Adversarial Nets · IJCAI 2017
Computer vision › Image recognition and object detection
attribute recognition
0.112019
Recurrent Attention Model for Pedestrian Attribute Recognition · AAAI 2019
Information retrieval › cross-modal retrieval
text-to-image retrieval
0.112017
TUCH: Turning Cross-view Hashing into Single-view Hashing via Generative Adversarial Nets · IJCAI 2017

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

recurrent neural network · 0.7triplet loss · 0.7pairwise loss · 0.7ensemble learning · 0.7convolutional neural network · 0.7language model · 0.6generative adversarial network · 0.6deep hashing · 0.6convolutional LSTM · 0.4attention model · 0.4feature extraction · 0.3body region proposal · 0.3adversarial domain adaptation · 0.3
YearPublicationVenuePosition
2026 Guest Editorial: Special Issue on Visual Datasets
Xin Zhao 0020, Qiang Qiu 0001, Limin Wang 0002, José Lezama, Qiuhong Ke, Yongchan Kwon, Ruoxi Jia 0001, Jungong Han
Int. J. Comput. Vis.1
2020 Discrete Probability Distribution Prediction of Image Emotions with Shared Sparse Learning
abstract
Computationally modelling the affective content of images has been extensively studied recently because of its wide applications in entertainment, advertisement, and education. Significant progress has been made on designing discriminative features to bridge the affective gap. Assuming that viewers can reach a consensus on the emotion of images, most existing works focused on assigning the dominant emotion category or the average dimension values to an image. However, the image emotions perceived by viewers are subjective by nature with the influence of personal and situational factors. In this paper, we propose a novel machine learning approach that characterizes the categorical image emotions as a discrete probability distribution (DPD). To associate emotion with the visual features extracted from images, we present shared sparse learning to learn the combination coefficients, with which the DPD of an unseen image is predicted by linearly combining the DPDs of the training images. Furthermore, we extend our method to the setup where multi-features are available and learn the optimal weights for each feature to reflect the importance of different features. Extensive experiments are carried out on Abstract, Emotion6 and IESN datasets and the results demonstrate the superiority of the proposed method, as compared to the state-of-the-art approaches.
Sicheng Zhao, Guiguang Ding, Yue Gao 0002, Xin Zhao 0020, Youbao Tang, Jungong Han, Hongxun Yao, Qingming Huang
IEEE Trans. Affect. Comput.4
2019 Recurrent Attention Model for Pedestrian Attribute Recognition
abstract
Pedestrian attribute recognition is to predict attribute labels of pedestrian from surveillance images, which is a very challenging task for computer vision due to poor imaging quality and small training dataset. It is observed that many semantic pedestrian attributes to be recognised tend to show spatial locality and semantic correlations by which they can be grouped while previous works mostly ignore this phenomenon. Inspired by Recurrent Neural Network (RNN)’s super capability of learning context correlations and Attention Model’s capability of highlighting the region of interest on feature map, this paper proposes end-to-end Recurrent Convolutional (RC) and Recurrent Attention (RA) models, which are complementary to each other. RC model mines the correlations among different attribute groups with convolutional LSTM unit, while RA model takes advantage of the intra-group spatial locality and inter-group attention correlation to improve the performance of pedestrian attribute recognition. Our RA method combines the Recurrent Learning and Attention Model to highlight the spatial position on feature map and mine the attention correlations among different attribute groups to obtain more precise attention. Extensive empirical evidence shows that our recurrent model frameworks achieve state-of-the-art results, based on pedestrian attribute datasets, i.e. standard PETA and RAP datasets.
Xin Zhao 0020, Liufang Sang, Guiguang Ding, Jungong Han, Na Di, Chenggang Yan 0001
AAAI1
2019 MEIAH: Mixing explicit and implicit formulation of attributes in binary representation for person re-identification
Liufang Sang, Xin Zhao 0020, Guiguang Ding
Multim. Tools Appl.2
2018 On Trivial Solution and High Correlation Problems in Deep Supervised Hashing
abstract
Deep supervised hashing (DSH), which combines binary learning and convolutional neural network, has attracted considerable research interests and achieved promising performance for highly efficient image retrieval. In this paper, we show that the widely used loss functions, pair-wise loss and triplet loss, suffer from the trivial solution problem and usually lead to highly correlated bits in practice, limiting the performance of DSH. One important reason is that it is difficult to incorporate proper constraints into the loss functions under the mini-batch based optimization algorithm. To tackle these problems, we propose to adopt ensemble learning strategy for deep model training. We found out that this simple strategy is capable of effectively decorrelating different bits, making the hashcodes more informative. Moreover, it is very easy to parallelize the training and support incremental model learning, which are very useful for real-world applications but usually ignored by existing DSH approaches. Experiments on benchmarks demonstrate the proposed ensemble based DSH can improve the performance of DSH approaches significant.
Xin Zhao 0020, Guiguang Ding, Jungong Han
AAAI2
2018 Grouping Attribute Recognition for Pedestrian with Joint Recurrent Learning
abstract
Pedestrian attributes recognition is to predict attribute labels of pedestrian from surveillance images, which is a very challenging task for computer vision due to poor imaging quality and small training dataset. It is observed that semantic pedestrian attributes to be recognised tend to show semantic or visual spatial correlation. Attributes can be grouped by the correlation while previous works mostly ignore this phenomenon. Inspired by Recurrent Neural Network (RNN)'s super capability of learning context correlations, this paper proposes an end-to-end Grouping Recurrent Learning (GRL) model that takes advantage of the intra-group mutual exclusion and inter-group correlation to improve the performance of pedestrian attribute recognition. Our GRL method starts with the detection of precise body region via Body Region Proposal followed by feature extraction from detected regions. These features, along with the semantic groups, are fed into RNN for recurrent grouping attribute recognition, where intra group correlations can be learned. Extensive empirical evidence shows that our GRL model achieves state-of-the-art results, based on pedestrian attribute datasets, i.e. standard PETA and RAP datasets.
Xin Zhao 0020, Liufang Sang, Guiguang Ding, Xiaoming Jin
IJCAI1
2018 EmotionGAN: Unsupervised Domain Adaptation for Learning Discrete Probability Distributions of Image Emotions
abstract
Deep neural networks have performed well on various benchmark vision tasks with large-scale labeled training data; however, such training data is expensive and time-consuming to obtain. Due to domain shift or dataset bias, directly transferring models trained on a large-scale labeled source domain to another sparsely labeled or unlabeled target domain often results in poor performance. In this paper, we consider the domain adaptation problem in image emotion recognition. Specifically, we study how to adapt the discrete probability distributions of image emotions from a source domain to a target domain in an unsupervised manner. We develop a novel adversarial model for emotion distribution learning, termed EmotionGAN, which alternately optimizes the Generative Adversarial Network (GAN) loss, semantic consistency loss, and regression loss. The EmotionGAN model can adapt source domain images such that they appear as if they were drawn from the target domain, while preserving the annotation information. Extensive experiments are conducted on the FlickrLDL and TwitterLDL datasets, and the results demonstrate the superiority of the proposed method as compared to state-of-the-art approaches.
Sicheng Zhao, Xin Zhao 0020, Guiguang Ding, Kurt Keutzer
ACM Multimedia2
2017 TUCH: Turning Cross-view Hashing into Single-view Hashing via Generative Adversarial Nets
abstract
Cross-view retrieval, which focuses on searching images as response to text queries or vice versa, has received increasing attention recently. Cross-view hashing is to efficiently solve the cross-view retrieval problem with binary hash codes. Most existing works on cross-view hashing exploit multi-view embedding method to tackle this problem, which inevitably causes the information loss in both image and text domains. Inspired by the Generative Adversarial Nets (GANs), this paper presents a new model that is able to Turn Cross-view Hashing into single-view hashing (TUCH), thus enabling the information of image to be preserved as much as possible. TUCH is a novel deep architecture that integrates a language model network T for text feature extraction, a generator network G to generate fake images from text feature and a hashing network H for learning hashing functions to generate compact binary codes. Our architecture effectively unifies joint generative adversarial learning and cross-view hashing. Extensive empirical evidence shows that our TUCH approach achieves state-of-the-art results, especially on text to image retrieval, based on image-sentences datasets, i.e. standard IAPRTC-12 and large-scale Microsoft COCO.
Xin Zhao 0020, Guiguang Ding, Jungong Han, Yue Gao 0002
IJCAI1
2017 Query expansion for object retrieval with active learning using BoW and CNN feature
Xin Zhao 0020, Guiguang Ding
Multim. Tools Appl.1