* Challenge the future Graduation project 2014 Exploring Regularities for Improving Façade Reconstruction from Point Cloud Supervisors Dr. Ben Gorte Dr.

Slides:



Advertisements
Similar presentations
Applications of one-class classification
Advertisements

Image Registration  Mapping of Evolution. Registration Goals Assume the correspondences are known Find such f() and g() such that the images are best.
GRAPP, Lisbon, February 2009 University of Ioannina Skeleton-based Rigid Skinning for Character Animation Andreas Vasilakis and Ioannis Fudos Department.
Face Alignment with Part-Based Modeling
2D matching part 2 Review of alignment methods and
Object Recognition using Invariant Local Features Applications l Mobile robots, driver assistance l Cell phone location or object recognition l Panoramas,
Automatic Feature Extraction for Multi-view 3D Face Recognition
Contactless and Pose Invariant Biometric Identification Using Hand Surface Vivek Kanhangad, Ajay Kumar, Senior Member, IEEE, and David Zhang, Fellow, IEEE.
Mapping: Scaling Rotation Translation Warp
Face Recognition and Biometric Systems
Fast and Extensible Building Modeling from Airborne LiDAR Data Qian-Yi Zhou Ulrich Neumann University of Southern California.
SEMANTIC FEATURE ANALYSIS IN RASTER MAPS Trevor Linton, University of Utah.
Surface Reconstruction from 3D Volume Data. Problem Definition Construct polyhedral surfaces from regularly-sampled 3D digital volumes.
Iterative closest point algorithms
Raster Data. The Raster Data Model The Raster Data Model is used to model spatial phenomena that vary continuously over a surface and that do not have.
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.
Contents Description of the big picture Theoretical background on this work The Algorithm Examples.
Prénom Nom Document Analysis: Data Analysis and Clustering Prof. Rolf Ingold, University of Fribourg Master course, spring semester 2008.
Robust Lane Detection and Tracking
FACE RECOGNITION, EXPERIMENTS WITH RANDOM PROJECTION
reconstruction process, RANSAC, primitive shapes, alpha-shapes
Iris localization algorithm based on geometrical features of cow eyes Menglu Zhang Institute of Systems Engineering
Lecture 3a: Feature detection and matching CS6670: Computer Vision Noah Snavely.
MSU CSE 803 Stockman CV: Matching in 2D Matching 2D images to 2D images; Matching 2D images to 2D maps or 2D models; Matching 2D maps to 2D maps.
Feature extraction Feature extraction involves finding features of the segmented image. Usually performed on a binary image produced from.
Color Transfer in Correlated Color Space Xuezhong Xiao, Computer Science & Engineering Department, Shanghai Jiao Tong University Lizhuang Ma., Computer.
Oral Defense by Sunny Tang 15 Aug 2003
כמה מהתעשייה? מבנה הקורס השתנה Computer vision.
Groundtruthing for Performance Evaluation of Document Image Analysis Systems: a primer Mathieu Delalandre Pattern Recognition.
My Research Experience Cheng Qian. Outline 3D Reconstruction Based on Range Images Color Engineering Thermal Image Restoration.
Yuping Lin and Gérard Medioni.  Introduction  Method  Register UAV streams to a global reference image ▪ Consecutive UAV image registration ▪ UAV to.
CSE 185 Introduction to Computer Vision
Computer Vision - Fitting and Alignment
Methods in Medical Image Analysis Statistics of Pattern Recognition: Classification and Clustering Some content provided by Milos Hauskrecht, University.
Hubert CARDOTJY- RAMELRashid-Jalal QURESHI Université François Rabelais de Tours, Laboratoire d'Informatique 64, Avenue Jean Portalis, TOURS – France.
CSE554AlignmentSlide 1 CSE 554 Lecture 8: Alignment Fall 2014.
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
An Integrated Approach to Extracting Ontological Structures from Folksonomies Huairen Lin, Joseph Davis, Ying Zhou ESWC 2009 Hyewon Lim October 9 th, 2009.
CSE554AlignmentSlide 1 CSE 554 Lecture 5: Alignment Fall 2011.
ALIGNMENT OF 3D ARTICULATE SHAPES. Articulated registration Input: Two or more 3d point clouds (possibly with connectivity information) of an articulated.
OPTIMIZATION OF FUNCTIONAL BRAIN ROIS VIA MAXIMIZATION OF CONSISTENCY OF STRUCTURAL CONNECTIVITY PROFILES Dajiang Zhu Computer Science Department The University.
Introduction Rigid motions can also be called congruency transformations. A congruency transformation moves a geometric figure but keeps the same size.
Digital Image Processing CCS331 Relationships of Pixel 1.
Automatic Minirhizotron Root Image Analysis Using Two-Dimensional Matched Filtering and Local Entropy Thresholding Presented by Guang Zeng.
CSE554AlignmentSlide 1 CSE 554 Lecture 8: Alignment Fall 2013.
Medical Image Analysis Dr. Mohammad Dawood Department of Computer Science University of Münster Germany.
1 Eye Detection in Images Introduction To Computational and biological Vision Lecturer : Ohad Ben Shahar Written by : Itai Bechor.
E9 Students are expected to make generalizations about the properties of translations and reflections and apply these properties. E10 Students are expected.
A NOVEL METHOD FOR COLOR FACE RECOGNITION USING KNN CLASSIFIER
Image Registration Advanced DIP Project
A Multiresolution Symbolic Representation of Time Series Vasileios Megalooikonomou Qiang Wang Guo Li Christos Faloutsos Presented by Rui Li.
Chapter 13 (Prototype Methods and Nearest-Neighbors )
1Ellen L. Walker 3D Vision Why? The world is 3D Not all useful information is readily available in 2D Why so hard? “Inverse problem”: one image = many.
Morphological Image Processing Robotics. 2/22/2016Introduction to Machine Vision Remember from Lecture 12: GRAY LEVEL THRESHOLDING Objects Set threshold.
776 Computer Vision Jan-Michael Frahm Spring 2012.
CURE: An Efficient Clustering Algorithm for Large Databases Authors: Sudipto Guha, Rajeev Rastogi, Kyuseok Shim Presentation by: Vuk Malbasa For CIS664.
CSCI 631 – Foundations of Computer Vision March 15, 2016 Ashwini Imran Image Stitching.
A 2D/3D correspondence building method for reconstruction of a 3D bone surface model Longwei Fang
 A transformation is an operation that moves or changes a geometric figure in some way to produce a new figure. The new figure is called the image. Another.
