Object Pose from a Single Image

Similar documents
SINGLE VIEW GEOMETRY AND SOME APPLICATIONS

ABSOLUTE DEFORMATION PROFILE MEASUREMENT IN TUNNELS USING RELATIVE CONVERGENCE MEASUREMENTS

A sufficient condition for spiral cone beam long object imaging via backprojection

CMSC 828D: Fundamentals of Computer Vision Homework 7

OPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Homework Set 7 Fall, 2018

Optimal Sampling in Compressed Sensing

On Plane Constrained Bounded-Degree Spanners

Evaluating Influence Diagrams

7. Texture Mapping. Idea. Examples Image Textures. Motivation. Textures can be images or procedures. Textures can be 2D or 3D

Maximal Cliques in Unit Disk Graphs: Polynomial Approximation

Stereo (Part 2) Introduction to Computer Vision CSE 152 Lecture 9

3D SURFACE RECONSTRUCTION BASED ON COMBINED ANALYSIS OF REFLECTANCE AND POLARISATION PROPERTIES: A LOCAL APPROACH

5.0 Curve and Surface Theory

[1] Hopcroft, J., D. Joseph and S. Whitesides, Movement problems for twodimensional

Planarity-Preserving Clustering and Embedding for Large Planar Graphs

Chapter 4: Network Layer

A Hybrid Weight-Based Clustering Algorithm for Wireless Sensor Networks

Pipelining. Chapter 4

ARRAY ANTENNA DIAGNOSTICS WITH THE 3D RECONSTRUCTION ALGORITHM

Chapter 5. Plane Graphs and the DCEL

Hardware-Accelerated Free-Form Deformation

Announcements. Motion. Motion. Continuous Motion. Background Subtraction

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY On the Analysis of the Bluetooth Time Division Duplex Mechanism

Tu P7 15 First-arrival Traveltime Tomography with Modified Total Variation Regularization

Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods

Uncertainty Determination for Dimensional Measurements with Computed Tomography

CS 4204 Computer Graphics

Compound Catadioptric Stereo Sensor for Omnidirectional Object Detection

Assignments. Computer Networks LECTURE 7 Network Layer: Routing and Addressing. Network Layer Function. Internet Architecture

DYNAMIC ROAD STRUCTURE ESTIMATION

Bias of Higher Order Predictive Interpolation for Sub-pixel Registration

On Plane Constrained Bounded-Degree Spanners

OPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Homework Set 9 Fall, 2018

Summer 2017 MATH Suggested Solution to Exercise Find the tangent hyperplane passing the given point P on each of the graphs: (a)

AUTOMATIC REGISTRATION FOR REPEAT-TRACK INSAR DATA PROCESSING

The single-cycle design from last time

Picking and Curves Week 6

The extra single-cycle adders

CS 557 Lecture IX. Drexel University Dept. of Computer Science

Stereopsis Raul Queiroz Feitosa

The effectiveness of PIES comparing to FEM and BEM for 3D elasticity problems

New-Sum: A Novel Online ABFT Scheme For General Iterative Methods

A Layered Approach to Stereo Reconstruction

FINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES

Hidden Line and Surface

3-D D Euclidean Space - Vectors

Computer-Aided Mechanical Design Using Configuration Spaces

Improving Network Connectivity Using Trusted Nodes and Edges

Real-time mean-shift based tracker for thermal vision systems

Network layer. Two Key Network-Layer Functions. Datagram Forwarding table. IP datagram format. IP Addressing: introduction

EFFECTS OF OPTICALLY SHALLOW BOTTOMS ON WATER-LEAVING RADIANCES. Curtis D. Mobley and Lydia Sundman Sequoia Scientific, Inc. th

Fast Obstacle Detection using Flow/Depth Constraint

Chapter 7 TOPOLOGY CONTROL

EEC 483 Computer Organization

SZ-1.4: Significantly Improving Lossy Compression for Scientific Data Sets Based on Multidimensional Prediction and Error- Controlled Quantization

Second Order Variational Optic Flow Estimation

PERFORMANCE EVALUATION AND HILS TEST OF CONTROL ALLOCATION METHODS FOR RECONFIGURATION CONTROL

The final datapath. M u x. Add. 4 Add. Shift left 2. PCSrc. RegWrite. MemToR. MemWrite. Read data 1 I [25-21] Instruction. Read. register 1 Read.

11 - Bump Mapping. Bump-Mapped Objects. Bump-Mapped Objects. Bump-Mapped Objects. Limitations Of Texture Mapping. Bumps: Perturbed Normals

Mobility Control and Its Applications in Mobile Ad Hoc Networks

Ma Lesson 18 Section 1.7

Last lecture: finishing up Chapter 22

Appearance Based Tracking with Background Subtraction

Chapter 6: Pipelining

REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS. M. Meulpolder, D.H.J. Epema, H.J. Sips

An Introduction to GPU Computing. Aaron Coutino MFCF

Blended Deformable Models

Image Restoration Image Degradation and Restoration

Faster Random Walks By Rewiring Online Social Networks On-The-Fly

