Using Multicore Processors to Parallelize 3D Point Cloud Registration with the Coarse Binary Cubes Method

Similar documents
A. OPENING POINT CLOUDS. (Notepad++ Text editor) (Cloud Compare Point cloud and mesh editor) (MeshLab Point cloud and mesh editor)

Fast Multipole Method for particle interactions: an open source parallel library component

Hardware design for ray tracing

Sense. 3D Scanner. User Guide

Universidad de Cantabria Departamento de Tecnología Electrónica, Ingeniería de Sistemas y Automática. Tesis Doctoral

Project-Based Learning of Scientific Writing and Communication Skills for Postgraduate Students

Visualisation in the Google Cloud

Improving System Scalability of OpenMP Applications Using Large Page Support

Intelligent Flexible Automation

CHAPTER 1 INTRODUCTION

Real-Time 3D Reconstruction Using a Kinect Sensor

Tracking a Depth Camera: Parameter Exploration for Fast ICP

Automatic Reconstruction of Parametric Building Models from Indoor Point Clouds. CAD/Graphics 2015

South East of Process Main Building / 1F. North East of Process Main Building / 1F. At 14:05 April 16, Sample not collected

VOLUMNECT - Measuring Volumes with Kinect T M

Lecture 3: Modern GPUs A Hardware Perspective Mohamed Zahran (aka Z) mzahran@cs.nyu.edu

PERFORMANCE ENHANCEMENTS IN TreeAge Pro 2014 R1.0

1. INTRODUCTION Graphics 2

IMPLICIT SHAPE MODELS FOR OBJECT DETECTION IN 3D POINT CLOUDS

Introduction to Cloud Computing

Tackling Big Data with MATLAB Adam Filion Application Engineer MathWorks, Inc.

Variations in Performance and Scalability when Migrating n-tier Applications to Different Clouds

ACCURACY ASSESSMENT OF BUILDING POINT CLOUDS AUTOMATICALLY GENERATED FROM IPHONE IMAGES

Analysis of XBOX Kinect Sensor Data for Use on Construction Sites: Depth Accuracy and Sensor Interference Assessment

Europass Curriculum Vitae

I-SiTE - Laser Scanning Revolutionises Site Survey

Spatial location in 360 of reference points over an object by using stereo vision

TRENTINO - The research, training and mobility programme in Trentino - PCOFUND-GA

Circle detection and tracking speed-up based on change-driven image processing

Parametric Analysis of Mobile Cloud Computing using Simulation Modeling

Performance Evaluations of Graph Database using CUDA and OpenMP Compatible Libraries

AN ADAPTIVE LOAD BALANCING TECHNIQUE FOR DISTRIBUTED VIRTUAL ENVIRONMENT SYSTEMS

ASSESSMENT OF VISUALIZATION SOFTWARE FOR SUPPORT OF CONSTRUCTION SITE INSPECTION TASKS USING DATA COLLECTED FROM REALITY CAPTURE TECHNOLOGIES

WELCOME TO THE FUTURE OF DIGITAL SIGNAGE

CUBE-MAP DATA STRUCTURE FOR INTERACTIVE GLOBAL ILLUMINATION COMPUTATION IN DYNAMIC DIFFUSE ENVIRONMENTS

Fast Voxel Maps with Counting Bloom Filters

An Adaptive Hierarchical Next-Best-View Algorithm for 3D Reconstruction of Indoor Scenes

HistoPyramid stream compaction and expansion

Findings in High-Speed OrthoMosaic

High Performance Computing in CST STUDIO SUITE

Four Keys to Successful Multicore Optimization for Machine Vision. White Paper

Parallels Virtuozzo Containers

GeoImaging Accelerator Pansharp Test Results

Sense. 3D Scanner. User Guide. See inside for use and safety information.

Carlos Villavieja, Nacho Navarro Arati Baliga, Liviu Iftode

Crosswalk: build world class hybrid mobile apps

Bogdan Vesovic Siemens Smart Grid Solutions, Minneapolis, USA

GUIDE TO POST-PROCESSING OF THE POINT CLOUD

HPC Wales Skills Academy Course Catalogue 2015

