基于注意力机制和最小代价流算法的LSTM草图识别

Bac Nguyen-Xuan, Gueesang Lee
{"title":"基于注意力机制和最小代价流算法的LSTM草图识别","authors":"Bac Nguyen-Xuan, Gueesang Lee","doi":"10.5392/IJoC.2019.15.4.008","DOIUrl":null,"url":null,"abstract":"This paper presents a solution of the ‘Quick, Draw! Doodle Recognition Challenge’ hosted by Google. Doodles are drawings comprised of concrete representational meaning or abstract lines creatively expressed by individuals. In this challenge, a doodle is presented as a sequence of sketches. From the view of at the sketch level, to learn the pattern of strokes representing a doodle, we propose a sequential model stacked with multiple convolution layers and Long Short-Term Memory (LSTM) cells following the attention mechanism [15]. From the view at the image level, we use multiple models pre-trained on ImageNet to recognize the doodle. Finally, an ensemble and a post-processing method using the minimum cost flow algorithm are introduced to combine multiple models in achieving better results. In this challenge, our solutions garnered 11th place among 1,316 teams. Our performance was 0.95037 MAP@3, only 0.4% lower than the winner. It demonstrates that our method is very competitive. The source code for this competition is published at: https://github.com/ngxbac/Kaggle-QuickDraw.","PeriodicalId":31343,"journal":{"name":"International Journal of Contents","volume":"15 1","pages":"8-15"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Sketch Recognition Using LSTM with Attention Mechanism and Minimum Cost Flow Algorithm\",\"authors\":\"Bac Nguyen-Xuan, Gueesang Lee\",\"doi\":\"10.5392/IJoC.2019.15.4.008\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a solution of the ‘Quick, Draw! Doodle Recognition Challenge’ hosted by Google. Doodles are drawings comprised of concrete representational meaning or abstract lines creatively expressed by individuals. In this challenge, a doodle is presented as a sequence of sketches. From the view of at the sketch level, to learn the pattern of strokes representing a doodle, we propose a sequential model stacked with multiple convolution layers and Long Short-Term Memory (LSTM) cells following the attention mechanism [15]. From the view at the image level, we use multiple models pre-trained on ImageNet to recognize the doodle. Finally, an ensemble and a post-processing method using the minimum cost flow algorithm are introduced to combine multiple models in achieving better results. In this challenge, our solutions garnered 11th place among 1,316 teams. Our performance was 0.95037 MAP@3, only 0.4% lower than the winner. It demonstrates that our method is very competitive. The source code for this competition is published at: https://github.com/ngxbac/Kaggle-QuickDraw.\",\"PeriodicalId\":31343,\"journal\":{\"name\":\"International Journal of Contents\",\"volume\":\"15 1\",\"pages\":\"8-15\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Contents\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5392/IJoC.2019.15.4.008\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Contents","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5392/IJoC.2019.15.4.008","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文提出了一种解决“快速,绘制!”涂鸦识别挑战赛由谷歌主办。涂鸦是由个人创造性地表达的具体具象意义或抽象线条组成的图画。在这个挑战中,涂鸦以一系列草图的形式呈现。从草图层面来看,为了学习代表涂鸦的笔画模式,我们提出了一个由多个卷积层和长短期记忆(LSTM)细胞堆叠的顺序模型,该模型遵循注意机制[15]。从图像层面来看,我们使用在ImageNet上预训练的多个模型来识别涂鸦。最后,介绍了一种集成和后处理方法,利用最小代价流算法将多个模型组合在一起,以获得更好的结果。在本次挑战赛中,我们的解决方案在1316支队伍中获得了第11名。我们的成绩是0.95037 MAP@3,只比冠军低0.4%。这表明我们的方法很有竞争力。本次竞赛的源代码发布在:https://github.com/ngxbac/Kaggle-QuickDraw。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Sketch Recognition Using LSTM with Attention Mechanism and Minimum Cost Flow Algorithm
This paper presents a solution of the ‘Quick, Draw! Doodle Recognition Challenge’ hosted by Google. Doodles are drawings comprised of concrete representational meaning or abstract lines creatively expressed by individuals. In this challenge, a doodle is presented as a sequence of sketches. From the view of at the sketch level, to learn the pattern of strokes representing a doodle, we propose a sequential model stacked with multiple convolution layers and Long Short-Term Memory (LSTM) cells following the attention mechanism [15]. From the view at the image level, we use multiple models pre-trained on ImageNet to recognize the doodle. Finally, an ensemble and a post-processing method using the minimum cost flow algorithm are introduced to combine multiple models in achieving better results. In this challenge, our solutions garnered 11th place among 1,316 teams. Our performance was 0.95037 MAP@3, only 0.4% lower than the winner. It demonstrates that our method is very competitive. The source code for this competition is published at: https://github.com/ngxbac/Kaggle-QuickDraw.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
审稿时长
8 weeks
期刊最新文献
Correlation between virtual reality’s intervention and monitored brain activity: A systematic review Unfamiliar or Defamiliarization: The Uncanny Valley in Interactive Artwork Installations Consequences of Advertising Literacy among College Students Perception of Digital Restoration and Representation of Cultural Heritage -Focusing on Simulation and Simulacra Item Development to Predict the Driving Risk of Older Drivers using the Delphi Method
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1