KOSYR’2001 Reconstruction of Polyhedron Objects by Structure Graph Integration Krzysztof Skabek Institute of Theoretical and Applied Computer Sciences.

Slides:

Advertisements

Similar presentations

3D Model Matching with Viewpoint-Invariant Patches(VIP) Reporter ：鄒嘉恆 Date ： 10/06/2009.

Advertisements

Simultaneous surveillance camera calibration and foot-head homology estimation from human detection 1 Author : Micusic & Pajdla Presenter : Shiu, Jia-Hau.

2D Geometric Transformations

Extended Gaussian Images

Answer the following questions using yesterday’s Translation Task: 1.What is a transformation? 2.What are vertices? 3.When does it mean when geometric.

Automatic Feature Extraction for Multi-view 3D Face Recognition

Mapping: Scaling Rotation Translation Warp

Intelligent Systems Lab. Extrinsic Self Calibration of a Camera and a 3D Laser Range Finder from Natural Scenes Davide Scaramuzza, Ahad Harati, and Roland.

1 Computer Graphics Chapter 7 3D Object Modeling.

Surface Reconstruction from 3D Volume Data. Problem Definition Construct polyhedral surfaces from regularly-sampled 3D digital volumes.

Contents Description of the big picture Theoretical background on this work The Algorithm Examples.

Real-time Combined 2D+3D Active Appearance Models Jing Xiao, Simon Baker,Iain Matthew, and Takeo Kanade CVPR 2004 Presented by Pat Chan 23/11/2004.

CS485/685 Computer Vision Prof. George Bebis

3D Geometry for Computer Graphics

Camera parameters Extrinisic parameters define location and orientation of camera reference frame with respect to world frame Intrinsic parameters define.

Active Appearance Models based on the article: T.F.Cootes, G.J. Edwards and C.J.Taylor. "Active Appearance Models", presented by Denis Simakov.

CSE 6367 Computer Vision Stereo Reconstruction Camera Coordinate Transformations “Everything should be made as simple as possible, but not simpler.” Albert.

Automatic Camera Calibration

Transforming Knowledge to Structures from Other Engineering Fields by Means of Graph Representations. Dr. Offer Shai and Daniel Rubin Department of Mechanics,

CSE554AlignmentSlide 1 CSE 554 Lecture 8: Alignment Fall 2014.

WP3 - 3D reprojection Goal: reproject 2D ball positions from both cameras into 3D space Inputs: – 2D ball positions estimated by WP2 – 2D table positions.

By Yevgeny Yusepovsky & Diana Tsamalashvili the supervisor: Arie Nakhmani 08/07/2010 1Control and Robotics Labaratory.

1 Preview At least two views are required to access the depth of a scene point and in turn to reconstruct scene structure Multiple views can be obtained.

Timing Trials An investigation arising out of the Assignment CS32310 – Nov 2013 H Holstein 1.

Course 12 Calibration. 1.Introduction In theoretic discussions, we have assumed: Camera is located at the origin of coordinate system of scene.

MESA LAB Multi-view image stitching Guimei Zhang MESA LAB MESA (Mechatronics, Embedded Systems and Automation) LAB School of Engineering, University of.

Exploitation of 3D Video Technologies Takashi Matsuyama Graduate School of Informatics, Kyoto University 12 th International Conference on Informatics.

International Conference on Computer Vision and Graphics, ICCVG ‘2002 Algorithm for Fusion of 3D Scene by Subgraph Isomorphism with Procrustes Analysis.

10-9 Reflections (page ) Indicators  G7-Identify the line & rotation symmetries of 2-d figures to solve problems. G8-Perform reflections of 2-d.

Functions Functions. A function is a rule that relates two quantities so that each input value corresponds to exactly one output value. Define-

EXAMPLE 3 Find the inverse of a 3 × 3 matrix Use a graphing calculator to find the inverse of A. Then use the calculator to verify your result. 2 1 – 2.

Correspondence-Free Determination of the Affine Fundamental Matrix (Tue) Young Ki Baik, Computer Vision Lab.

Multiview Geometry and Stereopsis. Inputs: two images of a scene (taken from 2 viewpoints). Output: Depth map. Inputs: multiple images of a scene. Output:

Acquiring 3D models of objects via a robotic stereo head David Virasinghe Department of Computer Science University of Adelaide Supervisors: Mike Brooks.

Plenoptic Modeling: An Image-Based Rendering System Leonard McMillan & Gary Bishop SIGGRAPH 1995 presented by Dave Edwards 10/12/2000.

A genetic approach to the automatic clustering problem Author : Lin Yu Tseng Shiueng Bien Yang Graduate : Chien-Ming Hsiao.

Haptic Rendering Part 2 4/CY/B3 Part 1. Collision detection and response Nic Melder Part 2. Manipulation and polygon transitions Nic Melder.

Wenqi Zhu 3D Reconstruction From Multiple Views Based on Scale-Invariant Feature Transform.

CSE554AlignmentSlide 1 CSE 554 Lecture 8: Alignment Fall 2013.

