arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1903.11249cs.CV
收藏

W-Net:用于密度图估计的增强U-Net

W-Net: Reinforced U-Net for Density Map Estimation

C-DAC(印度高级计算发展中心)

Varun Kannadi Valloli, Kinal Mehta

摘要:

在防止踩踏和拯救生命方面,人群管理至关重要,特别是在中国和印度这样的国家,人口总和占全球人口的三分之一。每年有数百万人聚集在全国各地庆祝无数的活动,人群数量估计是人群管理系统的关键,可以防止踩踏和拯救生命。我们提出了一个网络的人群计数报告的最先进的结果人群计数基准。我们的贡献是,首先,一个U-Net启发模型,使我们能够报告最先进的结果。其次,我们提出了一个独立的解码增强分支,这有助于网络更早地收敛,并使网络能够估计具有高结构相似性指数(SSIM)的密度图。第三,我们讨论了当代架构的缺点,并根据经验表明,即使我们的架构实现了最先进的结果,优点可能是由于编码器-解码器流水线代替。最后,我们报告的误差分析表明,当代的工作线处于饱和状态,留下一些突出的问题没有解决。

英文摘要:

Crowd management is of paramount importance when it comes to preventing stampedes and saving lives, especially in a countries like China and India where the combined population is a third of the global population. Millions of people convene annually all around the nation to celebrate a myriad of events and crowd count estimation is the linchpin of the crowd management system that could prevent stampedes and save lives. We present a network for crowd counting which reports state of the art results on crowd counting benchmarks. Our contributions are, first, a U-Net inspired model which affords us to report state of the art results. Second, we propose an independent decoding Reinforcement branch which helps the network converge much earlier and also enables the network to estimate density maps with high Structural Similarity Index (SSIM). Third, we discuss the drawbacks of the contemporary architectures and empirically show that even though our architecture achieves state of the art results, the merit may be due to the encoder-decoder pipeline instead. Finally, we report the error analysis which shows that the contemporary line of work is at saturation and leaves certain prominent problems unsolved.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