Gerald Dalley Signal Analysis and Machine Perception Laboratory The Ohio State University 07 Feb 2002 Linux Clustering Software + Surface Reconstruction.

Slides:



Advertisements
Similar presentations
Lecture 12: MapReduce: Simplified Data Processing on Large Clusters Xiaowei Yang (Duke University)
Advertisements

1 st Meeting, Industrial Geometry, 2005 Approximating Solids by Balls (in collaboration with subproject: "Applications of Higher Geometrics") Bernhard.
Surface Reconstruction From Unorganized Point Sets
Chapter 3. MPI MPI = Message Passing Interface Specification of message passing libraries for developers and users –Not a library by itself, but specifies.
KIM TAEHO PARK YOUNGMIN.  Curve Reconstruction problem.
Setting up of condor scheduler on computing cluster Raman Sehgal NPD-BARC.
Sample Shuffling for Quality Hierarchic Surface Meshing.
06/08/10 PBS, LSF and ARC integration Zoltán Farkas MTA SZTAKI LPDS.
OSCAR Jeremy Enos OSCAR Annual Meeting January 10-11, 2002 Workload Management.
Job Submission on WestGrid Feb on Access Grid.
Lecture 1: History of Operating System
Tamal K. Dey The Ohio State University Delaunay Meshing of Surfaces.
Surface Reconstruction Some figures by Turk, Curless, Amenta, et al.
Asynchronous Solution Appendix Eleven. Training Manual Asynchronous Solution August 26, 2005 Inventory # A11-2 Chapter Overview In this chapter,
Tamal K. Dey The Ohio State University Computing Shapes and Their Features from Point Samples.
BY: SACHIN SHRIVASTAVA Operating System By : Sachin Shrivastava 1.
DIRAC API DIRAC Project. Overview  DIRAC API  Why APIs are important?  Why advanced users prefer APIs?  How it is done?  What is local mode what.
Introduction to UNIX/Linux Exercises Dan Stanzione.
QCDgrid Technology James Perry, George Beckett, Lorna Smith EPCC, The University Of Edinburgh.
A Navigation Mesh for Dynamic Environments Wouter G. van Toll, Atlas F. Cook IV, Roland Geraerts CASA 2012.
Dobrina Boltcheva, Mariette Yvinec, Jean-Daniel Boissonnat INRIA – Sophia Antipolis, France 1. Initialization Use the.
A Distributed Computing System Based on BOINC September - CHEP 2004 Pedro Andrade António Amorim Jaime Villate.
ISG We build general capability Introduction to Olympus Shawn T. Brown, PhD ISG MISSION 2.0 Lead Director of Public Health Applications Pittsburgh Supercomputing.
The Pipeline Processing Framework LSST Applications Meeting IPAC Feb. 19, 2008 Raymond Plante National Center for Supercomputing Applications.
VIPBG LINUX CLUSTER By Helen Wang March 29th, 2013.
Bigben Pittsburgh Supercomputing Center J. Ray Scott
March 3rd, 2006 Chen Peng, Lilly System Biology1 Cluster and SGE.
Tamal K. Dey The Ohio State University Computing Shapes and Their Features from Point Samples.
03/27/2003CHEP20031 Remote Operation of a Monte Carlo Production Farm Using Globus Dirk Hufnagel, Teela Pulliam, Thomas Allmendinger, Klaus Honscheid (Ohio.
SURFACE RECONSTRUCTION FROM POINT CLOUD Bo Gao Master’s Thesis December, 2007 Thesis Committee: Professor Harriet Fell Professor Robert Futrelle College.
QCDGrid Progress James Perry, Andrew Jackson, Stephen Booth, Lorna Smith EPCC, The University Of Edinburgh.
Guide to Linux Installation and Administration, 2e1 Chapter 2 Planning Your System.
17-April-2007 High Performance Computing Basics April 17, 2007 Dr. David J. Haglin.
CS 390 Unix Programming Summer Unix Programming - CS 3902 Course Details Online Information Please check.
Rochester Institute of Technology Job Submission Andrew Pangborn & Myles Maxfield 10/19/2015Service Oriented Cyberinfrastructure Lab,
The ALICE short-term use case DataGrid WP6 Meeting Milano, 11 Dec 2000Piergiorgio Cerello 1 Physics Performance Report (PPR) production starting in Feb2001.
Ganga A quick tutorial Asterios Katsifodimos Trainer, University of Cyprus Nicosia, Feb 16, 2009.
Enabling Grids for E-sciencE EGEE-III INFSO-RI Using DIANE for astrophysics applications Ladislav Hluchy, Viet Tran Institute of Informatics Slovak.
Lecture 7 : Point Set Processing Acknowledgement : Prof. Amenta’s slides.
1/43 Department of Computer Science and Engineering Delaunay Mesh Generation Tamal K. Dey The Ohio State University.
Getting started DIRAC Project. Outline  DIRAC information system  Documentation sources  DIRAC users and groups  Registration with DIRAC  Getting.
Detecting Undersampling in Surface Reconstruction Tamal K. Dey and Joachim Giesen Ohio State University.
PMR: Point to Mesh Rendering, A Feature-Based Approach Tamal K. Dey and James Hudson
A New Voronoi-based Reconstruction Algorithm
9 of 18 Introduction to medial axis transforms and their computation Outline DefinitionsMAS PropertiesMAS CAD modelsTJC The challenges for computingTJC.
National Energy Research Scientific Computing Center (NERSC) Visualization Highlights Cristina Siegerist NERSC Center Division, LBNL October 4, 2005.
UTA MC Production Farm & Grid Computing Activities Jae Yu UT Arlington DØRACE Workshop Feb. 12, 2002 UTA DØMC Farm MCFARM Job control and packaging software.
ISG We build general capability Introduction to Olympus Shawn T. Brown, PhD ISG MISSION 2.0 Lead Director of Public Health Applications Pittsburgh Supercomputing.
Shape Reconstruction from Samples with Cocone Tamal K. Dey Dept. of CIS Ohio State University.
Portable Batch System – Definition and 3 Primary Roles Definition: PBS is a distributed workload management system. It handles the management and monitoring.
Alien and GSI Marian Ivanov. Outlook GSI experience Alien experience Proposals for further improvement.
Wouter Verkerke, NIKHEF 1 Using ‘stoomboot’ for NIKHEF-ATLAS batch computing What is ‘stoomboot’ – Hardware –16 machines, each 2x quad-core Pentium = 128.
Bigyan Ankur Mukherjee University of Utah. Given a set of Points P sampled from a surface Σ,  Find a Surface Σ * that “approximates” Σ  Σ * is generally.
Geant4 GRID production Sangwan Kim, Vu Trong Hieu, AD At KISTI.
INTRODUCTION TO XSEDE. INTRODUCTION  Extreme Science and Engineering Discovery Environment (XSEDE)  “most advanced, powerful, and robust collection.
CFI 2004 UW A quick overview with lots of time for Q&A and exploration.
An Brief Introduction Charlie Taylor Associate Director, Research Computing UF Research Computing.
Advanced Computing Facility Introduction
Lecture 9 : Point Set Processing
Decimating Samples for Mesh Simplification
GRID COMPUTING.
PARADOX Cluster job management
OpenPBS – Distributed Workload Management System
What’s new in FUSION? Bob McGaughey
Shape Dimension and Approximation from Samples
Submit BOSS Jobs on Distributed Computing System
Compiling and Job Submission
Point-Cloud 3D Modeling.
Working in The IITJ HPC System
Presentation transcript:

Gerald Dalley Signal Analysis and Machine Perception Laboratory The Ohio State University 07 Feb 2002 Linux Clustering Software + Surface Reconstruction from Point Clouds

2 Topic Motivation Computationally intensive work Many “small” execution jobs at each phase Range Image Aquisition Initial Detection (“Pop-out”) Ballooning Surface Reconstruction Surface Segmentation Recognition Multiple balloons must be merged: Segmentation requires dense meshes Non-sparse balloons are “leaky” Merging overlapping balloons is non-trivial

3 Outline Part 1: Linux Clustering Software –ClusterIt –Portable Batch System Part 2: Surface Reconstruction –Preliminaries –Curve Reconstruction –Cocone Algorithm –Undersampling –Some Results Current Status Further Reading

4 Cluster Software: ClusterIt What is it? –Simultaneous execution on a set of Linux boxes –Execution on “any” Linux box (but PBS is much better) What do I have to do to use it? –See for instructions on configuring SSH

5 Cluster Software: SAMPL Cluster Groups See /etc/dsh.cluster on a Linux box for the full set of groups GroupComments a All processors (use with jsd, etc.) a1 All boxes (use with dsh, etc.) b All Beowulf processors b1 All Beowulf boxes m All of the Micron boxes dc All processors on the dual Celerons dc1 All dual Celeron boxes

6 Cluster Software: dsh When would I use it? –Same command, many machines –Batch job preparation –Administrative work Usage –dsh -g om 'hostname -i' –Results sampl01: sampl02: sampl10: sampl12: Group (required!)Remote command (quoted)

7 Cluster Software: dsh Examples Good examples –dsh -g om 'hostname -i' –dsh –g om 'hostname > /tmp/tmpfile' –dsh –g a1 'smbmount //samplf04/dalleyg /u/dalleyg -o umask=077,dmask=077, password=PASSWORD' What to be careful about –Using quotes (single or double) –Redirecting input or output

8 Cluster Software: Other ClusterIt Examples pcp -g a1 datafile /tmp/datafile –Copies file datafile from the current directory to /tmp/datafile on all machines in the a1 group –Useful for copying files to local temporary storage prm -g a1 /tmp/datafile –Deletes /tmp/datafile on all machines in the a1 group –Useful for cleanup of local temporary storage, etc.

9 Cluster Software: Portable Batch System What is it? –Manages submission and execution of large batch jobs –Allows balancing between users –Used for single multi-processor machines all the way up to compute farms with many Crays (e.g. OSC)

10 Cluster Software: Portable Batch System (cont’d.) Submitting a job (from eepc359 only)* –qsub -N jobname jobprogram –qsub -N Test /home/dalleyg/nfs/test2.pl Cluster status –qstat -f -B xpbs –Helps you create job scripts, configure advanced options, etc. xpbsmon –Helps you monitor the state of the machines on the cluster *The configuration is still being debugged.

11 Part 2: Surface Reconstruction…

12 Surface Reconstruction Preliminaries: Voronoi Diagrams Voronoi Cell of x –The set of points that are closer to x than to any other sample point Voronoi cell Voronoi edge Voronoi vertex

13 Surface Reconstruction Preliminaries: Preliminaries: Medial Axis Medial Axis: –Find all circles that tangentially touch the curve in at least 2 points –Medial axis = centers of all those circles

14 Surface Reconstruction Preliminaries: ε-sampling f(x) ≡ feature size at point x = distance to the medial axis at point x Sampling criterion: each sample point x is at most εf(x) from the next closest sample (0 < ε < 1, typically). Important note: When ε is small, the curve locally looks flat f(x) x

15 Surface Reconstruction: Curve Reconstruction Algorithm: –Find the closest point, p, to x and connect them –Find the closest point, q, to x such that the angle pxq is at least 90°. Guaranteed to work when ε ≤ ⅓ x p q

16 Surface Reconstruction: Cocone Algorithm p + ≡ pole of p = point in the Voronoi cell farthest from p ε < 0.1 → –the vector from p to p + is within π/8 of the true surface normal –The surface is nearly flat within the cell Voronoi cell of p p+p+ p

17 Sample Reconstructed Surfaces Foot images from Prof. Dey

18 TuT Status Range Image Aquisition Initial Detection (“Pop-out”) Ballooning Surface Reconstruction Surface Segmentation Recognition Software written See Kanu Software written (by Kanu), generating data Software written (by Prof. Dey) Evaluating several variants To be done

19 Further Reading –Clusterit –Portable Batch System –Official web site (ask if you need the password) –Detailed administration/usage guide –Slideshow introduction to PBS by Doug Johnson from the Ohio Supercomputer Center –Surface Reconstruction N. Amenta, S. Choi, T. K. Dey and N. Leekha. A simple algorithm for homeomorphic surface reconstruction. Proc. 16th ACM Symposium on Computational Geometry, 2000, A simple algorithm for homeomorphic surface reconstruction