4,391 Hits in 5.3 sec

Fast low-memory streaming MLS reconstruction of point-sampled surfaces

R Pajarola, G Cuccuru, E Gobbetti, F Marton, R Pintus
Fast low-memory streaming MLS reconstruction of point-sampled surfaces Abstract We present a simple and ecient method for reconstructing triangulated surfaces from massive oriented point sample datasets  ...  We present a simple and efficient method for reconstructing triangulated surfaces from massive oriented point sample datasets.  ...  In our approach, this sort of smoothing step Ecient low-memory streaming implementation Streaming reconstruction assumes that the octree is adaptively rened near the surface of the model at a level  ... 
doi:10.5167/uzh-29727 fatcat:vczswny44bhrfmzkisckaaw7ue

Moving Least-Squares Reconstruction of Large Models with GPUs

Bruce Merry, James Gain, Patrick Marais
2014 IEEE Transactions on Visualization and Computer Graphics  
We present a GPU-accelerated implementation of the Moving Least Squares (MLS) surface reconstruction technique.  ...  It also allows data sets with billions of point samples to be processed on a standard desktop PC.  ...  [15] also perform out-of-core MLS reconstruction, but use a streaming approach. The points are sorted along an axis, then processed in a single pass, keeping an active set in memory. Bolitho et al.  ... 
doi:10.1109/tvcg.2013.118 pmid:24356367 fatcat:rytvtwpu2bggplyz5m2xbkggje

FusionMLS: Highly dynamic 3D reconstruction with consumer-grade RGB-D cameras

Siim Meerits, Diego Thomas, Vincent Nozick, Hideo Saito
2018 Computational Visual Media  
Our approach does not store the reconstruction volume in memory, making it memory-efficient and scalable to large scenes. Our implementation is completely GPU based and works in real time.  ...  To manage the resulting huge number of input depth images, we also introduce an efficient moving least squares-based volumetric reconstruction method that generates triangle meshes of the scene.  ...  We choose to estimate the local surfaces using MLS, which samples many points in the neighborhood of the voxel.  ... 
doi:10.1007/s41095-018-0121-0 fatcat:uiqymh55ibfmjczikwike5lpma

Robust and Efficient Surface Reconstruction From Range Data

P. Labatut, J.-P. Pons, R. Keriven
2009 Computer graphics forum (Print)  
We describe a robust but simple algorithm to reconstruct a surface from a set of merged range scans.  ...  scale well with respect to the size of the input point cloud.  ...  Finally the authors of [ACK01, OBA * 03, DG06, KBH06] are thanked for sharing the implementations of their respective reconstruction algorithms.  ... 
doi:10.1111/j.1467-8659.2009.01530.x fatcat:ut7p7wyd7nhr7hq6cdeqh46gvm

Efficient implementation of point set reconstruction by multi-layer peeling algorithm

Lu Wang, Tiow-Seng Tan, Chi-Wan Lim, Xiang-Xu Meng, Cheng Du, Zhen-fang Ji
2011 Computers & graphics  
We present a memory and time efficient surface reconstruction algorithm for large sets of points, without normal information, that may not fit within the main memory.  ...  Our algorithm treats the input points as forming layers of surface patches, and then performs reconstruction by working on multiple layers of surface patches concurrently based on an out-of-core octree  ...  [11] exploits an out-of-core octree indexing scheme that allows efficient retrieval of closest point queries based on the explicit moving-least squares (MLS) surface reconstruction.  ... 
doi:10.1016/j.cag.2010.12.004 fatcat:pn4iqq4kgje4bbeyo5majm2s4i

A multi-resolution interpolation scheme for pathline based Lagrangian flow representations

Alexy Agranovsky, Harald Obermaier, Christoph Garth, Kenneth I. Joy, David L. Kao, Ming C. Hao, Mark A. Livingston, Thomas Wischgoll
2015 Visualization and Data Analysis 2015  
We exemplify the advantages of replacing integration with interpolation for particle trajectory calculation through a real-time, low memory cost, interactive exploration environment for the study of flow  ...  of memory mapped by the file system.  ...  The initial surface reconstruction relies on pathlines interpolated from a low resolution sampling of the flow map.  ... 
doi:10.1117/12.2083253 dblp:conf/vda/AgranovskyOGJ15 fatcat:62elrhktejf7pksfa6sgkk4k4i

Robust mesh reconstruction from unoriented noisy points

Hoi Sheung, Charlie C. L. Wang
2009 2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling on - SPM '09  
Thirdly, a combinatorial approach is employed to reconstruct a triangular mesh connecting the down-sampled points, and a polygonal mesh which preserves sharp features is constructed by the dual-graph of  ...  We present a robust method to generate mesh surfaces from unoriented noisy points in this paper. The whole procedure consists of three steps.  ...  RELATED WORK The related works in the aspects of volumetric reconstruction, combinatorial approaches, robust statistics in surface reconstruction, down-sampling of massive points, and streaming and parallel  ... 
doi:10.1145/1629255.1629258 dblp:conf/sma/SheungW09 fatcat:wjbgnwg3mnf7to7jsrh2szncae

The Quantized kd-Tree: Efficient Ray Tracing of Compressed Point Clouds

