Institute for Information Industry (III) Research Report

Slides:



Advertisements
Similar presentations
Face Recognition Sumitha Balasuriya.
Advertisements

Automatic Photo Pop-up Derek Hoiem Alexei A.Efros Martial Hebert Carnegie Mellon University.
Road-Sign Detection and Recognition Based on Support Vector Machines Saturnino, Sergio et al. Yunjia Man ECG 782 Dr. Brendan.
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Developable Surface Fitting to Point Clouds Martin Peternell Computer Aided Geometric Design 21(2004) Reporter: Xingwang Zhang June 19, 2005.
Surface normals and principal component analysis (PCA)
Derivation of Engineering-relevant Deformation Parameters
1er. Escuela Red ProTIC - Tandil, de Abril, 2006 Principal component analysis (PCA) is a technique that is useful for the compression and classification.
Fast and Extensible Building Modeling from Airborne LiDAR Data Qian-Yi Zhou Ulrich Neumann University of Southern California.
As applied to face recognition.  Detection vs. Recognition.
Face Recognition & Biometric Systems, 2005/2006 Face recognition process.
March 15-17, 2002Work with student Jong Oh Davi Geiger, Courant Institute, NYU On-Line Handwriting Recognition Transducer device (digitizer) Input: sequence.
Pattern Recognition Topic 1: Principle Component Analysis Shapiro chap
CS 790Q Biometrics Face Recognition Using Dimensionality Reduction PCA and LDA M. Turk, A. Pentland, "Eigenfaces for Recognition", Journal of Cognitive.
Un Supervised Learning & Self Organizing Maps Learning From Examples
Abstract We present a model of curvilinear grouping using piecewise linear representations of contours and a conditional random field to capture continuity.
 Image Search Engine Results now  Focus on GIS image registration  The Technique and its advantages  Internal working  Sample Results  Applicable.
Implementing a reliable neuro-classifier
Smart Traveller with Visual Translator for OCR and Face Recognition LYU0203 FYP.
Con-Text: Text Detection Using Background Connectivity for Fine-Grained Object Classification Sezer Karaoglu, Jan van Gemert, Theo Gevers 1.
Laurent Itti: CS599 – Computational Architectures in Biological Vision, USC Lecture 7: Coding and Representation 1 Computational Architectures in.
Principal Component Analysis. Consider a collection of points.
Normal Estimation in Point Clouds 2D/3D Shape Manipulation, 3D Printing March 13, 2013 Slides from Olga Sorkine.
Face Recognition Using Neural Networks Presented By: Hadis Mohseni Leila Taghavi Atefeh Mirsafian.
Dimensionality reduction Usman Roshan CS 675. Supervised dim reduction: Linear discriminant analysis Fisher linear discriminant: –Maximize ratio of difference.
PCA & LDA for Face Recognition
Principle Component Analysis (PCA) Networks (§ 5.8) PCA: a statistical procedure –Reduce dimensionality of input vectors Too many features, some of them.
Principle Component Analysis Presented by: Sabbir Ahmed Roll: FH-227.
Multi-Sensor Image Fusion (MSIF) Team Members: Phu Kieu, Keenan Knaur Faculty Advisor: Dr. Eun-Young (Elaine) Kang Northrop Grumman Liaison: Richard Gilmore.
Machine Vision for Robots
TEMPLATE BASED SHAPE DESCRIPTOR Raif Rustamov Department of Mathematics and Computer Science Drew University, Madison, NJ, USA.
CS 6825: Binary Image Processing – binary blob metrics
EFFICIENT ROAD MAPPING VIA INTERACTIVE IMAGE SEGMENTATION Presenter: Alexander Velizhev CMRT’09 ISPRS Workshop O. Barinova, R. Shapovalov, S. Sudakov,
Graphing With Coordinates
N– variate Gaussian. Some important characteristics: 1)The pdf of n jointly Gaussian R.V.’s is completely described by means, variances and covariances.
Applications of Remote Sensing in Transportation.
Geometric Modeling using Polygonal Meshes Lecture 3: Discrete Differential Geometry and its Application to Mesh Processing Office: South B-C Global.
A split-and-merge framework for 2D shape summarization D. Gerogiannis, C. Nikou and A. Likas Department of Computer Science, University of Ioannina, Greece.
Nottingham Image Analysis School, 23 – 25 June NITS Image Segmentation Guoping Qiu School of Computer Science, University of Nottingham
Robust Watermarking of 3D Mesh Models. Introduction in this paper, it proposes an algorithm that extracts 2D image from the 3D model and embed watermark.
Multi-view Traffic Sign Detection, Recognition and 3D Localisation Radu Timofte, Karel Zimmermann, and Luc Van Gool.
Computer Vision Computer Vision based Hole Filling Chad Hantak COMP December 9, 2003.
Face detection and recognition Many slides adapted from K. Grauman and D. Lowe.
CSSE463: Image Recognition Day 25 This week This week Today: Applications of PCA Today: Applications of PCA Sunday night: project plans and prelim work.
Optical Character Recognition
Introduction to Transformations / Translations. By the end of this lesson, you will know… Transformations in general: A transformation is a change in.
Active Flattening of Curved Document Images via Two Structured Beams
Principal Component Analysis (PCA)
CSSE463: Image Recognition Day 27
3D Vision Interest Points.
9.3 Filtered delay embeddings
Dimensionality reduction
The horizontal number line is called the ______. x-axis
CS 332 Visual Processing in Computer and Biological Vision Systems
Tensor Visualization Chap. 7 October 21, 2008 Jie Zhang Copyright ©
MATH 1310 Section 1.1.
Object Detection Creation from Scratch Samsung R&D Institute Ukraine
Chap.8 Image Analysis 숙명여자대학교 컴퓨터과학과 최 영 우 2005년 2학기.
CSSE463: Image Recognition Day 25
Midterm Exam Closed book, notes, computer Similar to test 1 in format:
CSSE463: Image Recognition Day 25
MATH 1310 Section 1.1.
Principal Component Analysis
Lesson 2-4 The Coordinate Plane
Chapter 2: Transformations
Multi-Information Based GCPs Selection Method
MATH 1310 Section 1.1.
Point Cloud Processing
An introduction to Machine Learning (ML)
Outline Variance Matrix of Stochastic Variables and Orthogonal Transforms Principle Component Analysis Generalized Eigenvalue Decomposition.
Presentation transcript:

