Conference paper Open Access
Learning Short-Cut Connections for Object Counting
Daniel Oñoro-Rubio; Mathias Niepert; Roberto J. López-Sastre
Object counting is an important task in computer vision due to its growing demand in applications such as traffic monitoring or surveillance. In this paper, we consider object counting as a learning problem of a joint feature extraction and pixel-wise object density estimation with Convolutional-Deconvolutional networks. We introduce a novel counting model, named Gated U-Net (GU-Net). Specifically, we propose to enrich the U-Net architecture with the concept of learnable short-cut connections. Standard short-cut connections are connections between layers in deep neural networks which skip at least one intermediate layer. Instead of simply setting short-cut connections, we propose to learn these connections from data. Therefore, our short-cuts can work as gating units, which optimize the flow of information between convolutional and deconvolutional layers in the U-Net architecture. We evaluate the introduced GU-Net architecture on three commonly used benchmark data sets for object counting. GU-Nets consistently outperform the base U-Net architecture, and achieve state-of-the-art performance.
| Name | Size | |
|---|---|---|
|
Onoro-Rubio_Learning Short-Cut Connections for Object.pdf
md5:9974e8667992b03179bfee5dfeb4bb28 |
1.9 MB | Download |
| All versions | This version | |
|---|---|---|
| Views | 25 | 25 |
| Downloads | 19 | 19 |
| Data volume | 35.9 MB | 35.9 MB |
| Unique views | 24 | 24 |
| Unique downloads | 17 | 17 |
- Publication date:
- November 15, 2018
- DOI:
-
- Grants:
-
European Commission:
- 5GCITY - 5GCITY (761508)
- Meeting:
- BMBC 2018
- Communities:
- License (for files):
- Creative Commons Attribution 4.0 International