Deformation Modeling for Robust 3D Face Matching Xioguang Lu and Anil K. Jain Dept. of Computer Science & Engineering Michigan State University.
CSCI 631 – Foundations of Computer Vision March 15, 2016 Ashwini Imran Image Stitching Link: singhashwini.mesinghashwini.me.
776 Computer Vision Jan-Michael Frahm Spring 2012.
CSE 554 Lecture 8: Alignment
Lecture 07 13/12/2011 Shai Avidan הבהרה: החומר המחייב הוא החומר הנלמד בכיתה ולא זה המופיע / לא מופיע במצגת.
University of Ioannina
IMAGE PROCESSING RECOGNITION AND CLASSIFICATION
Principal Component Analysis (PCA)
A New Approach to Track Multiple Vehicles With the Combination of Robust Detection and Two Classifiers Weidong Min , Mengdan Fan, Xiaoguang Guo, and Qing.
CV: Matching in 2D Matching 2D images to 2D images; Matching 2D images to 2D maps or 2D models; Matching 2D maps to 2D maps MSU CSE 803 Stockman.
SIFT.
Presentation transcript:

* Challenge the future Graduation project 2014 Exploring Regularities for Improving Façade Reconstruction from Point Cloud Supervisors Dr. Ben Gorte Dr. Sisi Zlatanova Pirouz Nourian Client Cyclomedia Kaixuan Zhou

* Challenge the future Content Introduction Wall and hole extraction (relevant objects) Regularity identification and application Quality analysis Conclusion