Institute for Information Industry (III) Research Report 2018/09/25 黃季軒 0935090120 tazdingoHuang@gmail.com

Urban Scene Point Cloud Segmentation Road Surface Points Segmentation Road Points Non-road Points Road Markings Detection Pole-like Objects Segmentation and Classification

Road Surface Points Segmentation Input: original point cloud. Output: road points.

Get 4 Features of Each Point Method Point Cloud Get 4 Features of Each Point Classify Road Points and Non-road Points Using Random Forest Classifier Road Points Non-road Points

Method Features used in the classification are related to the eigenvalues and eigenvectors obtained from a principal component analysis (PCA) applied to the coordinates of the neighbors of each point of the cloud. Four features are used: Linearity: How elongated the neighborhood is. Planarity: How well it is fitted by a plane. Scattering: High scattering values correspond to an isotropic and spherical neighborhood. Verticality: How vertical the neighborhood is.

Results Reference: S. Guinard and L. Landrieu. Weakly supervised segmentation-aided classification of urban scenes from 3d LiDAR point clouds. In ISPRS 2017, 2017. Precision 94.8% Recall (road) 97.7% Recall (non-road) 87.0%

Road Markings Detection Input: road points. Output: vectors of lines, bounding boxes of road markings.

Method Extract high reflectivity points in ground points. Classify connected components by their region properties.

Results : Road markings. : Centerlines. : Turning lines.

Pole-like Objects Segmentation and Classification Input: Urban scene non-road points. Output: Segmented pole-like objects. Original point cloud scene. Segmented objects.

Method Non-road Points Segment Pole-like Objects in Point Cloud Get 4 Features of Each Pole-like Object Classify Pole-like Object Using PointNet Classify Pole-like Object Using Random Forest Classifier Pole-like Objects’ Classes

Segment Pole-like Objects in Point Cloud Voxelize the point cloud. Locate isolated objects with a small horizontal section. Consider vertical continuity and minimum height. Get connected component.

Method (Random Forest) PCA is used. Four features are used: Linearity: How elongated the neighborhood is. Planarity: How well it is fitted by a plane. Scattering: High scattering values correspond to an isotropic and spherical neighborhood. Height

Method (PointNet) Suitable for consuming unordered point sets in 3D. Capture local structures from nearby points. Invariance under transformations.

Pole-like Objects A B C D data set Pedestrian Signal 103 Street Light traffic light traffic sign Pedestrian Signal 103 Street Light 282 Traffic Light 167 Traffic Sign 35 data set

Classification Results (Dataset 1) Random Forest Point Net Class Precision Recall Pedestrian Signal 70% 92% Street light 95% 90% Traffic Light 97% 71% Traffic Sign 25% 44% Class Precision Recall Pedestrian Signal 81% 68% Street light 90% 95% Traffic Light 94% 100% Traffic Sign 43% 38% Over all accuracy: 82% Over all accuracy: 88% Average accuracy: 72% Average accuracy: 77%

Classification Results (Dataset 2) Random Forest Point Net Class Precision Recall Pedestrian Signal 78% 81% Street light 93% 96% Traffic Light 95% Traffic Sign 86% 67% Class Precision Recall Pedestrian Signal 100% Street light 98% Traffic Light 97% Traffic Sign Over all accuracy: 90% Over all accuracy: 99% Average accuracy: 88% Average accuracy: 99%

Classification Results (Dataset 3) Random Forest Point Net Class Precision Recall Pedestrian Signal 67% 62% Street light 84% 90% Traffic Light 93% 100% Traffic Sign 22% Class Precision Recall Pedestrian Signal 83% 91% Street light 95% Traffic Light 100% 92% Traffic Sign 43% Over all accuracy: 84% Over all accuracy: 91% Average accuracy: 78% Average accuracy: 80%

Classification Results (Dataset 4) Random Forest Point Net Class Precision Recall Pedestrian Signal 80% 62% Street light 88% 93% Traffic Light 87% 95% Traffic Sign 50% 38% Class Precision Recall Pedestrian Signal 100% 76% Street light 97% 98% Traffic Light 89% Traffic Sign 33% 50% Over all accuracy: 85% Over all accuracy: 92% Average accuracy: 76% Average accuracy: 80%

Classification Results Random Forest Point Net Over all accuracy 85.25% 92.50% Average accuracy 78.50% 84.00% Average recall 74.75% 87.13%