The multicycle datapath. Lecture 10 (Wed 10/15/2008) Finite-state machine for the control unit. Implementing the FSM

Faster Random Walks By Rewiring Online Social Networks On-The-Fly

Adaptive Influence Maximization in Microblog under the Competitive Independent Cascade Model

Real-Time Robot Path Planning via a Distance-Propagating Dynamic System with Obstacle Clearance

Fault Tolerance in Hypercubes

arxiv: v1 [cs.cg] 26 Sep 2018

EFFICIENT SOLUTION OF SYSTEMS OF ORIENTATION CONSTRAINTS

Curves and Surfaces. CS 537 Interactive Computer Graphics Prof. David E. Breen Department of Computer Science

Appeared in Proceedings of ISSAC'95 USA. bounds. of a matrix polynomial (or a ratio of matrix polynomials).

MultiView: Improving Trust in Group Video Conferencing Through Spatial Faithfulness David T. Nguyen, John F. Canny

Review: Computer Organization

C Puzzles! Taken from old exams. Integers Sep 3, Encoding Integers Unsigned. Encoding Example (Cont.) The course that gives CMU its Zip!

OPTI-202R Homework John E. Greivenkamp Spring ) An air-spaced triplet objective is comprised of three thin lenses in air:

POWER-OF-2 BOUNDARIES

Fixed-Parameter Algorithms for Cluster Vertex Deletion

Towards applications based on measuring the orbital angular momentum of light

Perspective Projection

OPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Final Exam In Class Page 1/15 Fall, 2012

Vessel Tracking for Retina Images Based on Fuzzy Ant Colony Algorithm

arxiv: v1 [cs.cg] 31 Aug 2017

Vertex Guarding in Weak Visibility Polygons

Unit 8 Chapter 3 Properties of Angles and Triangles

Functions of Combinational Logic

Digital Image Processing Chapter 5: Image Restoration

Statistical Methods in functional MRI. Standard Analysis. Data Processing Pipeline. Multiple Comparisons Problem. Multiple Comparisons Problem

Multi-lingual Multi-media Information Retrieval System

Building Facade Detection, Segmentation, and Parameter Estimation for Mobile Robot Localization and Guidance

Primary and Derived Variables with the Same Accuracy in Interval Finite Elements

Constructing and Comparing User Mobility Profiles for Location-based Services

Chapter 6 Enhancing Performance with. Pipelining. Pipelining. Pipelined vs. Single-Cycle Instruction Execution: the Plan. Pipelining: Keep in Mind

Sensor-Based Fast Thermal Evaluation Model For Energy Efficient High-Performance Datacenters

Transcription:

Object Pose from a Single Image

How Do We See Objects in Depth? Stereo Use differences between images in or left and right eye How mch is this difference for a car at 00 m? Moe or head sideways Or, the scene is moing Or we are moing in a car We know the sie and shape of objects raffic lights, car headlights and taillights

Headlights in the Dark A robot cold ealate its distance from incoming cars at night partly from a model of cars Distance between headlights known D m d Z Z = f d D Image plane f Center of projection 3

Object Pose with D Image Plane What happens if we don t know object s angle? 4

More Points Limited nmber of object poses ( or ) Head lights and one taillight ransparent car 5

Correspondence Problem When we know correspondences (i.e. matchings), pose is easier to find When we know the pose, correspondences are easier to find. Bt we need to find both at the same time Below, we first assme we know correspondences and describe how to sole the pose gien n corresponding points in image and object Perspectie n-point Problem hen we explore what to do when we don t know correspondences 6

7 Pose s. Calibration Problem Now we know calibration matrix K We can transform image points by K - transformation Projection matrix is now Soling pose problem consists of finding R and 6 nknowns = 0 0 0 K 0 0 y x s y x α α = ' ' ' w w - K [ ] = S S S Z Y X w 3 3 3-0 R 0 I K K [ ] = S S S Z Y X w R ] P = [R Canonical perspectie projection with f =

Iteratie Pose Calclation First we derie a linear system for the nknown parameters of rotation and translation that contains the known world coordinates of points and the homogenos coordinates of their images. Problem: Does not contain the wi components he wi components are reqired for compting homogeneos coordinates of images from the pixel locations hey can be compted once the rotation and translation parameters are estimated Soltion: Make a gess on wi, compte R and, then recompte wi, and recompte R and, etc 8

