已入深夜,您辛苦了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!祝你早点完成任务,早点休息,好梦!

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 (AAAI)]
卷期号: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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
離原完成签到,获得积分10
1秒前
2秒前
榶七七发布了新的文献求助10
3秒前
啊啊啊啊发布了新的文献求助10
3秒前
zhangyb发布了新的文献求助10
4秒前
4秒前
螺蛳粉大王完成签到 ,获得积分10
5秒前
lanbing802发布了新的文献求助10
5秒前
7秒前
lynn完成签到 ,获得积分10
7秒前
哇哇哇完成签到 ,获得积分10
8秒前
PDE完成签到 ,获得积分10
8秒前
9秒前
尤川发布了新的文献求助30
9秒前
轻松熊不轻松完成签到 ,获得积分10
10秒前
橙子快跑发布了新的文献求助10
11秒前
11秒前
科研通AI6.3应助miaomao采纳,获得10
13秒前
jia完成签到 ,获得积分10
13秒前
嘻嘻哈哈发布了新的文献求助100
14秒前
GWflowing发布了新的文献求助10
15秒前
万能图书馆应助XHR33采纳,获得10
15秒前
16秒前
科研通AI6.4应助Aqian采纳,获得10
18秒前
21秒前
盼芙完成签到 ,获得积分10
21秒前
隐形曼青应助lanbing802采纳,获得10
22秒前
脑洞疼应助科研狗采纳,获得10
23秒前
zz完成签到 ,获得积分10
23秒前
24秒前
执着的赛君完成签到,获得积分10
24秒前
24秒前
欢喜听双发布了新的文献求助10
25秒前
可靠的代柔完成签到,获得积分20
27秒前
XHR33发布了新的文献求助10
29秒前
30秒前
所所应助甘特采纳,获得10
36秒前
杏子完成签到 ,获得积分10
37秒前
38秒前
sky完成签到 ,获得积分10
39秒前
高分求助中
Adhesion Science: Principles & Practice 1234
Cold War Transcended: Australia's China Policy, 1949-1990 998
Signals, Systems, and Signal Processing 610
Fundamentals of Pharmaceutical and Biologics Regulations: A Global Perspective, Second Edition 600
Testimonial Injustice and Trust 510
Fundamentals of Body MRI 3rd Edition 400
The Wiley Blackwell Companion to Diachronic and Historical Linguistics 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 物理 内科学 复合材料 催化作用 物理化学 光电子学 电极 细胞生物学 基因 无机化学
热门帖子
关注 科研通微信公众号,转发送积分 6630906
求助须知:如何正确求助?哪些是违规求助? 8391627
关于积分的说明 17949900
捐赠科研通 5810863
什么是DOI,文献DOI怎么找? 2964673
邀请新用户注册赠送积分活动 1939829
关于科研通互助平台的介绍 1850551