Solid Modeling. Solid Modeling - Polyhedron A polyhedron is a connected mesh of simple planar polygons that encloses a finite amount of space. A polyhedron.

Geometric Hashing: A General and Efficient Model-Based Recognition Scheme Yehezkel Lamdan and Haim J. Wolfson ICCV 1988 Presented by Budi Purnomo Nov 23rd.

Chapter 2: Description of position and orientation Faculty of Engineering - Mechanical Engineering Department ROBOTICS Outline: Introduction. Descriptions:

12/24/2015 A.Aruna/Assistant professor/IT/SNSCE 1.

October 16, 2014Computer Vision Lecture 12: Image Segmentation II 1 Hough Transform The Hough transform is a very general technique for feature detection.

Holt Geometry 12-1 Reflections 12-1 Reflections Holt Geometry Warm Up Warm Up Lesson Presentation Lesson Presentation Lesson Quiz Lesson Quiz.

Translations. Graph the following coordinates, then connect the dots (-8,0) (-5,0) (-5,1) (-3,-1) (-5,-3) (-5,-2)(-8,-2)

Distinctive Image Features from Scale-Invariant Keypoints

CS552: Computer Graphics Lecture 11: Orthographic Projection.

Determining 3D Structure and Motion of Man-made Objects from Corners.

II-1 Transformations Transformations are needed to: –Position objects defined relative to the origin –Build scenes based on hierarchies –Project objects.

Uncalibrated reconstruction Calibration with a rig Uncalibrated epipolar geometry Ambiguities in image formation Stratified reconstruction Autocalibration.

End effector End effector - the last coordinate system of figure Located in joint N. But usually, we want to specify it in base coordinates. 1.

Deformation Modeling for Robust 3D Face Matching Xioguang Lu and Anil K. Jain Dept. of Computer Science & Engineering Michigan State University.

CSE 554 Lecture 8: Alignment

12-3 Rotations Warm Up Lesson Presentation Lesson Quiz Holt Geometry.

Processing visual information for Computer Vision

Lecture 10 Geometric Transformations In 3D(Three- Dimensional)

M. Frydler : Institute of Mathematical Machines

CHAPTER 2 FORWARD KINEMATIC 1.

Transformations.

A graphing calculator is required for some problems or parts of problems 2000.

Video Compass Jana Kosecka and Wei Zhang George Mason University

Efficient Subgraph Similarity All-Matching

9.3: Rotations.

Objective Identify and draw rotations..

Objective Identify and draw reflections..

Introduction to Artificial Intelligence Lecture 22: Computer Vision II

Translation in Homogeneous Coordinates

Presentation transcript:

KOSYR’2001 Reconstruction of Polyhedron Objects by Structure Graph Integration Krzysztof Skabek Institute of Theoretical and Applied Computer Sciences Polish Academy of Sciences, ul. Bałtycka 5, Gliwice,

Contents 1. Stages of 3D Scene Reconstruction 2. Graph Representation of 3D Scene 3. Structure Graph Integration 4. The Example of Scene Reconstruction 5. Conclusions

Stages of 3D Scene Reconstruction The scope of the presented method

Graph Representation of 3D Scene Contour Graph: Face Graph: - set of vertices in the scene - set of connections among vertices - 3D coordinates (x,y,z) of vertices - set of faces in the scene - set of connections among faces - parameters of faces - parameters of face connections

Construction of Structure Graphs Contour Graph Face Graph

Integration of Structure Graphs I GK i GK i – the contour graph obtained for ith view point GS i GK i GS i – the face graph for ith view created GK i GKM i GKM i – the integrated contour graph after i steps GSM GSM – the integrated face graph after i steps WK i GK i GKM i-1 WK i – set of corresponding vertices in GK i and GKM i-1 WS i GS i GSM i-1 WS i – set of corresponding vertices in GS i and GSM i-1

Integration of Structure Graphs II GK i GS i 1. Building GK i and GS i for ith view point GS i GSM i-1 WS i 2. Subgraph matching of GS i and GSM i-1 ; storing the matched vertices in WS i. GK i WS i 3. Finding correspondences between GK i and WS i. T i R i GK i GKM i-1 4. Calculation of the translation vector T i and the rotation matrix R i transformating coordinate system of GK i into the coordinates of GKM i-1 GK i T i R i 5. Calculation of new coordinates for vertices from GK i (using T i and R i ) GKM i-1 & GK i  GKM i GSM i-1 & GS i  GSM i 6. Consolidation of contour graphs: GKM i-1 & GK i  GKM i, GSM i-1 & GS i  GSM i 7. Checking the completeness of reconstruction

Completeness of the Representation  The total rotation angle in all iterations exceeds 360º  Passing a given number of iterations without encountering new scene objects

The Example of Scene Reconstruction Input Graph Integrated Contour Graph

Stages of Scene Reconstruction I I. II.III.

Stages of Scene Reconstruction II IV. V.VI.

Conclusions  Graph matching makes possible to reconstruct unknown polyhedra even if viewpoints are not exactly located in the scene;  Heuristics significantly increase the average time of graph matching algorithms;  The estimation of a viewpoint position is useful to verify the obtained scene models

The End