Direct Surface Reconstruction using Perspective Shape from Shading via Photometric Stereo
|
|
- Ashley Henry
- 5 years ago
- Views:
Transcription
1 Direct Surface Reconstruction using Perspective Shape from Shading via Roberto Mecca joint work with Ariel Tankus and Alfred M. Bruckstein Technion - Israel Institute of Technology Department of Computer Science 11 December 2012
2 (Perspective) Shape from Shading Artistic Precursor of the Shape from Shading R. Mecca Direct Surface Reconstruction using Perspective SfS-PS
3 Problem introduction Differential model Not uniqueness
4 Main ingredients (Perspective) Shape from Shading Differential model Not uniqueness The SfS problem is described by the following irradiance equation: R(ρ, n) = I (1) where R is the reflectance function; n is the unit normal vector to the surface; ρ is the albedo; I is the image function; I : Ω [0, 1], with Ω is a compact closed domain (Ω R 2 open set).
5 Perspective transformation Differential model Not uniqueness Surface in the real world: h(x, y) = x y ẑ(x, y) z (x, y, ẑ) Surface in the perspective world: ξ x ẑ(x,y) f k(ξ, η) = η = y ẑ(x,y) f z(ξ, η) ẑ(x, y) y x where f is the focal length. (,, f) A. Tankus, N. A. Sochen, Y. Yeshurun: Shape-from-Shading Under Perspective Projection, International Journal of Computer Vision 63(1): (25)
6 Differential model Not uniqueness Hypotheses and Non-Linear Problem 1. only one light source placed at infinity in the direction of the unit vector ω = (ω 1, ω 2, ω 3 ) R 3 (with ω 3 < 0); 2. Lambertian surface; 3. albedo unknown; 4. no self-reflection. It is possible to get the following non-linear PDE with Dirichlet boundary condition: ρ(ξ, η) z ξ(fω 1 + ξω 3 ) z η (fω 2 + ηω 3 ) zω 3 f = I(ξ, η), on Ω p 2 (zξ 2 + z2 η) + (z + ξz ξ + ηz η ) 2 z(ξ, η) = g(ξ, η) for the PSfS problem. on Ω p (2)
7 Concave/convex ambiguity Differential model Not uniqueness
8 Differential model Not uniqueness One picture is not enough to obtain uniqueness
9 (Perspective) Shape from Shading Differential model Not uniqueness
10 (Perspective) Shape from Shading Differential model Not uniqueness...
11 The new differential approach Direct Surface Reconstruction using Multiple Image Differential model for the PSfS-PS using 2 images Let us overpass the problem of uniqueness of solution considering the approach using two light sources defined by the unit vectors ω = (ω 1, ω 2, ω 3) and ω = (ω 1, ω 2, ω 3 ). Using the information obtained by both images we can couple the two equations obtaining the following system of non-linear PDE: ρ(ξ, η) z ξ(fω 1 + ξω 3) z η (fω 2 + ηω 3) zω 3 f = I 1 (ξ, η), on Ω p 2 (zξ 2 + z2 η) + (z + ξz ξ + ηz η ) 2 ρ(ξ, η) z ξ(fω 1 + ξω 3 ) z η (fω 2 + ηω 3 ) zω 3 f = I 2 (ξ, η), on Ω p 2 (zξ 2 + z2 η) + (z + ξz ξ + ηz η ) 2 z(ξ, η) = g(ξ, η) on Ω p. (3)
12 Removing the non-linearity The new differential approach Direct Surface Reconstruction using Multiple Image Now, observing that the denominator of both equations is the same (i.e. it does not depend on the light source) and obviously always different from zero, we can explicit the non-linearity from the first equation for example f 2 (zξ 2 + z2 η) + (z + ξz ξ + ηz η ) 2 = z ξ(fω 1 + ξω 3) z η (fω 2 + ηω 3) zω 3 ρ(ξ, η) I 1 (ξ, η) and replacing it in the other we obtain the following linear equation [(fω 1 + ξω 3)I 2 (ξ, η) (fω 1 + ξω 3 )I 1 (ξ, η)] z (ξ, η) ξ + [(fω 2 + ηω 3)I 2 (ξ, η) (fω 2 + ηω 3 )I 1 (ξ, η)] z (ξ, η) η + (ω 3I 2 (ξ, η) ω 3 I 1 (ξ, η))z(ξ, η) = 0 (4)
13 Removing the non-linearity The new differential approach Direct Surface Reconstruction using Multiple Image Now, observing that the denominator of both equations is the same (i.e. it does not depend on the light source) and obviously always different from zero, we can explicit the non-linearity from the first equation for example f 2 (zξ 2 + z2 η) + (z + ξz ξ + ηz η ) 2 = z ξ(fω 1 + ξω 3) z η (fω 2 + ηω 3) zω 3 ρ(ξ, η) I 1 (ξ, η) and replacing it in the other we obtain the following linear equation [(fω 1 + ξω 3)I 2 (ξ, η) (fω 1 + ξω 3 )I 1 (ξ, η)] z (ξ, η) ξ + [(fω 2 + ηω 3)I 2 (ξ, η) (fω 2 + ηω 3 )I 1 (ξ, η)] z (ξ, η) η + (ω 3I 2 (ξ, η) ω 3 I 1 (ξ, η))z(ξ, η) = 0 (4)
14 Linear PDE (Perspective) Shape from Shading The new differential approach Direct Surface Reconstruction using Multiple Image That is, instead of two non-linear PDEs we can consider this linear PDE: { b(ξ, η) z(ξ, η) + s(ξ, η)z(ξ, η) = 0, on Ω p z(ξ, η) = g(ξ, η) on Ω p (5) where: b(ξ, η) = ((fω 1 + ξω 3)I 2 (ξ, η) (fω 1 + ξω 3 )I 1 (ξ, η), (fω 2 + ηω 3)I 2 (ξ, η) (fω 2 + ηω 3 )I 1 (ξ, η)) (6) and s(ξ, η) = ω 3I 2 (ξ, η) ω 3 I 1 (ξ, η). (7) Lemma If there aren t points (ξ, η) Ω p of black shadows for the image functions (i.e. I 1 (ξ, η) 0 and I 2 (ξ, η) 0), than b(ξ, η) 0.
15 Linear PDE (Perspective) Shape from Shading The new differential approach Direct Surface Reconstruction using Multiple Image That is, instead of two non-linear PDEs we can consider this linear PDE: { b(ξ, η) z(ξ, η) + s(ξ, η)z(ξ, η) = 0, on Ω p z(ξ, η) = g(ξ, η) on Ω p (5) where: b(ξ, η) = ((fω 1 + ξω 3)I 2 (ξ, η) (fω 1 + ξω 3 )I 1 (ξ, η), (fω 2 + ηω 3)I 2 (ξ, η) (fω 2 + ηω 3 )I 1 (ξ, η)) (6) and s(ξ, η) = ω 3I 2 (ξ, η) ω 3 I 1 (ξ, η). (7) Lemma If there aren t points (ξ, η) Ω p of black shadows for the image functions (i.e. I 1 (ξ, η) 0 and I 2 (ξ, η) 0), than b(ξ, η) 0.
16 Discontinuity of b and s The new differential approach Direct Surface Reconstruction using Multiple Image z! I( ) 1 ẑ 2 p 1 p 2 p 3 4 f x 12 5 p p 3 p p p 2 p p p
17 Sketch of the Proof (Perspective) Shape from Shading The new differential approach Direct Surface Reconstruction using Multiple Image Theorem Let γ(t) be a curve of discontinuity for the function b(ξ, η) (and s(ξ, η)) and let p = (ξ, η) be a point of this curve. Let n(ξ, η) be the outgoing normal with respect to the set Ω p +, than we have [ lim (ξ,η) (ξ,η) (ξ,η) Ω p + b(ξ, η) n(ξ, η) ][ lim (ξ,η) (ξ,η) (ξ,η) Ω p b(ξ, η) n(ξ, η) ] 0 (8) p + p + p + p + p p p p (, ) (, ) (, ) (, ) (t) (t) (t) (t)
18 Sketch of the Proof (Perspective) Shape from Shading The new differential approach Direct Surface Reconstruction using Multiple Image Theorem Let us consider the problem { b(ξ, η) z(ξ, η) + s(ξ, η)z(ξ, η) = 0, a.e. (ξ, η) Ω p ; z(ξ, η) = g(ξ, η) (ξ, η) Ω p. Let us suppose that (γ 1 (t),..., γ k (t)), the family of discontinuity curves for b(ξ, η) and s(ξ, η), are not characteristic curves (with respect to the previous problem). Then it exists a unique Lipschitz solution of the problem.
19 Multiple Images Formulation The new differential approach Direct Surface Reconstruction using Multiple Image If we consider the problem (5) for three images, we get the following three linear equations (one for each couple of images): b (1,2) (ξ, η) z(ξ, η) + s (1,2) (ξ, η)z(ξ, η) = 0, a.e. (ξ, η) Ω p b (1,3) (ξ, η) z(ξ, η) + s (1,3) (ξ, η)z(ξ, η) = 0, a.e. (ξ, η) Ω p b (2,3) (ξ, η) z(ξ, η) + s (2,3) (ξ, η)z(ξ, η) = 0, a.e. (ξ, η) Ω p (9) and simply by summing the previous three equations, we can resume the previous system in the following equation: { ( b (1,2) + b (1,3) + b (2,3)) z(ξ, η) + ( s (1,2) + s (1,3) + s (2,3)) z(ξ, η) = 0 z(ξ, η) = g(ξ, η) which continues to have a unique weak solution. (10)
20 The new differential approach Direct Surface Reconstruction using Multiple Image Weighted Perspective with 3 Images We define the ingredients for the Weighted PPS 3 problem (W-PPS 3 ) as follow: b w 3 (ξ, η) = q p (ξ, η)b p (ξ, η) and s w 3 (ξ, η) = q p (ξ, η)s p (ξ, η) p ( [3] 2 ) p ( [3] 2 ) (11) where ( ) [3] = {(1, 2), (1, 3), (2, 3)}. (12) 2 We have now completed the construction of the W-PPS 3 formulation with { b w 3 (ξ, η) z(ξ, η) + s w 3 (ξ, η)z(ξ, η) = 0, a.e. (ξ, η) Ω p z(ξ, η) = g(ξ, η) (ξ, η) Ω p (13).
21 W-PPS 3 with shadows The new differential approach Direct Surface Reconstruction using Multiple Image The presence of shadows in the images consists in a loss of information that could compromise the surface reconstruction. Since no ambient light is assumed, for each image the shadow sets are defined as follow: S i S = {(ξ, η) Ω p 1 0 S S 1 0 S : I i (ξ, S 0 η) = 0} = where Sj i S are open and disjoint sets. 4 n i s j= S4 S4 Sj, i S i = S 1, S 2, 3 (14) S4 S4 S4 S 0 2 S 0 2 S 0 2 S 0 1 S 0 1 S 0 1 S 0 3 S 0 3 S 0 3 S4 S4 I BW 1 I BW 2 I BW 3 Figure : In this black and white (i.e. 0 and 1) pictures we consider the images Ii BW = H(I i ) where H( ) is the Heaviside step function. S4
22 W-PPS 3 with shadows The new differential approach Direct Surface Reconstruction using Multiple Image Let us define the following sets: S (1,2) = S, S (1,3) = S and S (2,3) S = S S S (15) and introduce the functions 0 S 1 0 S 0 1 ( ) [3] q p (ξ, η) = 1 p [Ω \Sp ] (ξ, η), p 2 showed in Figure 2. S 0 3 S 0 3 S 0 3 S4 S4 S4 (16) S 0 1 S 0 2 S 0 2 S 0 2 S 0 S S 0 1 S 0 1 S S4 S4 S4 S 0 3 S 0 3 S 0 3 S4 S4 S4 q (1,2) q (1,3) q (2,3) Figure : Here a schematic representation of the non-smooth weight functions is given. Using the Heaviside function we can also write them as q (h,k) = H(I h )H(I k ).
23 Semi-Lagrangian Backward and Forward semi-lagrangian scheme Dividing both sides of the linear equation in (5) by b(ξ, η) and considering the definition of the directional derivative we arrive to the following fixed point semi-lagrangian schemes: z n+1 i,j = z n (ξ i hαi,j, 1 η j hαi,j) 2 b i,j (17) b i,j ± hs i,j where z n+1 (ξ i, η j ) = z n+1 i,j and α i,j = bi,j b i,j on a uniform discretization of Ω P (Ω p d ). The convergence of this schemes is proven exploiting the properties of the asymptotically non expansive map
24 Backward and Forward semi-lagrangian scheme Semi-Lagrangian : Convergence Definition Let K be a subset of a Banach space X. A transformation T : K K is said to be asymptotically nonexpansive if for each x, y K, T i (x) T i (y) k i x y (18) where {k i } is a sequence of real number such that lim i k i = 1. It is obvious that for asymptotically non expansive mapping it may be assumed the k i 1 and that k i+1 k i for i = 1, 2,.... Theorem Let K be a nonempty, closed, convex and bounded subset of a uniformly convex Banach space X, and let F : K K be asymptotically nonexpansive. Than F has a fixed point. K. Goebel and W. A. Kirk, A fixed point theorem for asymptotically nonexpansive mappings, Proceedings of the American Mathematical Society, 35 (1972), pp
25 Backward and Forward semi-lagrangian scheme Semi-Lagrangian : Convergence Definition Let K be a subset of a Banach space X. A transformation T : K K is said to be asymptotically nonexpansive if for each x, y K, T i (x) T i (y) k i x y (18) where {k i } is a sequence of real number such that lim i k i = 1. It is obvious that for asymptotically non expansive mapping it may be assumed the k i 1 and that k i+1 k i for i = 1, 2,.... Theorem Let K be a nonempty, closed, convex and bounded subset of a uniformly convex Banach space X, and let F : K K be asymptotically nonexpansive. Than F has a fixed point. K. Goebel and W. A. Kirk, A fixed point theorem for asymptotically nonexpansive mappings, Proceedings of the American Mathematical Society, 35 (1972), pp
26 Backward and Forward semi-lagrangian scheme Semi-Lagrangian : Convergence We are now able to prove the following: Theorem The numerical schemes defined by the operators Th(z)(ξ, b b(ξ, η) η) = z((ξ, η) + hα(ξ, η)) b(ξ, η) hs(ξ, η), T f b(ξ, η) h (z)(ξ, η) = z((ξ, η) hα(ξ, η)) b(ξ, η) + hs(ξ, η) are convergent. (19)
27 Numerical Tests on Synthetic Images Backward and Forward semi-lagrangian scheme ω : ϕ 1 = 0.1, θ 1 = 0.0 (I 1 ) ω : ϕ 2 = 0.1, θ 2 = π (I 2 ) ω : ϕ 2 = 0.1, θ 2 = 3 2 π (I 3 ) Table : Set of images used with the respective light sources described by their spherical coordinates. In this case the albedo mask is added for all the images together with back patches and 10% of Gaussian Noise. The size of the pictures goes from 5 5 pixels to 4 4 pixels.
28 Numerical Tests on Synthetic Images Backward and Forward semi-lagrangian scheme Figure : On the left the original surface and on the right the reconstruction with 10% noised images of 16 Megapixel. Forward s-l Backward s-l L error L 1 error time (sec) L error L 1 error time (sec) Table : In this table the errors in the L and L 1 norms are shown together with the computational time for the semi-lagrangian schemes. The rows are divided considering the size of the starting images.
29 Real Images (Perspective) Shape from Shading Backward and Forward semi-lagrangian scheme We use the presented algorithm on a well known set of images depicting the Beethoven s bust. The size of these pictures is very small, only and the time needed for the reconstruction is seconds. Figure : Starting data obtained respectively with the light sources ω : ϕ 1 = 0.263, θ 1 = 0.305, ω : ϕ 2 = 0.2, θ 2 = and ω : ϕ 3 = 0.281, θ 3 =
30 Real Images (Perspective) Shape from Shading Backward and Forward semi-lagrangian scheme Figure : Forward and Backward reconstruction.
31 Conclusion and Perspective Backward and Forward semi-lagrangian scheme a new differential formulation for the Perspective Shape from Shading problem via (with only two images) has been proven to be well-posed; the extension to the Multi-Image reconstruction has been formulated also considering shadows and occlusions; the algorithm implemented is able to solve in a few seconds the W-PPS 3 with starting images of several megapixels. Our algorithms are not based on parallel computing and a first improvement of this work could be a GPU implementation in order to have 3D reconstruction in real time. Another direction of research could be the improvement of the shading model employed. The initial setup can be improved by taking into account specular reflections and different kind of perspective deformations.
Direct Shape Recovery from Photometric Stereo with Shadows
Direct Shape Recovery from Photometric Stereo with Shadows Roberto Mecca, Aaron Wetzler, Ron Kimmel and Alfred Marcel Bruckstein Department of Computer Science Technion - Israel Institute of Technology,
More informationNear Field Photometric Stereo with Point Light Sources
SIAM J. IMAGING SCIENCES Vol. 7, No. 4, pp. 2732 2770 c 2014 Society for Industrial and Applied Mathematics Near Field Photometric Stereo with Point Light Sources Roberto Mecca, Aaron Wetzler, Alfred M.
More informationOutline Introduction Problem Formulation Proposed Solution Applications Conclusion. Compressed Sensing. David L Donoho Presented by: Nitesh Shroff
Compressed Sensing David L Donoho Presented by: Nitesh Shroff University of Maryland Outline 1 Introduction Compressed Sensing 2 Problem Formulation Sparse Signal Problem Statement 3 Proposed Solution
More informationPhotometric Stereo. Lighting and Photometric Stereo. Computer Vision I. Last lecture in a nutshell BRDF. CSE252A Lecture 7
Lighting and Photometric Stereo Photometric Stereo HW will be on web later today CSE5A Lecture 7 Radiometry of thin lenses δa Last lecture in a nutshell δa δa'cosα δacos β δω = = ( z' / cosα ) ( z / cosα
More informationCAN THE SUN S DIRECTION BE ESTIMATED PRIOR TO THE DETERMINATION OF SHAPE?
CAN THE SUN S DIRECTION BE ESTIMATED PRIOR TO THE DETERMINATION OF SHAPE? WOJCIECH CHOJNACKI MICHAEL J. BROOKS Department of Computer Science, University of Adelaide Adelaide, SA 5005, Australia and DANIEL
More informationAn introduction to mesh generation Part IV : elliptic meshing
Elliptic An introduction to mesh generation Part IV : elliptic meshing Department of Civil Engineering, Université catholique de Louvain, Belgium Elliptic Curvilinear Meshes Basic concept A curvilinear
More informationLambertian model of reflectance I: shape from shading and photometric stereo. Ronen Basri Weizmann Institute of Science
Lambertian model of reflectance I: shape from shading and photometric stereo Ronen Basri Weizmann Institute of Science Variations due to lighting (and pose) Relief Dumitru Verdianu Flying Pregnant Woman
More informationRecent Developments in Model-based Derivative-free Optimization
Recent Developments in Model-based Derivative-free Optimization Seppo Pulkkinen April 23, 2010 Introduction Problem definition The problem we are considering is a nonlinear optimization problem with constraints:
More informationMassachusetts Institute of Technology. Department of Computer Science and Electrical Engineering /6.866 Machine Vision Quiz I
Massachusetts Institute of Technology Department of Computer Science and Electrical Engineering 6.801/6.866 Machine Vision Quiz I Handed out: 2004 Oct. 21st Due on: 2003 Oct. 28th Problem 1: Uniform reflecting
More informationLambertian model of reflectance II: harmonic analysis. Ronen Basri Weizmann Institute of Science
Lambertian model of reflectance II: harmonic analysis Ronen Basri Weizmann Institute of Science Illumination cone What is the set of images of an object under different lighting, with any number of sources?
More informationPhotometric Stereo, Shape from Shading SfS Chapter Szelisky
Photometric Stereo, Shape from Shading SfS Chapter 12.1.1. Szelisky Guido Gerig CS 6320, Spring 2012 Credits: M. Pollefey UNC CS256, Ohad Ben-Shahar CS BGU, Wolff JUN (http://www.cs.jhu.edu/~wolff/course600.461/week9.3/index.htm)
More informationGeneral Principles of 3D Image Analysis
General Principles of 3D Image Analysis high-level interpretations objects scene elements Extraction of 3D information from an image (sequence) is important for - vision in general (= scene reconstruction)
More informationAssignment #2. (Due date: 11/6/2012)
Computer Vision I CSE 252a, Fall 2012 David Kriegman Assignment #2 (Due date: 11/6/2012) Name: Student ID: Email: Problem 1 [1 pts] Calculate the number of steradians contained in a spherical wedge with
More informationRe-rendering from a Dense/Sparse Set of Images
Re-rendering from a Dense/Sparse Set of Images Ko Nishino Institute of Industrial Science The Univ. of Tokyo (Japan Science and Technology) kon@cvl.iis.u-tokyo.ac.jp Virtual/Augmented/Mixed Reality Three
More informationThe Cut Locus and the Jordan Curve Theorem
The Cut Locus and the Jordan Curve Theorem Rich Schwartz November 19, 2015 1 Introduction A Jordan curve is a subset of R 2 which is homeomorphic to the circle, S 1. The famous Jordan Curve Theorem says
More information3D Shape Recovery of Smooth Surfaces: Dropping the Fixed Viewpoint Assumption
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL., NO., 1 3D Shape Recovery of Smooth Surfaces: Dropping the Fixed Viewpoint Assumption Yael Moses Member, IEEE and Ilan Shimshoni Member,
More informationOther approaches to obtaining 3D structure
Other approaches to obtaining 3D structure Active stereo with structured light Project structured light patterns onto the object simplifies the correspondence problem Allows us to use only one camera camera
More informationCapturing light. Source: A. Efros
Capturing light Source: A. Efros Review Pinhole projection models What are vanishing points and vanishing lines? What is orthographic projection? How can we approximate orthographic projection? Lenses
More informationA Machine learning approach for Shape From Shading
2nd International Conference on Signal, Image, Vision and their Applications (SIVA13) November 18-20, 2013 - Guelma, Algeria. A Machine learning approach for Shape From Shading Lyes ABADA Laboratory of
More informationPerspective Shape from Shading with Non-Lambertian Reflectance
Perspective Shape from Shading with Non-Lambertian Reflectance Oliver Vogel, Michael Breuß, and Joachim Weickert Mathematical Image Analysis Group, Faculty of Mathematics and Computer Science, Building
More informationLast update: May 4, Vision. CMSC 421: Chapter 24. CMSC 421: Chapter 24 1
Last update: May 4, 200 Vision CMSC 42: Chapter 24 CMSC 42: Chapter 24 Outline Perception generally Image formation Early vision 2D D Object recognition CMSC 42: Chapter 24 2 Perception generally Stimulus
More informationAPPROXIMATING PDE s IN L 1
APPROXIMATING PDE s IN L 1 Veselin Dobrev Jean-Luc Guermond Bojan Popov Department of Mathematics Texas A&M University NONLINEAR APPROXIMATION TECHNIQUES USING L 1 Texas A&M May 16-18, 2008 Outline 1 Outline
More informationRadiance. Pixels measure radiance. This pixel Measures radiance along this ray
Photometric stereo Radiance Pixels measure radiance This pixel Measures radiance along this ray Where do the rays come from? Rays from the light source reflect off a surface and reach camera Reflection:
More informationProjection-Based Methods in Optimization
Projection-Based Methods in Optimization Charles Byrne (Charles Byrne@uml.edu) http://faculty.uml.edu/cbyrne/cbyrne.html Department of Mathematical Sciences University of Massachusetts Lowell Lowell, MA
More informationStabilized Finite Element Method for 3D Navier-Stokes Equations with Physical Boundary Conditions
Stabilized Finite Element Method for 3D Navier-Stokes Equations with Physical Boundary Conditions Mohamed Amara, Daniela Capatina, David Trujillo Université de Pau et des Pays de l Adour Laboratoire de
More informationA C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions
A C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions Nira Dyn School of Mathematical Sciences Tel Aviv University Michael S. Floater Department of Informatics University of
More informationFinite difference methods
Finite difference methods Siltanen/Railo/Kaarnioja Spring 8 Applications of matrix computations Applications of matrix computations Finite difference methods Spring 8 / Introduction Finite difference methods
More informationImage denoising using TV-Stokes equation with an orientation-matching minimization
Image denoising using TV-Stokes equation with an orientation-matching minimization Xue-Cheng Tai 1,2, Sofia Borok 1, and Jooyoung Hahn 1 1 Division of Mathematical Sciences, School of Physical Mathematical
More informationA PROOF OF THE LOWER BOUND CONJECTURE FOR CONVEX POLYTOPES
PACIFIC JOURNAL OF MATHEMATICS Vol. 46, No. 2, 1973 A PROOF OF THE LOWER BOUND CONJECTURE FOR CONVEX POLYTOPES DAVID BARNETTE A d polytope is defined to be a cz-dimensional set that is the convex hull
More informationA Survey of Light Source Detection Methods
A Survey of Light Source Detection Methods Nathan Funk University of Alberta Mini-Project for CMPUT 603 November 30, 2003 Abstract This paper provides an overview of the most prominent techniques for light
More informationReconstruction of Discrete Surfaces from Shading Images by Propagation of Geometric Features
Reconstruction of Discrete Surfaces from Shading Images by Propagation of Geometric Features Achille Braquelaire and Bertrand Kerautret LaBRI, Laboratoire Bordelais de Recherche en Informatique UMR 58,
More informationCannon s conjecture, subdivision rules, and expansion complexes
Cannon s conjecture, subdivision rules, and expansion complexes W. Floyd (joint work with J. Cannon and W. Parry) Department of Mathematics Virginia Tech UNC Greensboro: November, 2014 Motivation from
More informationFace Re-Lighting from a Single Image under Harsh Lighting Conditions
Face Re-Lighting from a Single Image under Harsh Lighting Conditions Yang Wang 1, Zicheng Liu 2, Gang Hua 3, Zhen Wen 4, Zhengyou Zhang 2, Dimitris Samaras 5 1 The Robotics Institute, Carnegie Mellon University,
More informationLevel lines based disocclusion
Level lines based disocclusion Simon Masnou Jean-Michel Morel CEREMADE CMLA Université Paris-IX Dauphine Ecole Normale Supérieure de Cachan 75775 Paris Cedex 16, France 94235 Cachan Cedex, France Abstract
More informationConvexization in Markov Chain Monte Carlo
in Markov Chain Monte Carlo 1 IBM T. J. Watson Yorktown Heights, NY 2 Department of Aerospace Engineering Technion, Israel August 23, 2011 Problem Statement MCMC processes in general are governed by non
More informationRefractive Index Map Reconstruction in Optical Deflectometry Using Total-Variation Regularization
Refractive Index Map Reconstruction in Optical Deflectometry Using Total-Variation Regularization L. Jacques 1, A. González 2, E. Foumouo 2 and P. Antoine 2 1 Institute of Information and Communication
More informationTOPOLOGY, DR. BLOCK, FALL 2015, NOTES, PART 3.
TOPOLOGY, DR. BLOCK, FALL 2015, NOTES, PART 3. 301. Definition. Let m be a positive integer, and let X be a set. An m-tuple of elements of X is a function x : {1,..., m} X. We sometimes use x i instead
More informationNumerische Mathematik
Numer. Math. (1997) 77: 423 451 Numerische Mathematik c Springer-Verlag 1997 Electronic Edition Minimal surfaces: a geometric three dimensional segmentation approach Vicent Caselles 1, Ron Kimmel 2, Guillermo
More informationShape from Shading for Rough Surfaces: Analysis of the Oren-Nayar Model
JU, BREUSS, BRUHN, GALLIANI: SHAPE FROM SHADING FOR ROUGH SURFACES 1 Shape from Shading for Rough Surfaces: Analysis of the Oren-Nayar Model Yong Chul Ju y.ju@mmci.uni-saarland.de Michael Breuß breuss@tu-cottbus.de
More informationMotion Estimation. There are three main types (or applications) of motion estimation:
Members: D91922016 朱威達 R93922010 林聖凱 R93922044 謝俊瑋 Motion Estimation There are three main types (or applications) of motion estimation: Parametric motion (image alignment) The main idea of parametric motion
More informationTwo Algorithms for Approximation in Highly Complicated Planar Domains
Two Algorithms for Approximation in Highly Complicated Planar Domains Nira Dyn and Roman Kazinnik School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv 69978, Israel, {niradyn,romank}@post.tau.ac.il
More informationOutline. Level Set Methods. For Inverse Obstacle Problems 4. Introduction. Introduction. Martin Burger
For Inverse Obstacle Problems Martin Burger Outline Introduction Optimal Geometries Inverse Obstacle Problems & Shape Optimization Sensitivity Analysis based on Gradient Flows Numerical Methods University
More informationModeling web-crawlers on the Internet with random walksdecember on graphs11, / 15
Modeling web-crawlers on the Internet with random walks on graphs December 11, 2014 Modeling web-crawlers on the Internet with random walksdecember on graphs11, 2014 1 / 15 Motivation The state of the
More informationLecture 15: The subspace topology, Closed sets
Lecture 15: The subspace topology, Closed sets 1 The Subspace Topology Definition 1.1. Let (X, T) be a topological space with topology T. subset of X, the collection If Y is a T Y = {Y U U T} is a topology
More informationStatistical and Learning Techniques in Computer Vision Lecture 1: Markov Random Fields Jens Rittscher and Chuck Stewart
Statistical and Learning Techniques in Computer Vision Lecture 1: Markov Random Fields Jens Rittscher and Chuck Stewart 1 Motivation Up to now we have considered distributions of a single random variable
More information= f (a, b) + (hf x + kf y ) (a,b) +
Chapter 14 Multiple Integrals 1 Double Integrals, Iterated Integrals, Cross-sections 2 Double Integrals over more general regions, Definition, Evaluation of Double Integrals, Properties of Double Integrals
More informationconvolution shift invariant linear system Fourier Transform Aliasing and sampling scale representation edge detection corner detection
COS 429: COMPUTER VISON Linear Filters and Edge Detection convolution shift invariant linear system Fourier Transform Aliasing and sampling scale representation edge detection corner detection Reading:
More informationImage Processing 1 (IP1) Bildverarbeitung 1
MIN-Fakultät Fachbereich Informatik Arbeitsbereich SAV/BV (KOGS) Image Processing 1 (IP1) Bildverarbeitung 1 Lecture 20: Shape from Shading Winter Semester 2015/16 Slides: Prof. Bernd Neumann Slightly
More information60 2 Convex sets. {x a T x b} {x ã T x b}
60 2 Convex sets Exercises Definition of convexity 21 Let C R n be a convex set, with x 1,, x k C, and let θ 1,, θ k R satisfy θ i 0, θ 1 + + θ k = 1 Show that θ 1x 1 + + θ k x k C (The definition of convexity
More informationThe Set-Open topology
Volume 37, 2011 Pages 205 217 http://topology.auburn.edu/tp/ The Set-Open topology by A. V. Osipov Electronically published on August 26, 2010 Topology Proceedings Web: http://topology.auburn.edu/tp/ Mail:
More informationThe Farey Tessellation
The Farey Tessellation Seminar: Geometric Structures on manifolds Mareike Pfeil supervised by Dr. Gye-Seon Lee 15.12.2015 Introduction In this paper, we are going to introduce the Farey tessellation. Since
More informationChapter 6. Curves and Surfaces. 6.1 Graphs as Surfaces
Chapter 6 Curves and Surfaces In Chapter 2 a plane is defined as the zero set of a linear function in R 3. It is expected a surface is the zero set of a differentiable function in R n. To motivate, graphs
More informationEdge and corner detection
Edge and corner detection Prof. Stricker Doz. G. Bleser Computer Vision: Object and People Tracking Goals Where is the information in an image? How is an object characterized? How can I find measurements
More informationLagrangian methods for the regularization of discrete ill-posed problems. G. Landi
Lagrangian methods for the regularization of discrete ill-posed problems G. Landi Abstract In many science and engineering applications, the discretization of linear illposed problems gives rise to large
More informationSome Illumination Models for Industrial Applications of Photometric Stereo
Some Illumination Models for Industrial Applications of Photometric Stereo Yvain Quéau and Jean-Denis Durou Université de Toulouse, IRIT, UMR CNRS 5505, Toulouse, France ABSTRACT Among the possible sources
More informationReview Initial Value Problems Euler s Method Summary
THE EULER METHOD P.V. Johnson School of Mathematics Semester 1 2008 OUTLINE 1 REVIEW 2 INITIAL VALUE PROBLEMS The Problem Posing a Problem 3 EULER S METHOD Method Errors 4 SUMMARY OUTLINE 1 REVIEW 2 INITIAL
More informationAn Efficient Numerical Inverse Scattering Algorithm for Generalized Zakharov-Shabat Equations with Two Potential Functions
An Efficient Numerical Inverse Scattering Algorithm for Generalized Zakharov-Shabat Equations with Two Potential Functions Huaibin Tang, Qinghua Zhang To cite this version: Huaibin Tang, Qinghua Zhang.
More informationJune Wesley, Cambridge Univ. Press,
[6] P Dupuis and J Oliensis. An optimal control formulation and related numerical methods for a problem in shape reconstruction. Ann. Appl. Probab., 4():87{ 346, 994. [7] B K P Horn. Obtaining shape from
More informationPoint-Set Topology II
Point-Set Topology II Charles Staats September 14, 2010 1 More on Quotients Universal Property of Quotients. Let X be a topological space with equivalence relation. Suppose that f : X Y is continuous and
More informationMcGill University. Electrical and Computer Engineering. Shape Analysis. Term Project. Shape from Shading Using Level Sets Method
McGill University Electrical and Computer Engineering Shape Analysis Term Project Shape from Shading Using Level Sets Method Name: Mohannad Elhamod Student ID: 260303471 1 Contents I. Introduction... 3
More informationA Modified Spline Interpolation Method for Function Reconstruction from Its Zero-Crossings
Scientific Papers, University of Latvia, 2010. Vol. 756 Computer Science and Information Technologies 207 220 P. A Modified Spline Interpolation Method for Function Reconstruction from Its Zero-Crossings
More informationAnalisi ed approssimazione di alcuni problemi appartenenti alla classe Shape-from-X
Analisi ed approssimazione di alcuni problemi appartenenti alla classe Shape-from-X Silvia Tozza Assegnista INdAM Unità di ricerca INdAM presso Dip. di Matematica, Sapienza Università di Roma Convegno
More informationPhotometric Stereo. Photometric Stereo. Shading reveals 3-D surface geometry BRDF. HW3 is assigned. An example of photometric stereo
Photometric Stereo Photometric Stereo HW3 is assigned Introduction to Computer Vision CSE5 Lecture 6 Shading reveals 3-D surface geometry Shape-from-shading: Use just one image to recover shape. Requires
More informationA Direct Search Algorithm for Global Optimization
Article A Direct Search Algorithm for Global Optimization Enrique Baeyens, *, Alberto Herreros and José R. Perán 2 Instituto de las Tecnologías Avanzadas de la Producción (ITAP), Universidad de Valladolid,
More informationEdge detection. Winter in Kraków photographed by Marcin Ryczek
Edge detection Winter in Kraków photographed by Marcin Ryczek Edge detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the image
More informationValue function and optimal trajectories for a control problem with supremum cost function and state constraints
Value function and optimal trajectories for a control problem with supremum cost function and state constraints Hasnaa Zidani ENSTA ParisTech, University of Paris-Saclay joint work with: A. Assellaou,
More informationTeichmüller Space and Fenchel-Nielsen Coordinates
Teichmüller Space and Fenchel-Nielsen Coordinates Nathan Lopez November 30, 2015 Abstract Here we give an overview of Teichmüller space and its realization as a smooth manifold through Fenchel- Nielsen
More informationCompactness Theorems for Saddle Surfaces in Metric Spaces of Bounded Curvature. Dimitrios E. Kalikakis
BULLETIN OF THE GREEK MATHEMATICAL SOCIETY Volume 51, 2005 (45 52) Compactness Theorems for Saddle Surfaces in Metric Spaces of Bounded Curvature Dimitrios E. Kalikakis Abstract The notion of a non-regular
More information13 Distribution Ray Tracing
13 In (hereafter abbreviated as DRT ), our goal is to render a scene as accurately as possible. Whereas Basic Ray Tracing computed a very crude approximation to radiance at a point, in DRT we will attempt
More informationweighted minimal surface model for surface reconstruction from scattered points, curves, and/or pieces of surfaces.
weighted minimal surface model for surface reconstruction from scattered points, curves, and/or pieces of surfaces. joint work with (S. Osher, R. Fedkiw and M. Kang) Desired properties for surface reconstruction:
More informationA C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions
A C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions Nira Dyn Michael S. Floater Kai Hormann Abstract. We present a new four-point subdivision scheme that generates C 2 curves.
More informationScene-Consistent Detection of Feature Points in Video Sequences
Scene-Consistent Detection of Feature Points in Video Sequences Ariel Tankus and Yehezkel Yeshurun School of Computer Science Tel-Aviv University Tel-Aviv 69978, Israel {arielt,hezy}@post.tau.ac.il Abstract
More informationDistributed non-convex optimization
Distributed non-convex optimization Behrouz Touri Assistant Professor Department of Electrical and Computer Engineering University of California San Diego/University of Colorado Boulder AFOSR Computational
More informationNumerical schemes for Hamilton-Jacobi equations, control problems and games
Numerical schemes for Hamilton-Jacobi equations, control problems and games M. Falcone H. Zidani SADCO Spring School Applied and Numerical Optimal Control April 23-27, 2012, Paris Lecture 2/3 M. Falcone
More information2 A topological interlude
2 A topological interlude 2.1 Topological spaces Recall that a topological space is a set X with a topology: a collection T of subsets of X, known as open sets, such that and X are open, and finite intersections
More informationEdge detection. Goal: Identify sudden. an image. Ideal: artist s line drawing. object-level knowledge)
Edge detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the image can be encoded in the edges More compact than pixels Ideal: artist
More informationLigh%ng and Reflectance
Ligh%ng and Reflectance 2 3 4 Ligh%ng Ligh%ng can have a big effect on how an object looks. Modeling the effect of ligh%ng can be used for: Recogni%on par%cularly face recogni%on Shape reconstruc%on Mo%on
More informationMirror-symmetry in images and 3D shapes
Journées de Géométrie Algorithmique CIRM Luminy 2013 Mirror-symmetry in images and 3D shapes Viorica Pătrăucean Geometrica, Inria Saclay Symmetry is all around... In nature: mirror, rotational, helical,
More informationProblem definition Image acquisition Image segmentation Connected component analysis. Machine vision systems - 1
Machine vision systems Problem definition Image acquisition Image segmentation Connected component analysis Machine vision systems - 1 Problem definition Design a vision system to see a flat world Page
More informationAMS527: Numerical Analysis II
AMS527: Numerical Analysis II A Brief Overview of Finite Element Methods Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao SUNY Stony Brook AMS527: Numerical Analysis II 1 / 25 Overview Basic concepts Mathematical
More informationComputational Foundations of Cognitive Science
Computational Foundations of Cognitive Science Lecture 16: Models of Object Recognition Frank Keller School of Informatics University of Edinburgh keller@inf.ed.ac.uk February 23, 2010 Frank Keller Computational
More informationKernels and representation
Kernels and representation Corso di AA, anno 2017/18, Padova Fabio Aiolli 20 Dicembre 2017 Fabio Aiolli Kernels and representation 20 Dicembre 2017 1 / 19 (Hierarchical) Representation Learning Hierarchical
More informationAnalysis of Planar Light Fields from Homogeneous Convex Curved Surfaces Under Distant Illumination
Analysis of Planar Light Fields from Homogeneous Convex Curved Surfaces Under Distant Illumination Ravi Ramamoorthi and Pat Hanrahan {ravir,hanrahan}@graphics.stanford.edu http://graphics.stanford.edu/papers/planarlf/
More information1 (5 max) 2 (10 max) 3 (20 max) 4 (30 max) 5 (10 max) 6 (15 extra max) total (75 max + 15 extra)
Mierm Exam CS223b Stanford CS223b Computer Vision, Winter 2004 Feb. 18, 2004 Full Name: Email: This exam has 7 pages. Make sure your exam is not missing any sheets, and write your name on every page. The
More informationEpipolar geometry contd.
Epipolar geometry contd. Estimating F 8-point algorithm The fundamental matrix F is defined by x' T Fx = 0 for any pair of matches x and x in two images. Let x=(u,v,1) T and x =(u,v,1) T, each match gives
More informationFUTURE communication networks are expected to support
1146 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL 13, NO 5, OCTOBER 2005 A Scalable Approach to the Partition of QoS Requirements in Unicast and Multicast Ariel Orda, Senior Member, IEEE, and Alexander Sprintson,
More informationarxiv: v1 [math.na] 20 Sep 2016
arxiv:1609.06236v1 [math.na] 20 Sep 2016 A Local Mesh Modification Strategy for Interface Problems with Application to Shape and Topology Optimization P. Gangl 1,2 and U. Langer 3 1 Doctoral Program Comp.
More informationProject Updates Short lecture Volumetric Modeling +2 papers
Volumetric Modeling Schedule (tentative) Feb 20 Feb 27 Mar 5 Introduction Lecture: Geometry, Camera Model, Calibration Lecture: Features, Tracking/Matching Mar 12 Mar 19 Mar 26 Apr 2 Apr 9 Apr 16 Apr 23
More information. Tutorial Class V 3-10/10/2012 First Order Partial Derivatives;...
Tutorial Class V 3-10/10/2012 1 First Order Partial Derivatives; Tutorial Class V 3-10/10/2012 1 First Order Partial Derivatives; 2 Application of Gradient; Tutorial Class V 3-10/10/2012 1 First Order
More informationConvexity. 1 X i is convex. = b is a hyperplane in R n, and is denoted H(p, b) i.e.,
Convexity We ll assume throughout, without always saying so, that we re in the finite-dimensional Euclidean vector space R n, although sometimes, for statements that hold in any vector space, we ll say
More informationCurve Sampling and Geometric Conditional Simulation
Curve Sampling and Geometric Conditional Simulation Ayres Fan Joint work with John Fisher, William Wells, Jonathan Kane, and Alan Willsky S S G Massachusetts Institute of Technology September 19, 2007
More informationAnnouncements. Edges. Last Lecture. Gradients: Numerical Derivatives f(x) Edge Detection, Lines. Intro Computer Vision. CSE 152 Lecture 10
Announcements Assignment 2 due Tuesday, May 4. Edge Detection, Lines Midterm: Thursday, May 6. Introduction to Computer Vision CSE 152 Lecture 10 Edges Last Lecture 1. Object boundaries 2. Surface normal
More informationEdge Detection. Today s reading. Cipolla & Gee on edge detection (available online) From Sandlot Science
Edge Detection From Sandlot Science Today s reading Cipolla & Gee on edge detection (available online) Project 1a assigned last Friday due this Friday Last time: Cross-correlation Let be the image, be
More informationParticle Filtering. CS6240 Multimedia Analysis. Leow Wee Kheng. Department of Computer Science School of Computing National University of Singapore
Particle Filtering CS6240 Multimedia Analysis Leow Wee Kheng Department of Computer Science School of Computing National University of Singapore (CS6240) Particle Filtering 1 / 28 Introduction Introduction
More informationConvex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes Menelaos I. Karavelas joint work with Eleni Tzanaki University of Crete & FO.R.T.H. OrbiCG/ Workshop on Computational
More information1.7 The Heine-Borel Covering Theorem; open sets, compact sets
1.7 The Heine-Borel Covering Theorem; open sets, compact sets This section gives another application of the interval halving method, this time to a particularly famous theorem of analysis, the Heine Borel
More informationThe topology of limits of embedded minimal disks. (joint work with Jacob Bernstein) Giuseppe Tinaglia King s College London
The topology of limits of embedded minimal disks. (joint work with Jacob Bernstein) Giuseppe Tinaglia King s College London Notations; Background; Main result; Possible questions; Another proof. Let M
More informationLevel Set Methods and Fast Marching Methods
Level Set Methods and Fast Marching Methods I.Lyulina Scientific Computing Group May, 2002 Overview Existing Techniques for Tracking Interfaces Basic Ideas of Level Set Method and Fast Marching Method
More informationLecture 19 Subgradient Methods. November 5, 2008
Subgradient Methods November 5, 2008 Outline Lecture 19 Subgradients and Level Sets Subgradient Method Convergence and Convergence Rate Convex Optimization 1 Subgradients and Level Sets A vector s is a
More informationA GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY
A GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY KARL L. STRATOS Abstract. The conventional method of describing a graph as a pair (V, E), where V and E repectively denote the sets of vertices and edges,
More information