An SVM Learning Approach to Robotic Grasping Raphael Pelossof December 03 2002 Advanced Machine Learning.

Slides:



Advertisements
Similar presentations
COMP Robotics: An Introduction
Advertisements

1 Regression as Moment Structure. 2 Regression Equation Y =  X + v Observable Variables Y z = X Moment matrix  YY  YX  =  YX  XX Moment structure.
Configuration Space. Recap Represent environments as graphs –Paths are connected vertices –Make assumption that robot is a point Need to be able to use.
Computer vision: models, learning and inference Chapter 8 Regression.
Extended Gaussian Images
Kinematics & Grasping Need to know: Representing mechanism geometry Standard configurations Degrees of freedom Grippers and graspability conditions Goal.
Optimal Design Laboratory | University of Michigan, Ann Arbor 2011 Design Preference Elicitation Using Efficient Global Optimization Yi Ren Panos Y. Papalambros.
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
Classification and Prediction: Regression Via Gradient Descent Optimization Bamshad Mobasher DePaul University.
CSCE 641: Forward kinematics and inverse kinematics Jinxiang Chai.
Content Based Image Clustering and Image Retrieval Using Multiple Instance Learning Using Multiple Instance Learning Xin Chen Advisor: Chengcui Zhang Department.
Computing Movement Geometry A step in Sensory-Motor Transformations Elizabeth Torres & David Zipser.
Picking Up the Pieces: Grasp Planning via Decomposition Trees Corey Goldfeder, Peter K. Allen, Claire Lackner, Raphael Pelosoff.
1 Numerical geometry of non-rigid shapes Lecture II – Numerical Tools Numerical geometry of shapes Lecture II – Numerical Tools non-rigid Alex Bronstein.
3D Hand Pose Estimation by Finding Appearance-Based Matches in a Large Database of Training Views
Numerical geometry of non-rigid shapes
Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wiley.
Sparse Kernels Methods Steve Gunn.
1 Computational Learning Theory and Kernel Methods Tianyi Jiang March 8, 2004.
Theoretical Mechanics DYNAMICS
Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wiley.
1 Numerical geometry of non-rigid shapes Non-Euclidean Embedding Non-Euclidean Embedding Lecture 6 © Alexander & Michael Bronstein tosca.cs.technion.ac.il/book.
Motion from normal flow. Optical flow difficulties The aperture problemDepth discontinuities.
Lightseminar: Learned Representation in AI An Introduction to Locally Linear Embedding Lawrence K. Saul Sam T. Roweis presented by Chan-Su Lee.
1 M. Bronstein Multigrid multidimensional scaling Multigrid Multidimensional Scaling Michael M. Bronstein Department of Computer Science Technion – Israel.
Prediction of Non-Linear Aging Trajectories of Faces
Object Detection with Superquadrics Presenter: Ilya Afanasyev Facoltà di Ingegneria Trento, /12/2010 1/20.
Geometry Optimisation Modelling OH + C 2 H 4 *CH 2 -CH 2 -OH CH 3 -CH 2 -O* 3D PES.
Active Shape Models: Their Training and Applications Cootes, Taylor, et al. Robert Tamburo July 6, 2000 Prelim Presentation.
Computational Stochastic Optimization: Bridging communities October 25, 2012 Warren Powell CASTLE Laboratory Princeton University
1/20 Obtaining Shape from Scanning Electron Microscope Using Hopfield Neural Network Yuji Iwahori 1, Haruki Kawanaka 1, Shinji Fukui 2 and Kenji Funahashi.
COMMON EVALUATION FINAL PROJECT Vira Oleksyuk ECE 8110: Introduction to machine Learning and Pattern Recognition.
Learning a Kernel Matrix for Nonlinear Dimensionality Reduction By K. Weinberger, F. Sha, and L. Saul Presented by Michael Barnathan.
Transductive Regression Piloted by Inter-Manifold Relations.
Virtual Vector Machine for Bayesian Online Classification Yuan (Alan) Qi CS & Statistics Purdue June, 2009 Joint work with T.P. Minka and R. Xiang.
Vision-based human motion analysis: An overview Computer Vision and Image Understanding(2007)
Non-Euclidean Example: The Unit Sphere. Differential Geometry Formal mathematical theory Work with small ‘patches’ –the ‘patches’ look Euclidean Do calculus.
1 Research Question  Can a vision-based mobile robot  with limited computation and memory,  and rapidly varying camera positions,  operate autonomously.
Interactive Learning of the Acoustic Properties of Objects by a Robot
Sparse Bayesian Learning for Efficient Visual Tracking O. Williams, A. Blake & R. Cipolloa PAMI, Aug Presented by Yuting Qi Machine Learning Reading.
Geometry of Shape Manifolds
COMP322/S2000/L281 Task Planning Three types of planning: l Gross Motion Planning concerns objects being moved from point A to point B without problems,
Linear Models for Classification
Laboratory of mechatronics and robotics Institute of solid mechanics, mechatronics and biomechanics, BUT & Institute of Thermomechanics, CAS Mechatronics,
11/6/ :55 Graphics II Introduction to Parametric Curves and Surfaces Session 2.
Final Exam Review CS479/679 Pattern Recognition Dr. George Bebis 1.
Distinctive Image Features from Scale-Invariant Keypoints
Statistical Models of Appearance for Computer Vision 主講人:虞台文.
Level Set Segmentation ~ 9.37 Ki-Chang Kwak.
Tree and Forest Classification and Regression Tree Bagging of trees Boosting trees Random Forest.
MASKS © 2004 Invitation to 3D vision Lecture 6 Introduction to Algebra & Rigid-Body Motion Allen Y. Yang September 18 th, 2006.
11/25/03 3D Model Acquisition by Tracking 2D Wireframes Presenter: Jing Han Shiau M. Brown, T. Drummond and R. Cipolla Department of Engineering University.
Projective 2D geometry course 2 Multiple View Geometry Comp Marc Pollefeys.
Linear machines márc Decison surfaces We focus now on the decision surfaces Linear machines = linear decision surface Non-optimal solution but.
Non-separable SVM's, and non-linear classification using kernels Jakob Verbeek December 16, 2011 Course website:
CSCE 441: Computer Graphics Forward/Inverse kinematics
Neural Networks for Quantum Simulation
Line Fitting James Hayes.
Computer vision: models, learning and inference
Geometrical intuition behind the dual problem
Machine Learning Basics
Clustering (3) Center-based algorithms Fuzzy k-means
CHAPTER 2 FORWARD KINEMATIC 1.
Pattern Recognition CS479/679 Pattern Recognition Dr. George Bebis
Linear machines 28/02/2017.
CSCE 441: Computer Graphics Forward/Inverse kinematics
One-shot learning and generation of dexterous grasps for novel objects
Object Detection with Superquadrics
Support Vector Machines
One-shot learning and generation of dexterous grasps
Presentation transcript:

