4-Points Congruent Sets for Robust Pairwise Surface Registration

Slides:



Advertisements
Similar presentations
Recognising Panoramas M. Brown and D. Lowe, University of British Columbia.
Advertisements

Fast and Accurate Optical Flow Estimation
3D Model Matching with Viewpoint-Invariant Patches(VIP) Reporter :鄒嘉恆 Date : 10/06/2009.
Extrinsic and Depth Calibration of TOF-cameras Reporter :鄒嘉恆 Date : 2009/12/22.
Towards Geographical Referencing of Monocular SLAM Reconstruction Using 3D City Models: Application to Real- Time Accurate Vision-Based Localization Reporter.
Vision-based Motion Planning for an Autonomous Motorcycle on Ill-Structured Road Reporter :鄒嘉恆 Date : 08/31/09.
Author :Andrea Selinger Salgian Department of Computer Science
SuperMatching: Feature Matching using Supersymmetric Geometric Constraints Submission ID: 0208.
1 A robust detection algorithm for copy- move forgery in digital images Source: Forensic Science International, Volume 214, Issues 1–3, 10 January 2012.
Robust Global Registration Natasha Gelfand Niloy Mitra Leonidas Guibas Helmut Pottmann.
Object Recognition using Invariant Local Features Applications l Mobile robots, driver assistance l Cell phone location or object recognition l Panoramas,
Object Recognition & Model Based Tracking © Danica Kragic Tracking system.
Chapter 6 Feature-based alignment Advanced Computer Vision.
Proportion Priors for Image Sequence Segmentation Claudia Nieuwenhuis, etc. ICCV 2013 Oral.
Robust Object Tracking via Sparsity-based Collaborative Model
Unnatural L 0 Representation for Natural Image Deblurring Speaker: Wei-Sheng Lai Date: 2013/04/26.
Inter-Surface Mapping John Schreiner, Arul Asirvatham, Emil Praun (University of Utah) Hugues Hoppe (Microsoft Research)
Probabilistic Fingerprints for Shapes Niloy J. MitraLeonidas Guibas Joachim GiesenMark Pauly Stanford University MPII SaarbrückenETH Zurich.
Image alignment Image from
A Versatile Depalletizer of Boxes Based on Range Imagery Dimitrios Katsoulas*, Lothar Bergen*, Lambis Tassakos** *University of Freiburg **Inos Automation-software.
Computer Vision Group University of California Berkeley Shape Matching and Object Recognition using Shape Contexts Jitendra Malik U.C. Berkeley (joint.
Robust and large-scale alignment Image from
Iterative closest point algorithms
A Study of Approaches for Object Recognition
Object Recognition with Invariant Features n Definition: Identify objects or scenes and determine their pose and model parameters n Applications l Industrial.
Recognising Panoramas
Agenda A brief introduction The MASS algorithm The pairwise case Extension to the multiple case Experimental results.
Automatic Panoramic Image Stitching using Local Features Matthew Brown and David Lowe, University of British Columbia.
Lecture 8: Image Alignment and RANSAC
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2006 with a lot of slides stolen from Steve Seitz and.
On the Object Proposal Presented by Yao Lu
FAsT-Match: Fast Affine Template Matching
Lecture 10: Robust fitting CS4670: Computer Vision Noah Snavely.
1 Dot Plots For Time Series Analysis Dragomir Yankov, Eamonn Keogh, Stefano Lonardi Dept. of Computer Science & Eng. University of California Riverside.
3D Global Registration. The Problem Given: n scans around an objectGiven: n scans around an object Goal: align them allGoal: align them all First attempt:
CSE 185 Introduction to Computer Vision
Chapter 6 Feature-based alignment Advanced Computer Vision.
Automatic Registration of Color Images to 3D Geometry Computer Graphics International 2009 Yunzhen Li and Kok-Lim Low School of Computing National University.
Shape Matching for Model Alignment 3D Scan Matching and Registration, Part I ICCV 2005 Short Course Michael Kazhdan Johns Hopkins University.
Image Stitching Shangliang Jiang Kate Harrison. What is image stitching?
MESA LAB Multi-view image stitching Guimei Zhang MESA LAB MESA (Mechatronics, Embedded Systems and Automation) LAB School of Engineering, University of.
Correspondence-Free Determination of the Affine Fundamental Matrix (Tue) Young Ki Baik, Computer Vision Lab.
BING: Binarized Normed Gradients for Objectness Estimation at 300fps
Dengsheng Zhang and Melissa Chen Yi Lim
3D Object Modelling and Classification Intelligent Robotics Research Centre (IRRC) Department of Electrical and Computer Systems Engineering Monash University,
3D reconstruction from uncalibrated images
Visual Odometry David Nister, CVPR 2004
776 Computer Vision Jan-Michael Frahm Spring 2012.
1 LSB Matching Revisited Source: IEEE Signal Processing Letters (Accepted for future publication) Authors: Jarno Mielikainen Speaker: Chia-Chun Wu ( 吳佳駿.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology Advisor : Dr. Hsu Graduate : Chun Kai Chen Author : Andrew.
CSCI 631 – Foundations of Computer Vision March 15, 2016 Ashwini Imran Image Stitching.
Introduction to Medical Imaging Regis Introduction to Medical Imaging Registration Alexandre Kassel Course
김지형. Introduction precursor peptides are dynamically selected for fragmentation with exclusion to prevent repetitive acquisition of MS/MS spectra.
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.
CENG 789 – Digital Geometry Processing 10- Least-Squares Solutions
Nearest-neighbor matching to feature database
Learning Mid-Level Features For Recognition
Fast Preprocessing for Robust Face Sketch Synthesis
Lecture 7: Image alignment
Approximate Models for Fast and Accurate Epipolar Geometry Estimation
Unsupervised Face Alignment by Robust Nonrigid Mapping
Nearest-neighbor matching to feature database
3D Scan Alignment Using ICP
Source: Information Sciences, 2018, accpeted.
CENG 789 – Digital Geometry Processing 11- Least-Squares Solutions
Computational Photography
EFFICIENCY OF MrSID Chapter 6. Slide 41
Color image noise removal algorithm utilizing hybrid vector filtering
A Robust Digital Watermarking Of Satellite Image at Third Level DWT Decomposition Source:International Conference on Computational Intelligence and Multimedia.
Presentation transcript:

4-Points Congruent Sets for Robust Pairwise Surface Registration Date : 01/01/26 Reporter : 鄒嘉恆 CVPR 2008

Introduction They introduce 4PCS, a fast and robust alignment scheme for 3D point sets that uses wide bases, which are known to be resilient to noise and outliers.

Outline Motivation Problem Approximate congruent 4-Points The 4PCS Algorithm Experimental results Conclusions

Motivation Two scans Corrupted with noise and outliers. In arbitrary initial poses with unknown overlap Refer to Dror A.’s slide on SIGGRAPH 2008

Problem Using wide base, not narrow-base Registration first, denoising later. [Goodrich et al. 1994]

Approximate congruent 4-Points

Approximate congruent 4-Points Affine invariants of 4-points set

Approximate congruent 4-Points Affine invariants of 4-points set Refer to Dror A.’s slide on SIGGRAPH 2008

Approximate congruent 4-Points Affine invariants of 4-points set Refer to Dror A.’s slide on SIGGRAPH 2008

Approximate congruent 4-Points Affine invariants of 4-points set Refer to Dror A.’s slide on SIGGRAPH 2008

Approximate congruent 4-Points Affine invariants of 4-points set Refer to Dror A.’s slide on SIGGRAPH 2008

Approximate congruent 4-Points Affine invariants of 4-points set Refer to Dror A.’s slide on SIGGRAPH 2008

Approximate congruent 4-Points Affine invariants of 4-points set Refer to Dror A.’s slide on SIGGRAPH 2008

The 4PCS Algorithm Refer to Dror A.’s slide on SIGGRAPH 2008

The 4PCS Algorithm Refer to Dror A.’s slide on SIGGRAPH 2008

The 4PCS Algorithm Refer to Dror A.’s slide on SIGGRAPH 2008

The 4PCS Algorithm Refer to Dror A.’s slide on SIGGRAPH 2008

The 4PCS Algorithm

The 4PCS Algorithm

Experimental results LD-RANSAC Local descrptors: spin images [Li and Guskov 2005]

Experimental results LD-RANSAC Local descrptors: spin images + integral invariants [Pottmann et al. 2007]

Experimental results Trial 1

Experimental results Trial 2

Experimental results Trial 2

Experimental results Trial 3

Experimental results

Experimental results

Experimental results

Experimental results Limitation

Conclusions A coplanar 4-points base allow us to employ a technique the efficiently matches pairs of affine invariants ratios in 3D. More faster. Prevent noise and outliers.