Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao https://doi.org/10.1...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
DBLP
Conference object . 2023
Data sources: DBLP
versions View all 2 versions
addClaim

Feature Reaggregation Network for Crowd Counting

Authors: Xiaoliang Hao; Qianqian Yang; Yinfeng Xia; Baoqun Yin; Sifan Peng;

Feature Reaggregation Network for Crowd Counting

Abstract

In this paper, we propose a novel end-to-end network named Feature Reaggregation Network (FRNet) for crowd counting, which focuses on fusing the multi-scale features in the hierarchy for generating high-quality density maps. Two level and three level feature reaggregation modules are developed between the backbone network and the next feature extraction modules in the hierarchy so that the low-layer spatial feature and the high-layer semantic information can be multi-combined by element-wise addition. In addition, these two modules are placed behind the backbone network to extract global features. Furthermore, we also introduce the extra deformable mixture regression module which donates deformable convolution to extract features so that we can generate the high-quality estimated density map. We have evaluated our experiments on three popular crowd counting datasets (ShanghaiTech, UCF_CC_50 and UCF_QNRF datasets), and the experiments demonstrate that the superiority of the proposed method over the other excellent approaches.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!