An SVM Learning Approach to Robotic Grasping Raphael Pelossof December Advanced Machine Learning

Introduction Motivation: Provide an easy method for optimizing a robotic grasp for arbitrary hands. Difficulty: Grasping involves many degrees of freedom, and the grasp quality surface is undefined Solution: 1.Sample grasp quality surface for different shapes and hand configurations 2.Fit SVM regression to quality surface 3.Travel along kernel gradient to find optimal grasp given a new shape.

The Barret Hand Barret hand has four DOF –Spread angle (1) –Finger rotation (3) Orientation in space has six DOF –Translation in space (3) –Rotation in space (3)

Superquadrics Superquadrics are a smooth family of shapes with smooth transitions between them. Superellipse: Constant number of parameters Global deformations can be applied to them Surface normals

GraspIt! Grasp analysis simulator –Approximats grasp quality measure using a 6D wrench space –Different materials –Normalized quality measure Grasp planning using superquadrics Simulation Time

SVM Semi - Monte Carlo sampling Angle representation Dataset Size: 9sq x 16vec x 100ang = SVM regression with RBF Kernel with different values for the variance, C, and epsilon.

Convergence Results Training DatasetTesting Dataset Test Error: 0.03 Training and testing over top 150 grasps per superquadric

Give me a shape I’ll find the best grasp ! 1.Modify all first two dimensions of all support vectors to the requested parameters. 2.Evaluate SVM at all support vectors 3.Start from the support vector with the highest value 4.Iterate until no improvement in quality

Future Work I Using Priors: P(spread) ~ N(mu=1, sigma = 0.067) Change the distance metric from Euclidean distance to Geodesic over a sphere. –Distances between angles live on a sphere –Kernel no longer satisfies mercer’s condition

Future Work II Machine Vision to further constraint the search space Use Convex Invariance Learning (CoIL) for multiple superquadrics