Assessment. Presenter: Yupu Zhang, Guoliang Jin, Tuo Wang Computer Vision 2008 Fall

Specifying Laser Scanning Services. A Quantapoint White Paper

Lecture 11: Multi-Core and GPU. Multithreading. Integration of multiple processor cores on a single chip.

How To Use Bodescan For 3D Imaging Of The Human Body

Hardware-Aware Analysis and. Presentation Date: Sep 15 th 2009 Chrissie C. Cui

REALTIME 3D MAPPING, OPTIMIZATION, AND RENDERING BASED ON A DEPTH SENSOR CRAIG MOUSER. Bachelor of Science in Computer Engineering

CS277 - Experimental Haptics

Virtualization of ArcGIS Pro. An Esri White Paper December 2015

Server Virtualization and Cloud Computing

BSPCloud: A Hybrid Programming Library for Cloud Computing *

The Future Of Animation Is Games

A New Approach to Cutting Tetrahedral Meshes

Automatic Labeling of Lane Markings for Autonomous Vehicles

Muse Server Sizing. 18 June Document Version Muse

SYSTAP / bigdata. Open Source High Performance Highly Available. 1 bigdata Presented to CSHALS 2/27/2014

Clustering Billions of Data Points Using GPUs

Juha Hyvärinen SURFACE RECONSTRUCTION OF POINT CLOUDS CAPTURED WITH MICROSOFT KINECT

Performance of Software Switching

Achieving Real-Time Business Solutions Using Graph Database Technology and High Performance Networks

Classifying Manipulation Primitives from Visual Data

Performance Guideline for syslog-ng Premium Edition 5 LTS

Performance Analysis of Web based Applications on Single and Multi Core Servers

HPC enabling of OpenFOAM R for CFD applications

Dynamic Resolution Rendering

In-Situ Bitmaps Generation and Efficient Data Analysis based on Bitmaps. Yu Su, Yi Wang, Gagan Agrawal The Ohio State University

DAMAGED ROAD TUNNEL LASER SCANNER SURVEY

Auto-Tuning TRSM with an Asynchronous Task Assignment Model on Multicore, GPU and Coprocessor Systems

Data Structure for Real-Time Processing in 3-D

NVIDIA IndeX Enabling Interactive and Scalable Visualization for Large Data Marc Nienhaus, NVIDIA IndeX Engineering Manager and Chief Architect

Chapter 18: Database System Architectures. Centralized Systems

Post Processing Service

A VOXELIZATION BASED MESH GENERATION ALGORITHM FOR NUMERICAL MODELS USED IN FOUNDRY ENGINEERING

IS-ENES/PrACE Meeting EC-EARTH 3. A High-resolution Configuration

Estimation of Position and Orientation of Mobile Systems in a Wireless LAN

Drivers to support the growing business data demand for Performance Management solutions and BI Analytics

Robust Algorithms for Current Deposition and Dynamic Load-balancing in a GPU Particle-in-Cell Code

Off-line Model Simplification for Interactive Rigid Body Dynamics Simulations Satyandra K. Gupta University of Maryland, College Park

Department of Computer Sciences University of Salzburg. HPC In The Cloud? Seminar aus Informatik SS 2011/2012. July 16, 2012

Collecting and Analyzing Big Data for O&G Exploration and Production Applications October 15, 2013 G&G Technology Seminar

THE RTOS AS THE ENGINE POWERING THE INTERNET OF THINGS

A Practical Method for Estimating Performance Degradation on Multicore Processors, and its Application to HPC Workloads.

DDS-Enabled Cloud Management Support for Fast Task Offloading

RoboCup Advanced 3D Monitor

Dynamic resource management for energy saving in the cloud computing environment

GPU Point List Generation through Histogram Pyramids

Using In-Memory Computing to Simplify Big Data Analytics

How To Cluster Of Complex Systems

Quality management of 3D cultural heritage replicas with CIDOC-CRM

Course Development of Programming for General-Purpose Multicore Processors

Centralized Systems. A Centralized Computer System. Chapter 18: Database System Architectures

HPC Deployment of OpenFOAM in an Industrial Setting

