已入深夜,您辛苦了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人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秒前
秋波发布了新的文献求助30
4秒前
Lucas应助chu采纳,获得10
4秒前
旧时光完成签到,获得积分10
4秒前
故笺完成签到,获得积分10
5秒前
情怀应助要减肥的冰姬采纳,获得10
7秒前
长安完成签到 ,获得积分10
8秒前
9秒前
9秒前
一天完成签到 ,获得积分10
11秒前
t忒对完成签到 ,获得积分10
12秒前
干煸鸡发布了新的文献求助10
13秒前
跳跃惜筠发布了新的文献求助10
13秒前
顾白凡完成签到,获得积分0
13秒前
17秒前
烟花应助xu采纳,获得10
18秒前
lpp完成签到,获得积分10
18秒前
19秒前
fuziluo发布了新的文献求助10
19秒前
okayu发布了新的文献求助10
22秒前
25秒前
无花果应助柠VV采纳,获得10
27秒前
27秒前
快乐学习每一天完成签到 ,获得积分10
28秒前
28秒前
干煸鸡完成签到,获得积分10
30秒前
33秒前
33秒前
FashionBoy应助短短大王采纳,获得10
34秒前
maplesirup发布了新的文献求助10
34秒前
Criminology34应助科研通管家采纳,获得10
35秒前
Criminology34应助科研通管家采纳,获得10
35秒前
Criminology34应助科研通管家采纳,获得10
35秒前
科研通AI2S应助科研通管家采纳,获得10
35秒前
搜集达人应助科研通管家采纳,获得10
36秒前
纯真忆安完成签到,获得积分20
36秒前
FashionBoy应助科研通管家采纳,获得10
36秒前
英俊的铭应助科研通管家采纳,获得10
36秒前
大模型应助科研通管家采纳,获得10
36秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Prompt Engineering for Clinicians: Harnessing AI in Everyday Medical Practice 600
REAL-WORLD EFFICACY AND GENOMIC LANDSCAPE OF POLATUZUMA VEDOTIN-BASED FIRST-LINE THERAPY IN DIFFUSE LARGE B-CELL LYMPHOMA: A FOCUS ON TP53 MUTATIONS AND TREATMENT RESPONSE 500
Handbook of Luminescence Dating 500
Safety Pharmacology 500
《KNN基无铅压电陶瓷电学性能优化与物理机理研究》 500
Elgar Concise Encyclopedia of Space Law 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 计算机科学 化学工程 生物化学 物理 内科学 复合材料 催化作用 光电子学 物理化学 电极 细胞生物学 基因 遗传学
热门帖子
关注 科研通微信公众号,转发送积分 6944437
求助须知:如何正确求助?哪些是违规求助? 8629885
关于积分的说明 18305557
捐赠科研通 6379654
什么是DOI,文献DOI怎么找? 3079291
关于科研通互助平台的介绍 2120203
邀请新用户注册赠送积分活动 2056180