发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
Calibration-free approach to 3D reconstruction using light stripe projections on a cube frame 使用立方体框架上的光条投影进行三维重建的无校准方法
Proceedings Third International Conference on 3-D Digital Imaging and Modeling Pub Date : 2001-05-28 DOI: 10.1109/IM.2001.924385
C. Chu, Sungjoo Hwang, Soon Ki Jung
{"title":"Calibration-free approach to 3D reconstruction using light stripe projections on a cube frame","authors":"C. Chu, Sungjoo Hwang, Soon Ki Jung","doi":"10.1109/IM.2001.924385","DOIUrl":"https://doi.org/10.1109/IM.2001.924385","url":null,"abstract":"This paper presents a new approach based on light striping for reconstructing a 3D model from a real object. The proposed system consists of a light plane projector, camera and cube frame with LEDs attached. As in other light striping systems, the correspondence problem is solved by projecting light plane onto an object inside a frame. However, we use only cross-ratios and vanishing points to set up the world coordinates of the object, while the intrinsic and extrinsic parameters of the camera and the position of light source are not required. As such, the proposed system does not calibrate the camera and the light source. Furthermore, the computed 3D point data does not require by registration process because the data is directly measured based on unified world coordinates. Experimental results proved the accuracy of the measurements and consistency of the outcomes without any knowledge of the camera and light source parameters.","PeriodicalId":155451,"journal":{"name":"Proceedings Third International Conference on 3-D Digital Imaging and Modeling","volume":"141 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":"133534263","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}
引用次数: 31
Shape recovery and analysis of large screw threads 大型螺纹的形状恢复与分析
Proceedings Third International Conference on 3-D Digital Imaging and Modeling Pub Date : 2001-05-28 DOI: 10.1109/IM.2001.924462
C. Robertson, Robert B. Fisher
{"title":"Shape recovery and analysis of large screw threads","authors":"C. Robertson, Robert B. Fisher","doi":"10.1109/IM.2001.924462","DOIUrl":"https://doi.org/10.1109/IM.2001.924462","url":null,"abstract":"In this work we have addressed the question of whether it is possible to extract parametric models of screw-threads from 3D range data. Results, example times for analysis and comparisons with known ground truths are given.","PeriodicalId":155451,"journal":{"name":"Proceedings Third International Conference on 3-D Digital Imaging and Modeling","volume":"2 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":"124217886","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}
引用次数: 9
Planar patch extraction with noisy depth data 带噪声深度数据的平面斑块提取
Proceedings Third International Conference on 3-D Digital Imaging and Modeling Pub Date : 2001-05-28 DOI: 10.1109/IM.2001.924444
Dana Cobzas, Hong Zhang
{"title":"Planar patch extraction with noisy depth data","authors":"Dana Cobzas, Hong Zhang","doi":"10.1109/IM.2001.924444","DOIUrl":"https://doi.org/10.1109/IM.2001.924444","url":null,"abstract":"This paper presents an algorithm for extracting planar patches by integrating both intensity and range data provided by a stereo system. For dealing with noisy and sparse range data, the initial segmentation is based on intensity information, and then the resulted regions are thresholded using depth data. This new algorithm, different from the existing ones that use only range data in the segmentation process, produces accurate planar patches that are then used for building a panoramic image-based model for mobile robot navigation.","PeriodicalId":155451,"journal":{"name":"Proceedings Third International Conference on 3-D Digital Imaging and Modeling","volume":"16 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":"128117418","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}
引用次数: 13
A method of style discrimination of oil painting based on 3D range data 基于三维距离数据的油画风格判别方法
Proceedings Third International Conference on 3-D Digital Imaging and Modeling Pub Date : 2001-05-28 DOI: 10.1109/IM.2001.924470
Naoya Masuda, Kazuhiko Yamamoto, K. Kato, H. Tanahashi
{"title":"A method of style discrimination of oil painting based on 3D range data","authors":"Naoya Masuda, Kazuhiko Yamamoto, K. Kato, H. Tanahashi","doi":"10.1109/IM.2001.924470","DOIUrl":"https://doi.org/10.1109/IM.2001.924470","url":null,"abstract":"We conducted an experiment about \"Kansei\", which is sensibility of each person. Our goal was to extract an artist's style in the oil painting. A style is determined by color skill and other key elements. Our methods paid particular attention to the characteristics of touch, one of the skills. Texture of the oil painting is very different from watercolor painting because paints harden, and it becomes a ruggedness that can easily be seen by the human eye. We supposed that a touch could be determined with in the local mean curvature and the Gaussian curvature extracted from the range image of the oil painting. In this paper we proposed a style discrimination method using these curvatures, and reported on the experiment result.","PeriodicalId":155451,"journal":{"name":"Proceedings Third International Conference on 3-D Digital Imaging and Modeling","volume":"23 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":"125616668","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}
引用次数: 3
A 3D laser micro-sensor integrating control and data processing in an FPGA-based calculator 一种集控制与数据处理于一体的三维激光微传感器
Proceedings Third International Conference on 3-D Digital Imaging and Modeling Pub Date : 2001-05-28 DOI: 10.1109/IM.2001.924415
Nestor Arana-Arejolaleiba, M. Briot, C. Ganibal, A. Nketsa, R. Prajoux
{"title":"A 3D laser micro-sensor integrating control and data processing in an FPGA-based calculator","authors":"Nestor Arana-Arejolaleiba, M. Briot, C. Ganibal, A. Nketsa, R. Prajoux","doi":"10.1109/IM.2001.924415","DOIUrl":"https://doi.org/10.1109/IM.2001.924415","url":null,"abstract":"Within a project whose objective is to develop a small-size 3D sensor combining a video camera with a 3D laser-based \"camera\", this paper describes the current status of the laser camera. The prototype of the laser camera is operational and is able to produce 3D \"images\" with good definition at high speed. Because of size constraints, some of the control electronics are implemented in an FPGA. The video camera that will be included in the system also needs integrated data processing. Consequently, the paper also describes an ongoing research about how to optimize the implementation in an FPGA of an algorithm class which is relevant both for control electronics and video data processing.","PeriodicalId":155451,"journal":{"name":"Proceedings Third International Conference on 3-D Digital Imaging and Modeling","volume":"9 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":"127754371","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}
引用次数: 2
Compact 3D profilometer with grazing incidence diffraction optics 紧凑的三维轮廓仪与掠入射衍射光学
Proceedings Third International Conference on 3-D Digital Imaging and Modeling Pub Date : 2001-05-01 DOI: 10.1109/IM.2001.924401
Thomas D. Ditto
{"title":"Compact 3D profilometer with grazing incidence diffraction optics","authors":"Thomas D. Ditto","doi":"10.1109/IM.2001.924401","DOIUrl":"https://doi.org/10.1109/IM.2001.924401","url":null,"abstract":"A new configuration of diffraction range finder is disclosed that places the grating at an angle of grazing incidence relative to the lens and transducer in the receiver. The new design offers improvements over an earlier prototype in reduced package size, shorter grating frequency chirp, and anamorphic behavior that increases length to depth ratios in profilometry applications. Demonstrations with transmission and reflection types of diffraction grating corroborate predictions.","PeriodicalId":155451,"journal":{"name":"Proceedings Third International Conference on 3-D Digital Imaging and Modeling","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132147523","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}
引用次数: 2
The parallel iterative closest point algorithm 并行迭代最近点算法
Proceedings Third International Conference on 3-D Digital Imaging and Modeling Pub Date : 2001-05-01 DOI: 10.1109/IM.2001.924434
C. Langis, M. Greenspan, G. Godin
{"title":"The parallel iterative closest point algorithm","authors":"C. Langis, M. Greenspan, G. Godin","doi":"10.1109/IM.2001.924434","DOIUrl":"https://doi.org/10.1109/IM.2001.924434","url":null,"abstract":"This paper describes a parallel implementation developed to improve the time performance of the Iterative Closest Point Algorithm. Within each iteration, the correspondence calculations are distributed among the processor resources. At the end of each iteration, the results of the correspondence determination are communicated back to a central processor and the current transformation is calculated A number of additional techniques were developed that served to improve upon this basic scheme. Calculating the partial sums within each distributed resource made it unnecessary to transmit the correspondence values back to the central processor, which reduced the communication overhead, and improved time performance. Randomly distributing the points among the processor resources resulted in a better load balancing, which further improved time performance. We also found that thinning the image by randomly removing a certain percentage of the points did not improve the performance, when viewed as the progression of mse with time. The method was implemented and tested on a 22 node Beowulf class cluster. For a large image, linear performance improvements were obtained for up to 16 processors, while they held for up to 8 processors with a smaller image.","PeriodicalId":155451,"journal":{"name":"Proceedings Third International Conference on 3-D Digital Imaging and Modeling","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124965646","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}
引用次数: 58
View planning with a registration constraint 带有注册约束的视图规划
Proceedings Third International Conference on 3-D Digital Imaging and Modeling Pub Date : 2001-05-01 DOI: 10.1109/IM.2001.924419
W. Scott, G. Roth, J. Rivest
{"title":"View planning with a registration constraint","authors":"W. Scott, G. Roth, J. Rivest","doi":"10.1109/IM.2001.924419","DOIUrl":"https://doi.org/10.1109/IM.2001.924419","url":null,"abstract":"The view planning problem, also known as the next-best-view (NBV) problem, for object reconstruction and inspection, has been shown to be isomorphic to the set covering problem which is NP-Complete. In this paper we express a theoretical framework for the NBV problem as an integer programming problem including a registration constraint. Experimental view planning results using a modified greedy search algorithm are presented.","PeriodicalId":155451,"journal":{"name":"Proceedings Third International Conference on 3-D Digital Imaging and Modeling","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126813486","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}
引用次数: 35
How much 3D-information can we acquire? optical range sensors at the physical limit, and where to apply them 我们能获得多少3d信息?光学测距传感器的物理极限，以及在哪里应用它们
Proceedings Third International Conference on 3-D Digital Imaging and Modeling Pub Date : 1900-01-01 DOI: 10.1109/IM.2001.924453
G. Hausler
{"title":"How much 3D-information can we acquire? optical range sensors at the physical limit, and where to apply them","authors":"G. Hausler","doi":"10.1109/IM.2001.924453","DOIUrl":"https://doi.org/10.1109/IM.2001.924453","url":null,"abstract":"Most of the problems of industrial inspection, reverse engineering, virtual reality require data about the geometrical shape of objects in 3D space. Such >D data offer advantages over 2-D data: shape data are invariant against alteration of the illumination, soiling, and object rotation ... Unfortunately, those data are much more difficult to acquire than video data about the 2-D local reflectivity of objects. We will discuss the physics of 3 -D sensing and will address the following subjects:","PeriodicalId":155451,"journal":{"name":"Proceedings Third International Conference on 3-D Digital Imaging and Modeling","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132723410","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}
引用次数: 1
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信