* Challenge the future Introduction LoD3 Façade details Applications Serious games: Fire brigade training Luminance calculations Point Clouds- (Semi)-Automatic Terrestrial LiDAR Panoramic images Cyclomedia point cloud Courtesy of Karlsruhe Institute of Technology

* Challenge the future Introduction Problems of Data Relevant objects Wall and holes Occlusions Out of Scope Not bad for terrestrial point cloud Noise and varying Densities Imperfectness of recognition algorithms Regularities Features shared within one object and among objects

* Challenge the future Introduction Problems of Data Relevant objects Wall and holes Occlusions Out of Scope Not bad for terrestrial point cloud Noise and varying Densities Imperfectness of recognition algorithms Regularities Features shared within one object and among objects

* Challenge the future Introduction Problems of Data Relevant objects Wall and holes Occlusions Out of Scope Noise and varying Densities Imperfectness of recognition algorithms Regularities Features shared within one object and among objects highlow Density Size of hole small big

* Challenge the future Introduction Problems of Data Relevant objects Wall and holes Occlusions Out of Scope Not bad for terrestrial point cloud Noise and varying Densities Imperpectness of recogintion algorithms Regularities Features shared within one object and among objects

* Challenge the future Introduction Problems of Data Relevant objects Wall and holes Occlusions Out of Scope Not bad for terrestrial point cloud Noise and varing Densities Imperpectness of recogintion algorithms Regularities Features shared within one object and among objects

* Challenge the future Introduction Noise, varying density and imperfectness of algorithm can affect quality of extracted separate objects. Research Question: In which way regularities can be identified from point cloud and applied in order to improve quality of 3D facade reconstruction?

* Challenge the future Content Introduction Wall and hole extraction (relevant objects) Regularity identification and application Quality analysis Conclusion

* Challenge the future Wall and Hole extraction ●Facade of Faculty of Applied Sciences (TN) ●RANSAC Plane fitting and Wall extraction( knowledge rule: vertical and largest plane)

* Challenge the future Holes extraction ●Rasterization ●Dilation and erosion closing(varying density) ●Connected component labeling ● Hole points tracing

* Challenge the future Holes extraction ●Advantage ●Robust to noise and varying densities. ●Tracing point back from original point cloud avoid loss of information

* Challenge the future Content Introduction Wall and hole extraction (relevant objects) Regularity identification and application Quality analysis Conclusion

* Challenge the future Regularity identification and application Different regularities in the Facade Principle of regularities identification and application from feature and clustering method The procedures of regularity identification and application

* Challenge the future Different regularities(9 Cases) Local Regularity: regularities within one hole Orthogonal and parallel orientation Global regularities: regularities among holes Global regularities among similar holes Similar holes share Same boundary Same orientation Position alignment Same Line alignment Same distance Global regularities among different holes The boundaries of different holes share Parallel and orthogonal orientation Same length Position Same Line alignment Same distance

* Challenge the future Different regularities(9 Cases) Local Regularity: regularities within one hole Orthogonal and parallel orientation Global regularities: regularities shared among holes Global regularities among similar holes Similar holes share Same boundary Same orientation Position alignment Same Line alignment Same distance Global regularities among different holes Different holes share Parallel and orthogonal orientation Same length Position Same Line alignment Same distance

* Challenge the future Different regularities(9 Cases) Local Regularity: regularities within one hole Orthogonal and parallel orientation Global regularities: regularities shared among holes Global regularities among similar holes Similar holes share Same boundary Same orientation Position alignment Same Line alignment Same distance Global regularities among different holes Different holes (Boundaries) share Parallel and orthogonal orientation Same length Position Same Line alignment Same distance

* Challenge the future Principle of regularity identification and application Objects sharing regularities have similar certain features Clustering method can find the similar objects in the feature space The weighted center is chosen as representative of cluster used for representing all member in cluster

* Challenge the future Principle of regularity identification and application Hierarchical Clustering ( Group similar objects in feature space)

* Challenge the future The procedures of regularity identification and application Find features to present each regularity for clustering Procedure (1): local regularity and global regularities among similar holes identification and application Procedure (2): global regularities between different holes identification and application

