Verifying the “Consistency” of Shading Patterns and 3-D Structures Pawan Sinha & Edward Adelson.

Slides:



Advertisements
Similar presentations
Land’s Retinex algorithm
Advertisements

COMP 175 | COMPUTER GRAPHICS Remco Chang1/6103b – Shapes Lecture 03b: Shapes COMP 175: Computer Graphics February 3, 2015.
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean 5403 T-R 3:00pm – 4:20pm Lecture #12.
Extended Gaussian Images
The perception of Shading and Reflectance E.H. Adelson, A.P. Pentland Presenter: Stefan Zickler.
Chapter 12: Surface Area and Volume of Solids
Torrance Sparrow Model of Reflectance + Oren Nayar Model of Reflectance.
December 5, 2013Computer Vision Lecture 20: Hidden Markov Models/Depth 1 Stereo Vision Due to the limited resolution of images, increasing the baseline.
Recovering Intrinsic Images from a Single Image 28/12/05 Dagan Aviv Shadows Removal Seminar.
May 2004SFS1 Shape from shading Surface brightness and Surface Orientation --> Reflectance map READING: Nalwa Chapter 5. BKP Horn, Chapter 10.
Computer Vision - A Modern Approach
Global Illumination May 7, Global Effects translucent surface shadow multiple reflection.
Motion Field and Optical Flow. Outline Motion Field and Optical Flow Definition, Example, Relation Optical Flow Constraint Equation Assumptions & Derivation,
Photometric Stereo & Shape from Shading
Visualization and graphics research group CIPIC February 13, 2003ECS289L – Multiresolution Methods – Winter Illumination Dependent Refinement of.
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean 5403 T-R 3:00pm – 4:20pm Lecture #18.
Computer Vision Spring ,-685 Instructor: S. Narasimhan PH A18B T-R 10:30am – 11:50am Lecture #13.
 A Polyhedron- (polyhedra or polyhedrons)  Is formed by 4 or more polygons (faces) that intersect only at the edges.  Encloses a region in space. 
Polygon Shading. Assigning color to a shape to make graphical scenes look realistic, or artistic, or whatever effect we’re attempting to achieve But first.
COMPUTER GRAPHICS CS 482 – FALL 2014 AUGUST 27, 2014 FIXED-FUNCTION 3D GRAPHICS MESH SPECIFICATION LIGHTING SPECIFICATION REFLECTION SHADING HIERARCHICAL.
Prisms Fun with by D. Fisher
1/20 Obtaining Shape from Scanning Electron Microscope Using Hopfield Neural Network Yuji Iwahori 1, Haruki Kawanaka 1, Shinji Fukui 2 and Kenji Funahashi.
1 Ray Tracing Polyhedra ©Anthony Steed
Vertex – A point at which two or more edges meet Edge – A line segment at which two faces intersect Face – A flat surface Vertices, Edges, Faces.
COLLEGE OF ENGINEERING UNIVERSITY OF PORTO COMPUTER GRAPHICS AND INTERFACES / GRAPHICS SYSTEMS JGB / AAS 1 Shading (Shading) & Smooth Shading Graphics.
Vision & Recognition. From a different direction At different times, particularly if it has been modified in the interval In different light A particular.
Object Stereo- Joint Stereo Matching and Object Segmentation Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on Michael Bleyer Vienna.
December 4, 2014Computer Vision Lecture 22: Depth 1 Stereo Vision Comparing the similar triangles PMC l and p l LC l, we get: Similarly, for PNC r and.
Image Synthesis Rabie A. Ramadan, PhD 1. 2 About my self Rabie A. Ramadan My website and publications
EECS 274 Computer Vision Sources, Shadows, and Shading.
December 9, 2014Computer Vision Lecture 23: Motion Analysis 1 Now we will talk about… Motion Analysis.
7.1 Three- Dimensional Figures I can classify and draw three-dimensional figures.
1 Polygonal Techniques 이영건. 2 Introduction This chapter –Discuss a variety of problems that are encountered within polygonal data sets The.
Photo-realistic Rendering and Global Illumination in Computer Graphics Spring 2012 Material Representation K. H. Ko School of Mechatronics Gwangju Institute.
November 4, THE REFLECTANCE MAP AND SHAPE-FROM-SHADING.
1 Self-Calibration and Neural Network Implementation of Photometric Stereo Yuji IWAHORI, Yumi WATANABE, Robert J. WOODHAM and Akira IWATA.
(c) 2000, 2001 SNU CSE Biointelligence Lab Finding Region Another method for processing image  to find “regions” Finding regions  Finding outlines.
Chapter Area, Pythagorean Theorem, and Volume 14 Copyright © 2013, 2010, and 2007, Pearson Education, Inc.
Geometrically Bounded Wireframe AIC (Part 510) Grouping of curves relevant for 3-dimensional wireframe modeling without topological constructs Elementary.
1Ellen L. Walker 3D Vision Why? The world is 3D Not all useful information is readily available in 2D Why so hard? “Inverse problem”: one image = many.
Reflectance Function Estimation and Shape Recovery from Image Sequence of a Rotating object Jiping Lu, Jim Little UBC Computer Science ICCV ’ 95.
Introduction to Meshes Lecture 22 Mon, Oct 20, 2003.
Space Figures and Cross Sections. Polyhedra A polyhedron is a three- dimensional figure whose surfaces are polygons. Each polygon is a face of the polyhedron.
6.1 - Solid Shapes & Spatial Relationships.
7.1 Three- Dimensional Figures I can classify and draw three-dimensional figures.
RENDERING : Global Illumination
Plane Reflection – Learning Outcomes  Demonstrate the laws of reflection.  Discuss images formed in plane mirrors.  Differentiate between real and virtual.
Computational Vision CSCI 363, Fall 2012 Lecture 17 Stereopsis II
EECS 274 Computer Vision Sources, Shadows, and Shading.
Announcements Project 3a due today Project 3b due next Friday.
Sections of Solids ME 111 Engineering Drawing. Sectional Views The internal hidden details of the object are shown in orthographic views by dashed lines.
MAN-522 Computer Vision Spring
Polyhedra and Prisms.
Instructor: S. Narasimhan
Figure Legend: From: Visual detection of symmetry of 3D shapes
Visit for more Learning Resources
Common Classification Tasks
CSC461: Lecture 23 Shading Computation
Polygons and Perimeter
Planarity and Euler’s Formula
L Differentiate Threshold Integrate R.
Symmetry and three-dimensional geometry
Computing Vertex Normals from Arbitrary Meshes
Part One: Acquisition of 3-D Data 2019/1/2 3DVIP-01.
Geometric Solids All bounded three-dimensional geometric figures. Examples: Sphere, Cylinders, Cubes, Cones, Pyramids, and Prisms.
Geometric Solids All bounded three-dimensional geometric figures. Examples: Sphere, Cylinders, Cubes, Cones, Pyramids, and Prisms.
CS5500 Computer Graphics May 29, 2006
Vertical Angles Vertical angles are across from each other and are created by intersecting lines.
11.5 Explore Solids Mrs. vazquez Geometry.
Presentation transcript:

Verifying the “Consistency” of Shading Patterns and 3-D Structures Pawan Sinha & Edward Adelson

What is the 3D Structure of Each Image?

Infinite Number of Possible Interpretations

Goal 1: 3D Shape Recovery

Goal 2: Check Shading Consistency

Input Patterns

Goal 1: Propose 3D Structure ● Questions: – What distinguishes correct structure? – How to search for it algorithmically?

What Distinguishes Correct Structure? WrongRight

What Distinguishes Correct Structure? ● Low “Complexity” – Low Angle Variance – Planarity of Faces – Overall Compactness

How to Search? ● Minimize Cost Function – How to weight constraints? – Cumbersome ● Incremental Solution – Start with 2-D Line Drawing – “Pull” vertices until regularity is maximized ● i.e. Gradient descent in regularity space

Incremental Solution

Goal 2: Check Shading Consistency ● Given – 3D structure – 2D gray-level image ● Assume – Structure is uniformly colored ● Find – Single light source to account for shading

Quantitative Approach ● Given: – Lambertian Reflectance Model – Surface Normal – Surface Brightness ● Defines: – A cone of valid light directions for each surface

Cone of valid light direction N=surface normal E=brightness N

Quantitative Approach ● Consider cones for all surfaces ● Intersection is direction of illumination

Problems ● Small changes in grey lead to no solution Surface l 3 changes brightness Gradient Space Input Patterns Before After Intersection

Qualitative Approach ● Observation – Human vision ● Good at judging relation between brightness ● Bad at judging absolute brightness ● So... – Use binary relations to: ● find light source ● Not commit to particular reflectance function

Qualitative Approach ● Each surface now defines a hemisphere of possible light directions – Overall consistency implies finding a non-null intersection of hemispheres

Qualitative Approach ● Hemisphere ~ set of vectors t s.t Angle between s and t is less than 90

Qualitative Approach ● Hemisphere ~ set of vectors t s.t sij is defined between a surface i and surface j, with normals ni and nj

Qualitative Approach ● Hemisphere ~ set of vectors t s.t s is perpindicular to the average of the normals

Qualitative Approach ● Hemisphere ~ set of vectors t s.t s is perpindicular to plane defined by the normals

Qualitative Approach ● Hemisphere ~ set of vectors t s.t The angle between s and ni is less than 90 & the angle between s and nj is greater

Solution ● Solution to constraints lie on a convex polygon on the unit sphere. Direction of agreement

Is it consistent? ● If no polygons found that satisfy all constraints, then – Shading is not consistent No maximum

Largely Solveable ● For each polygon, count # of constraints matched – A maximum indicates most likely lighting direction

Compound Edges ● What do unsatisfied constraints represent? – Compound edge – where surface changes color, not just shading Compound edges

Justification ● Why do shape derivation with line drawings and not brightness? – Humans can use edges ● Can humans use grey level? – It seems like it – An experiment

An Experiment ● Random Height Tesselation – Can human determine 3d structure? 3D Representation Overhead View

Limitations ● Polyhedral objects only ● Later research addresses contoured objects w/ smoothly changing brightness.

Conclusions ● Humans mostly use edges to determine 3D structure ● Use shading to verify this determination ● Algorithm effective for polyhedra