EDBT 2026 Demo / reviewers in the wild / expert
Ansheng You
dblp:245/9015
· DBLP profile ↗
8ranked-venue papers
2as first author
4since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 7 · 1 first-author · 3 since 2021Artificial intelligence and machine learning · 5 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 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
6 papers |
Segmentation and scene understanding · 26% Deep learning architectures and training · 19% Graph learning · 19% | |
| Computer graphics and multimedia
4 papers |
Visual content generation and editing · 83% Multimedia analysis and retrieval · 9% Computational photography and imaging · 8% |
Topics — the 12 heaviest of 18, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Segmentation and scene understanding
semantic segmentation |
0.9 | 2 | 2021 | Towards Efficient Scene Understanding via Squeeze Reasoning · IEEE Trans. Image Process. 2021 Semantic Flow for Fast and Accurate Scene Parsing · ECCV (1) 2020 |
Machine learning › Deep learning architectures and training › deep generative model
autoencoder-based generative model |
0.5 | 1 | 2021 | Towards Controllable and Photorealistic Region-wise Image Manipulation · ACM Multimedia 2021 |
Machine learning › Graph learning › graph neural network
graph convolutional network |
0.5 | 1 | 2021 | Extremely Compact Non-local Representation Learning · KDD 2021 |
Machine learning › Graph learning
graph reasoning |
0.5 | 1 | 2021 | Towards Efficient Scene Understanding via Squeeze Reasoning · IEEE Trans. Image Process. 2021 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › automated reasoning
high-order reasoning |
0.5 | 1 | 2021 | Extremely Compact Non-local Representation Learning · KDD 2021 |
Machine learning › Efficient and distributed learning › distributed training › distributed training systems
large-scale distributed training |
0.5 | 1 | 2021 | Once and for All: Self-supervised Multi-modal Co-training on One-billion Videos at Alibaba · ACM Multimedia 2021 |
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning › self-supervised representation learning
multimodal self-supervised learning |
0.5 | 1 | 2021 | Once and for All: Self-supervised Multi-modal Co-training on One-billion Videos at Alibaba · ACM Multimedia 2021 |
Visual content generation and editing
image editing |
0.5 | 1 | 2021 | Towards Controllable and Photorealistic Region-wise Image Manipulation · ACM Multimedia 2021 |
Computer vision › Segmentation and scene understanding
scene parsing |
0.4 | 1 | 2020 | Semantic Flow for Fast and Accurate Scene Parsing · ECCV (1) 2020 |
Visual content generation and editing › image generation
multi-modal image synthesis |
0.4 | 1 | 2020 | Semantically Multi-Modal Image Synthesis · CVPR 2020 |
Visual content generation and editing › image-to-image translation
semantic image synthesis |
0.4 | 1 | 2020 | Semantically Multi-Modal Image Synthesis · CVPR 2020 |
Multimedia analysis and retrieval › multimedia feature representation
video representation learning |
0.1 | 1 | 2021 | Once and for All: Self-supervised Multi-modal Co-training on One-billion Videos at Alibaba · ACM Multimedia 2021 |
Methods — techniques the papers use, named apart from their topics
sliding-window subset sampling · 1.0disentangled representation learning · 1.0cross-modal pseudo-label consistency · 1.0contrastive co-training · 1.0content alignment loss · 1.0code consistency loss · 1.0coarse-to-fine clustering · 1.0graph convolution network · 0.5global hadamard pooling · 0.5context graph reasoning · 0.5two-stage detection · 0.4reprojection · 0.4group convolution · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Extremely Compact Non-local Representation LearningabstractIn contrast to regular convolutions with local receptive fields, non-local operations have widely proven an effective method for modeling long-range dependencies. Although lots of prior works have been proposed, prohibitive computation and GPU memory occupation are still the major concerns. Different from that carrying out non-local operations pixel-wise or channel-wise in a computation intensive way, we argue that we can achieve effective non-local operation using a more compact high-order statistic, which can be computed more efficiently and may convey some high-level information. In this paper, we propose an extremely compact non-local learning module (CoNL) with high-order reasoning based on a graph convolution as the core. In our CoNL, a global Hadamard pooling (GHP) as a non-local operation is used to extract a compact second-order feature vector from the input tensor. With the help of a light-weight graph convolution network (GCN), this high-order compact vector is further refined with high-level reasoning. After the GCN refinement, the compact high-order vector intuitively indicates some global semantic characteristics, and is eventually applied to enhance the input tensor through a channel scaling operation. The CoNL module is designed easily pluggable to upgrade existing networks. Extensive experiments on a wide range of tasks demonstrate the effectiveness and efficiency of our work. The proposed CoNL can achieve comparable or superior performance over previous state-of-the-art baselines on video recognition, semantic segmentation, object detection and instance segmentation tasks. For a 96 x 96 x 2048 input, our block consumes 13.6 x less in computational cost than non-local block while 7.6 x smaller in GPU memory occupation. Ansheng You, Xiangzeng Zhou, Yingya Zhang |
KDD | 1 |
| 2021 | Once and for All: Self-supervised Multi-modal Co-training on One-billion Videos at AlibabaabstractVideos grow to be one of the largest mediums on the Internet. E-commerce platforms like Alibaba need to process millions of video data across multimedia (e.g., visual, audio, image, and text) and on a variety of tasks (e.g., retrieval, tagging, and summary) every day. In this work, we aim to develop a once and for all pretraining technique for diverse modalities and downstream tasks. To achieve this, we make the following contributions: (1) We propose a self-supervised multi-modal co-training framework. It takes cross-modal pseudo-label consistency as the supervision and can jointly learn representations of multiple modalities. (2) We introduce several novel techniques (e.g., sliding-window subset sampling, coarse-to-fine clustering, fast spatial-temporal convolution and parallel data transmission and processing) to optimize the training process, making billion-scale stable training feasible. (3) We construct a large-scale multi-modal dataset consisting of 1.4 billion videos (~0.5 PB) and train our framework on it. The training takes only 4.6 days on an in-house 256 GPUs cluster, and it simultaneously produces pretrained video, audio, image, motion, and text networks. (4) Finetuning from our pretrained models, we obtain significant performance gains and faster convergence on diverse multimedia tasks at Alibaba. Furthermore, we also validate the learned representation on public datasets. Despite the domain gap between our commodity-centric pretraining and the action-centric evaluation data, we show superior results against state-of-the-arts. Lianghua Huang, Yu Liu 0063, Xiangzeng Zhou, Ansheng You, Yingya Zhang |
ACM Multimedia | 4 |
| 2021 | Towards Controllable and Photorealistic Region-wise Image ManipulationabstractAdaptive and flexible image editing is a desirable function of modern generative models. In this work, we present a generative model with auto-encoder architecture for per-region style manipulation. We apply a code consistency loss to enforce an explicit disentanglement between content and style latent representations, making the content and style of generated samples consistent with their corresponding content and style references. The model is also constrained by a content alignment loss to ensure the foreground editing will not interfere background contents. As a result, given interested region masks provided by users, our model supports foreground region-wise style transfer. Specially, our model receives no extra annotations such as semantic labels except for self-supervision. Extensive experiments show the effectiveness of the proposed method and exhibit the flexibility of the proposed model for various applications, including region-wise style editing, latent space interpolation, cross-domain style transfer. Ansheng You, Chenglin Zhou, Qixuan Zhang, Lan Xu 0003 |
ACM Multimedia | 1 |
| 2021 | Towards Efficient Scene Understanding via Squeeze ReasoningabstractGraph-based convolutional model such as non-local block has shown to be effective for strengthening the context modeling ability in convolutional neural networks (CNNs). However, its pixel-wise computational overhead is prohibitive which renders it unsuitable for high resolution imagery. In this paper, we explore the efficiency of context graph reasoning and propose a novel framework called Squeeze Reasoning. Instead of propagating information on the spatial map, we first learn to squeeze the input feature into a channel-wise global vector and perform reasoning within the single vector where the computation cost can be significantly reduced. Specifically, we build the node graph in the vector where each node represents an abstract semantic concept. The refined feature within the same semantic category results to be consistent, which is thus beneficial for downstream tasks. We show that our approach can be modularized as an end-to-end trained block and can be easily plugged into existing networks. Despite its simplicity and being lightweight, the proposed strategy allows us to establish the considerable results on different semantic segmentation datasets and shows significant improvements with respect to strong baselines on various other scene understanding tasks including object detection, instance segmentation and panoptic segmentation. Code is available at https://github.com/lxtGH/SFSegNets. Xiangtai Li, Xia Li 0005, Ansheng You, Li Zhang 0040, Kuiyuan Yang, Yunhai Tong, Zhouchen Lin |
IEEE Trans. Image Process. | 3 |
| 2020 | Spherical Criteria for Fast and Accurate 360° Object DetectionabstractWith the advance of omnidirectional panoramic technology, 360◦ imagery has become increasingly popular in the past few years. To better understand the 360◦ content, many works resort to the 360◦ object detection and various criteria have been proposed to bound the objects and compute the intersection-over-union (IoU) between bounding boxes based on the common equirectangular projection (ERP) or perspective projection (PSP). However, the existing 360◦ criteria are either inaccurate or inefficient for real-world scenarios. In this paper, we introduce a novel spherical criteria for fast and accurate 360◦ object detection, including both spherical bounding boxes and spherical IoU (SphIoU). Based on the spherical criteria, we propose a novel two-stage 360◦ detector, i.e., Reprojection R-CNN, by combining the advantages of both ERP and PSP, yielding efficient and accurate 360◦ object detection. To validate the design of spherical criteria and Reprojection R-CNN, we construct two unbiased synthetic datasets for training and evaluation. Experimental results reveal that compared with the existing criteria, the two-stage detector with spherical criteria achieves the best mAP results under the same inference speed, demonstrating that the spherical criteria can be more suitable for 360◦ object detection. Moreover, Reprojection R-CNN outperforms the previous state-of-the-art methods by over 30% on mAP with competitive speed, which confirms the efficiency and accuracy of the design. Ansheng You, Yuanxing Zhang, Jiaying Liu 0001, Kaigui Bian, Yunhai Tong |
AAAI | 2 |
| 2020 | Semantically Multi-Modal Image SynthesisabstractIn this paper, we focus on semantically multi-modal image synthesis (SMIS) task, namely, generating multi-modal images at the semantic level. Previous work seeks to use multiple class-specific generators, constraining its usage in datasets with a small number of classes. We instead propose a novel Group Decreasing Network (GroupDNet) that leverages group convolutions in the generator and progressively decreases the group numbers of the convolutions in the decoder. Consequently, GroupDNet is armed with much more controllability on translating semantic labels to natural images and has plausible high-quality yields for datasets with many classes. Experiments on several challenging datasets demonstrate the superiority of GroupDNet on performing the SMIS task. We also show that GroupDNet is capable of performing a wide range of interesting synthesis applications. Codes and models are available at: https://github.com/Seanseattle/SMIS. Zhen Zhu 0006, Ansheng You, Xiang Bai |
CVPR | 3 |
| 2020 | Semantic Flow for Fast and Accurate Scene Parsing
Xiangtai Li, Ansheng You, Zhen Zhu 0006, Houlong Zhao, Maoke Yang, Kuiyuan Yang, Shaohua Tan, Yunhai Tong |
ECCV (1) | 2 |
| 2019 | Global Aggregation then Local Distribution in Fully Convolutional Networks
Xiangtai Li, Li Zhang 0040, Ansheng You, Maoke Yang, Kuiyuan Yang, Yunhai Tong |
BMVC | 3 |