Cargando…

Redesigned Skip-Network for Crowd Counting with Dilated Convolution and Backward Connection

Crowd counting is a challenging task dealing with the variation of an object scale and a crowd density. Existing works have emphasized on skip connections by integrating shallower layers with deeper layers, where each layer extracts features in a different object scale and crowd density. However, on...

Descripción completa

Detalles Bibliográficos
Autores principales: Sooksatra, Sorn, Kondo, Toshiaki, Bunnun, Pished, Yoshitaka, Atsuo
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2020
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8321029/
https://www.ncbi.nlm.nih.gov/pubmed/34460730
http://dx.doi.org/10.3390/jimaging6050028
_version_ 1783730754299101184
author Sooksatra, Sorn
Kondo, Toshiaki
Bunnun, Pished
Yoshitaka, Atsuo
author_facet Sooksatra, Sorn
Kondo, Toshiaki
Bunnun, Pished
Yoshitaka, Atsuo
author_sort Sooksatra, Sorn
collection PubMed
description Crowd counting is a challenging task dealing with the variation of an object scale and a crowd density. Existing works have emphasized on skip connections by integrating shallower layers with deeper layers, where each layer extracts features in a different object scale and crowd density. However, only high-level features are emphasized while ignoring low-level features. This paper proposes an estimation network by passing high-level features to shallow layers and emphasizing its low-level feature. Since an estimation network is a hierarchical network, a high-level feature is also emphasized by an improved low-level feature. Our estimation network consists of two identical networks for extracting a high-level feature and estimating the final result. To preserve semantic information, dilated convolution is employed without resizing the feature map. Our method was tested in three datasets for counting humans and vehicles in a crowd image. The counting performance is evaluated by mean absolute error and root mean squared error indicating the accuracy and robustness of an estimation network, respectively. The experimental result shows that our network outperforms other related works in a high crowd density and is effective for reducing over-counting error in the overall case.
format Online
Article
Text
id pubmed-8321029
institution National Center for Biotechnology Information
language English
publishDate 2020
publisher MDPI
record_format MEDLINE/PubMed
spelling pubmed-83210292021-08-26 Redesigned Skip-Network for Crowd Counting with Dilated Convolution and Backward Connection Sooksatra, Sorn Kondo, Toshiaki Bunnun, Pished Yoshitaka, Atsuo J Imaging Article Crowd counting is a challenging task dealing with the variation of an object scale and a crowd density. Existing works have emphasized on skip connections by integrating shallower layers with deeper layers, where each layer extracts features in a different object scale and crowd density. However, only high-level features are emphasized while ignoring low-level features. This paper proposes an estimation network by passing high-level features to shallow layers and emphasizing its low-level feature. Since an estimation network is a hierarchical network, a high-level feature is also emphasized by an improved low-level feature. Our estimation network consists of two identical networks for extracting a high-level feature and estimating the final result. To preserve semantic information, dilated convolution is employed without resizing the feature map. Our method was tested in three datasets for counting humans and vehicles in a crowd image. The counting performance is evaluated by mean absolute error and root mean squared error indicating the accuracy and robustness of an estimation network, respectively. The experimental result shows that our network outperforms other related works in a high crowd density and is effective for reducing over-counting error in the overall case. MDPI 2020-05-02 /pmc/articles/PMC8321029/ /pubmed/34460730 http://dx.doi.org/10.3390/jimaging6050028 Text en © 2020 by the authors. https://creativecommons.org/licenses/by/4.0/Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/ (https://creativecommons.org/licenses/by/4.0/) ).
spellingShingle Article
Sooksatra, Sorn
Kondo, Toshiaki
Bunnun, Pished
Yoshitaka, Atsuo
Redesigned Skip-Network for Crowd Counting with Dilated Convolution and Backward Connection
title Redesigned Skip-Network for Crowd Counting with Dilated Convolution and Backward Connection
title_full Redesigned Skip-Network for Crowd Counting with Dilated Convolution and Backward Connection
title_fullStr Redesigned Skip-Network for Crowd Counting with Dilated Convolution and Backward Connection
title_full_unstemmed Redesigned Skip-Network for Crowd Counting with Dilated Convolution and Backward Connection
title_short Redesigned Skip-Network for Crowd Counting with Dilated Convolution and Backward Connection
title_sort redesigned skip-network for crowd counting with dilated convolution and backward connection
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8321029/
https://www.ncbi.nlm.nih.gov/pubmed/34460730
http://dx.doi.org/10.3390/jimaging6050028
work_keys_str_mv AT sooksatrasorn redesignedskipnetworkforcrowdcountingwithdilatedconvolutionandbackwardconnection
AT kondotoshiaki redesignedskipnetworkforcrowdcountingwithdilatedconvolutionandbackwardconnection
AT bunnunpished redesignedskipnetworkforcrowdcountingwithdilatedconvolutionandbackwardconnection
AT yoshitakaatsuo redesignedskipnetworkforcrowdcountingwithdilatedconvolutionandbackwardconnection