Fast and Extensible Building Modeling from Airborne LiDAR Data Qian-Yi Zhou Ulrich Neumann University of Southern California.

Slides:



Advertisements
Similar presentations
Automatic Photo Pop-up Derek Hoiem Alexei A.Efros Martial Hebert Carnegie Mellon University.
Advertisements

Complex Networks for Representation and Characterization of Images For CS790g Project Bingdong Li 9/23/2009.
IMAGE Semi-automatic 3D building extraction in dense urban areas using digital surface models Dr. Philippe Simard President SimActive Inc.
Efficient access to TIN Regular square grid TIN Efficient access to TIN Let q := (x, y) be a point. We want to estimate an elevation at a point q: 1. should.
Texture Synthesis on [Arbitrary Manifold] Surfaces Presented by: Sam Z. Glassenberg* * Several slides borrowed from Wei/Levoy presentation.
3D Shape Histograms for Similarity Search and Classification in Spatial Databases. Mihael Ankerst,Gabi Kastenmuller, Hans-Peter-Kriegel,Thomas Seidl Univ.
Stephen J. Guy 1. Photomontage Photomontage GrabCut – Interactive Foreground Extraction 1.
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
Local or Global Minima: Flexible Dual-Front Active Contours Hua Li Anthony Yezzi.
K nearest neighbor and Rocchio algorithm
Workshop on Earth Observation for Urban Planning and Management, 20 th November 2006, HK 1 Zhilin Li & Kourosh Khoshelham Dept of Land Surveying & Geo-Informatics.
1 Learning to Detect Objects in Images via a Sparse, Part-Based Representation S. Agarwal, A. Awan and D. Roth IEEE Transactions on Pattern Analysis and.
Self-Supervised Segmentation of River Scenes Supreeth Achar *, Bharath Sankaran ‡, Stephen Nuske *, Sebastian Scherer *, Sanjiv Singh * * ‡
Shape Modeling International 2007 – University of Utah, School of Computing Robust Smooth Feature Extraction from Point Clouds Joel Daniels ¹ Linh Ha ¹.
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2005 with a lot of slides stolen from Steve Seitz and.
reconstruction process, RANSAC, primitive shapes, alpha-shapes
Presented by Zeehasham Rasheed
Smart Traveller with Visual Translator for OCR and Face Recognition LYU0203 FYP.
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2006 with a lot of slides stolen from Steve Seitz and.
Linear Discriminant Functions Chapter 5 (Duda et al.)
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Surface Simplification Using Quadric Error Metrics.
Face Recognition Using Neural Networks Presented By: Hadis Mohseni Leila Taghavi Atefeh Mirsafian.
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
Image Segmentation Rob Atlas Nick Bridle Evan Radkoff.
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
Dobrina Boltcheva, Mariette Yvinec, Jean-Daniel Boissonnat INRIA – Sophia Antipolis, France 1. Initialization Use the.
Edge Linking & Boundary Detection
ALIGNMENT OF 3D ARTICULATE SHAPES. Articulated registration Input: Two or more 3d point clouds (possibly with connectivity information) of an articulated.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology Adaptive nonlinear manifolds and their applications to pattern.
A Scalable Self-organizing Map Algorithm for Textual Classification: A Neural Network Approach to Thesaurus Generation Dmitri G. Roussinov Department of.
I 3D: Interactive Planar Reconstruction of Objects and Scenes Adarsh KowdleYao-Jen Chang Tsuhan Chen School of Electrical and Computer Engineering Cornell.
1 Manifolds from meshes Cindy Grimm and John Hughes, “Modeling Surfaces of Arbitrary Topology using Manifolds”, Siggraph ’95 J. Cotrina Navau and N. Pla.
Object-Based Building Boundary Extraction from Lidar Data You Shao and Samsung Lim.
Chapter 10, Part II Edge Linking and Boundary Detection The methods discussed in the previous section yield pixels lying only on edges. This section.
* Challenge the future Graduation project 2014 Exploring Regularities for Improving Façade Reconstruction from Point Cloud Supervisors Dr. Ben Gorte Dr.
1 Interactive Thickness Visualization of Articular Cartilage Author :Matej Mlejnek, Anna Vilanova,Meister Eduard GröllerMatej MlejnekAnna VilanovaMeister.
Copyright © 2010 Siemens Medical Solutions USA, Inc. All rights reserved. Hierarchical Segmentation and Identification of Thoracic Vertebra Using Learning-based.
Pattern Recognition April 19, 2007 Suggested Reading: Horn Chapter 14.
A. Polyhedrons 1. Vocabulary of Polyhedrons 2. Building Polyhedrons a. Create a net from the Polyhedron b. Create the Polyhedron from the net B. Prisms.
CURE: An Efficient Clustering Algorithm for Large Databases Sudipto Guha, Rajeev Rastogi, Kyuseok Shim Stanford University Bell Laboratories Bell Laboratories.
Segmentation of 3D Tubular Structures Paul Hernandez-Herrera Computational Biomedicine Lab Advisor: Ioannis A. Kakadiaris and Manos Papadakis 1.
A Scalable Machine Learning Approach for Semi-Structured Named Entity Recognition Utku Irmak(Yahoo! Labs) Reiner Kraft(Yahoo! Inc.) WWW 2010(Information.
CS654: Digital Image Analysis
CSE 185 Introduction to Computer Vision Face Recognition.
Geometric Modeling using Polygonal Meshes Lecture 3: Discrete Differential Geometry and its Application to Mesh Processing Office: South B-C Global.
Intelligent Database Systems Lab N.Y.U.S.T. I. M. Externally growing self-organizing maps and its application to database visualization and exploration.
Levels of Image Data Representation 4.2. Traditional Image Data Structures 4.3. Hierarchical Data Structures Chapter 4 – Data structures for.
SemiBoost : Boosting for Semi-supervised Learning Pavan Kumar Mallapragada, Student Member, IEEE, Rong Jin, Member, IEEE, Anil K. Jain, Fellow, IEEE, and.
R I T Rochester Institute of Technology Geometric Scene Reconstruction Using 3-D Point Cloud Data Feng Li and Steve Lach Advanced Digital Image Processing.
Text From Corners: A Novel Approach to Detect Text and Caption in Videos Xu Zhao, Kai-Hsiang Lin, Yun Fu, Member, IEEE, Yuxiao Hu, Member, IEEE, Yuncai.
Fast Query-Optimized Kernel Machine Classification Via Incremental Approximate Nearest Support Vectors by Dennis DeCoste and Dominic Mazzoni International.
Competition II: Springleaf Sha Li (Team leader) Xiaoyan Chong, Minglu Ma, Yue Wang CAMCOS Fall 2015 San Jose State University.
Outline ● Introduction – What is the problem ● Generate stochastic textures ● Improve realism ● High level approach - Don't just jump into details – Why.
Outline ● Introduction – What is the problem ● Generate stochastic textures ● Improve realism ● High level approach - Don't just jump into details – Why.
Automatic 3D modelling of Architecture Anthony Dick 1 Phil Torr 2 Roberto Cipolla 1 1 Department of Engineering 2 Microsoft Research, University of Cambridge.
Evaluation of Gender Classification Methods with Automatically Detected and Aligned Faces Speaker: Po-Kai Shen Advisor: Tsai-Rong Chang Date: 2010/6/14.
Shape2Pose: Human Centric Shape Analysis CMPT888 Vladimir G. Kim Siddhartha Chaudhuri Leonidas Guibas Thomas Funkhouser Stanford University Princeton University.
Linear Discriminant Functions Chapter 5 (Duda et al.) CS479/679 Pattern Recognition Dr. George Bebis.
Object-based Classification
MIRA, SVM, k-NN Lirong Xia. MIRA, SVM, k-NN Lirong Xia.
QianZhu, Liang Chen and Gagan Agrawal
Recognition: Face Recognition
Boosting Nearest-Neighbor Classifier for Character Recognition
Radio Propagation Simulation Based on Automatic 3D Environment Reconstruction D. He A novel method to simulate radio propagation is presented. The method.
Scale-Space Representation of 3D Models and Topological Matching
Institute for Information Industry (III) Research Report
CS4670: Intro to Computer Vision
Topological Signatures For Fast Mobility Analysis
MAS 622J Course Project Classification of Affective States - GP Semi-Supervised Learning, SVM and kNN Hyungil Ahn
MIRA, SVM, k-NN Lirong Xia. MIRA, SVM, k-NN Lirong Xia.
Presentation transcript:

Fast and Extensible Building Modeling from Airborne LiDAR Data Qian-Yi Zhou Ulrich Neumann University of Southern California

Introduction Toward automatic 3D building model reconstruction … – 3D models are useful in several applications – Manual creation is slow and expensive – New instruments provides more and more data – Problem How to fulfill the gap between data and 3D building models?

Introduction Approach overview – Data source: airborne LiDAR data Without other data sources Working directly on point cloud, without rasterization – Experiments On 3 different data sets – Automatic vs. interaction Fully automatic for flat roofs Use interaction to acquire the extensibility for non-flat roof patterns

Pipeline Input LiDAR dataClassified points Classification Plane extraction Plane extraction Planes of one patch Boundary detection Boundary detection Boundary pointsBuilding model Modeling

Pipeline Plane extraction Plane extraction Planes of one patch Boundary detection Boundary detection Boundary pointsBuilding model Modeling Input LiDAR dataClassified points Classification

Algorithm – Use a SVM (Support Vector Machine) algorithm Machine learning method All the weight parameters could be trained from a small area of labeled data – Take several differential geometry properties as features Features are defined locally Same solution works for different data sets, even their global variants (e.g. absolute height) varies

Classification Features: Building (ground) vs. vegetation – Distribution of neighbor points Regular vs. Irregular – Normal direction Vertical vs. Unordered – Flatness Flat vs. Non-flat – Normal distribution Regular vs. Irregular

Classification Input LiDAR data F1 (regularity of distribution ) F2 (normal direction ) F3 (flatness ) F4 (regularity of normal dist. ) F5 (regularity of normal dist. )

Classification Experiments for classification – Weights for features learned from data: W 1~5 = (2.5, 0.1, 1.7, 5.2, 20.4) Regularities of normal distribution are important – We get around 95% accuracy rate on 3 different data sets Sample rate of different data sets varies from 6 points per sq.m. to 17 points per sq.m. Global variants (e.g. average height, average intensity) varies between different data sets

Classification Post-processing – Refinement Use the intuition that points of same category usually occur together in space Let points in a local neighborhood vote for the final classification result – Segmentation Apply region growing algorithm to find roof patches Largest patch is assigned as ground

Classification

Input LiDAR data Classification Pipeline Boundary detection Boundary detection Boundary pointsBuilding model Modeling Classified points Plane extraction Plane extraction Planes of one patch

Plane extraction Algorithm – For each roof patch, apply a region growing algorithm but based on normal similarity – Iteratively find all plane patterns in one roof patch

Classified points Plane extraction Plane extraction Input LiDAR data Classification Pipeline Building model Modeling Planes of one patch Boundary detection Boundary detection Boundary points

Boundary detection Algorithm – Apply a uniform grid onto the point cloud P – Correspondence: Boundary line in grid  Boundary point of P Boundary corner in grid  Boundary edge of P – Run two passes, to construct a watertight manifold polygonal boundary from boundary points and edges

Boundary detection Algorithm (continue) Boundary lines Boundary corners First pass Second pass

Boundary detection Advantages – Topology guarantee: watertight manifold boundary – Easy to implement – Efficient and robust – Can be used with morphological operations Limitation – Cannot guarantee geometry completeness

Planes of one patch Boundary detection Boundary detection Classified points Plane extraction Plane extraction Input LiDAR data Classification Pipeline Boundary pointsBuilding model Modeling

Building modeling Principal directions – Intuition: most boundary line segments in a local area fall into a couple of directions, known as principal directions

Building modeling Snapping – Snap to principal directions Find as much as possible boundary segments along principal directions – Snap between neighbor segments Patches may share same boundary segments Patches may be connected via a vertical wall

Building modeling

Planes of one patch Boundary detection Boundary detection Classified points Plane extraction Plane extraction Input LiDAR data Classification Pipeline Boundary pointsBuilding model Modeling Non-flat roof extension User interaction Non-flat roofs

Non-flat objects extension Algorithm – Define a few pattern types, e.g. cone, sphere, cylinder – Let user specify pattern type of certain roof patch – Apply RANSAC algorithm to get the parameters for this shape pattern

Experiments Oakland (17 samples/sq.m.; 600m x 600m)

Experiments Denver (6 samples/sq.m.; 1km x 1km)

Experiments Industrial site (14 samples/sq.m.)

Conclusion We provide an automatic building modeling pipeline with novel classification, boundary extraction and modeling algorithms; in addition, we show the extensibility to non-flat roofs with the help of a few user interactions. Future works – How to quantitatively analysis errors? – How to handle data sets with billions of points? An out-of-core implementation is possible!

The end Q & A Acknowledgement – Data Airborne 1 Corp., Sanborn Corp., Chevron Corp., Sentinel AVE LLC – Discussion and comments Suya You, Yuan Li, and anonymous reviewers – Support Provost’s Fellowship from USC