Silhouette Intersection

Slides:



Advertisements
Similar presentations
Review from this Lesson
Advertisements

Vanishing points  .
Multiview Reconstruction. Why More Than 2 Views? BaselineBaseline – Too short – low accuracy – Too long – matching becomes hard.
Improved Seam Carving for Video Retargeting Authors: Michael Rubinstein, Ariel Shamir and Shai Avidan Source: ACM Transactions on Graphics (TOG), Volume.
Stereo Many slides adapted from Steve Seitz. Binocular stereo Given a calibrated binocular stereo pair, fuse it to produce a depth image Where does the.
Computer vision: models, learning and inference
Plain Mirror Style SNC2D
The 5 C’s of Cinematography
Image Indexing and Retrieval using Moment Invariants Imran Ahmad School of Computer Science University of Windsor – Canada.
The 5 C’s of Cinematography Camera Angles, Composition, Cutting, Close-ups and Continuity.
December 5, 2013Computer Vision Lecture 20: Hidden Markov Models/Depth 1 Stereo Vision Due to the limited resolution of images, increasing the baseline.
Multiview Reconstruction. Why More Than 2 Views? BaselineBaseline – Too short – low accuracy – Too long – matching becomes hard.
Shape from Contours and Multiple Stereo A Hierarchical, Mesh-Based Approach Hendrik Kück, Wolfgang Heidrich, Christian Vogelgsang.
Computational Photography: Image-based Modeling Jinxiang Chai.
1 MURI review meeting 09/21/2004 Dynamic Scene Modeling Video and Image Processing Lab University of California, Berkeley Christian Frueh Avideh Zakhor.
CSCE 641 Computer Graphics: Image-based Modeling Jinxiang Chai.
Prénom Nom Document Analysis: Segmentation & Layout Analysis Prof. Rolf Ingold, University of Fribourg Master course, spring semester 2008.
Multiview stereo. Volumetric stereo Scene Volume V Input Images (Calibrated) Goal: Determine occupancy, “color” of points in V.
Stereo and Structure from Motion
Project 1 grades out Announcements. Multiview stereo Readings S. M. Seitz and C. R. Dyer, Photorealistic Scene Reconstruction by Voxel Coloring, International.
3-D Computer Vision Using Structured Light Prepared by Burak Borhan.
Announcements PS3 Due Thursday PS4 Available today, due 4/17. Quiz 2 4/24.
E.G.M. PetrakisBinary Image Processing1 Binary Image Analysis Segmentation produces homogenous regions –each region has uniform gray-level –each region.
3-D Scene u u’u’ Study the mathematical relations between corresponding image points. “Corresponding” means originated from the same 3D point. Objective.
Image-Based Visual Hulls Wojciech Matusik Chris Buehler Ramesh Raskar Steven Gortler Leonard McMillan Presentation by: Kenton McHenry.
Computer Vision Spring ,-685 Instructor: S. Narasimhan WH 5409 T-R 10:30am – 11:50am Lecture #15.
Day and Night by M.C. Escher
Structure from images. Calibration Review: Pinhole Camera.
Mining Discriminative Components With Low-Rank and Sparsity Constraints for Face Recognition Qiang Zhang, Baoxin Li Computer Science and Engineering Arizona.
CS 6825: Binary Image Processing – binary blob metrics
High-Resolution Interactive Panoramas with MPEG-4 발표자 : 김영백 임베디드시스템연구실.
Properties of Dilations, Day 2. How do you describe the properties of dilations? Dilations change the size of figures, but not their orientation or.
Translations Translations and Getting Ready for Reflections by Graphing Horizontal and Vertical Lines.
Stereo Many slides adapted from Steve Seitz.
COMP322/S2000/L261 Geometric and Physical Models of Objects Geometric Models l defined as the spatial information (i.e. dimension, volume, shape) of objects.
Graphic Communication
Parallel Perpendicular lines
Attributes A quality that is characteristic of someone or something.
875 Dynamic Scene Reconstruction
Visual Tracking by Cluster Analysis Arthur Pece Department of Computer Science University of Copenhagen
Silhouette Segmentation in Multiple Views Wonwoo Lee, Woontack Woo, and Edmond Boyer PAMI, VOL. 33, NO. 7, JULY 2011 Donguk Seo
Correspondence and Stereopsis Original notes by W. Correa. Figures from [Forsyth & Ponce] and [Trucco & Verri]
Course 3 Binary Image Binary Images have only two gray levels: “1” and “0”, i.e., black / white. —— save memory —— fast processing —— many features of.
Correspondence and Stereopsis. Introduction Disparity – Informally: difference between two pictures – Allows us to gain a strong sense of depth Stereopsis.
CSE 185 Introduction to Computer Vision Stereo 2.
Over the recent years, computer vision has started to play a significant role in the Human Computer Interaction (HCI). With efficient object tracking.
Acquiring, Stitching and Blending Diffuse Appearance Attributes on 3D Models C. Rocchini, P. Cignoni, C. Montani, R. Scopigno Istituto Scienza e Tecnologia.
Robot Vision SS 2011 Matthias Rüther / Matthias Straka 1 ROBOT VISION Lesson 7: Volumetric Object Reconstruction Matthias Straka.
Processing visual information for Computer Vision
The YELLOW Cross Lesson 5 Lesson 4 Review Lesson Extension
제 5 장 스테레오.
Vectors and the Geometry
Copyright © Cengage Learning. All rights reserved.
CS4670 / 5670: Computer Vision Kavita Bala Lec 27: Stereo.
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Mauricio Hess-Flores1, Mark A. Duchaineau2, Kenneth I. Joy3
Transformations Learning Target: I will be able to translate, reflect, rotate, and dilate figures.
Common Classification Tasks
Coding Approaches for End-to-End 3D TV Systems
Vectors and the Geometry
A Distributed System for Real-time Volume Reconstruction
Plain Mirror Style SNC2D
Binary Image processing بهمن 92
Slope and Similar Triangles
Graphing on a Coordinate plane
Lecture 15: Structure from motion
Announcements Project 3 out today (help session at end of class)
Exact Voxel Occupancy with Graph Cuts
Stereo vision Many slides adapted from Steve Seitz.
Presentation transcript:

Silhouette Intersection System Overview Silhouette Intersection View Cube 3 meters on a side Images Silhouettes Calibration Our approach to calibration is to maximize the consistency between image or alternatively the reconstructed volume. An outline of the algorithm: Begin with rough camera estimates. Adjust cameras Intersect cones generated from the cameras and associated silhouettes. Project the 3d model back onto the silhouettes. If there is greater consistency between silhouettes and reconstruction, update cameras. Repeat until reconstruction matches silhouette. Miscalibrated Cameras Calibrated Our system can dynamically recalibrate the cameras in the view cube. Segmentation Original Image Difference Segmentation Our system can uses a graph cut formalism to find the optimal segmentation very rapidly. Real-Time The direction of run-length encoding in each image corresponds to vertical lines in the world. We call the lines in the world worldlines, and the lines in the image, corresponding to lines in the world, imagelines. From left to right: (1) A camera, with some imagelines, looking at a set of worldlines; (2) the same camera, oriented to show a worldline corresponding to the rightmost imageline; (3) the same camera, oriented to show a worldline corresponding to the next imageline. Two views of the image plane with imagelines. Left: Camera is horizontal. Right: Camera looking slightly down. Top-left: three cameras' views of a person, with a worldline and 3d model. Top-right: the three cameras with just the worldline. Middle-left: the worldline with the run from the right camera highlighted. Middle-right: the worldline with the run from the center camera highlighted. Bottom-left: the worldline with the run from the left camera highlighted. Bottom-right: the three runs along a worldline, the intersection of those runs (rightmost line) is the part that would remain after reconstruction. Our system operates in real-time. Each camera computes a segmentation and then compresses the silhouette by run-length encoding. The compression depends on the orientation of the camera in the world. As a result 3D reconstruction of the volume can take place without decompressing the silhouettes. Voxel Occupancy Left: Eight of the 16 images captured using within the acquisition volume. Right: Silhouettes computed from these images. Notice that there has been no attempt to artificially simplify the image processing necessary to compute silhouettes. The lighting and background is complex and uncontrolled. The subject is also wearing natural clothing which often matches the color of the background. Three reconstructions. Top: reconstruction using our method. Middle: reconstruction using silhouette intersection (silhouettes were computed using image differencing, and morphological operations to remove noise). Bottom: robust silhouette intersection, where a voxel is consider occupied if 3 out of 4 cameras agree that it is within the silhouette. with graph cuts Our system operates uses the graph-cut formalism to find the optimal 3D volume which explains the resulting silhouettes. The graph-cut system incorporates both a spatial prior (on shapes) and a model of noise in the images.