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

Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06)最新文献

筛选
英文 中文
Region-Based Motion Analysis and 3D Reconstruction for a Translational Video Sequence 基于区域的平移视频序列运动分析与三维重建
Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06) Pub Date : 2006-06-14 DOI: 10.1109/3DPVT.2006.119
Xiaodong Huang, E. Dubois
{"title":"Region-Based Motion Analysis and 3D Reconstruction for a Translational Video Sequence","authors":"Xiaodong Huang, E. Dubois","doi":"10.1109/3DPVT.2006.119","DOIUrl":"https://doi.org/10.1109/3DPVT.2006.119","url":null,"abstract":"This paper presents a hybrid 1D motion estimation algorithm which combines pixel-based and region-based approaches that can give depth images from translational video sequences with very high quality. Firstly, we combine the motion information estimated by a variational regularization approach and by the Gabor transform through histogram analysis to identify those regions with zero motion (like for the sky). Then another round of region matching is carried out to refine the motion values for the other regions. Our algorithm can detect most of the sky regions segmented by foreground objects with complex geometry while keeping the boundaries of moving objects sharp and clear, which is an very important feature to obtain accurate 3D models. The high quality motion maps/depth images obtained by our algorithm are shown along with 3D reconstructions from novel viewpoints.","PeriodicalId":346673,"journal":{"name":"Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122355656","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}
引用次数: 0
Efficient Constraint Evaluation Algorithms for Hierarchical Next-Best-View Planning 分级次优视图规划的高效约束评估算法
Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06) Pub Date : 2006-06-14 DOI: 10.1109/3DPVT.2006.52
Kok-Lim Low, A. Lastra
{"title":"Efficient Constraint Evaluation Algorithms for Hierarchical Next-Best-View Planning","authors":"Kok-Lim Low, A. Lastra","doi":"10.1109/3DPVT.2006.52","DOIUrl":"https://doi.org/10.1109/3DPVT.2006.52","url":null,"abstract":"We recently proposed a new and efficient next-best- view algorithm for 3D reconstruction of indoor scenes using active range sensing. We overcome the computation difficulty of evaluating the view metric function by using an adaptive hierarchical approach to exploit the various spatial coherences inherent in the acquisition constraints and quality requirements. The impressive speedups have allowed our NBV algorithm to become the first to be able to exhaustively evaluate a large set of 3D views with respect to a large set of surfaces, and to include many practical acquisition constraints and quality requirements. The success of the algorithm is greatly dependent on the implementation efficiency of the constraint and quality evaluations. In this paper, we describe the algorithmic details of the hierarchical view evaluation, and present efficient algorithms that evaluate sensing constraints and surface sampling densities between a view volume and a surface patch instead of simply between a single view point and a surface point. The presentation here provides examples for the design of efficient algorithms for new sensing constraints.","PeriodicalId":346673,"journal":{"name":"Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122803558","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}
引用次数: 32
Low Altitude Wind Simulation over Mount Saint Helens Using NASA SRTM Digital Terrain Model 利用 NASA SRTM 数字地形模型模拟圣海伦山上空的低空风
Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06) Pub Date : 2006-06-14 DOI: 10.1109/3DPVT.2006.92
Manuel Garcia, P. Boulanger
{"title":"Low Altitude Wind Simulation over Mount Saint Helens Using NASA SRTM Digital Terrain Model","authors":"Manuel Garcia, P. Boulanger","doi":"10.1109/3DPVT.2006.92","DOIUrl":"https://doi.org/10.1109/3DPVT.2006.92","url":null,"abstract":"On February 11, 2000, the Shuttle Radar Topography Mission (SRTM) was launched into space as part of one of the pay load of the Shuttle Endeavor. Using a new radar sweeping technique most of the Earth's surfaces was digitized in 3D in approximately 10 days. SRTM acquired enough data during its mission to obtain a near-global high-resolution database of the Earth's topography. This paper describe how this revolutionary data set can be used to simulate anywhere around the Earth low altitude wind conditions for various atmospheric conditions. More specifically, we will describe the various processing steps necessary to convert this high-resolution terrain model provided by the SRTM database into a Computational Fluid Dynamic (CFD) volumetric mesh that is compatible with an open source CFD solver called OpenFOAM running in parallel on large West- Grid supercomputers. This work is the result of a new virtual wind-tunnel under development at the University of Alberta. In the paper, we present wind flow over the Mount- Saint Helens in the United States for a simple wind flow boundary condition.","PeriodicalId":346673,"journal":{"name":"Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129522780","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}
引用次数: 8
Interactive Modeling with Automatic Online Compression 交互式建模与自动在线压缩
Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06) Pub Date : 2006-06-14 DOI: 10.1109/3DPVT.2006.83
J. Deschênes, Philippe Lambert, P. Hébert
{"title":"Interactive Modeling with Automatic Online Compression","authors":"J. Deschênes, Philippe Lambert, P. Hébert","doi":"10.1109/3DPVT.2006.83","DOIUrl":"https://doi.org/10.1109/3DPVT.2006.83","url":null,"abstract":"A few 3D interactive modeling systems have been developed recently. Such systems must cope with a high flow of input measurements during the entire acquisition period. Therefore, the reconstruction and rendering algorithms used must all run online. However, compression algorithms are still run offline as postprocessing. In order to develop a fully interactive modeling framework, this paper presents an online compression algorithm where the system automatically adjusts the level of detail according to the user behavior. The proposed method can reduce peak memory consumption by more than 50% during the acquisition of a typical model and the final result is comparable to offline compression. Furthermore, the results obtained show that a local acquisition approach must be prioritized.","PeriodicalId":346673,"journal":{"name":"Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128416520","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
An Efficient Error-Bounded General Camera Model 一种有效的误差有界通用相机模型
Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06) Pub Date : 2006-06-14 DOI: 10.1109/3DPVT.2006.26
V. Popescu, Jordan Dauble, Chunhui Mei, E. Sacks
{"title":"An Efficient Error-Bounded General Camera Model","authors":"V. Popescu, Jordan Dauble, Chunhui Mei, E. Sacks","doi":"10.1109/3DPVT.2006.26","DOIUrl":"https://doi.org/10.1109/3DPVT.2006.26","url":null,"abstract":"Camera models are essential infrastructure in computer vision, computer graphics, and visualization. The most frequently used camera models are based on the single- viewpoint constraint. Removing this constraint brings the advantage of improved flexibility in camera design. However, prior camera models that eliminate the single- viewpoint constraint are inefficient. We describe an approximate model for coherent general cameras, which projects efficiently with user chosen accuracy. The rays of the general camera are partitioned into simple cameras that approximate the camera locally. The simple cameras are modeled with k- ray cameras, a novel class of non-pinhole cameras. The rays of a k-ray camera interpolate between k construction rays. We analyze several variants of k-ray cameras. The resulting compound camera model is efficient because the number of simple cameras is orders of magnitude lower than the original number of rays camera, and because each simple camera offers closed-form projection.","PeriodicalId":346673,"journal":{"name":"Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130320484","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}
引用次数: 11
Hierarchical PCA Decomposition of Point Clouds 点云的层次PCA分解
Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06) Pub Date : 2006-06-14 DOI: 10.1109/3DPVT.2006.72
J. Fransens, F. Reeth
{"title":"Hierarchical PCA Decomposition of Point Clouds","authors":"J. Fransens, F. Reeth","doi":"10.1109/3DPVT.2006.72","DOIUrl":"https://doi.org/10.1109/3DPVT.2006.72","url":null,"abstract":"We present a hierarchical, analysis technique for point clouds, based on principal component analysis (PCA), a well known multivariate statistical method. The crux of the algorithm is a top-down planarity assessment of the underlying point data, after which individual planar patches are merged using a tree clustering technique. We will demonstrate how the results of this analysis are used as a preprocessing step for computer aided inspection of sheet metal folding, surface reconstruction and a hybrid point- polygon rendering algorithm.","PeriodicalId":346673,"journal":{"name":"Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129134717","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}
引用次数: 8
Isoradius Contours: New Representations and Techniques for 3D Face Registration and Matching 等半径轮廓:三维人脸配准与匹配的新表征与技术
Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06) Pub Date : 2006-06-14 DOI: 10.1109/3DPVT.2006.85
Nick E. Pears, T. Heseltine
{"title":"Isoradius Contours: New Representations and Techniques for 3D Face Registration and Matching","authors":"Nick E. Pears, T. Heseltine","doi":"10.1109/3DPVT.2006.85","DOIUrl":"https://doi.org/10.1109/3DPVT.2006.85","url":null,"abstract":"We propose a technique for 3D face registration and matching using a novel representation called \"isoradius contours\". An isoradius contour is the contour on the 3D facial surface that is a known fixed distance relative to some predefined reference point (the tip of the nose). A 3D face representation contains many isoradius contours with different radii and the first major benefit of the technique is that the shape of the contours is independent of the facial pose, due to the infinite rotational symmetry of a sphere. The second major benefit of the technique is that registration, alignment and matching can be implemented using a simple process of ID correlation. Our results have shown that registration and alignment is of comparable accuracy to ICP (iterative closest points), but is fast, non iterative, and is robust to the presence of outliers.","PeriodicalId":346673,"journal":{"name":"Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125628383","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}
引用次数: 15
A 3D Outdoor Scene Scanner Based on a Night-Vision Range-Gated Active Imaging System 基于夜视距离门控主动成像系统的三维户外场景扫描仪
Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06) Pub Date : 2006-06-14 DOI: 10.1109/3DPVT.2006.8
D. Monnin, Armin L. Schneider, F. Christnacher, Y. Lutz
{"title":"A 3D Outdoor Scene Scanner Based on a Night-Vision Range-Gated Active Imaging System","authors":"D. Monnin, Armin L. Schneider, F. Christnacher, Y. Lutz","doi":"10.1109/3DPVT.2006.8","DOIUrl":"https://doi.org/10.1109/3DPVT.2006.8","url":null,"abstract":"We present a 3D outdoor scene scanner for the acquisition of kilometers-deep scenes in night conditions. Its imaging system is based on a compact and low-cost pulsed laser illuminator and a light-intensifier equipped CCD camera. By precisely synchronizing both the illuminator and the camera shutter, it is possible to acquire \"slices\" of the scene at specific known distances. We show that even with large laser pulses and without megahertz-capable electronics, the third dimension can be recovered for the whole range of the scene by processing only two images acquired in specific conditions. As the pixel intensities of the images produced by active imaging systems vary with the square of the range, and due to the limited dynamics of image sensors, scanning long-range scenes with shorter \"slices\" allows the camera gain to be adjusted with respect to the range and the accuracy to be enhanced. The imaging system as well as the different image processing steps are detailed in this paper and an example of typical results is given.","PeriodicalId":346673,"journal":{"name":"Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06)","volume":"63 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126019084","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}
引用次数: 44
Multiple Camera Calibration Using Robust Perspective Factorization 基于鲁棒视角分解的多摄像机标定
Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06) Pub Date : 2006-06-14 DOI: 10.1109/3DPVT.2006.100
Andrei Zaharescu, R. Horaud, Rémi Ronfard, L. Lefort
{"title":"Multiple Camera Calibration Using Robust Perspective Factorization","authors":"Andrei Zaharescu, R. Horaud, Rémi Ronfard, L. Lefort","doi":"10.1109/3DPVT.2006.100","DOIUrl":"https://doi.org/10.1109/3DPVT.2006.100","url":null,"abstract":"In this paper we address the problem of recovering structure and motion from a large number of intrinsically calibrated perspective cameras. We describe a method that combines (1) weak-perspective reconstruction in the presence of noisy and missing data and (2) an algorithm that updates weak-perspective reconstruction to perspective reconstruction by incrementally estimating the projective depths. The method also solves for the reversal ambiguity associated with affine factorization techniques. The method has been successfully applied to the problem of calibrating the external parameters (position and orientation) of several multiple-camera setups. Results obtained with synthetic and experimental data compare favourably with results obtained with nonlinear minimization such as bundle adjustment.","PeriodicalId":346673,"journal":{"name":"Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115972000","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}
引用次数: 19
Multi-View Multi-Exposure Stereo 多视角多曝光立体
Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06) Pub Date : 2006-06-14 DOI: 10.1109/3DPVT.2006.98
Alejandro J. Troccoli, S. B. Kang, S. Seitz
{"title":"Multi-View Multi-Exposure Stereo","authors":"Alejandro J. Troccoli, S. B. Kang, S. Seitz","doi":"10.1109/3DPVT.2006.98","DOIUrl":"https://doi.org/10.1109/3DPVT.2006.98","url":null,"abstract":"Multi-view stereo algorithms typically rely on same-exposure images as inputs due to the brightness constancy assumption. While state-of-the-art depth results are excellent, they do not produce high-dynamic range textures required for high-quality view reconstruction. In this paper, we propose a technique that adapts multi-view stereo for different exposure inputs to simultaneously recover reliable dense depth and high dynamic range textures. In our technique, we use an exposure-invariant similarity statistic to establish correspondences, through which we robustly extract the camera radiometric response function and the image exposures. This enables us to then convert all images to radiance space and selectively use the radiance data for dense depth and high dynamic range texture recovery. We show results for synthetic and real scenes.","PeriodicalId":346673,"journal":{"name":"Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134308241","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}
引用次数: 44
下一页 尾页
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学术官方微信