Densely Connected Convolutional Networks

被引:23427
作者
Huang, Gao [1 ]
Liu, Zhuang [2 ]
van der Maaten, Laurens [3 ]
Weinberger, Kilian Q. [1 ]
机构
[1] Cornell Univ, Ithaca, NY 14853 USA
[2] Tsinghua Univ, Beijing, Peoples R China
[3] Facebook AI Res, Menlo Pk, CA USA
来源
30TH IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2017) | 2017年
基金
中国国家自然科学基金; 美国国家科学基金会;
关键词
D O I
10.1109/CVPR.2017.243
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Recent work has shown that convolutional networks can be substantially deeper, more accurate, and efficient to train if they contain shorter connections between layers close to the input and those close to the output. In this paper, we embrace this observation and introduce the Dense Convolutional Network (DenseNet), which connects each layer to every other layer in a feed-forward fashion. Whereas traditional convolutional networks with L layers have L connections-one between each layer and its subsequent layer-our network has L(L+1)/2 direct connections. For each layer, the feature-maps of all preceding layers are used as inputs, and its own feature-maps are used as inputs into all subsequent layers. DenseNets have several compelling advantages: they alleviate the vanishing-gradient problem, strengthen feature propagation, encourage feature reuse, and substantially reduce the number of parameters. We evaluate our proposed architecture on four highly competitive object recognition benchmark tasks (CIFAR-10, CIFAR-100, SVHN, and ImageNet). DenseNets obtain significant improvements over the state-of-the-art on most of them, whilst requiring less computation to achieve high performance. Code and pre-trained models are available at https://github.com/liuzhuang13/DenseNet.
引用
收藏
页码:2261 / 2269
页数:9
相关论文
共 42 条
  • [1] [Anonymous], 2015, CVPR
  • [2] [Anonymous], 2014, ICLR
  • [3] [Anonymous], 2015, ICCV
  • [4] [Anonymous], 2015, INAISTATS
  • [5] [Anonymous], 2016, BMVC
  • [6] [Anonymous], 2016, CoRR
  • [7] [Anonymous], LEARNING MULTIPLE LA
  • [8] [Anonymous], 2011, NEURAL INFORM PROCES
  • [9] [Anonymous], 2009, PROC IEEE C COMPUT V
  • [10] [Anonymous], 2011, AISTATS