Geometric reasoning via internet CrowdSourcing

A. Jagadeesan, A. Lynn, J. Corney, Xiu-Tian Yan, J. Wenzel, A. Sherlock, W. Regli
{"title":"Geometric reasoning via internet CrowdSourcing","authors":"A. Jagadeesan, A. Lynn, J. Corney, Xiu-Tian Yan, J. Wenzel, A. Sherlock, W. Regli","doi":"10.1145/1629255.1629296","DOIUrl":null,"url":null,"abstract":"The ability to interpret and reason about shapes is a peculiarly human capability that has proven difficult to reproduce algorithmically. So despite the fact that geometric modeling technology has made significant advances in the representation, display and modification of shapes, there have only been incremental advances in geometric reasoning. For example, although today's CAD systems can confidently identify isolated cylindrical holes, they struggle with more ambiguous tasks such as the identification of partial symmetries or similarities in arbitrary geometries. Even well defined problems such as 2D shape nesting or 3D packing generally resist elegant solution and rely instead on brute force explorations of a subset of the many possible solutions.\n Identifying economic ways to solving such problems would result in significant productivity gains across a wide range of industrial applications. The authors hypothesize that Internet Crowdsourcing might provide a pragmatic way of removing many geometric reasoning bottlenecks.\n This paper reports the results of experiments conducted with Amazon's mTurk site and designed to determine the feasibility of using Internet Crowdsourcing to carry out geometric reasoning tasks as well as establish some benchmark data for the quality, speed and costs of using this approach.\n After describing the general architecture and terminology of the mTurk Crowdsourcing system, the paper details the implementation and results of the following three investigations; 1) the identification of \"Canonical\" viewpoints for individual shapes, 2) the quantification of \"similarity\" relationships with-in collections of 3D models and 3) the efficient packing of 2D Strips into rectangular areas. The paper concludes with a discussion of the possibilities and limitations of the approach.","PeriodicalId":216067,"journal":{"name":"Symposium on Solid and Physical Modeling","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symposium on Solid and Physical Modeling","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1629255.1629296","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

Abstract

The ability to interpret and reason about shapes is a peculiarly human capability that has proven difficult to reproduce algorithmically. So despite the fact that geometric modeling technology has made significant advances in the representation, display and modification of shapes, there have only been incremental advances in geometric reasoning. For example, although today's CAD systems can confidently identify isolated cylindrical holes, they struggle with more ambiguous tasks such as the identification of partial symmetries or similarities in arbitrary geometries. Even well defined problems such as 2D shape nesting or 3D packing generally resist elegant solution and rely instead on brute force explorations of a subset of the many possible solutions. Identifying economic ways to solving such problems would result in significant productivity gains across a wide range of industrial applications. The authors hypothesize that Internet Crowdsourcing might provide a pragmatic way of removing many geometric reasoning bottlenecks. This paper reports the results of experiments conducted with Amazon's mTurk site and designed to determine the feasibility of using Internet Crowdsourcing to carry out geometric reasoning tasks as well as establish some benchmark data for the quality, speed and costs of using this approach. After describing the general architecture and terminology of the mTurk Crowdsourcing system, the paper details the implementation and results of the following three investigations; 1) the identification of "Canonical" viewpoints for individual shapes, 2) the quantification of "similarity" relationships with-in collections of 3D models and 3) the efficient packing of 2D Strips into rectangular areas. The paper concludes with a discussion of the possibilities and limitations of the approach.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过互联网众包进行几何推理
对形状进行解释和推理的能力是人类特有的能力,事实证明这种能力很难通过算法重现。因此,尽管几何建模技术在形状的表示、显示和修改方面取得了重大进展,但在几何推理方面却只有渐进式的进展。例如,虽然今天的CAD系统可以自信地识别孤立的圆柱形孔,但它们在更模糊的任务中挣扎,例如识别任意几何形状的部分对称性或相似性。即使是定义明确的问题,如2D形状嵌套或3D包装,通常也会抵制优雅的解决方案,而是依赖于对许多可能解决方案子集的蛮力探索。确定解决这些问题的经济方法将导致在广泛的工业应用中显著提高生产率。作者假设,互联网众包可能提供一种实用的方式来消除许多几何推理瓶颈。本文报告了在亚马逊的mTurk网站上进行的实验结果,旨在确定使用互联网众包来执行几何推理任务的可行性,并为使用这种方法的质量、速度和成本建立一些基准数据。在描述了mTurk众包系统的总体架构和术语之后,论文详细介绍了以下三项调查的实施和结果;1)单个形状的“规范”视点识别,2)三维模型集合内“相似”关系的量化,3)二维条形条在矩形区域内的有效填充。文章最后讨论了这种方法的可能性和局限性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Robust Minkowski sums of polyhedra via controlled linear perturbation Adaptive surface reconstruction based on implicit PHT-splines Hexahedral shell mesh construction via volumetric polycube map Hierarchical surface fairing with constraints Accurate moment computation using the GPU
×
引用
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