Rapid Octree Construction from Image Sequences

Szeliski R.
{"title":"Rapid Octree Construction from Image Sequences","authors":"Szeliski R.","doi":"10.1006/ciun.1993.1029","DOIUrl":null,"url":null,"abstract":"<div><p>The construction of a three-dimensional object model from a set of images taken from different viewpoints is an important problem in computer vision. One of the simplest ways to do this is to use the silhouettes of the object (the binary classification of images into object and background) to construct a bounding volume for the object. To efficiently represent this volume, we use an octree, which represents the object as a tree of recursively subdivided cubes. We develop a new algorithm for computing the octree bounding volume from multiple silhouettes and apply it to an object rotating on a turntable in front of a stationary camera. The algorithm performs a limited amount of processing for each viewpoint and incrementally builds the volumetric model. The resulting algorithm requires less total computation than previous algorithms, runs in close to real-time, and builds a model whose resolution improves over time.</p></div>","PeriodicalId":100350,"journal":{"name":"CVGIP: Image Understanding","volume":"58 1","pages":"Pages 23-32"},"PeriodicalIF":0.0000,"publicationDate":"1993-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1006/ciun.1993.1029","citationCount":"632","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"CVGIP: Image Understanding","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1049966083710296","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 632

Abstract

The construction of a three-dimensional object model from a set of images taken from different viewpoints is an important problem in computer vision. One of the simplest ways to do this is to use the silhouettes of the object (the binary classification of images into object and background) to construct a bounding volume for the object. To efficiently represent this volume, we use an octree, which represents the object as a tree of recursively subdivided cubes. We develop a new algorithm for computing the octree bounding volume from multiple silhouettes and apply it to an object rotating on a turntable in front of a stationary camera. The algorithm performs a limited amount of processing for each viewpoint and incrementally builds the volumetric model. The resulting algorithm requires less total computation than previous algorithms, runs in close to real-time, and builds a model whose resolution improves over time.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
从图像序列快速八叉树构建
从不同视点拍摄的图像中构建三维物体模型是计算机视觉中的一个重要问题。最简单的方法之一是使用对象的轮廓(将图像分为对象和背景的二分类)来构建对象的边界体。为了有效地表示这个体积,我们使用八叉树,它将对象表示为递归细分的立方体树。我们开发了一种从多个轮廓计算八叉树边界体积的新算法,并将其应用于固定摄像机前转盘上旋转的物体。该算法对每个视点执行有限的处理,并逐步构建体积模型。由此产生的算法比以前的算法需要更少的总计算量,运行接近实时,并且构建的模型的分辨率随着时间的推移而提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Phase-Based Binocular Vergence Control and Depth Reconstruction Using Active Vision 3D Structure Reconstruction from Point Correspondences between two Perspective Projections Default Shape Theory: With Application to the Computation of the Direction of the Light Source Computational Cross Ratio for Computer Vision Refining 3D reconstruction: a theoretical and experimental study of the effect of cross-correlations
×
引用
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