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

Hui Zhu 0002

dblp:85/2110-2 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
1since 2021 · last 2021
0000-0002-0056-3220ORCID · conflict

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

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

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
1 paper
Deep learning architectures and training · 61% Image recognition and object detection · 30% Trustworthy machine learning · 9%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
convolutional neural network
0.412020
Gated Convolutional Networks with Hybrid Connectivity for Image Classification · AAAI 2020
Machine learning › Deep learning architectures and training › convolutional neural network
dense connectivity
0.412020
Gated Convolutional Networks with Hybrid Connectivity for Image Classification · AAAI 2020
Computer vision › Image recognition and object detection
image classification
0.412020
Gated Convolutional Networks with Hybrid Connectivity for Image Classification · AAAI 2020
Machine learning › Trustworthy machine learning
robustness
0.112020
Gated Convolutional Networks with Hybrid Connectivity for Image Classification · AAAI 2020

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

hybrid connectivity · 0.4gated convolution · 0.4depthwise convolution · 0.4attention module · 0.4
YearPublicationVenuePosition
2021 Towards Compressing Efficient Generative Adversarial Networks for Image Translation via Pruning and Distilling
Luqi Gong, Chao Li 0028, Hailong Hong, Hui Zhu 0002, Tangwen Qian, Yongjun Xu 0001
ICANN (2)4
2020 Gated Convolutional Networks with Hybrid Connectivity for Image Classification
abstract
We propose a simple yet effective method to reduce the redundancy of DenseNet by substantially decreasing the number of stacked modules by replacing the original bottleneck by our SMG module, which is augmented by local residual. Furthermore, SMG module is equipped with an efficient two-stage pipeline, which aims to DenseNet-like architectures that need to integrate all previous outputs, i.e., squeezing the incoming informative but redundant features gradually by hierarchical convolutions as a hourglass shape and then exciting it by multi-kernel depthwise convolutions, the output of which would be compact and hold more informative multi-scale features. We further develop a forget and an update gate by introducing the popular attention modules to implement the effective fusion instead of a simple addition between reused and new features. Due to the Hybrid Connectivity (nested combination of global dense and local residual) and Gated mechanisms, we called our network as the HCGNet. Experimental results on CIFAR and ImageNet datasets show that HCGNet is more prominently efficient than DenseNet, and can also significantly outperform state-of-the-art networks with less complexity. Moreover, HCGNet also shows the remarkable interpretability and robustness by network dissection and adversarial defense, respectively. On MS-COCO, HCGNet can consistently learn better features than popular backbones.
Chuanguang Yang, Zhulin An, Hui Zhu 0002, Kun Zhang 0045, Kaiqiang Xu, Chao Li 0028, Yongjun Xu 0001
AAAI3
2020 DRNet: Dissect and Reconstruct the Convolutional Neural Network via Interpretable Manners
abstract
Convolutional neural networks (ConvNets) are widely used in real life. People usually use ConvNets which pre-trained on a fixed number of classes. However, for different application scenarios, we usually do not need all of the classes, which means ConvNets are redundant when dealing with these tasks. This paper focuses on the redundancy of ConvNet channels. We proposed a novel idea: using an interpretable manner to find the most important channels for every single class (dissect), and dynamically run channels according to classes in need (reconstruct). For VGG16 pre-trained on CIFAR-10, we only run 11\% parameters for two-classes sub-tasks on average with negligible accuracy loss. For VGG16 pre-trained on ImageNet, our method averagely gains 14.29\% accuracy promotion for two-classes sub-tasks. In addition, analysis show that our method captures some semantic meanings of channels, and uses the context information more targeted for sub-tasks of ConvNets.
Zhulin An, Chuanguang Yang, Hui Zhu 0002, Kaiqiang Xu, Yongjun Xu 0001
ECAI4
2020 Towards More Efficient And Effective Inference: The Joint Decision Of Multi-Participants
abstract
Existing approaches to improve the performances of convolutional neural networks by optimizing the local architectures or deepening the networks tend to increase the size of models significantly. In order to deploy and apply the neural networks to edge devices which are in great demand, reducing the scale of networks is quite crucial. However, It is easy to degrade the performance of image processing by compressing the networks. In this paper, we propose a method which is suitable for edge devices while improving the efficiency and effectiveness of inference. The joint decision of multiparticipants, mainly contain multi-layers and multi-networks, can achieve higher classification accuracy (0.26% on CFAR-10 and 4.49% on CFAR-100 at most) with similar total number of parameters for classical convolutional neural networks.
Hui Zhu 0002, Zhulin An, Kaiqiang Xu, Yongjun Xu 0001
ICIP1
2020 HLNet: Modeling High and Low Frequencies for Scene Parsing
abstract
In this paper we propose to model high and low frequencies of segmentation map, based on the observation that the map can be seen as a mixture of different frequencies. Based on the sparsity of high frequencies and local similarity of low frequencies, we design special building blocks and further a novel High and Low frequency Network (HLNet) with two branches based on FCN to predict high and low frequencies of the segmentation map, respectively. Specifically, we design a high frequency branch with a small kernel size and high-resolution features to predict a sparse high frequency component. Mean-while, a low frequency branch with similarity computing and low-resolution features is employed to predict a low frequency component. On top of two branches, we combine two different frequency components to generate final result for scene parsing. We empirically demonstrate that the designed model achieves superior performance 44.07% on ADE20K, and 80.14% mIoU on Cityscapes datasets.
Kaiqiang Xu, Zhulin An, Hui Zhu 0002, Yongjun Xu 0001
IJCNN3
2020 Efficient Search for the Number of Channels for Convolutional Neural Networks
abstract
Latest algorithms for automatic neural architecture search perform remarkably but few of them can effectively design the number of channels for convolutional neural networks and consume less computational efforts. In this paper, we propose a method for efficient automatic search which is special to the widths of networks instead of the connections within neural architectures. Our method, functionally incremental search based on function-preserving, will explore the number of channels for almost any convolutional neural network rapidly while controlling the number of parameters and even the amount of computations (FLOPs). On CIFAR-10 and CIFAR-100 classification, our method using minimal computational resources (0.41 ~ 1.29 GPU-days) can discover more effective rules of the widths of networks to improve the accuracy (a ~ 1.08 on CIFAR-10 and b ~ 2.33 on CIFAR-100) with fewer number of parameters.
Hui Zhu 0002, Zhulin An, Chuanguang Yang, Kaiqiang Xu, Yongjun Xu 0001
IJCNN1