Transcription:

University Departamento of Málaga de Ingeniería de Using Multicore Processors to Parallelize 3D Point Cloud Registration with the Coarse Binary Cubes Method Jorge L. Martínez, Antonio J. Reina, Jesús Morales, Anthony Mandow and Alfonso García-Cerezo Departamento de Ingeniería de Sistemas y Automática Universidad de Málaga, Spain 1

Outline 1. INTRODUCTION 2. THE COARSE BINARY CUBES (CBC) METHOD University Departamento of Málaga de Ingeniería de 3. CBC FOR MULTICORE PROCESSORS 4. EXPERIMENTAL RESULTS 5. CONCLUSIONS 2

University Departamento of Málaga de Ingeniería de 1. INTRODUCTION 3

University of Málaga Departamento de Ingeniería de Spain Sistemas y Automática 3D point cloud matching It is a basic operation in mobile robotics for localization and mapping. All scan directions and depths may contain relevant data. Farther regions have lower sampling densities. The search is performed around an initial odometric estimation. 4

Aim of this work To speed up 3D point cloud matching with the Coarse Binary Cubes (CBC) method University Departamento of Málaga de Ingeniería de by taking advantage of widespread multicore and multithreaded processors. 5

University Departamento of Málaga de Ingeniería de 2. THE COARSE BINARY CUBES (CBC) METHOD 6

Illustration of the CBC principle 1st range image 2nd range image Z* Coincident 2 nd pose Y* Which is the spatial transformation University Departamento of Málaga de Ingeniería de X Z 1 st pose T Y X* to project the second scan into the first scan that maximices the number J of coincident binary cubes? 7

The CBC method Objective function J(T) can be evaluated: - without using any 3D data structure, - in O(n) time, where n is the number of points. University Departamento of Málaga de Ingeniería de The search for T is performed with a variation of the Nelder-Mead method: - Instead of a simplex of 7 vertices, vertices are used. - Shrinking the set of vertices is avoided and the set is reinitialized around the initial estimation. CBC is a compelling alternative to Iterative Closest Points (ICP) and Normal Distribution Transform (NDT) for scene registration (Martínez et al., 2012). 8

Example of a match for outdoor scene Second scan First scan University of Málaga Departamento de Ingeniería de Spain Sistemas y Automática Motion T Cube edge: 0.3 m 9

University Departamento of Málaga de Ingeniería de 3. CBC FOR MULTICORE PROCESSORS 10

Parallelization alternatives 1. To broke down the computation of J into independent tasks to be evenly spread across the cores. - It requires semaphores to share data structures. University Departamento of Málaga de Ingeniería de 2. To evaluate different prospective solutions J(T) in parallel by replacing the p worst vertices. - This strategy is suitable as long as p<m. - Easily scalable to the available cores without rewriting code. - Replacement of a vertex requires 2 J evaluations: reflection and (expansion or contraction). 11

University Departamento of Málaga de Ingeniería de 4. EXPERIMENTAL RESULTS 12

Experimental setup University of Málaga Departamento de Ingeniería de Spain Sistemas y Automática 2D scan Indoor scene 3D laser device Point cloud: n= 505.036 points, Maximun range: 30 m 13

Registration results (Linux OS,OpenMP library,m= 22) University Departamento of Málaga de Ingeniería de Processor: Intel Core Quad Q9550 (4 cores) 14

Registration results (Linux OS,OpenMP library,m=28) University Departamento of Málaga de Ingeniería de Processor: Intel Core i7 2720QM (8 virtual cores) 15

University Departamento of Málaga de Ingeniería de 5. CONCLUSIONS 16

Conclusions The efficiency of Coarse Binary Cubes (CBC) method has been improved by using multicore processors. Prospective solutions has been evaluated in parallel in the Nelder-Mead search by replacing the p worst vertices. University Departamento of Málaga de Ingeniería de A gain g near to the number of physical cores have been achieved without degrading registration accuracy. Future work: - Subsample the scan to reduce the number of points to be projected n. - Parallelize CBC with a Graphic Processing Unit (GPU). 17

Thank you! University Departamento of Málaga de Ingeniería de 18