* Challenge the future The procedures of regularity identification and application: Procedures(1)-- Overview

* Challenge the future The procedures of regularity identification and application: Procedures(1)-- Overview ICP(iterative closest points)- similar objects identification and registration Score: distance of closest pairs

* Challenge the future The procedures of regularity identification and application: Procedures(1)-- Overview Register holes points contains all boundary information Transformation matrices contain orientation and position information

* Challenge the future The procedures of regularity identification and application: Procedures(1)– Detail

* Challenge the future The procedures of regularity identification and application: Procedures(1)– Detail RANSAC line fitting: boundary line candidates

* Challenge the future The procedures of regularity identification and application: Procedures(1)– Detail Local regularity: orthogonal and parallel orientation. θ r≥ 0 and θ in the interval (−π, π]

* Challenge the future The procedures of regularity identification and application: Procedures(1)– Detail Same boundary: (r, θ)

* Challenge the future The procedures of regularity identification and application: Procedures(1)– Detail Same orientation:

* Challenge the future The procedures of regularity identification and application: Procedures(1)– Detail σ Translation in 2D: Aligned orientation: Translation in direction: Common case

* Challenge the future The procedures of regularity identification and application: Procedures(1)– Detail

* Challenge the future The procedures of regularity identification and application: Procedures(2)

* Challenge the future The procedures of regularity identification and application: Procedures(2) Façade point cloud from Faculty of Architecture and Built Environment (BK)

* Challenge the future The procedures of regularity identification and application: Procedures(2) Parallel and orthogonal orientation: All orientations of boundary from all groups are considered The regularity identification and application is the same with local regularity.

* Challenge the future The procedures of regularity identification and application: Procedures(2) Same length: Lengthes of boundary share a same direction from all groups are clustered respectively.

* Challenge the future The procedures of regularity identification and application: Procedures(2) Position regularities: preserve the chains established in previous position regularities among similar objects Same line alignment among similar objects Same distance among similar objects

* Challenge the future The procedures of regularity identification and application: Procedures(2) Chains are restrianed to move to its orthogonal direction

* Challenge the future The procedures of regularity identification and application: Procedures(2) Only Boundaries with similar direction with Chains to taken into account for position regularites

* Challenge the future The procedures of regularity identification and application: Procedures(2) The regularities are found between prominent group (Target)and one of other groups(Source) each time

* Challenge the future The procedures of regularity identification and application: Procedures(2)

* Challenge the future Quality analysis Effects of provided procedure for applying regularity Match with original point cloud

* Challenge the future Quality analysis Effects of provided procedure for applying regularity TN Facade(Case1-Case6)

* Challenge the future Quality analysis Effects of provided procedure for applying regularity BK Facade(Case1-Case9)

* Challenge the future Quality analysis Match with original point clouds

* Challenge the future Conclusion and future work Conclusions: Hole extraction Rasterization approach Robust to various density, noise No loss information of edge Local and global regularities identification and application Provide 9 cases of regularities to explore Feature and clustering method to extract regularities ICP to find different groups of similar holes Register points and Transformation matrices RANSAC line fitting to find the boundary lines Chains to preserve the established connections Quality Procedures provided works fine with these two datasets Good match with original point cloud Improve results from noise, various densities and imperfectness of algorithms

* Challenge the future Conclusion and future work Future work: The regularities of whole façade: including extrusions, intrusions, doors. Even for a whole building with several facades Special cases of regularities can be also applied: orientations of similar objects share orthogonal orientations. The similar objects shares mirror reflection regularity. Position regularities are explored among all groups Occlusion problem needs to be fixed. For example, ICP can not identify partially matched objects Thresholds need to be limited and set adaptively. The relations between thresholds can be derived in order to reduce number of threshold

* Challenge the future Appendix Thresholds

* Challenge the future Appendix AlgorithmSource SegmentationRANSAC plane fittingPCL Hole extraction Dilation and erosionSupervisor Connected components labeling Supervisor Regularities Hierachical ClusteringALGLIB ICPPCL RANSAC Line fittingPCL

* Challenge the future