Lecture 8: Registration
|
|
- Roderick Stephens
- 5 years ago
- Views:
Transcription
1 ME 328: Medical Robotics Winter 2019 Lecture 8: Registration Allison Okamura Stanford University
2 Updates Assignment 4 Sign up for teams/ultrasound by noon today at: Main parts: Readings/questions Image acquisition and analysis (ultrasound lab) Image registration Needle insertion (robot control) Remainder of assignment will be posted this morning
3 registration the alignment of multiple data sets into a single coordinate system such that the spatial locations of corresponding points coincide i.e., establish a quantitative relationship between different reference frames essential for the quantitative integration of various sources of information: 1. pre-, intra-, and post-operative images 2. trackers (tracking data not useful unless registered) 3. robots (cannot use images unless registered) Image-Guided Procedures: A Review, by Ziv Yaniv and Kevin Cleary (2006)
4 examples L. Joskowicz c 2011
5 suitability for image-guided procedures accuracy: target registration error (TRE) quantifies how far the predicted position of the anatomical target is from its actual position ~1 mm typically satisfactory speed: how long does it take the algorithm to produce the solution intraoperatively, need on the order of seconds to minutes robustness: how well does the algorithm deal with noise and outliers depends on how noisy the data is
6 navigation and registration example
7 a typical robot registration problem Preoperative model from a CT scan gives the location of a tumor in the brain... Now we are in the OR and want to operate with a robot based on this preoperative registration example and graphics provided by Russell H. Taylor, JHU image
8 a typical robot registration problem preoperative model intraoperative reality T reg v CT = T reg v ptr v ptr What is? T reg c Russell H. Taylor, 2011
9 coordinate systems and transformations y B T {B} y A z B x B {A} x A e.g., image or patient coordinate system z A e.g., robot base T 1 coordinate system
10 coordinate systems and transformations v A = F (v B ) v A = Tv B y B v A = Rv B + p T {B} v B y A z B x B {A} v A x A e.g., image or patient coordinate system z A e.g., robot base coordinate system T 1 T (R, p) = apple R 3 3 p
11 coordinate systems and transformations v A = F (v B ) first rotate v A = Tv B v A = Rv B + p {B} v B {A} v A T (R, p) = apple R 3 3 p
12 v A = F (v B ) v A = Tv B coordinate systems and transformations v A = Rv B + p {B} v B then translate {A} v A T (R, p) = apple R 3 3 p
13 interesting properties of T and R forward transformation v A = Tv B v A = Rv B + p inverse transformation T 1 v A = v B v B = R 1 (v A p) v B = R 1 v A R 1 p composition of transformations T 3 = T 1 T 2 R 3 = R 1 R 2 p 3 = R 1 p 2 + p 1 rotation matrices are orthogonal matrices R T = R 1 R T R = RR T = I and members of the group SO(3) det(r) =+1
14 composition of transformations F CH F CA F BE F BD F C F D F E F GC F G F DU F U F EH F BG F UA F H F B F GH? F GH = F 1 BG F BEF EH c Russell H. Taylor, 2011
15 feature-based registration preoperative model intraoperative reality tracked pointer/robot end-effector c Russell H. Taylor, 2011
16 features used for feature-based registration Point fiducials (markers) Point anatomical landmarks Ridge curves Contours Surfaces Line fiducials given two features (either the same features in two different reference frames, of two different features in the same reference frame), we need to know the distance between them
17 what the computer knows preoperative model intraoperative reality c Russell H. Taylor, 2011
18 identify corresponding points preoperative model intraoperative reality c Russell H. Taylor, 2011
19 how to identify correspondences { b } i manual vs. part of the optimization/ a k? minimization process state of the art is the iterative closest point (ICP) algorithm... but we will assume manual is possible
20 find the best rigid transformation preoperative model intraoperative reality X min T reg i w i D(T reg a i,b i ) minimize over all possible values of T reg weighting depending on which points are being considered c a disparity function Russell H. Taylor, 2011
21 disparity function, D a metric for the error between two feature sets minimize over all possible values of T reg X min T reg i w i D(T reg a i,b i ) weighting depending on which points are being considered sum of squares of residuals is common: X min T reg i other D possibilities include: maximum distance median distance a disparity function w i (T reg a i b i ) 2 cardinality depending in threshold
22 how to do the optimization for rigid registration Given points in two different coordinate systems (e.g., a set of points and a set of points ) {a i } {b i } Find the transformation matrix T (R, p) X That minimizes e T i e i i Where e i =(Ra i + p) b i this is tricky because of R Options: global vs. local numerical vs. direct (analytical) ways of dealing with local minima
23 minimizing registration errors Step 1: compute means and residuals of known points ā = 1 NX NX 1 b a i = b i N N i=1 i=1 ã i = a i ā bi = b b i X Step 2: Find R that minimizes (Rã bi i ) 2 Step 3: Find p p = b Rā i How??? There are 4 substeps within Step 4: Desired transformation is apple R p T (R, p) = this step
24 minimization substeps: direct method (there is also an iterative method) Step 1: Compute H = i!a i,x! bi,x!a i,x! bi,y!a i,x! bi,z!a i,y! bi,x!a i,y! bi,y!a i,y! bi,z!a i,z! bi,x!a i,z! bi,y!a i,z! bi,z Step 2: Compute the SVD of H = USV t Step 3: R = VU t outer product between a and b Step 4: Verify Det(R) = 1. If not, then algorithm may fail. K. S. Arun, T. S. Huang, S. D. Blostein. Least-Squares Fitting of Two 3-D Point Sets. IEEE Transactions on Pattern Analysis and Machine Intelligence, 9(5): , 1987.
25 Extra Slides: An Iterative Method for Finding the Rotation Matrix (I don t recommend using this for your assignment, though. The SVD method is much simpler.)
26 iterative method: solving for R Goal: given paired point sets {a i } and {b i }, find R = arg min X i (Rã i bi ) 2 Step 0: Make an initial guess R 0 Step 1: Given R, compute ˆbi k = R 1 k b i X Step 2: Compute R that minimizes ( Rã ˆbi i ) 2 Step 3: Set R k+1 = R k R Step 4: Iterate Steps 1-3 until residual error is sufficiently small (or other termination condition) i
27 more mathematical preliminaries matrix representation of cross product 2 T a = a x a y a z skew(a) = 4 a v =skew(a)v 0 a z a y a z 0 a x a y a x representations/constructions of rotation matrices angle-axis: rot(a, ) is a rotation about axis a Rodrigues formula: c = rot(a, )b = b cos( )+a b sin( )+a(a T b)(1 cos( )) exponential: rot(a, ) =e skew(a) = I + skew(a)+ 2 2! skew(a) rot(a, ) I + skew(a) more notation: rot(a, ) =R a ( ) R(a) = rot(a, a )
28 small transformations useful for linear approximations to represent small pose shifts Tv = Rv + p R a small rotation R a ( ) a rotation by a small angle about axis a rot(a, a )b a b + b for a sufficiently small R(a) a rotation that is small enough so that any error introduced by this approximation is negligible R( a) R(µb) R( a + µb) linearity for small rotations exercise: work out the linearity proposition by substitution
29 small transformations Tv = R(a)v + p Tv v + a v + p a v =skew(a)v = a z a y a z 0 a x a y a x v x v y v z 3 5 skew(a)a =0 R(a) I +skew(a) R(a) 1 I skew(a) =I +skew( a)
30 iterative method: solving for Goal: given paired point sets {a i } and {b i }, find R = arg min X i R (Rã i bi ) 2 Step 0: Make an initial guess R 0 Step 1: Given R, compute ˆbi k = R 1 k b i X Step 2: Compute R that minimizes ( Rã ˆbi i ) 2 Step 3: Set R k+1 = R k R Step 4: Iterate Steps 1-3 until residual error is sufficiently small (or other termination condition) i
31 iterative method: solving for R Approximate R as (I +skew( )) Which is equivalent to Rv v + v remember: multiplying by a skew-symmetric matrix is equivalent to taking cross product Then our least squares problem becomes X min ( Rã ˆbi i ) 2 X min (ã ˆbi i + ã i ) 2 R i This is a linear least squares problem in i Then compute R( )
First scan matching algorithms. Alberto Quattrini Li University of South Carolina
First scan matching algorithms Alberto Quattrini Li 2015-10-22 University of South Carolina Robot mapping through scan-matching Framework for consistent registration of multiple frames of measurements
More information5.2 Surface Registration
Spring 2018 CSCI 621: Digital Geometry Processing 5.2 Surface Registration Hao Li http://cs621.hao-li.com 1 Acknowledgement Images and Slides are courtesy of Prof. Szymon Rusinkiewicz, Princeton University
More informationLecture 6: Medical imaging and image-guided interventions
ME 328: Medical Robotics Winter 2019 Lecture 6: Medical imaging and image-guided interventions Allison Okamura Stanford University Updates Assignment 3 Due this Thursday, Jan. 31 Note that this assignment
More information10/03/11. Model Fitting. Computer Vision CS 143, Brown. James Hays. Slides from Silvio Savarese, Svetlana Lazebnik, and Derek Hoiem
10/03/11 Model Fitting Computer Vision CS 143, Brown James Hays Slides from Silvio Savarese, Svetlana Lazebnik, and Derek Hoiem Fitting: find the parameters of a model that best fit the data Alignment:
More informationInverse Kinematics II and Motion Capture
Mathematical Foundations of Computer Graphics and Vision Inverse Kinematics II and Motion Capture Luca Ballan Institute of Visual Computing Comparison 0 1 A B 2 C 3 Fake exponential map Real exponential
More informationICRA 2016 Tutorial on SLAM. Graph-Based SLAM and Sparsity. Cyrill Stachniss
ICRA 2016 Tutorial on SLAM Graph-Based SLAM and Sparsity Cyrill Stachniss 1 Graph-Based SLAM?? 2 Graph-Based SLAM?? SLAM = simultaneous localization and mapping 3 Graph-Based SLAM?? SLAM = simultaneous
More informationAn idea which can be used once is a trick. If it can be used more than once it becomes a method
An idea which can be used once is a trick. If it can be used more than once it becomes a method - George Polya and Gabor Szego University of Texas at Arlington Rigid Body Transformations & Generalized
More informationThe Alignment of Arbitrary Contours Using Area Difference Distance Measurement
The Alignment of Arbitrary Contours Using Area Difference Distance Measurement Jessica De Silva, Karen Murata, and Jung-ha An, Ph.D. Department of Mathematics California State University Stanislaus One
More informationHomework Assignment /655 (CIRCLE ONE) Fall Instructions and Score Sheet (hand in with answers)
Homework Assignment 3 601.455/655 (CIRCLE ONE) Fall 2017 Instructions and Score Sheet (hand in with answers) Name Email Other contact information (optional) Signature (required) I have followed the rules
More informationTwo-view geometry Computer Vision Spring 2018, Lecture 10
Two-view geometry http://www.cs.cmu.edu/~16385/ 16-385 Computer Vision Spring 2018, Lecture 10 Course announcements Homework 2 is due on February 23 rd. - Any questions about the homework? - How many of
More informationAssessing Accuracy Factors in Deformable 2D/3D Medical Image Registration Using a Statistical Pelvis Model
Assessing Accuracy Factors in Deformable 2D/3D Medical Image Registration Using a Statistical Pelvis Model Jianhua Yao National Institute of Health Bethesda, MD USA jyao@cc.nih.gov Russell Taylor The Johns
More informationQuaternions and Exponentials
Quaternions and Exponentials Michael Kazhdan (601.457/657) HB A.6 FvDFH 21.1.3 Announcements OpenGL review II: Today at 9:00pm, Malone 228 This week's graphics reading seminar: Today 2:00-3:00pm, my office
More informationThree-Dimensional Sensors Lecture 6: Point-Cloud Registration
Three-Dimensional Sensors Lecture 6: Point-Cloud Registration Radu Horaud INRIA Grenoble Rhone-Alpes, France Radu.Horaud@inria.fr http://perception.inrialpes.fr/ Point-Cloud Registration Methods Fuse data
More informationNonlinear State Estimation for Robotics and Computer Vision Applications: An Overview
Nonlinear State Estimation for Robotics and Computer Vision Applications: An Overview Arun Das 05/09/2017 Arun Das Waterloo Autonomous Vehicles Lab Introduction What s in a name? Arun Das Waterloo Autonomous
More information3D Point Cloud Processing
3D Point Cloud Processing The image depicts how our robot Irma3D sees itself in a mirror. The laser looking into itself creates distortions as well as changes in intensity that give the robot a single
More informationCS251 Spring 2014 Lecture 7
CS251 Spring 2014 Lecture 7 Stephanie R Taylor Feb 19, 2014 1 Moving on to 3D Today, we move on to 3D coordinates. But first, let s recap of what we did in 2D: 1. We represented a data point in 2D data
More informationCS612 - Algorithms in Bioinformatics
Fall 2017 Structural Manipulation November 22, 2017 Rapid Structural Analysis Methods Emergence of large structural databases which do not allow manual (visual) analysis and require efficient 3-D search
More informationRecovery of 3D Pose of Bones in Single 2D X-ray Images
Recovery of 3D Pose of Bones in Single 2D X-ray Images Piyush Kanti Bhunre Wee Kheng Leow Dept. of Computer Science National University of Singapore 3 Science Drive 2, Singapore 117543 {piyushka, leowwk}@comp.nus.edu.sg
More informationSurface Registration. Gianpaolo Palma
Surface Registration Gianpaolo Palma The problem 3D scanning generates multiple range images Each contain 3D points for different parts of the model in the local coordinates of the scanner Find a rigid
More informationDynamic Geometry Processing
Dynamic Geometry Processing EG 2012 Tutorial Will Chang, Hao Li, Niloy Mitra, Mark Pauly, Michael Wand Tutorial: Dynamic Geometry Processing 1 Articulated Global Registration Introduction and Overview
More informationAgenda. Rotations. Camera models. Camera calibration. Homographies
Agenda Rotations Camera models Camera calibration Homographies D Rotations R Y = Z r r r r r r r r r Y Z Think of as change of basis where ri = r(i,:) are orthonormal basis vectors r rotated coordinate
More informationIterative Closest Point Algorithm in the Presence of Anisotropic Noise
Iterative Closest Point Algorithm in the Presence of Anisotropic Noise L. Maier-Hein, T. R. dos Santos, A. M. Franz, H.-P. Meinzer German Cancer Research Center, Div. of Medical and Biological Informatics
More informationGeometric Transformations
Geometric Transformations CS 4620 Lecture 9 2017 Steve Marschner 1 A little quick math background Notation for sets, functions, mappings Linear and affine transformations Matrices Matrix-vector multiplication
More informationIntroduction to Computer Vision
Introduction to Computer Vision Michael J. Black Nov 2009 Perspective projection and affine motion Goals Today Perspective projection 3D motion Wed Projects Friday Regularization and robust statistics
More informationDIMENSIONAL SYNTHESIS OF SPATIAL RR ROBOTS
DIMENSIONAL SYNTHESIS OF SPATIAL RR ROBOTS ALBA PEREZ Robotics and Automation Laboratory University of California, Irvine Irvine, CA 9697 email: maperez@uci.edu AND J. MICHAEL MCCARTHY Department of Mechanical
More informationCALCULATING TRANSFORMATIONS OF KINEMATIC CHAINS USING HOMOGENEOUS COORDINATES
CALCULATING TRANSFORMATIONS OF KINEMATIC CHAINS USING HOMOGENEOUS COORDINATES YINGYING REN Abstract. In this paper, the applications of homogeneous coordinates are discussed to obtain an efficient model
More informationAH Matrices.notebook November 28, 2016
Matrices Numbers are put into arrays to help with multiplication, division etc. A Matrix (matrices pl.) is a rectangular array of numbers arranged in rows and columns. Matrices If there are m rows and
More information3D Transformations. CS 4620 Lecture 10. Cornell CS4620 Fall 2014 Lecture Steve Marschner (with previous instructors James/Bala)
3D Transformations CS 4620 Lecture 10 1 Translation 2 Scaling 3 Rotation about z axis 4 Rotation about x axis 5 Rotation about y axis 6 Properties of Matrices Translations: linear part is the identity
More informationMTRX4700 Experimental Robotics
MTRX 4700 : Experimental Robotics Lecture 2 Stefan B. Williams Slide 1 Course Outline Week Date Content Labs Due Dates 1 5 Mar Introduction, history & philosophy of robotics 2 12 Mar Robot kinematics &
More informationCorrespondence. CS 468 Geometry Processing Algorithms. Maks Ovsjanikov
Shape Matching & Correspondence CS 468 Geometry Processing Algorithms Maks Ovsjanikov Wednesday, October 27 th 2010 Overall Goal Given two shapes, find correspondences between them. Overall Goal Given
More informationA Detailed Look into Forward and Inverse Kinematics
A Detailed Look into Forward and Inverse Kinematics Kinematics = Study of movement, motion independent of the underlying forces that cause them September 19-26, 2016 Kinematics Preliminaries Preliminaries:
More informationAdvanced Techniques for Mobile Robotics Graph-based SLAM using Least Squares. Wolfram Burgard, Cyrill Stachniss, Kai Arras, Maren Bennewitz
Advanced Techniques for Mobile Robotics Graph-based SLAM using Least Squares Wolfram Burgard, Cyrill Stachniss, Kai Arras, Maren Bennewitz SLAM Constraints connect the poses of the robot while it is moving
More informationImage processing and features
Image processing and features Gabriele Bleser gabriele.bleser@dfki.de Thanks to Harald Wuest, Folker Wientapper and Marc Pollefeys Introduction Previous lectures: geometry Pose estimation Epipolar geometry
More information3D Transformations. CS 4620 Lecture Kavita Bala w/ prior instructor Steve Marschner. Cornell CS4620 Fall 2015 Lecture 11
3D Transformations CS 4620 Lecture 11 1 Announcements A2 due tomorrow Demos on Monday Please sign up for a slot Post on piazza 2 Translation 3 Scaling 4 Rotation about z axis 5 Rotation about x axis 6
More informationScale-Invariant Registration of Monocular Endoscopic Images to CT-Scans for Sinus Surgery
Scale-Invariant Registration of Monocular Endoscopic Images to CT-Scans for Sinus Surgery Darius Burschka 1, Ming Li 2, Russell Taylor 2, and Gregory D. Hager 1 1 Computational Interaction and Robotics
More informationImage Analysis. Rasmus R. Paulsen DTU Compute. DTU Compute
Rasmus R. Paulsen rapa@dtu.dk http://www.compute.dtu.dk/courses/02502 Plenty of slides adapted from Thomas Moeslunds lectures Lecture 8 Geometric Transformation 2, Technical University of Denmark What
More information3D Environment Reconstruction
3D Environment Reconstruction Using Modified Color ICP Algorithm by Fusion of a Camera and a 3D Laser Range Finder The 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems October 11-15,
More informationHomework Assignment /645 Fall Instructions and Score Sheet (hand in with answers)
Homework Assignment 3 600.445/645 Fall 2018 Instructions and Score Sheet (hand in with answers) Name Email Other contact information (optional) Signature (required) I have followed the rules in completing
More informationIntegrated Math 1. Integrated Math, Part 1
Integrated Math 1 Course Description: This Integrated Math course will give students an understanding of the foundations of Algebra and Geometry. Students will build on an an understanding of variables,
More informationSensor-aided Milling with a Surgical Robot System
1 Sensor-aided Milling with a Surgical Robot System Dirk Engel, Joerg Raczkowsky, Heinz Woern Institute for Process Control and Robotics (IPR), Universität Karlsruhe (TH) Engler-Bunte-Ring 8, 76131 Karlsruhe
More informationA New Method for CT to Fluoroscope Registration Based on Unscented Kalman Filter
A New Method for CT to Fluoroscope Registration Based on Unscented Kalman Filter Ren Hui Gong, A. James Stewart, and Purang Abolmaesumi School of Computing, Queen s University, Kingston, ON K7L 3N6, Canada
More informationAgenda. Rotations. Camera calibration. Homography. Ransac
Agenda Rotations Camera calibration Homography Ransac Geometric Transformations y x Transformation Matrix # DoF Preserves Icon translation rigid (Euclidean) similarity affine projective h I t h R t h sr
More informationJacobians. 6.1 Linearized Kinematics. Y: = k2( e6)
Jacobians 6.1 Linearized Kinematics In previous chapters we have seen how kinematics relates the joint angles to the position and orientation of the robot's endeffector. This means that, for a serial robot,
More informationHumanoid Robotics. Least Squares. Maren Bennewitz
Humanoid Robotics Least Squares Maren Bennewitz Goal of This Lecture Introduction into least squares Use it yourself for odometry calibration, later in the lecture: camera and whole-body self-calibration
More informationHumanoid Robotics. Projective Geometry, Homogeneous Coordinates. (brief introduction) Maren Bennewitz
Humanoid Robotics Projective Geometry, Homogeneous Coordinates (brief introduction) Maren Bennewitz Motivation Cameras generate a projected image of the 3D world In Euclidian geometry, the math for describing
More informationLecture 4: Transforms. Computer Graphics CMU /15-662, Fall 2016
Lecture 4: Transforms Computer Graphics CMU 15-462/15-662, Fall 2016 Brief recap from last class How to draw a triangle - Why focus on triangles, and not quads, pentagons, etc? - What was specific to triangles
More informationAn Automated Image-based Method for Multi-Leaf Collimator Positioning Verification in Intensity Modulated Radiation Therapy
An Automated Image-based Method for Multi-Leaf Collimator Positioning Verification in Intensity Modulated Radiation Therapy Chenyang Xu 1, Siemens Corporate Research, Inc., Princeton, NJ, USA Xiaolei Huang,
More informationNon-rigid Image Registration
Overview Non-rigid Image Registration Introduction to image registration - he goal of image registration - Motivation for medical image registration - Classification of image registration - Nonrigid registration
More informationMedicale Image Analysis
Medicale Image Analysis Registration Validation Prof. Dr. Philippe Cattin MIAC, University of Basel Prof. Dr. Philippe Cattin: Registration Validation Contents 1 Validation 1.1 Validation of Registration
More informationA SYSTEM FOR COMPUTER-ASSISTED SURGERY WITH INTRAOPERATIVE CT IMAGING
A SYSTEM FOR COMPUTER-ASSISTED SURGERY WITH INTRAOPERATIVE CT IMAGING by ANTON OENTORO A thesis submitted to the School of Computing in conformity with the requirements for the degree of Master of Science
More informationStereo and Epipolar geometry
Previously Image Primitives (feature points, lines, contours) Today: Stereo and Epipolar geometry How to match primitives between two (multiple) views) Goals: 3D reconstruction, recognition Jana Kosecka
More informationMEAM 620: HW 1. Sachin Chitta Assigned: January 10, 2007 Due: January 22, January 10, 2007
MEAM 620: HW 1 Sachin Chitta (sachinc@grasp.upenn.edu) Assigned: January 10, 2007 Due: January 22, 2006 January 10, 2007 1: MATLAB Programming assignment Using MATLAB, write the following functions: 1.
More informationMatrix Inverse 2 ( 2) 1 = 2 1 2
Name: Matrix Inverse For Scalars, we have what is called a multiplicative identity. This means that if we have a scalar number, call it r, then r multiplied by the multiplicative identity equals r. Without
More informationLecture 13 Theory of Registration. ch. 10 of Insight into Images edited by Terry Yoo, et al. Spring (CMU RI) : BioE 2630 (Pitt)
Lecture 13 Theory of Registration ch. 10 of Insight into Images edited by Terry Yoo, et al. Spring 2018 16-725 (CMU RI) : BioE 2630 (Pitt) Dr. John Galeotti The content of these slides by John Galeotti,
More informationComputer and Machine Vision
Computer and Machine Vision Lecture Week 10 Part-2 Skeletal Models and Face Detection March 21, 2014 Sam Siewert Outline of Week 10 Lab #4 Overview Lab #5 and #6 Extended Lab Overview SIFT and SURF High
More informationIntroduction to Mobile Robotics Iterative Closest Point Algorithm. Wolfram Burgard, Cyrill Stachniss, Maren Bennewitz, Kai Arras
Introduction to Mobile Robotics Iterative Closest Point Algorithm Wolfram Burgard, Cyrill Stachniss, Maren Bennewitz, Kai Arras 1 Motivation 2 The Problem Given: two corresponding point sets: Wanted: translation
More informationVector Algebra Transformations. Lecture 4
Vector Algebra Transformations Lecture 4 Cornell CS4620 Fall 2008 Lecture 4 2008 Steve Marschner 1 Geometry A part of mathematics concerned with questions of size, shape, and relative positions of figures
More informationCOMPUTER AND ROBOT VISION
VOLUME COMPUTER AND ROBOT VISION Robert M. Haralick University of Washington Linda G. Shapiro University of Washington A^ ADDISON-WESLEY PUBLISHING COMPANY Reading, Massachusetts Menlo Park, California
More informationHomework 5: Transformations in geometry
Math b: Linear Algebra Spring 08 Homework 5: Transformations in geometry This homework is due on Wednesday, February 7, respectively on Thursday February 8, 08. a) Find the reflection matrix at the line
More informationLecture Note 3: Rotational Motion
ECE5463: Introduction to Robotics Lecture Note 3: Rotational Motion Prof. Wei Zhang Department of Electrical and Computer Engineering Ohio State University Columbus, Ohio, USA Spring 2018 Lecture 3 (ECE5463
More informationOccluded Facial Expression Tracking
Occluded Facial Expression Tracking Hugo Mercier 1, Julien Peyras 2, and Patrice Dalle 1 1 Institut de Recherche en Informatique de Toulouse 118, route de Narbonne, F-31062 Toulouse Cedex 9 2 Dipartimento
More informationVALIDATION OF DIR. Raj Varadhan, PhD, DABMP Minneapolis Radiation Oncology
VALIDATION OF DIR Raj Varadhan, PhD, DABMP Minneapolis Radiation Oncology Overview Basics: Registration Framework, Theory Discuss Validation techniques Using Synthetic CT data & Phantoms What metrics to
More informationUser-assisted Segmentation and 3D Motion Tracking. Michael Fleder Sudeep Pillai Jeremy Scott
User-assisted Segmentation and 3D Motion Tracking Michael Fleder Sudeep Pillai Jeremy Scott 3D Object Tracking Virtual reality and animation Imitation in robotics Autonomous driving Augmented reality Motivation
More informationMath background. 2D Geometric Transformations. Implicit representations. Explicit representations. Read: CS 4620 Lecture 6
Math background 2D Geometric Transformations CS 4620 Lecture 6 Read: Chapter 2: Miscellaneous Math Chapter 5: Linear Algebra Notation for sets, functions, mappings Linear transformations Matrices Matrix-vector
More informationTopological map merging
Topological map merging Kris Beevers Algorithmic Robotics Laboratory Department of Computer Science Rensselaer Polytechnic Institute beevek@cs.rpi.edu March 9, 2005 Multiple robots create topological maps
More informationRobot Mapping. Least Squares Approach to SLAM. Cyrill Stachniss
Robot Mapping Least Squares Approach to SLAM Cyrill Stachniss 1 Three Main SLAM Paradigms Kalman filter Particle filter Graphbased least squares approach to SLAM 2 Least Squares in General Approach for
More informationGraphbased. Kalman filter. Particle filter. Three Main SLAM Paradigms. Robot Mapping. Least Squares Approach to SLAM. Least Squares in General
Robot Mapping Three Main SLAM Paradigms Least Squares Approach to SLAM Kalman filter Particle filter Graphbased Cyrill Stachniss least squares approach to SLAM 1 2 Least Squares in General! Approach for
More informationIndex. 3D reconstruction, point algorithm, point algorithm, point algorithm, point algorithm, 263
Index 3D reconstruction, 125 5+1-point algorithm, 284 5-point algorithm, 270 7-point algorithm, 265 8-point algorithm, 263 affine point, 45 affine transformation, 57 affine transformation group, 57 affine
More informationRigid ICP registration with Kinect
Rigid ICP registration with Kinect Students: Yoni Choukroun, Elie Semmel Advisor: Yonathan Aflalo 1 Overview.p.3 Development of the project..p.3 Papers p.4 Project algorithm..p.6 Result of the whole body.p.7
More informationGeometric camera models and calibration
Geometric camera models and calibration http://graphics.cs.cmu.edu/courses/15-463 15-463, 15-663, 15-862 Computational Photography Fall 2018, Lecture 13 Course announcements Homework 3 is out. - Due October
More informationA Multiple-Layer Flexible Mesh Template Matching Method for Nonrigid Registration between a Pelvis Model and CT Images
A Multiple-Layer Flexible Mesh Template Matching Method for Nonrigid Registration between a Pelvis Model and CT Images Jianhua Yao 1, Russell Taylor 2 1. Diagnostic Radiology Department, Clinical Center,
More informationSOME CONCEPTS IN DISCRETE COSINE TRANSFORMS ~ Jennie G. Abraham Fall 2009, EE5355
SOME CONCEPTS IN DISCRETE COSINE TRANSFORMS ~ Jennie G. Abraham Fall 009, EE5355 Under Digital Image and Video Processing files by Dr. Min Wu Please see lecture10 - Unitary Transform lecture11 - Transform
More information2D Rigid Registration of MR Scans using the 1d Binary Projections
2D Rigid Registration of MR Scans using the 1d Binary Projections Panos D. Kotsas Abstract This paper presents the application of a signal intensity independent registration criterion for 2D rigid body
More informationEnabling Technologies for Robot Assisted Ultrasound Tomography
Enabling Technologies for Robot Assisted Ultrasound Tomography Seminar Presentation By: Fereshteh Aalamifar Team Members: Rishabh Khurana, Fereshteh Aalamifar Mentors: Emad Boctor, Iulian Iordachita, Russell
More informationCALIBRATION BETWEEN DEPTH AND COLOR SENSORS FOR COMMODITY DEPTH CAMERAS. Cha Zhang and Zhengyou Zhang
CALIBRATION BETWEEN DEPTH AND COLOR SENSORS FOR COMMODITY DEPTH CAMERAS Cha Zhang and Zhengyou Zhang Communication and Collaboration Systems Group, Microsoft Research {chazhang, zhang}@microsoft.com ABSTRACT
More informationRectification and Distortion Correction
Rectification and Distortion Correction Hagen Spies March 12, 2003 Computer Vision Laboratory Department of Electrical Engineering Linköping University, Sweden Contents Distortion Correction Rectification
More informationfmri pre-processing Juergen Dukart
fmri pre-processing Juergen Dukart Outline Why do we need pre-processing? fmri pre-processing Slice time correction Realignment Unwarping Coregistration Spatial normalisation Smoothing Overview fmri time-series
More informationAugmented Reality VU. Computer Vision 3D Registration (2) Prof. Vincent Lepetit
Augmented Reality VU Computer Vision 3D Registration (2) Prof. Vincent Lepetit Feature Point-Based 3D Tracking Feature Points for 3D Tracking Much less ambiguous than edges; Point-to-point reprojection
More informationCS 775: Advanced Computer Graphics. Lecture 3 : Kinematics
CS 775: Advanced Computer Graphics Lecture 3 : Kinematics Traditional Cell Animation, hand drawn, 2D Lead Animator for keyframes http://animation.about.com/od/flashanimationtutorials/ss/flash31detanim2.htm
More informationStructured Light II. Thanks to Ronen Gvili, Szymon Rusinkiewicz and Maks Ovsjanikov
Structured Light II Johannes Köhler Johannes.koehler@dfki.de Thanks to Ronen Gvili, Szymon Rusinkiewicz and Maks Ovsjanikov Introduction Previous lecture: Structured Light I Active Scanning Camera/emitter
More informationThis week. CENG 732 Computer Animation. Warping an Object. Warping an Object. 2D Grid Deformation. Warping an Object.
CENG 732 Computer Animation Spring 2006-2007 Week 4 Shape Deformation Animating Articulated Structures: Forward Kinematics/Inverse Kinematics This week Shape Deformation FFD: Free Form Deformation Hierarchical
More informationMiniature faking. In close-up photo, the depth of field is limited.
Miniature faking In close-up photo, the depth of field is limited. http://en.wikipedia.org/wiki/file:jodhpur_tilt_shift.jpg Miniature faking Miniature faking http://en.wikipedia.org/wiki/file:oregon_state_beavers_tilt-shift_miniature_greg_keene.jpg
More informationComputer Vision I. Announcements. Fourier Tansform. Efficient Implementation. Edge and Corner Detection. CSE252A Lecture 13.
Announcements Edge and Corner Detection HW3 assigned CSE252A Lecture 13 Efficient Implementation Both, the Box filter and the Gaussian filter are separable: First convolve each row of input image I with
More informationFundamentals of 3D. Lecture 3: Debriefing: Lecture 2 Rigid transformations Quaternions Iterative Closest Point (+Kd-trees)
INF555 Fundamentals of 3D Lecture 3: Debriefing: Lecture 2 Rigid transformations Quaternions Iterative Closest Point (+Kd-trees) Frank Nielsen nielsen@lix.polytechnique.fr Harris-Stephens' combined corner/edge
More informationMulti-stable Perception. Necker Cube
Multi-stable Perception Necker Cube Spinning dancer illusion, Nobuuki Kaahara Fitting and Alignment Computer Vision Szeliski 6.1 James Has Acknowledgment: Man slides from Derek Hoiem, Lana Lazebnik, and
More informationCS 565 Computer Vision. Nazar Khan PUCIT Lectures 15 and 16: Optic Flow
CS 565 Computer Vision Nazar Khan PUCIT Lectures 15 and 16: Optic Flow Introduction Basic Problem given: image sequence f(x, y, z), where (x, y) specifies the location and z denotes time wanted: displacement
More informationCV: 3D sensing and calibration
CV: 3D sensing and calibration Coordinate system changes; perspective transformation; Stereo and structured light MSU CSE 803 1 roadmap using multiple cameras using structured light projector 3D transformations
More informationDynamic 2D/3D Registration for the Kinect
Dynamic 2D/3D Registration for the Kinect Sofien Bouaziz Mark Pauly École Polytechnique Fédérale de Lausanne Abstract Image and geometry registration algorithms are an essential component of many computer
More informationDevelopment of an Automated Fingerprint Verification System
Development of an Automated Development of an Automated Fingerprint Verification System Fingerprint Verification System Martin Saveski 18 May 2010 Introduction Biometrics the use of distinctive anatomical
More informationComputational Medical Imaging Analysis Chapter 4: Image Visualization
Computational Medical Imaging Analysis Chapter 4: Image Visualization Jun Zhang Laboratory for Computational Medical Imaging & Data Analysis Department of Computer Science University of Kentucky Lexington,
More informationPhoto by Carl Warner
Photo b Carl Warner Photo b Carl Warner Photo b Carl Warner Fitting and Alignment Szeliski 6. Computer Vision CS 43, Brown James Has Acknowledgment: Man slides from Derek Hoiem and Grauman&Leibe 2008 AAAI
More informationWorkshop - Model Calibration and Uncertainty Analysis Using PEST
About PEST PEST (Parameter ESTimation) is a general-purpose, model-independent, parameter estimation and model predictive uncertainty analysis package developed by Dr. John Doherty. PEST is the most advanced
More informationSets the default folder to be the folder where this notebook is saved. That is a fancy way of saying
1 1 1 1 1 1 1 1 1 1 1 1 In this module, you will write algorithms that bring two meshes into alignment using translations, rotations, and local Laplacian-based deformations. Alignment is useful for establishing
More informationFully Automatic Endoscope Calibration for Intraoperative Use
Fully Automatic Endoscope Calibration for Intraoperative Use Christian Wengert, Mireille Reeff, Philippe C. Cattin, Gábor Székely Computer Vision Laboratory, ETH Zurich, 8092 Zurich, Switzerland {wengert,
More informationUNIVERSITY OF TORONTO Faculty of Applied Science and Engineering. ROB501H1 F: Computer Vision for Robotics. Midterm Examination.
UNIVERSITY OF TORONTO Faculty of Applied Science and Engineering ROB501H1 F: Computer Vision for Robotics October 26, 2016 Student Name: Student Number: Instructions: 1. Attempt all questions. 2. The value
More informationof Iterative Closest Point ICP algorithm to
Iterative Closest Point Algorithm. L Error Approach via Linear Programming Yaroslav O. Halchenko PhD Student, CS@NJIT yh42@njit.edu Abstract The original goal of this project was a straightforward implementation
More informationSome material taken from: Yuri Boykov, Western Ontario
CS664 Lecture #22: Distance transforms, Hausdorff matching, flexible models Some material taken from: Yuri Boykov, Western Ontario Announcements The SIFT demo toolkit is available from http://www.evolution.com/product/oem/d
More informationCS231A Midterm Review. Friday 5/6/2016
CS231A Midterm Review Friday 5/6/2016 Outline General Logistics Camera Models Non-perspective cameras Calibration Single View Metrology Epipolar Geometry Structure from Motion Active Stereo and Volumetric
More informationQuaternions and Rotations
CSCI 420 Computer Graphics Lecture 20 and Rotations Rotations Motion Capture [Angel Ch. 3.14] Rotations Very important in computer animation and robotics Joint angles, rigid body orientations, camera parameters
More informationShape-based Diffeomorphic Registration on Hippocampal Surfaces Using Beltrami Holomorphic Flow
Shape-based Diffeomorphic Registration on Hippocampal Surfaces Using Beltrami Holomorphic Flow Abstract. Finding meaningful 1-1 correspondences between hippocampal (HP) surfaces is an important but difficult
More information