Proceedings Third International Conference on 3-D Digital Imaging and Modeling最新文献_第2页

AVENUE: Automated site modeling in urban environments 大道:城市环境中的自动化站点建模

Proceedings Third International Conference on 3-D Digital Imaging and Modeling Pub Date : 2001-05-28 DOI: 10.1109/IM.2001.924477

P. Allen, I. Stamos, A. Gueorguiev, Ethan Gold, P. Blaer

引用次数: 110

Fast range image segmentation by an edge detection strategy 基于边缘检测策略的快速距离图像分割

Proceedings Third International Conference on 3-D Digital Imaging and Modeling Pub Date : 2001-05-28 DOI: 10.1109/IM.2001.924460

A. Sappa, M. Devy

引用次数: 116

Reconstruction of complex environments by robust pre-aligned ICP 基于鲁棒预对准ICP的复杂环境重建

Proceedings Third International Conference on 3-D Digital Imaging and Modeling Pub Date : 2001-05-28 DOI: 10.1109/IM.2001.924432

Vittorio Murino, L. Ronchetti, U. Castellani, Andrea Fusiello

引用次数: 22

Acquisition of three-dimensional information in a real environment by using the Stereo Omni-directional System (SOS) 利用立体全向系统(SOS)获取真实环境中的三维信息

Proceedings Third International Conference on 3-D Digital Imaging and Modeling Pub Date : 2001-05-28 DOI: 10.1109/IM.2001.924479

H. Tanahashi, Daisuke Shimada, Kazuhiko Yamamoto, Y. Niwa

引用次数: 23

3-D landmark detection and identification in the CAESAR project CAESAR项目中的三维地标检测与识别

Proceedings Third International Conference on 3-D Digital Imaging and Modeling Pub Date : 2001-05-28 DOI: 10.1109/IM.2001.924485

D. Burnsides, M. Boehmer, K. Robinette

引用次数: 51

Structure and motion from two uncalibrated views using points on planes 结构和运动从两个未校准的视图使用平面上的点

Proceedings Third International Conference on 3-D Digital Imaging and Modeling Pub Date : 2001-05-28 DOI: 10.1109/IM.2001.924410

A. Bartoli, P. Sturm, R. Horaud

{"title":"Structure and motion from two uncalibrated views using points on planes","authors":"A. Bartoli, P. Sturm, R. Horaud","doi":"10.1109/IM.2001.924410","DOIUrl":"https://doi.org/10.1109/IM.2001.924410","url":null,"abstract":"This paper is about the problem of structure and motion recovery from two views of a rigid scene. Especially, we deal with the case of scenes containing planes, i.e. there are sets of coplanar points. Coplanarity is a strong constraint for both structure recovery and motion estimation. Most existing works do only exploit one of the two aspects, or, if both, then in a sub-optimal manner. A typical example is to estimate motion (epipolar geometry) using raw point correspondences, to perform a 3D reconstruction and then to fit planes and maybe correct 3D point positions to make them coplanar. In this paper we present an approach to estimate camera motion and piecewise planar structure simultaneously and optimally: the result is the estimation of camera motion and 3D structure, that minimizes reprojection error while satisfying the piecewise planarity. The estimation problem is minimally parameterized using 2D entities-epipoles, epipolar transformation, plane homographies and image points-subsequently deriving the corresponding 3D entities is trivial. Experimental results show that the reconstruction is of clearly superior quality compared to traditional methods based only on points, even if the scene is not perfectly piecewise planar.","PeriodicalId":155451,"journal":{"name":"Proceedings Third International Conference on 3-D Digital Imaging and Modeling","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130455867","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 18

Dual-beam structured-light scanning for 3-D object modeling 用于三维物体建模的双光束结构光扫描

Proceedings Third International Conference on 3-D Digital Imaging and Modeling Pub Date : 2001-05-28 DOI: 10.1109/IM.2001.924399

Johnny Park, G. DeSouza, A. Kak

引用次数: 44

Compact and portable 3D camera for space applications 用于空间应用的紧凑便携式3D相机

Proceedings Third International Conference on 3-D Digital Imaging and Modeling Pub Date : 2001-05-28 DOI: 10.1109/IM.2001.924390

E. Harvey, M. Arsenault, Jean-François Lavoie, B. Bélanger, Mary-Ann Boucher

引用次数: 2

Range image registration: A software platform and empirical evaluation 距离图像配准:一个软件平台与实证评价

Proceedings Third International Conference on 3-D Digital Imaging and Modeling Pub Date : 2001-05-28 DOI: 10.1109/IM.2001.924446

G. Dalley, P. Flynn

引用次数: 31

A nearest neighbor method for efficient ICP 高效ICP的最近邻法

Proceedings Third International Conference on 3-D Digital Imaging and Modeling Pub Date : 2001-05-28 DOI: 10.1109/IM.2001.924426

M. Greenspan, G. Godin

{"title":"A nearest neighbor method for efficient ICP","authors":"M. Greenspan, G. Godin","doi":"10.1109/IM.2001.924426","DOIUrl":"https://doi.org/10.1109/IM.2001.924426","url":null,"abstract":"A novel solution is presented to the Nearest Neighbor Problem that is specifically tailored for determining correspondences within the Iterative Closest Point Algorithm. The reference point set P is preprocessed by calculating for each point p/spl I.oarr//sub i//spl isin/P that neighborhood of points which lie within a certain distance /spl epsiv/ of p/spl I.oarr//sub i/. The points within each /spl epsiv/-neighborhood are sorted by increasing distance to their respective p/spl I.oarr//sub i/. At runtime, the correspondences are tracked across iterations, and the previous correspondence is used as an estimate of the current correspondence. If the estimate satifies a constraint, called the Spherical Constraint, then the nearest neighbor falls within the /spl epsiv/-neighborhood of the estimate. A novel theorem, the Ordering Theorem, is presented which allows the Triangle Inequality to efficiently prune points from the sorted /spl epsiv/-neighborhood from further consideration. The method has been implemented and is demonstrated to be more efficient than both the k-d tree and Elias methods. After /spl sim/40 iterations, fewer than 2 distance calculations were required on average per correspondence, which is close to the theoretical minimum of 1. Furthermore, after 20 iterations the time expense per iteration was demonstrated to be negligibly more than simply looping through the points.","PeriodicalId":155451,"journal":{"name":"Proceedings Third International Conference on 3-D Digital Imaging and Modeling","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123614745","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 121