Robust Moving Least-squares Fitting with Sharp Features Shachar Fleishman* Daniel Cohen-Or § Claudio T. Silva* * University of Utah § Tel-Aviv university.

Slides:



Advertisements
Similar presentations
Outliers Because we square errors, a few points with large errors can have large effect on fitted response surface Both in simulations and in experiments.
Advertisements

CSCE 643 Computer Vision: Template Matching, Image Pyramids and Denoising Jinxiang Chai.
L1 sparse reconstruction of sharp point set surfaces
Regression “A new perspective on freedom” TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAA A A A A AAA A A.
CMPUT 466/551 Principal Source: CMU
Chapter 4: Linear Models for Classification
1Ellen L. Walker Edges Humans easily understand “line drawings” as pictures.
BMVC 2009 Specularity and Shadow Interpolation via Robust Polynomial Texture Maps Mark S. Drew 1, Nasim Hajari 1, Yacov Hel-Or 2 & Tom Malzbender 3 1 School.
Segmentation into Planar Patches for Recovery of Unmodeled Objects Kok-Lim Low COMP Computer Vision 4/26/2000.
Boosting CMPUT 615 Boosting Idea We have a weak classifier, i.e., it’s error rate is a little bit better than 0.5. Boosting combines a lot of such weak.
x – independent variable (input)
Bounded-distortion Piecewise Mesh Parameterization
CS CS 175 – Week 2 Processing Point Clouds Local Surface Properties, Moving Least Squares.
Fitting. We’ve learned how to detect edges, corners, blobs. Now what? We would like to form a higher-level, more compact representation of the features.
Filling Arbitrary Holes in Finite Element Models 17 th International Meshing Roundtable 2008 Schilling, Bidmon, Sommer, and Ertl.
FYP Presentataion CK1 Intelligent Surface Modeler By Yu Wing TAI Kam Lun TANG Advised by Prof. Chi Keung TANG.
Shape Modeling International 2007 – University of Utah, School of Computing Robust Smooth Feature Extraction from Point Clouds Joel Daniels ¹ Linh Ha ¹.
Optimal Bandwidth Selection for MLS Surfaces
1 Removal of Impulse Noise in Images by Means of the Use of Support Vector Machines H. Gómez-Moreno, S. Maldonado-Bascón, F. López-Ferreras, and P. Gil-Jiménez.
Lecture 17 Today: Start Chapter 9 Next day: More of Chapter 9.
Consolidation of Unorganized Point Clouds for Surface Reconstruction Hui Huang 1 Dan Li 1 Hao Zhang 2 Uri Ascher 1 Daniel Cohen-Or 3 1 University of British.
Defining Point Set Surfaces Nina Amenta and Yong Joo Kil University of California, Davis IDAV Institute for Data Analysis and Visualization Visualization.
Robust estimation Problem: we want to determine the displacement (u,v) between pairs of images. We are given 100 points with a correlation score computed.
Robust Statistical Estimation of Curvature on Discretized Surfaces Evangelos Kalogerakis Patricio Simari Derek Nowrouzezahrai Karan Singh Symposium on.
Detecting the Domain Structure of Proteins from Sequence Information Niranjan Nagarajan and Golan Yona Department of Computer Science Cornell University.
Accurate, Dense and Robust Multi-View Stereopsis Yasutaka Furukawa and Jean Ponce Presented by Rahul Garg and Ryan Kaminsky.
Computational Analysis of USA Swimming Data Junfu Xu School of Computer Engineering and Science, Shanghai University.
CSCE 441: Computer Graphics Image Filtering Jinxiang Chai.
CpE- 310B Engineering Computation and Simulation Dr. Manal Al-Bzoor
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Feature-Aware Filtering for Point-Set Surface Denoising Min Ki Park*Seung.
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
A D V A N C E D C O M P U T E R G R A P H I C S CMSC 635 January 15, 2013 Quadric Error Metrics 1/20 Quadric Error Metrics.
Context-based Surface Completion Andrei Sharf, Marc Alexa, Daniel Cohen-Or.
Resistant Learning on the Envelope Bulk for Identifying Anomalous Patterns Fang Yu Department of Management Information Systems National Chengchi University.
Time Series Data Analysis - I Yaji Sripada. Dept. of Computing Science, University of Aberdeen2 In this lecture you learn What are Time Series? How to.
Recent Work/Papers by the Visualization and Geometry Computing (VGC) Group.
Projecting points onto a point cloud with noise Speaker: Jun Chen Mar 26, 2008.
Model Construction: interpolation techniques 1392.
Data Mining Practical Machine Learning Tools and Techniques Chapter 4: Algorithms: The Basic Methods Section 4.7: Instance-Based Learning Rodney Nielsen.
AP Statistics Semester One Review Part 1 Chapters 1-3 Semester One Review Part 1 Chapters 1-3.
Course 8 Contours. Def: edge list ---- ordered set of edge point or fragments. Def: contour ---- an edge list or expression that is used to represent.
Chapter1: Introduction Chapter2: Overview of Supervised Learning
Bilateral Mesh Denoising Shachar Fleishman Iddo Drori Daniel Cohen-Or Tel Aviv University.
3.7 Adaptive filtering Joonas Vanninen Antonio Palomino Alarcos.
KNN Ch. 3 Diagnostics and Remedial Measures Applied Regression Analysis BUSI 6220.
Curve Fitting Introduction Least-Squares Regression Linear Regression Polynomial Regression Multiple Linear Regression Today’s class Numerical Methods.
With Tamal Dey, Qichao Que, Issam Safa, Lei Wang, Yusu Wang Computer science and Engineering The Ohio State University Xiaoyin Ge.
Fitting.
SIAM Conference on Geometric Desing & Computing Approximation of spatial data with shape constraints Maria Lucia Sampoli University of Siena, Italy.
Decimation of Triangle Meshes Paper by W.J.Schroeder et.al Presented by Guangfeng Ji.
AP Statistics Review Day 1 Chapters 1-4. AP Exam Exploring Data accounts for 20%-30% of the material covered on the AP Exam. “Exploratory analysis of.
Use of administrative data for outlier detection in the VI Italian agriculture census A. Reale 1, M. Riani 2, M. Greco 1, G. Ruocco 1 1 ISTAT, Census Department;
Digital Camera and Computer Vision Laboratory Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, R.O.C.
1 C.A.L. Bailer-Jones. Machine Learning. Data exploration and dimensionality reduction Machine learning, pattern recognition and statistical data modelling.
A Plane-Based Approach to Mondrian Stereo Matching
Machine Learning with Spark MLlib
Data Science Algorithms: The Basic Methods
From Point Clouds To Trimmed NURBS
Linear Regression.
MATH 2140 Numerical Methods
Classification and Prediction
MATH 2140 Numerical Methods
Intro to Machine Learning
Introduction to Sensor Interpretation
Robust Moving Least-squares Fitting with Sharp Features
Introduction to Sensor Interpretation
Regression and Correlation of Data
Machine Learning in Business John C. Hull
Absorption Spectrum of HCl
Presentation transcript:

Robust Moving Least-squares Fitting with Sharp Features Shachar Fleishman* Daniel Cohen-Or § Claudio T. Silva* * University of Utah § Tel-Aviv university

Surface reconstruction Noise Smooth surface Smooth sharp features Method for identifying and reconstructing sharp features

Point set surfaces (Levin ’98) Defines a smooth surface using a projection operator

Point set surfaces Defines a smooth surface using a projection operator Noisy point set The surface S is defined:

The MLS projection: overview Find a point q on the surfaces whose normal goes through the projected point x q is the projection of x

The MLS projection: overview Find a point q on the surfaces whose normal goes through the projected point x q is the projection of x Improve approximation order using polynomial fit

Sharp features Smoothed out Ambiguous

Sharp features Smoothed out Ambiguous – Classify

Projection near sharp feature

Classification Using outlier identification algorithm That fits a polynomial patch to a neighborhood

Classification Using outlier identification algorithm That fits a polynomial patch to a neighborhood

Statistics 101 Find the center of a set of points mean

Statistics 101 Find the center of a set of points Robustly using median mean median

Regression with backward search Loop – Fit a model – Remove point with maximal residual Until no more outliers

Regression with backward search Outliers can have a significant influence of the fitted model

Regression with forward search (Atkinson and Riani) Start with an initial good but crude surface – LMS (least median of squares) Incrementally improve the fit Monitor the search

Monitoring the forward search Residual plot

Monitoring the forward search Residual plot

Results Polynomial fit allows reconstruction of curved edges Input with missing data Reconstructed and corners Smooth MLS MLS w. edges

Results Noisy input Reconstructed input smooth sharp

Results Outliers are ignoredMisaligned regions are determined to be two regions Local decision may cause inconsistencies

Summary Classification of noisy point sets to smooth regions Application to PSS – Reconstruct surfaces with sharp features from noisy data – Improve the stability of the projection Local decisions may result different neighborhoods for adjacent points Can be applied to other surface reconstruction methods such as the MPU

Acknowledgements Department of Energy under the VIEWS program and the MICS office The National Science Foundation under grants CCF , EIA , and OISE A University of Utah Seed Grant The Israel Science Foundation (founded by the Israel Academy of Sciences and Humanities), and the Israeli Ministry of Science