9 Iteratie Pose Calclation = S S S y x Z Y X w 3 r r r X r r r 3 = y x w i i i i Z Y X w ),,.( + r 3 = X r r = y x [ ] = y x r r X = y x Z Y X Z Y X Z Y X Z Y X 4 4 4 3 3 3 4 4 3 3 r r = 4 4 3 3 y x - M r r Non coplanar points needed (otherwise matrix M is singlar). At least 4 points.

0 Iteratie Pose Calclation Compte model matrix M and its inerse Assme Compte i = w i x i, i = w i y i Compte Compte, x, y, r, r, then r 3 = r x r Compte Go back to step and iterate ntil conergence i i i i Z Y X w ),,.( + r 3 = = 4 4 3 3 y x - M r r ),, ( = = i i i i w Z Y X. r 3

Iteratie Pose Calclation. Find object pose nder scaled orthographic projection. Project object points on lines of sight 3. Find scaled orthographic projection images of those points 4. Loop sing those images in step r 3

POSI for a Cbe Left: Actal perspectie image for cbe with known model op: Eoltion of perspectie image dring iteration Bottom: Eoltion of scaled orthographic projection

Application: 3D Mose 3

3 Points Each correspondence between scene point and image point determines eqations Since there are 6 degrees of freedom in the pose problems, the correspondences between 3 scene points in a known configration and 3 image points shold proide enogh eqations for compting the pose of the 3 scene points the pose of a triangle of known dimension is defined from a single image of the triangle Bt nonlinear method, to 4 soltions 4

riangle Pose Problem here are two basic approaches Analytically soling for nknown pose parameters Soling a 4th degree eqation in one pose parameter, and then sing the 4 soltions to the eqation to sole for remaining pose parameters problem: errors in estimating location of image featres can lead to either large pose errors or failre to sole the 4th degree eqation Approximate nmerical algorithms find soltions when exact methods fail de to image measrement error more comptation 5

Nmerical Method for riangle Pose A α B C' A' B' γ δ C Center of Projection β If distance R c to C is known, then possible locations of A (and B) can be compted they lie on the intersections of the line of sight throgh A' and the sphere of radis AC centered at C Once A and B are located, their distance can be compted and compared against the actal distance 6 AB

Nmerical Method for riangle Pose H A A' α C' γ δ B' C β B Not practical to search on R c since it is nbonded Instead, search on one anglar pose parameter, α. R c = AC cos α sin δ R a = R c cos δ ± AC sin α R b = R c cos γ ± [(BC -(RC sin γ) ] his reslts in for possible lengths for side AB Keep poses with the right AB length 7

Choosing Points on Objects Gien a 3-D object, how do we decide which points from its srface to choose for its model? Choose points that will gie rise to detectable featres in images For polyhedra, the images of its ertices will be points in the images where two or more long lines meet hese can be detected by edge detection methods Points on the interiors of regions, or along straight lines are not 8easily identified in images.

Example images 9

Choosing the Points Example: why not choose the midpoints of the edges of a polyhedra as featres midpoints of projections of line segments are not the projections of the midpoints of line segments if the entire line segment in the image is not identified, then we introdce error in locating midpoint 0

Strategy: Objects and Unknown Correspondences Pick p a small grop of points (3 or 4) on object, and candidate image points in image Find object pose for these correspondences Check or accmlate eidence by one of following techniqes: Clstering in pose space Image-Model Alignment and RANSAC

4-3--? 4 - point perspectie soltion Uniqe soltion for 6 pose parameters Comptational complexity of n 4 m 4 3 - point perspectie soltion Generally two soltions per triangle pair, bt sometimes for. Redced complexity of n 3 m 3

Redcing the Combinatorics of Pose Estimation How can we redce the nmber of matches Consider only qadrples of object featres that are simltaneosly isible extensie preprocessing 3

Redcing the Combinatorics of Pose Estimation Redcing the nmber of matches Consider only qadrples of image featres that Are connected by edges Are close to one another Bt not too close or the ineitable errors in estimating the position of an image ertex will lead to large errors in pose estimation Generally, try to grop the image featres into sets that are probably from a single object, and then only constrct qadrples from within a single grop 4

Image-Model Alignment Gien: A 3-D object modeled as a collection of points Image of a scene sspected to inclde an instance of the object, segmented into featre points Goal Hypothesie the pose of the object in the scene by matching (collections of) n model points against n featre points, enabling s to sole for the rigid body transformation from the object to world coordinate systems, and Verify that hypothesis by projecting the remainder of the model into the image and matching Look for edges connecting predicted ertex locations Srface markings 5

RANSAC RANdom SAmple Consenss Randomly select a set of 3 points in the image and a select a set of 3 points in the model Compte triangle pose and pose of model Project model at compted pose onto image Determine the set of projected model points that are within a distance threshold t of image points, called the consenss set After N trials, select pose with largest consenss set 6

Clstering in Pose Space Each matching of n model points against n featre points proides R and Each correct matching proides a similar rotation and translation Represent each pose by a point in a 6D space. hen points from correct matchings shold clster Or find clsters for points and find the clster where the rotations are most consistent Generalied Hogh transform if bins are sed 7

Scope of the Problem Flat objects s. 3D objects Grabbing flat tools on a tray s. grabbing handle of cp Ronded objects s. polyhedral objects Cp s. keyboard or CD cassette Rigid objects s. deformable objects 8

Pose and Recognition Soling the Pose Problem can be sed to sole the Recognition Problem for 3D objects: ry to find the pose of each item in the database of objects we want to identify Select the items whose projected points match the largest amonts of image points in the erification stage, and label the corresponding image regions with the item names. Bt many alternatie recognition techniqes do not proide the pose of the recognied item. 9

References VAS literatre on the sbject (larger than for calibration) Search for pose & object & model & USC Search in citeseer.nj.nec.com 30