Exploring online ad images using a clustering approach

Krushil M. Bhadani, Bijal Talati
{"title":"Exploring online ad images using a clustering approach","authors":"Krushil M. Bhadani, Bijal Talati","doi":"10.1109/ICOEI.2019.8862732","DOIUrl":null,"url":null,"abstract":"Online advertising is a huge, rapidly growing advertising market in today's world. The common form of online advertising is using image ads. A decision is made (often in real time) every time when a user sees an ad, and the advertiser is eager to determine the best ad to display. Consequently, many algorithms have been developed in order to calculate the optimal ad in order to show that the current user is available at the present time. Typically, these algorithms focus on variations of the ad, optimizing among different properties such as background color, image size, or set of images but none of them define the property of objects. Our study looks at new qualities of ads that can be determined before an ad is shown (rather than online optimization) and defines which ad image's objects are most likely to be successful. We present a set of algorithms that utilize machine learning to investigate online advertising and to construct object detection models which can foresee objects that are likely to be in successive ad image. The focus of results is to get high success rate in ad image with objects appear in it. In this paper we discuss two approaches, using cascading trainer and R-CNN network. We have compare this two approaches using HOG and CNN features. R-CNN gives better result than cascading but require more time to train.","PeriodicalId":212501,"journal":{"name":"2019 3rd International Conference on Trends in Electronics and Informatics (ICOEI)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 3rd International Conference on Trends in Electronics and Informatics (ICOEI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOEI.2019.8862732","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Online advertising is a huge, rapidly growing advertising market in today's world. The common form of online advertising is using image ads. A decision is made (often in real time) every time when a user sees an ad, and the advertiser is eager to determine the best ad to display. Consequently, many algorithms have been developed in order to calculate the optimal ad in order to show that the current user is available at the present time. Typically, these algorithms focus on variations of the ad, optimizing among different properties such as background color, image size, or set of images but none of them define the property of objects. Our study looks at new qualities of ads that can be determined before an ad is shown (rather than online optimization) and defines which ad image's objects are most likely to be successful. We present a set of algorithms that utilize machine learning to investigate online advertising and to construct object detection models which can foresee objects that are likely to be in successive ad image. The focus of results is to get high success rate in ad image with objects appear in it. In this paper we discuss two approaches, using cascading trainer and R-CNN network. We have compare this two approaches using HOG and CNN features. R-CNN gives better result than cascading but require more time to train.
使用聚类方法探索在线广告图像
在线广告是当今世界一个巨大的、快速增长的广告市场。在线广告的常见形式是使用图像广告。每当用户看到广告时,就会做出决定(通常是实时的),广告商渴望确定展示的最佳广告。因此,许多算法已经被开发出来,以计算最佳广告,以显示当前用户在当前时间是可用的。通常,这些算法专注于广告的变化,在不同的属性(如背景颜色、图像大小或图像集)之间进行优化,但它们都没有定义对象的属性。我们的研究着眼于广告的新品质,这些品质可以在广告显示之前确定(而不是在线优化),并定义哪些广告图像的对象最有可能成功。我们提出了一套算法,利用机器学习来调查在线广告,并构建对象检测模型,该模型可以预见可能出现在连续广告图像中的对象。结果的重点是在有物体出现的广告图像中获得较高的成功率。本文讨论了使用级联训练器和R-CNN网络的两种方法。我们使用HOG和CNN特征比较了这两种方法。R-CNN给出了比级联更好的结果,但需要更多的时间来训练。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信