arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1810.12440cs.CV
收藏

TallyQA:复杂计数问题的验证

TallyQA: Answering Complex Counting Questions

Chester F. Carlson Center for Imaging Science(切斯特·F·卡尔森成像科学中心);Rochester Institute of Technology(罗切斯特理工学院)

Manoj Acharya, Kushal Kafle, Christopher Kanan

摘要:

视觉问答(VQA)数据集中的大多数计数问题都很简单,只需要目标检测。在这里,我们研究复杂计数问题的算法,这些问题涉及对象之间的关系,属性识别,推理等。为此,我们创建了TallyQA,这是世界上最大的开放式计数数据集。我们提出了一个新的算法,使用关系网络与区域建议计数。我们的方法可以让关系网络有效地用于高分辨率图像。与TallyQA和HowMany-QA基准测试的基线和最新系统相比,它产生了最先进的结果。

英文摘要:

Most counting questions in visual question answering (VQA) datasets are simple and require no more than object detection. Here, we study algorithms for complex counting questions that involve relationships between objects, attribute identification, reasoning, and more. To do this, we created TallyQA, the world's largest dataset for open-ended counting. We propose a new algorithm for counting that uses relation networks with region proposals. Our method lets relation networks be efficiently used with high-resolution imagery. It yields state-of-the-art results compared to baseline and recent systems on both TallyQA and the HowMany-QA benchmark.

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

↑