Erik Hubo, Tom Mertens, Tom Haber, Philippe Bekaert
2006 2006 IEEE Symposium on Interactive Ray Tracing  
Computational efficiency has been the main focus of previous work on ray tracing point-sampled surfaces.  ...  We show that the Quantized kd-tree reduces the memory footprint up to 18 times, not compromising performance.  ...  Part of the research at the Expertise Centre for Digital Media is funded by the ERDF (European Regional Development Fund), the Flemish Government and the Flemish Interdisciplinary institute for Broadband  ... 
doi:10.1109/rt.2006.280221 fatcat:4lxblvcrura7jkmn7jwb4p54qe

Applications and Techniques for Fast Machine Learning in Science [article]

Allison McCarn Deiana, Joshua Agar, Michaela Blott, Giuseppe Di Guglielmo, Javier Duarte, Philip Harris, Scott Hauck, Mia Liu, Mark S. Neubauer, Jennifer Ngadiuba, Seda Ogrenci-Memik, Maurizio Pierini (+74 others)
2021 arXiv   pre-print
The material for the report builds on two workshops held by the Fast ML for Science community and covers three main areas: applications for fast ML across a number of scientific domains; techniques for  ...  In this community review report, we discuss applications and techniques for fast machine learning (ML) in science -- the concept of integrating power ML methods into the real-time experimental data processing  ...  In summary, the core of designing NN architecture is to have a fast method of sampling architectures (through NAS), and the fast training of the sampled architectures (through fast and robust optimization  ... 
arXiv:2110.13041v1 fatcat:cvbo2hmfgfcuxi7abezypw2qrm

Feature enhancing aerial lidar point cloud refinement

Zhenzhen Gao, Ulrich Neumann, Atilla M. Baskurt, Robert Sitnik
2014 Three-Dimensional Image Processing, Measurement (3DIPM), and Applications 2014  
In a separate similar process, boundary points are smoothed directed by tangent directions of underlying lines, and ii) the up-sampling step interpolates new points to fill gaps/holes for both interior  ...  We present a new refinement approach to accommodate unique properties of aerial LiDAR building points.  ...  Due to noise and under-sampling, a direct rendering or surface reconstruction of raw points produces grainy surfaces, gaps and holes, and irregular boundaries.  ... 
doi:10.1117/12.2035749 dblp:conf/3dica/GaoN14 fatcat:f3o4my4b3jba7myxx2kyby5b4u

A fast framework construction and visualization method for particle-based fluid

Fengquan Zhang, Zhaowei Wang, Jian Chang, Jianjun Zhang, Feng Tian
2017 EURASIP Journal on Image and Video Processing  
Fast and vivid fluid simulation and visualization is a challenge topic of study in recent years.  ...  Furthermore, to realize the fast construction of scenes, an optimized design of parallel framework and interface is also discussed in our paper.  ...  Guennebaud and Gross [28] presented an improved Moving Least Squares (MLS) method to improve the stability in low sampled and high curved sections.  ... 
doi:10.1186/s13640-017-0227-9 fatcat:7cdgg72krrdotlyd5wevg6xgye

High-Quality Extraction of Isosurfaces from Regular and Irregular Grids

John Schreiner, Carlos Scheidegger, Claudio Silva
2006 IEEE Transactions on Visualization and Computer Graphics  
In particular, we describe a set of sampling conditions that guarantee that surface features will be captured by the algorithm.  ...  They are often the main computational component of important processing pipelines (e.g. , surface reconstruction), and are heavily used in practice.  ...  , Lawrence Livermore National Laboratory, an IBM Faculty Award, and a University of Utah Seed Grant.  ... 
doi:10.1109/tvcg.2006.149 pmid:17080853 fatcat:aqhhiatmojat7k62irlkgh2p4a

Compression of Point-Based 3D Models by Shape-Adaptive Wavelet Coding of Multi-Height Fields [article]

Tilo Ochotta, Dietmar Saupe
2004 Symposium Point-Based Graphics : [Proceedings]  
We propose a compression scheme for coordinate data of point-based 3D models of surfaces.  ...  In our encodings of complex 3D models competitive rate-distortion performances were achieved with excellent reconstruction quality at under 3 bits per point (bpp).  ...  This work was supported by a grant of the Kurt Lion foundation.  ... 
doi:10.2312/spbg/spbg04/103-112 fatcat:wrzgkkdmnrb55d2qbguq7fpy5m

Direct (Re)Meshing for Efficient Surface Processing

John Schreiner, Carlos E. Scheidegger, Shachar Fleishman, Cláudio T. Silva
2006 Computer graphics forum (Print)  
We also show how to adapt the algorithm to blend and merge mixed-mode objects -for example, to compute the union of a point-set surface and a triangle mesh.  ...  While many remeshing algorithms are based on global parametrization or local mesh optimization, our algorithm is closely related to surface reconstruction techniques and it requires no explicit parameterization  ...  of Utah Seed Grant.  ... 
doi:10.1111/j.1467-8659.2006.00972.x fatcat:5hswny72wjbo7besrg3yruxdri

Liborg: a lidar-based robot for efficient 3D mapping

Michiel Vlaminck, Wilfried Philips, Hiêp Q. Luong, Andrew G. Tescher
2017 Applications of Digital Image Processing XL  
The novelty of this work is in the highly efficient way we deal with the tremendous amount of data to guarantee fast execution times while preserving sufficiently high accuracy.  ...  The paper discusses and evaluates the main benefits of our approach including its efficiency regarding building and updating the map and its compactness regarding compressing the map.  ...  After that, the newly created points are projected to the mls surface of the closest point in the point cloud.  ... 
doi:10.1117/12.2272145 fatcat:wubc2gkpjvajdljwitrdw4cfd4
« Previous Showing results 1 — 15 out of 4,391 results