arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2001.07059cs.CVcs.CC

Accuracy vs. Complexity: A Trade-off in Visual Question Answering Models

Australian National University (ANU)(澳大利亚国立大学);Commonwealth Scientific and Industrial Research Organisation (CSIRO)(联邦科学与工业研究组织);Inception Institute of Artificial Intelligence (IIAI)(人工智能初始研究院)

Moshiur R. Farazi, Salman H. Khan, Nick Barnes

英文摘要:

Visual Question Answering (VQA) has emerged as a Visual Turing Test to validate the reasoning ability of AI agents. The pivot to existing VQA models is the joint embedding that is learned by combining the visual features from an image and the semantic features from a given question. Consequently, a large body of literature has focused on developing complex joint embedding strategies coupled with visual attention mechanisms to effectively capture the interplay between these two modalities. However, modelling the visual and semantic features in a high dimensional (joint embedding) space is computationally expensive, and more complex models often result in trivial improvements in the VQA accuracy. In this work, we systematically study the trade-off between the model complexity and the performance on the VQA task. VQA models have a diverse architecture comprising of pre-processing, feature extraction, multimodal fusion, attention and final classification stages. We specifically focus on the effect of "multi-modal fusion" in VQA models that is typically the most expensive step in a VQA pipeline. Our thorough experimental evaluation leads us to two proposals, one optimized for minimal complexity and the other one optimized for state-of-the-art VQA performance.

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

↑