To Choose or to Fuse? Scale Selection for Crowd Counting

特征(语言学) 计算机科学 比例(比率) 特征选择 保险丝(电气) 人工智能 像素 模式识别(心理学) 选择(遗传算法) 棱锥(几何) 航程(航空) 机器学习 数据挖掘 数学 工程类 航空航天工程 哲学 物理 电气工程 量子力学 语言学 几何学
作者
Qingyu Song,Chang’an Wang,Yabiao Wang,Ying Tai,Chengjie Wang,Jilin Li,Jian Wu,Jiayi Ma
出处
期刊:Proceedings of the ... AAAI Conference on Artificial Intelligence [Association for the Advancement of Artificial Intelligence]
卷期号:35 (3): 2576-2583 被引量:119
标识
DOI:10.1609/aaai.v35i3.16360
摘要

In this paper, we address the large scale variation problem in crowd counting by taking full advantage of the multi-scale feature representations in a multi-level network. We implement such an idea by keeping the counting error of a patch as small as possible with a proper feature level selection strategy, since a specific feature level tends to perform better for a certain range of scales. However, without scale annotations, it is sub-optimal and error-prone to manually assign the predictions for heads of different scales to specific feature levels. Therefore, we propose a Scale-Adaptive Selection Network (SASNet), which automatically learns the internal correspondence between the scales and the feature levels. Instead of directly using the predictions from the most appropriate feature level as the final estimation, our SASNet also considers the predictions from other feature levels via weighted average, which helps to mitigate the gap between discrete feature levels and continuous scale variation. Since the heads in a local patch share roughly a same scale, we conduct the adaptive selection strategy in a patch-wise style. However, pixels within a patch contribute different counting errors due to the various difficulty degrees of learning. Thus, we further propose a Pyramid Region Awareness Loss (PRA Loss) to recursively select the most hard sub-regions within a patch until reaching the pixel level. With awareness of whether the parent patch is over-estimated or under-estimated, the fine-grained optimization with the PRA Loss for these region-aware hard pixels helps to alleviate the inconsistency problem between training target and evaluation metric. The state-of-the-art results on four datasets demonstrate the superiority of our approach. The code will be available at: https://github.com/TencentYoutuResearch/CrowdCounting-SASNet.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
所所应助BL采纳,获得10
刚刚
Lizhiiiy完成签到,获得积分10
1秒前
1秒前
重逢发布了新的文献求助10
2秒前
生动的猎豹完成签到,获得积分20
2秒前
花生发布了新的文献求助10
3秒前
英俊的铭应助ccc采纳,获得10
3秒前
叶子完成签到,获得积分10
3秒前
慢漫完成签到,获得积分20
3秒前
忧心的中蓝完成签到,获得积分10
3秒前
巅峰囚冰发布了新的文献求助10
3秒前
花佩剑完成签到,获得积分10
4秒前
zfffgen发布了新的文献求助10
4秒前
伊梦阑珊完成签到,获得积分10
4秒前
做个梦给你完成签到,获得积分10
5秒前
5秒前
全问筠发布了新的文献求助10
5秒前
裴q完成签到 ,获得积分10
5秒前
5秒前
5秒前
zhaoyy发布了新的文献求助10
6秒前
谁有文献请救救我完成签到,获得积分10
6秒前
大福应助Dr采纳,获得10
6秒前
萤火微光发布了新的文献求助10
7秒前
7秒前
北游完成签到,获得积分10
7秒前
世界完成签到,获得积分10
7秒前
爱学习完成签到,获得积分10
7秒前
李爱国应助李肉圆采纳,获得10
7秒前
7秒前
大模型应助lilizi采纳,获得10
8秒前
境屾完成签到,获得积分10
8秒前
任性小霸王完成签到,获得积分10
8秒前
Voiceless完成签到,获得积分10
9秒前
9秒前
Astraeus完成签到,获得积分10
9秒前
完美世界应助pokexuejiao采纳,获得10
9秒前
djuanyx完成签到,获得积分10
10秒前
三金完成签到,获得积分10
10秒前
高分求助中
Markov Chain Monte Carlo 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Common Foundations of American and East Asian Modernisation: From Alexander Hamilton to Junichero Koizumi 5000
Advanced Weaponeering Fourth Edition, Volume 2 1000
Weaponeering: An Introduction Fourth Edition, Volume 1 1000
悉尼大学博士学位论文,题目:Modelling and testing of one-sided stitched laminated composites. 作者:Kristopher P. Plain 700
Matrix Methods in Data Mining and Pattern Recognition Second Edition 610
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7558312
求助须知:如何正确求助?哪些是违规求助? 9140172
关于积分的说明 19537609
捐赠科研通 7147764
什么是DOI,文献DOI怎么找? 3261326
关于科研通互助平台的介绍 2427857
邀请新用户注册赠送积分活动 2250685