Photometric Stereo: Three recent contributions. Dipartimento di Matematica, La Sapienza
|
|
- Juniper Robinson
- 5 years ago
- Views:
Transcription
1 Photometric Stereo: Three recent contributions Dipartimento di Matematica, La Sapienza Jean-Denis DUROU IRIT, Toulouse Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
2 Outline 1 Shape-from-X techniques 2 Photometric techniques 3 Integration of a normal field 4 Uncalibrated Photometric Stereo 5 Conclusion and Perspective Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
3 Outline Shape-from-X techniques 1 Shape-from-X techniques 2 Photometric techniques 3 Integration of a normal field 4 Uncalibrated Photometric Stereo 5 Conclusion and Perspective Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
4 Shape-from-X techniques 3D-scanning 3D-reconstruction 3D-scanning 3D-reconstruction + Albedo ( color) estimation Different kinds of 3D-scanning Palpation Mechanical process Telemeters Time of flight of laser pulses Kinect Projection of an infra-red pattern Photographic techniques Shape-from-X Some applications of 3D-scanning Architecture Metrology Cultural heritage Augmented reality Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
5 Shape-from-X techniques 3D-scanning 3D-reconstruction 3D-scanning 3D-reconstruction + Albedo ( color) estimation Different kinds of 3D-scanning Palpation Mechanical process Telemeters Time of flight of laser pulses Kinect Projection of an infra-red pattern Photographic techniques Shape-from-X Some applications of 3D-scanning Architecture Metrology Cultural heritage Augmented reality Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
6 Shape-from-X techniques 3D-scanning 3D-reconstruction 3D-scanning 3D-reconstruction + Albedo ( color) estimation Different kinds of 3D-scanning Palpation Mechanical process Telemeters Time of flight of laser pulses Kinect Projection of an infra-red pattern Photographic techniques Shape-from-X Some applications of 3D-scanning Architecture Metrology Cultural heritage Augmented reality Current application in our laboratory Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
7 Shape-from-X techniques Main shape-from-x techniques Geometric techniques Photometric techniques Mono-view Shape-from-structured light Shape-from-shading techniques Shape-from-shadow (n = 1 image) Shape-from-contour Shape-from-texture Multi-view Stereoscopy Photometric Stereo techniques Structure-from-motion (n > 1 images) Shape-from-silhouettes Shape-from-defocus Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
8 Shape-from-X techniques Main shape-from-x techniques Geometric techniques Photometric techniques Mono-view Shape-from-structured light Shape-from-shading techniques Shape-from-shadow (n = 1 image) Shape-from-contour Shape-from-texture Multi-view Stereoscopy Photometric Stereo techniques Structure-from-motion (n > 1 images) Shape-from-silhouettes Shape-from-defocus Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
9 Outline Photometric techniques 1 Shape-from-X techniques 2 Photometric techniques 3 Integration of a normal field 4 Uncalibrated Photometric Stereo 5 Conclusion and Perspective Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
10 Photometric techniques Photometric techniques: Definition Data n 1 images of a scene under the same camera pose n light vectors S i, i [1, n] Results Always: Depth map Sometimes: Albedo map S 1 S 2 S 3 Depth map + Albedo map 3D-model Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
11 Photometric techniques Shape-from-shading (SFS) / Photometric Stereo (PS) 2 or 3 unknowns per pixel Always: Normal N such that N = 1 2 unknowns Sometimes: Albedo ρ [0, 1] 1 additional unknown n equations per pixel Lambert s law: Greylevel I i = ρ N S i, i [1, n] (1) If ρ unknown: M = ρ N R 3 Linear equations Known albedo Unknown albedo 2 unknowns per pixel 3 unknowns per pixel + Non-linear equations + Linear equations n = 1 SFS: Under-constrained SFSρ: Under-constrained++ n = 2 PS2: Well-constrained PS2ρ: Under-constrained n = 3 PS: Over-constrained PS: Well-constrained n > 3 PS: Over-constrained++ PS: Over-constrained Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
12 Photometric techniques Shape-from-shading (SFS) / Photometric Stereo (PS) 2 or 3 unknowns per pixel Always: Normal N such that N = 1 2 unknowns Sometimes: Albedo ρ [0, 1] 1 additional unknown n equations per pixel Lambert s law: Greylevel I i = ρ N S i, i [1, n] (1) If ρ unknown: M = ρ N R 3 Linear equations Known albedo Unknown albedo 2 unknowns per pixel 3 unknowns per pixel + Non-linear equations + Linear equations n = 1 SFS: Under-constrained SFSρ: Under-constrained++ n = 2 PS2: Well-constrained PS2ρ: Under-constrained n = 3 PS: Over-constrained PS: Well-constrained n > 3 PS: Over-constrained++ PS: Over-constrained Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
13 Photometric techniques Shape-from-shading (SFS) / Photometric Stereo (PS) 2 or 3 unknowns per pixel Always: Normal N such that N = 1 2 unknowns Sometimes: Albedo ρ [0, 1] 1 additional unknown n equations per pixel Lambert s law: Greylevel I i = ρ N S i, i [1, n] (1) If ρ unknown: M = ρ N R 3 Linear equations Known albedo Unknown albedo 2 unknowns per pixel 3 unknowns per pixel + Non-linear equations + Linear equations n = 1 SFS: Under-constrained SFSρ: Under-constrained++ n = 2 PS2: Well-constrained PS2ρ: Under-constrained n = 3 PS: Over-constrained PS: Well-constrained n > 3 PS: Over-constrained++ PS: Over-constrained Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
14 Photometric techniques Shape-from-shading (SFS) / Photometric Stereo (PS) 2 or 3 unknowns per pixel Always: Normal N such that N = 1 2 unknowns Sometimes: Albedo ρ [0, 1] 1 additional unknown n equations per pixel Lambert s law: Greylevel I i = ρ N S i, i [1, n] (1) If ρ unknown: M = ρ N R 3 Linear equations Known albedo Unknown albedo 2 unknowns per pixel 3 unknowns per pixel + Non-linear equations + Linear equations n = 1 SFS: Under-constrained SFSρ: Under-constrained++ n = 2 PS2: Well-constrained PS2ρ: Under-constrained n = 3 PS: Over-constrained PS: Well-constrained n > 3 PS: Over-constrained++ PS: Over-constrained Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
15 Photometric techniques Shape-from-shading (SFS) / Photometric Stereo (PS) 2 or 3 unknowns per pixel Always: Normal N such that N = 1 2 unknowns Sometimes: Albedo ρ [0, 1] 1 additional unknown n equations per pixel Lambert s law: Greylevel I i = ρ N S i, i [1, n] (1) If ρ unknown: M = ρ N R 3 Linear equations Known albedo Unknown albedo 2 unknowns per pixel 3 unknowns per pixel + Non-linear equations + Linear equations n = 1 SFS: Under-constrained SFSρ: Under-constrained++ n = 2 PS2: Well-constrained PS2ρ: Under-constrained n = 3 PS: Over-constrained PS: Well-constrained n > 3 PS: Over-constrained++ PS: Over-constrained Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
16 Photometric techniques Photometric techniques: Other variants More realistic models Camera projection: Orthographic or perspective Light beams: Parallel or point light sources Uncalibrated variant Additional unknowns S i, i [1, n] Worse constrained Direct search for the depth u Lambert s law: Greylevel I i = ρ N S i, i [1, n] (1) Relation between N and u: N = 1/ u 2 x + u 2 y + 1 [ u x, u y, 1] (2) Computer vision: Non-differential approach First resolution of (1), then resolution of (2) Mathematics: Differential approach Elimination of N from (1) + (2) n coupled PDEs in u Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
17 Photometric techniques Photometric techniques: Other variants More realistic models Camera projection: Orthographic or perspective Light beams: Parallel or point light sources Uncalibrated variant Additional unknowns S i, i [1, n] Worse constrained Direct search for the depth u Lambert s law: Greylevel I i = ρ N S i, i [1, n] (1) Relation between N and u: N = 1/ u 2 x + u 2 y + 1 [ u x, u y, 1] (2) Computer vision: Non-differential approach First resolution of (1), then resolution of (2) Mathematics: Differential approach Elimination of N from (1) + (2) n coupled PDEs in u Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
18 Photometric techniques Photometric techniques: Other variants More realistic models Camera projection: Orthographic or perspective Light beams: Parallel or point light sources Uncalibrated variant Additional unknowns S i, i [1, n] Worse constrained Direct search for the depth u Lambert s law: Greylevel I i = ρ N S i, i [1, n] (1) Relation between N and u: N = 1/ u 2 x + u 2 y + 1 [ u x, u y, 1] (2) Computer vision: Non-differential approach First resolution of (1), then resolution of (2) Mathematics: Differential approach Elimination of N from (1) + (2) n coupled PDEs in u Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
19 Photometric techniques Non-differential approach / Differential approach Non-differential approach Easier to handle (mainly for computer scientists!) Resolution of (2) required (called integration ): N = 1/ u 2 x + u 2 y + 1 [ u x, u y, 1] (2) Differential approach Better constrained since the elimination of N = [N 1, N 2, N 3 ] from (1) + (2) implicitely supposes: u xy = u yx y u x = x u y y (N 1 /N 3 ) = x (N 2 /N 3 ) Usually requires boundary conditions Problems which could benefit from the differential approach SFS Much studied PS2ρ Galileo project with La Sapienza? Uncalibrated PS with point light sources To be done Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
20 Photometric techniques Non-differential approach / Differential approach Non-differential approach Easier to handle (mainly for computer scientists!) Resolution of (2) required (called integration ): N = 1/ u 2 x + u 2 y + 1 [ u x, u y, 1] (2) Differential approach Better constrained since the elimination of N = [N 1, N 2, N 3 ] from (1) + (2) implicitely supposes: u xy = u yx y u x = x u y y (N 1 /N 3 ) = x (N 2 /N 3 ) Usually requires boundary conditions Problems which could benefit from the differential approach SFS Much studied PS2ρ Galileo project with La Sapienza? Uncalibrated PS with point light sources To be done Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
21 Photometric techniques Main advantages of Photometric Stereo Advantages of Photometric Stereo vs. Shape-from-shading Well-posed and linear if n 3 non-coplanar sources No assumption required on the albedo (uniform albedo, etc.) No need to restrict the 3D-reconstruction to a family of objects (applicable surfaces, human faces, etc.) Advantages of Photometric Stereo vs. Stereoscopy No external geometric calibration (single camera pose) No matching No problem such as occlusions Estimate of the shape and of the albedo 3D-model Dense and accurate 3D-reconstruction (applications in metrology) Limits of Photometric Stereo Limited to images taken under very controlled conditions 2.5D-reconstruction (depth map) instead of real 3D-reconstruction Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
22 Photometric techniques Photometric Stereo: Three recent contributions Integration of a normal field cf. Section 3 A new fast and edge-preserving method of integration Jean-François AUJOL (IMB, Bordeaux) Yvain QUÉAU (IRIT) Uncalibrated Photometric Stereo cf. Section 4 Resolution of the Uncalibrated PS problem using Total Variation François LAUZE (DIKU, Copenhagen) Yvain QUÉAU (IRIT) Photometric Stereo with n = 2 images cf. Perspective Theoretical study and practical resolution of the PS2 problem Roberto MECCA (IIT, Genova) Xavier DESCOMBES (INRIA, Sophia Antipolis) Yvain QUÉAU (IRIT) Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
23 Outline Integration of a normal field 1 Shape-from-X techniques 2 Photometric techniques 3 Integration of a normal field 4 Uncalibrated Photometric Stereo 5 Conclusion and Perspective Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
24 Integration of a normal field Integration of a normal field: Equations Data: Unit normal vector N = [N 1, N 2, N 3 ] Unknown: Depth u Relation between N and u: N = 1/ u 2 x + u 2 y + 1 [ u x, u y, 1] (2) On the other hand: N 3 0 N = N 3 [N 1 /N 3, N 2 /N 3, 1] Identification of both expressions of N: u = [N 1 /N 3, N 2 /N 3 ] Standard notations: p = N 1 /N 3, q = N 2 /N 3 Linear PDE in u: u = [p, q] (3) Integration of a normal field N such that y (N 1 /N 3 ) = x (N 2 /N 3 ) Integration of a gradient field [p, q] = [N 1 /N 3, N 2 /N 3 ] Equation (3) is invalid when N 3 = 0 (contours of occultation) Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
25 Integration of a normal field Closed-form solution Direct resolution of the PDE (3) Equation to solve: u(x, y) = [p(x, y), q(x, y)], for (x, y) Ω Partially ill-posed: u solution u + c Closed-form solution: u(x, y) = u(x 0, y 0 ) + Constraint of integrability (x,y) (x 0,y 0 ) On any closed contour, we should have: (x0,y 0 ) (x 0,y 0 ) [p(u, v) du + q(u, v) dv] = 0 solution, c R [p(u, v) du + q(u, v) dv] This occurs iff: curl [p, q, 1] = 0 p y = q x Integrability constraint Never rigorously satisfied in practice Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
26 Integration of a normal field Quadratic minimization Least-square resolution of the PDE (3) F L2 (u) = u(x, y) [p(x, y), q(x, y)] 2 dx dy (x,y) Ω Euler-Lagrange equation: F L2 (u) = 2 div ( u [p, q]) u = p x + q y (4) Poisson equation Natural boundary condition: ( u [p, q]) η = 0 (5) η outer normal to Ω in the image plane Minimization of F L2 (u) Resolution of the Poisson equation (4) Eq. (4) needs to be constrained, since any solution to the Laplace equation u = 0 (harmonic function) can be added to a solution Constrained boundary (Dirichlet or Neumann) or free boundary (natural boundary condition (5)) Unique solution to (4) Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
27 Integration of a normal field Quadratic minimization: Discretization Discretization of the functional F L2 (u) E(u) = [ ] ((i,j),(i+1,j)) Ω 2 u i+1,j u i,j p i+1,j +p 2 i,j 2 + [ ((i,j),(i,j+1)) Ω 2 u i,j+1 u i,j q i,j+1+q i,j 2 ] 2 with { u = [ui,j ] (i,j) Ω\ Ω if constrained boundary u = [u i,j ] (i,j) Ω if free boundary Discretization of the Poisson equation (4) For (i, j) Ω\ Ω: E u i,j = 0 u i+1,j + u i,j+1 + u i 1,j + u i,j 1 4 u i,j = p i+1,j p i 1,j +q i,j+1 q i,j 1 2 Discretization of the natural boundary condition (5) For (i, j) Ω, such that (i + 1, j) Ω and (i, j + 1) Ω: = 0 u i+1,j + u i,j+1 2 u i,j = p i+1,j p i,j +q i,j+1 q i,j 2 E u i,j Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
28 Integration of a normal field Quadratic minimization: Numerical resolution System to solve: (4) + boundary condition In any case (constrained boundary or free boundary): One linear equation per pixel Square linear system A u = B (6) Resolution of (6) using a Jacobi iteration Constrained boundary: [Horn, Brooks 1986] Free boundary: [Durou, Courteille 2007] Reconstruction domain Ω not necessarily rectangular Very slow algorithms Resolution of (4) using the Fourier transform Constrained boundary: [Frankot, Chellappa 1988] Free boundary: [Simchony et al. 1990] Fast algorithms thanks to the FFT Reconstruction domain Ω necessarily rectangular Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
29 Integration of a normal field Application to Photometric Stereo (first step) S 1 S 2 S 3 Reconstruction domain Ω Estimated normal field N Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
30 Integration of a normal field Application to Photometric Stereo (second step) Non-rectangular Ω + Free boundary [Durou, Courteille 2007] Images of size : CPU = 8 s Very slow! Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
31 Integration of a normal field A simple (but wrong) idea to accelerate the integration Embed Ω in the whole image domain Ω The normals in Ω \Ω are fixed to N = [0, 0, 1] (flat ground) Rectangular Ω + Free boundary [Simchony et al. 1990] [Durou, Courteille 2007]: CPU = 8 s [Simchony et al. 1990]: CPU 0 s The integration is much accelerated But quadratic minimization distorts the surface... Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
32 Integration of a normal field Non-quadratic minimization Weighted least-square resolution of the PDE (3) (Perona-Malik like) u(x, y) [p(x, y), q(x, y)] 2 F PM (u) = dx dy 1 + a p y (x, y) q x (x, y) (x,y) Ω The denominator is minimal when p y = q x (integrability constraint) Euler-Lagrange equation: u = p x + q y + ln(1 + a p y q x ) ( u [p, q]) (7) Linear PDE in u Resolution of the PDE (7) But (7) has non-constant coefficients FFT discarded Discretization of (7) New square linear system A u = B Matrix A very sparse LU decomposition very fast New method of normal integration: u = A \B Fast, edge-preserving, Ω not necessarily rectangular Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
33 Results Integration of a normal field Discontinuous surface Direct quadratic minimization Size [Simchony et al. 1990] RMSE = 9.47, CPU = 0.23 s Iterative non-quadratic minimization [Durou et al. 2009] RMSE = 2.87, CPU = 81.3 s Direct non-quadratic minimization Proposed method RMSE = 0.49, CPU = 0.32 s Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
34 Outline Uncalibrated Photometric Stereo 1 Shape-from-X techniques 2 Photometric techniques 3 Integration of a normal field 4 Uncalibrated Photometric Stereo 5 Conclusion and Perspective Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
35 Uncalibrated Photometric Stereo Uncalibrated Photometric Stereo: Preprocessing Lambert s law In each pixel px Ω: [I 1 px... I n px] = M px S M px = ρ px N px R 1 3, S = [S 1... S n ] R 3 n Stacking such equalities for all the pixels px Ω: I = M S (8) I R m n, M R m 3, m = card(ω) Departures from the Lambert s law From (8), we should have rank(i) 3 In practice, due to departures from the Lambert s law: n > 3 real images rank(i) = min(m, n) > 3 Preprocessing of the real images: I = arg min J of rank 3 J I F The shadows and specularities are removed: see demo UPS Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
36 Uncalibrated Photometric Stereo Uncalibrated Photometric Stereo: Ambiguities Problem formulation Find M R m 3 and S R 3 n such that I = M S (10) For any solution (M, S ) of (10), and any G GL(3): I = M G G 1 S (M G, G 1 S ) other solution of (10) Bas-relief ambiguity [Belhumeur et al. 1999] Imposing the integrability constraint on N = M/ M The integrability constraint imposes G = µ ν λ Generalized bas-relief ambiguity: (µ, ν) R 2 and λ > 0 Resort to the differential approach? Not useful, since the integrability constraint is already used Could be useful with point light sources To be done Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
37 Uncalibrated Photometric Stereo Generalized bas-relief ambiguity: Example Two surfaces giving the same 3 images under different ligths How to find the correct one : compare the estimated albedos Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
38 Uncalibrated Photometric Stereo Uncalibrated Photometric Stereo: Resolution A priori knowledge: Uniform albedo First solution better Minimizing the variance of the albedo: see demo UPS More general resolution: TV-regularization of the albedo Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
39 Outline Conclusion and Perspective 1 Shape-from-X techniques 2 Photometric techniques 3 Integration of a normal field 4 Uncalibrated Photometric Stereo 5 Conclusion and Perspective Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
40 Conclusion Conclusion and Perspective Three recent contributions to Photometric Stereo Contribution 1: Integration of a normal field A new fast and edge-preserving method of integration Contribution 2: Uncalibrated Photometric Stereo Resolution of the Uncalibrated PS problem using Total Variation Contribution 3: Photometric Stereo with n = 2 images Theoretical study and practical resolution of the PS2 problem Application of Contributions 1 and 2 Society Fitting Box (Toulouse) Interactive solutions to eyewear professionals : see video Technological transfer project Photometric stereo for the 3D-scanning of faces Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
41 Conclusion and Perspective Contribution 3: Photometric Stereo with n = 2 images PS2 problem Known albedo n = 2 equations and 2 unknowns per pixel But not so well-constrained, since non-linear equations 2 solutions N in each pixel: 2 m solutions? The solution N must satisfy: y (N 1 /N 3 ) = x (N 2 /N 3 ) Differential approach Better constrained: proof of unicity [Mecca and Falcone 2013] Dirichlet boundary condition required: how to do in practice? Practical resolution I(p, q) = (i,j) Ω p i,j+1 p i,j (q i+1,j q i,j ) Minimization of I(p, q) using simulated annealing: see demo PS2 Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
42 Perspective Conclusion and Perspective Outdoors Photometric Stereo There are more and more webcams (around 2000 in Toulouse!) Huge amount of images: big data (very trendy) An urban webcam is fixed + The Sun makes a parallel beam + It moves PS Continuation of Contribution 3 All the S i are coplanar (S of rank 2) Problem PS2 Unknown albedo ρ PS2ρ Linear, but under-constrained Ideas for a possible collaboration (Galileo project) Big data Robust PS2 (shadows, specularities, moving objects) TV-regularization of the albedo Jean-Denis DUROU (IRIT, Toulouse) 17 December / 32
Normal Integration Part I: A Survey
Normal Integration Part I: A Survey Y Quéau, Jean-Denis Durou, Jean-François Aujol To cite this version: Y Quéau, Jean-Denis Durou, Jean-François Aujol. Normal Integration Part I: A Survey. 016.
More informationarxiv: v1 [cs.cv] 18 Sep 2017
Noname manuscript No. (will be inserted by the editor) Normal Integration: A Survey Yvain Quéau Jean-Denis Durou Jean-François Aujol arxiv:1709.05940v1 [cs.cv] 18 Sep 017 the date of receipt and acceptance
More informationNormal Integration Part II: New Insights
Noname manuscript No. will be inserted by the editor) Normal Integration Part II: New Insights Yvain Quéau Jean-Denis Durou Jean-François Aujol the date of receipt and acceptance should be inserted later
More informationNormal Integration Part I: A Survey
Noname manuscript No. (will be inserted by the editor) Normal Integration Part I: A Survey Jean-Denis Durou Yvain Quéau Jean-François Aujol the date of receipt and acceptance should be inserted later Abstract
More informationMotion Estimation (I)
Motion Estimation (I) Ce Liu celiu@microsoft.com Microsoft Research New England We live in a moving world Perceiving, understanding and predicting motion is an important part of our daily lives Motion
More informationarxiv: v1 [cs.cv] 18 Sep 2017
Noname manuscript No. will be inserted by the editor) Variational Methods for Normal Integration Yvain Quéau Jean-Denis Durou Jean-François Aujol arxiv:709.05965v [cs.cv] 8 Sep 07 the date of receipt and
More informationMotion Estimation (I) Ce Liu Microsoft Research New England
Motion Estimation (I) Ce Liu celiu@microsoft.com Microsoft Research New England We live in a moving world Perceiving, understanding and predicting motion is an important part of our daily lives Motion
More informationImage enhancement. Why image enhancement? Why image enhancement? Why image enhancement? Example of artifacts caused by image encoding
13 Why image enhancement? Image enhancement Example of artifacts caused by image encoding Computer Vision, Lecture 14 Michael Felsberg Computer Vision Laboratory Department of Electrical Engineering 12
More informationLecture 9 Approximations of Laplace s Equation, Finite Element Method. Mathématiques appliquées (MATH0504-1) B. Dewals, C.
Lecture 9 Approximations of Laplace s Equation, Finite Element Method Mathématiques appliquées (MATH54-1) B. Dewals, C. Geuzaine V1.2 23/11/218 1 Learning objectives of this lecture Apply the finite difference
More informationGradient Domain High Dynamic Range Compression
Gradient Domain High Dynamic Range Compression Raanan Fattal Dani Lischinski Michael Werman The Hebrew University of Jerusalem School of Computer Science & Engineering 1 In A Nutshell 2 Dynamic Range Quantity
More informationGradient-domain image processing
Gradient-domain image processing http://graphics.cs.cmu.edu/courses/15-463 15-463, 15-663, 15-862 Computational Photography Fall 2018, Lecture 10 Course announcements Homework 3 is out. - (Much) smaller
More informationInverse source estimation problems in magnetostatics
Inverse source estimation problems in magnetostatics ERNSI Workshop, Lyon, 2017 Juliette Leblond INRIA Sophia Antipolis (France), Team APICS Joint work with: Laurent Baratchart, Sylvain Chevillard, Doug
More informationGradient Descent and Implementation Solving the Euler-Lagrange Equations in Practice
1 Lecture Notes, HCI, 4.1.211 Chapter 2 Gradient Descent and Implementation Solving the Euler-Lagrange Equations in Practice Bastian Goldlücke Computer Vision Group Technical University of Munich 2 Bastian
More informationErkut Erdem. Hacettepe University February 24 th, Linear Diffusion 1. 2 Appendix - The Calculus of Variations 5.
LINEAR DIFFUSION Erkut Erdem Hacettepe University February 24 th, 2012 CONTENTS 1 Linear Diffusion 1 2 Appendix - The Calculus of Variations 5 References 6 1 LINEAR DIFFUSION The linear diffusion (heat)
More informationUniversität des Saarlandes. Fachrichtung 6.1 Mathematik
Universität des Saarlandes U N I V E R S I T A S S A R A V I E N I S S Fachrichtung 6.1 Mathematik Preprint Nr. 281 Perspective Shape from Shading: Ambiguity Analysis and Numerical Approximations Michael
More information3D from Photographs: Camera Calibration. Dr Francesco Banterle
3D from Photographs: Camera Calibration Dr Francesco Banterle francesco.banterle@isti.cnr.it 3D from Photographs Automatic Matching of Images Camera Calibration Photographs Surface Reconstruction Dense
More informationNONLINEAR DIFFUSION PDES
NONLINEAR DIFFUSION PDES Erkut Erdem Hacettepe University March 5 th, 0 CONTENTS Perona-Malik Type Nonlinear Diffusion Edge Enhancing Diffusion 5 References 7 PERONA-MALIK TYPE NONLINEAR DIFFUSION The
More informationBasic Aspects of Discretization
Basic Aspects of Discretization Solution Methods Singularity Methods Panel method and VLM Simple, very powerful, can be used on PC Nonlinear flow effects were excluded Direct numerical Methods (Field Methods)
More informationSection 5.6 Integration by Parts
.. 98 Section.6 Integration by Parts Integration by parts is another technique that we can use to integrate problems. Typically, we save integration by parts as a last resort when substitution will not
More informationImage restoration. An example in astronomy
Image restoration Convex approaches: penalties and constraints An example in astronomy Jean-François Giovannelli Groupe Signal Image Laboratoire de l Intégration du Matériau au Système Univ. Bordeaux CNRS
More informationarxiv: v2 [physics.comp-ph] 4 Feb 2014
Fast and accurate solution of the Poisson equation in an immersed setting arxiv:1401.8084v2 [physics.comp-ph] 4 Feb 2014 Alexandre Noll Marques a, Jean-Christophe Nave b, Rodolfo Ruben Rosales c Abstract
More informationIntroduction Linear system Nonlinear equation Interpolation
Interpolation Interpolation is the process of estimating an intermediate value from a set of discrete or tabulated values. Suppose we have the following tabulated values: y y 0 y 1 y 2?? y 3 y 4 y 5 x
More informationThe Euler equations in fluid mechanics
The Euler equations in fluid mechanics Jordan Bell jordan.bell@gmail.com Department of Mathematics, niversity of Toronto April 14, 014 1 Continuity equation Let Ω be a domain in R n and let C (Ω R); perhaps
More informationTrinocular Geometry Revisited
Trinocular Geometry Revisited Jean Pounce and Martin Hebert 报告人 : 王浩人 2014-06-24 Contents 1. Introduction 2. Converging Triplets of Lines 3. Converging Triplets of Visual Rays 4. Discussion 1. Introduction
More informationTree Crown Extraction using Marked Point Processes
Tree Crown Extraction using Marked Point Processes G. Perrin 12 PhD Advisors : C. Saguez 1 J. Zerubia 2 1 : MAS Laboratory (Ecole Centrale Paris) 2 : Ariana Res. Group (CNRS/INRIA/UNSA) http://www.mas.ecp.fr
More informationLecture Introduction
Lecture 1 1.1 Introduction The theory of Partial Differential Equations (PDEs) is central to mathematics, both pure and applied. The main difference between the theory of PDEs and the theory of Ordinary
More information2 Regularized Image Reconstruction for Compressive Imaging and Beyond
EE 367 / CS 448I Computational Imaging and Display Notes: Compressive Imaging and Regularized Image Reconstruction (lecture ) Gordon Wetzstein gordon.wetzstein@stanford.edu This document serves as a supplement
More informationNonlinear Diffusion. Journal Club Presentation. Xiaowei Zhou
1 / 41 Journal Club Presentation Xiaowei Zhou Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology 2009-12-11 2 / 41 Outline 1 Motivation Diffusion process
More informationWeighted Nonlocal Laplacian on Interpolation from Sparse Data
Noname manuscript No. (will be inserted by the editor) Weighted Nonlocal Laplacian on Interpolation from Sparse Data Zuoqiang Shi Stanley Osher Wei Zhu Received: date / Accepted: date Abstract Inspired
More informationLinear Diffusion and Image Processing. Outline
Outline Linear Diffusion and Image Processing Fourier Transform Convolution Image Restoration: Linear Filtering Diffusion Processes for Noise Filtering linear scale space theory Gauss-Laplace pyramid for
More informationAugmented Reality VU Camera Registration. Prof. Vincent Lepetit
Augmented Reality VU Camera Registration Prof. Vincent Lepetit Different Approaches to Vision-based 3D Tracking [From D. Wagner] [From Drummond PAMI02] [From Davison ICCV01] Consider natural features Consider
More informationA Partial Differential Equation Approach to Image Zoom
A Partial Differential Equation Approach to Image Zoom Abdelmounim Belahmidi and Frédéric Guichard January 2004 Abstract We propose a new model for zooming digital image. This model, driven by a partial
More informationFirst, Second, and Third Order Finite-Volume Schemes for Diffusion
First, Second, and Third Order Finite-Volume Schemes for Diffusion Hiro Nishikawa 51st AIAA Aerospace Sciences Meeting, January 10, 2013 Supported by ARO (PM: Dr. Frederick Ferguson), NASA, Software Cradle.
More informationMATHEMATICS FOR COMPUTER VISION WEEK 2 LINEAR SYSTEMS. Dr Fabio Cuzzolin MSc in Computer Vision Oxford Brookes University Year
1 MATHEMATICS FOR COMPUTER VISION WEEK 2 LINEAR SYSTEMS Dr Fabio Cuzzolin MSc in Computer Vision Oxford Brookes University Year 2013-14 OUTLINE OF WEEK 2 Linear Systems and solutions Systems of linear
More information1 Curvilinear Coordinates
MATHEMATICA PHYSICS PHYS-2106/3 Course Summary Gabor Kunstatter, University of Winnipeg April 2014 1 Curvilinear Coordinates 1. General curvilinear coordinates 3-D: given or conversely u i = u i (x, y,
More informationSYDE 575: Introduction to Image Processing. Image Compression Part 2: Variable-rate compression
SYDE 575: Introduction to Image Processing Image Compression Part 2: Variable-rate compression Variable-rate Compression: Transform-based compression As mentioned earlier, we wish to transform image data
More informationCamera Models and Affine Multiple Views Geometry
Camera Models and Affine Multiple Views Geometry Subhashis Banerjee Dept. Computer Science and Engineering IIT Delhi email: suban@cse.iitd.ac.in May 29, 2001 1 1 Camera Models A Camera transforms a 3D
More informationCourse Outline. 2. Vectors in V 3.
1. Vectors in V 2. Course Outline a. Vectors and scalars. The magnitude and direction of a vector. The zero vector. b. Graphical vector algebra. c. Vectors in component form. Vector algebra with components.
More informationTrefftz-DG solution to the Helmholtz equation involving integral equations
Trefftz-DG solution to the Helmholtz equation involving integral equations H. Barucq, A. Bendali, M. Fares, V. Mattesi, S. Tordeux Magique 3D Inria Bordeaux Sud Ouest LMA UMR CNRS 5142 INSA of Toulouse
More informationNonlinear Diffusion. 1 Introduction: Motivation for non-standard diffusion
Nonlinear Diffusion These notes summarize the way I present this material, for my benefit. But everything in here is said in more detail, and better, in Weickert s paper. 1 Introduction: Motivation for
More informationCN780 Final Lecture. Low-Level Vision, Scale-Space, and Polyakov Action. Neil I. Weisenfeld
CN780 Final Lecture Low-Level Vision, Scale-Space, and Polyakov Action Neil I. Weisenfeld Department of Cognitive and Neural Systems Boston University chapter 14.2-14.3 May 9, 2005 p.1/25 Introduction
More informationContinuum Modeling of Transportation Networks with Differential Equations
with Differential Equations King Abdullah University of Science and Technology Thuwal, KSA Examples of transportation networks The Silk Road Examples of transportation networks Painting by Latifa Echakhch
More informationFinal Exam May 4, 2016
1 Math 425 / AMCS 525 Dr. DeTurck Final Exam May 4, 2016 You may use your book and notes on this exam. Show your work in the exam book. Work only the problems that correspond to the section that you prepared.
More informationEfficient Beltrami Filtering of Color Images via Vector Extrapolation
Efficient Beltrami Filtering of Color Images via Vector Extrapolation Lorina Dascal, Guy Rosman, and Ron Kimmel Computer Science Department, Technion, Institute of Technology, Haifa 32000, Israel Abstract.
More informationReconstruction from Digital Holograms by Statistical Methods
Reconstruction from Digital Holograms by Statistical Methods Saowapak Sotthivirat Jeffrey A. Fessler EECS Department The University of Michigan 2003 Asilomar Nov. 12, 2003 Acknowledgements: Brian Athey,
More informationSparse Approximation: from Image Restoration to High Dimensional Classification
Sparse Approximation: from Image Restoration to High Dimensional Classification Bin Dong Beijing International Center for Mathematical Research Beijing Institute of Big Data Research Peking University
More informationDigital Matting. Outline. Introduction to Digital Matting. Introduction to Digital Matting. Compositing equation: C = α * F + (1- α) * B
Digital Matting Outline. Introduction to Digital Matting. Bayesian Matting 3. Poisson Matting 4. A Closed Form Solution to Matting Presenting: Alon Gamliel,, Tel-Aviv University, May 006 Introduction to
More informationNumerical approximation for optimal control problems via MPC and HJB. Giulia Fabrini
Numerical approximation for optimal control problems via MPC and HJB Giulia Fabrini Konstanz Women In Mathematics 15 May, 2018 G. Fabrini (University of Konstanz) Numerical approximation for OCP 1 / 33
More informationM3: Multiple View Geometry
M3: Multiple View Geometry L18: Projective Structure from Motion: Iterative Algorithm based on Factorization Based on Sections 13.4 C. V. Jawahar jawahar-at-iiit.net Mar 2005: 1 Review: Reconstruction
More informationPart I. Discrete Models. Part I: Discrete Models. Scientific Computing I. Motivation: Heat Transfer. A Wiremesh Model (2) A Wiremesh Model
Part I: iscrete Models Scientific Computing I Module 5: Heat Transfer iscrete and Continuous Models Tobias Neckel Winter 04/05 Motivation: Heat Transfer Wiremesh Model A Finite Volume Model Time ependent
More informationMathematical Methods - Lecture 9
Mathematical Methods - Lecture 9 Yuliya Tarabalka Inria Sophia-Antipolis Méditerranée, Titane team, http://www-sop.inria.fr/members/yuliya.tarabalka/ Tel.: +33 (0)4 92 38 77 09 email: yuliya.tarabalka@inria.fr
More informationSolving a magnetic diffusion equation by the Mixed Hybrid Finite Element method.
Solving a magnetic diffusion equation by the Mixed Hybrid Finite Element method. Corinne Aymard, Christophe Fochesato CEA, DAM, DIF, F-91297 Arpajon CEA/DAM/DIF 6 juillet 2010 1 Outline Objectives Model
More informationIterative Methods for Ill-Posed Problems
Iterative Methods for Ill-Posed Problems Based on joint work with: Serena Morigi Fiorella Sgallari Andriy Shyshkov Salt Lake City, May, 2007 Outline: Inverse and ill-posed problems Tikhonov regularization
More informationFinite Difference Methods for Boundary Value Problems
Finite Difference Methods for Boundary Value Problems October 2, 2013 () Finite Differences October 2, 2013 1 / 52 Goals Learn steps to approximate BVPs using the Finite Difference Method Start with two-point
More informationMarkov Point Process for Multiple Object Detection
Markov Point Process for Multiple Object Detection Xavier Descombes INRIA Sophia Antipolis Méditerranée 24/06/2013 Outline Motivation The different issues : - objects - reference measure - prior - data
More informationA Robust Preconditioner for the Hessian System in Elliptic Optimal Control Problems
A Robust Preconditioner for the Hessian System in Elliptic Optimal Control Problems Etereldes Gonçalves 1, Tarek P. Mathew 1, Markus Sarkis 1,2, and Christian E. Schaerer 1 1 Instituto de Matemática Pura
More informationMultigrid Methods and their application in CFD
Multigrid Methods and their application in CFD Michael Wurst TU München 16.06.2009 1 Multigrid Methods Definition Multigrid (MG) methods in numerical analysis are a group of algorithms for solving differential
More informationSingle Exposure Enhancement and Reconstruction. Some slides are from: J. Kosecka, Y. Chuang, A. Efros, C. B. Owen, W. Freeman
Single Exposure Enhancement and Reconstruction Some slides are from: J. Kosecka, Y. Chuang, A. Efros, C. B. Owen, W. Freeman 1 Reconstruction as an Inverse Problem Original image f Distortion & Sampling
More informationChapter 6. Finite Element Method. Literature: (tiny selection from an enormous number of publications)
Chapter 6 Finite Element Method Literature: (tiny selection from an enormous number of publications) K.J. Bathe, Finite Element procedures, 2nd edition, Pearson 2014 (1043 pages, comprehensive). Available
More informationMean field games and related models
Mean field games and related models Fabio Camilli SBAI-Dipartimento di Scienze di Base e Applicate per l Ingegneria Facoltà di Ingegneria Civile ed Industriale Email: Camilli@dmmm.uniroma1.it Web page:
More informationA mathematical model and inversion procedure for Magneto-Acousto-Electric Tomography (MAET)
A mathematical model and inversion procedure for Magneto-Acousto-Electric Tomography (MAET) Leonid Kunyansky University of Arizona, Tucson, AZ Suppported in part by NSF grant DMS-0908243 NSF grant "we
More informationA very short introduction to the Finite Element Method
A very short introduction to the Finite Element Method Till Mathis Wagner Technical University of Munich JASS 2004, St Petersburg May 4, 2004 1 Introduction This is a short introduction to the finite element
More informationCS 4495 Computer Vision Principle Component Analysis
CS 4495 Computer Vision Principle Component Analysis (and it s use in Computer Vision) Aaron Bobick School of Interactive Computing Administrivia PS6 is out. Due *** Sunday, Nov 24th at 11:55pm *** PS7
More informationADI iterations for. general elliptic problems. John Strain Mathematics Department UC Berkeley July 2013
ADI iterations for general elliptic problems John Strain Mathematics Department UC Berkeley July 2013 1 OVERVIEW Classical alternating direction implicit (ADI) iteration Essentially optimal in simple domains
More informationIntroduction to Boundary Value Problems
Chapter 5 Introduction to Boundary Value Problems When we studied IVPs we saw that we were given the initial value of a function and a differential equation which governed its behavior for subsequent times.
More informationStructure from Motion. CS4670/CS Kevin Matzen - April 15, 2016
Structure from Motion CS4670/CS5670 - Kevin Matzen - April 15, 2016 Video credit: Agarwal, et. al. Building Rome in a Day, ICCV 2009 Roadmap What we ve seen so far Single view modeling (1 camera) Stereo
More informationINTRODUCTION TO PDEs
INTRODUCTION TO PDEs In this course we are interested in the numerical approximation of PDEs using finite difference methods (FDM). We will use some simple prototype boundary value problems (BVP) and initial
More informationM.Sc. in Meteorology. Numerical Weather Prediction
M.Sc. in Meteorology UCD Numerical Weather Prediction Prof Peter Lynch Meteorology & Climate Centre School of Mathematical Sciences University College Dublin Second Semester, 2005 2006. In this section
More informationMath background. Physics. Simulation. Related phenomena. Frontiers in graphics. Rigid fluids
Fluid dynamics Math background Physics Simulation Related phenomena Frontiers in graphics Rigid fluids Fields Domain Ω R2 Scalar field f :Ω R Vector field f : Ω R2 Types of derivatives Derivatives measure
More informationTable of Contents. II. PDE classification II.1. Motivation and Examples. II.2. Classification. II.3. Well-posedness according to Hadamard
Table of Contents II. PDE classification II.. Motivation and Examples II.2. Classification II.3. Well-posedness according to Hadamard Chapter II (ContentChapterII) Crashtest: Reality Simulation http:www.ara.comprojectssvocrownvic.htm
More informationLarge-Scale L1-Related Minimization in Compressive Sensing and Beyond
Large-Scale L1-Related Minimization in Compressive Sensing and Beyond Yin Zhang Department of Computational and Applied Mathematics Rice University, Houston, Texas, U.S.A. Arizona State University March
More informationThe Deep Ritz method: A deep learning-based numerical algorithm for solving variational problems
The Deep Ritz method: A deep learning-based numerical algorithm for solving variational problems Weinan E 1 and Bing Yu 2 arxiv:1710.00211v1 [cs.lg] 30 Sep 2017 1 The Beijing Institute of Big Data Research,
More informationComputer Vision Motion
Computer Vision Motion Professor Hager http://www.cs.jhu.edu/~hager 12/1/12 CS 461, Copyright G.D. Hager Outline From Stereo to Motion The motion field and optical flow (2D motion) Factorization methods
More informationControl of Interface Evolution in Multi-Phase Fluid Flows
Control of Interface Evolution in Multi-Phase Fluid Flows Markus Klein Department of Mathematics University of Tübingen Workshop on Numerical Methods for Optimal Control and Inverse Problems Garching,
More informationENGI 4430 PDEs - d Alembert Solutions Page 11.01
ENGI 4430 PDEs - d Alembert Solutions Page 11.01 11. Partial Differential Equations Partial differential equations (PDEs) are equations involving functions of more than one variable and their partial derivatives
More informationOptimal stopping time formulation of adaptive image filtering
Optimal stopping time formulation of adaptive image filtering I. Capuzzo Dolcetta, R. Ferretti 19.04.2000 Abstract This paper presents an approach to image filtering based on an optimal stopping time problem
More informationPartial Differential Equations
M3M3 Partial Differential Equations Solutions to problem sheet 3/4 1* (i) Show that the second order linear differential operators L and M, defined in some domain Ω R n, and given by Mφ = Lφ = j=1 j=1
More informationSatellite image deconvolution using complex wavelet packets
Satellite image deconvolution using complex wavelet packets André Jalobeanu, Laure Blanc-Féraud, Josiane Zerubia ARIANA research group INRIA Sophia Antipolis, France CNRS / INRIA / UNSA www.inria.fr/ariana
More information13 PDEs on spatially bounded domains: initial boundary value problems (IBVPs)
13 PDEs on spatially bounded domains: initial boundary value problems (IBVPs) A prototypical problem we will discuss in detail is the 1D diffusion equation u t = Du xx < x < l, t > finite-length rod u(x,
More informationFourier series on triangles and tetrahedra
Fourier series on triangles and tetrahedra Daan Huybrechs K.U.Leuven Cambridge, Sep 13, 2010 Outline Introduction The unit interval Triangles, tetrahedra and beyond Outline Introduction The topic of this
More informationThe Conjugate Gradient Method
The Conjugate Gradient Method Jason E. Hicken Aerospace Design Lab Department of Aeronautics & Astronautics Stanford University 14 July 2011 Lecture Objectives describe when CG can be used to solve Ax
More informationHigh-order finite volume method for curved boundaries and non-matching domain-mesh problems
High-order finite volume method for curved boundaries and non-matching domain-mesh problems May 3-7, 0, São Félix, Portugal Ricardo Costa,, Stéphane Clain,, Gaspar J. Machado, Raphaël Loubère Institut
More informationIn this chapter we study elliptical PDEs. That is, PDEs of the form. 2 u = lots,
Chapter 8 Elliptic PDEs In this chapter we study elliptical PDEs. That is, PDEs of the form 2 u = lots, where lots means lower-order terms (u x, u y,..., u, f). Here are some ways to think about the physical
More informationTwo special equations: Bessel s and Legendre s equations. p Fourier-Bessel and Fourier-Legendre series. p
LECTURE 1 Table of Contents Two special equations: Bessel s and Legendre s equations. p. 259-268. Fourier-Bessel and Fourier-Legendre series. p. 453-460. Boundary value problems in other coordinate system.
More informationMB4018 Differential equations
MB4018 Differential equations Part II http://www.staff.ul.ie/natalia/mb4018.html Prof. Natalia Kopteva Spring 2015 MB4018 (Spring 2015) Differential equations Part II 0 / 69 Section 1 Second-Order Linear
More informationVideo and Motion Analysis Computer Vision Carnegie Mellon University (Kris Kitani)
Video and Motion Analysis 16-385 Computer Vision Carnegie Mellon University (Kris Kitani) Optical flow used for feature tracking on a drone Interpolated optical flow used for super slow-mo optical flow
More informationParallelizing large scale time domain electromagnetic inverse problem
Parallelizing large scale time domain electromagnetic inverse problems Eldad Haber with: D. Oldenburg & R. Shekhtman + Emory University, Atlanta, GA + The University of British Columbia, Vancouver, BC,
More informationWhat Tasks Can Be Performed with an Uncalibrated Stereo Vision System?
In Special Issue on Vision Research at Yale of the Int. J. of Computer Vision, 35(1):65-85, Nov. 1999. What Tasks Can Be Performed with an Uncalibrated Stereo Vision System? J. P. Hespanha, Z. Dodds, G.
More informationDifferential Motion Analysis
Differential Motion Analysis Ying Wu Electrical Engineering and Computer Science Northwestern University, Evanston, IL 60208 yingwu@ece.northwestern.edu http://www.eecs.northwestern.edu/~yingwu July 19,
More informationIntroduction of Partial Differential Equations and Boundary Value Problems
Introduction of Partial Differential Equations and Boundary Value Problems 2009 Outline Definition Classification Where PDEs come from? Well-posed problem, solutions Initial Conditions and Boundary Conditions
More informationRandom walks and anisotropic interpolation on graphs. Filip Malmberg
Random walks and anisotropic interpolation on graphs. Filip Malmberg Interpolation of missing data Assume that we have a graph where we have defined some (real) values for a subset of the nodes, and that
More informationInverse problem and optimization
Inverse problem and optimization Laurent Condat, Nelly Pustelnik CNRS, Gipsa-lab CNRS, Laboratoire de Physique de l ENS de Lyon Decembre, 15th 2016 Inverse problem and optimization 2/36 Plan 1. Examples
More informationSpectral Processing. Misha Kazhdan
Spectral Processing Misha Kazhdan [Taubin, 1995] A Signal Processing Approach to Fair Surface Design [Desbrun, et al., 1999] Implicit Fairing of Arbitrary Meshes [Vallet and Levy, 2008] Spectral Geometry
More informationIntroduction to First Order Equations Sections
A B I L E N E C H R I S T I A N U N I V E R S I T Y Department of Mathematics Introduction to First Order Equations Sections 2.1-2.3 Dr. John Ehrke Department of Mathematics Fall 2012 Course Goals The
More informationEdges and Scale. Image Features. Detecting edges. Origin of Edges. Solution: smooth first. Effects of noise
Edges and Scale Image Features From Sandlot Science Slides revised from S. Seitz, R. Szeliski, S. Lazebnik, etc. Origin of Edges surface normal discontinuity depth discontinuity surface color discontinuity
More informationMultiple View Geometry in Computer Vision
Multiple View Geometry in Computer Vision Prasanna Sahoo Department of Mathematics University of Louisville 1 Scene Planes & Homographies Lecture 19 March 24, 2005 2 In our last lecture, we examined various
More informationCoordinate Update Algorithm Short Course Operator Splitting
Coordinate Update Algorithm Short Course Operator Splitting Instructor: Wotao Yin (UCLA Math) Summer 2016 1 / 25 Operator splitting pipeline 1. Formulate a problem as 0 A(x) + B(x) with monotone operators
More informationComputation Fluid Dynamics
Computation Fluid Dynamics CFD I Jitesh Gajjar Maths Dept Manchester University Computation Fluid Dynamics p.1/189 Garbage In, Garbage Out We will begin with a discussion of errors. Useful to understand
More informationV (r,t) = i ˆ u( x, y,z,t) + ˆ j v( x, y,z,t) + k ˆ w( x, y, z,t)
IV. DIFFERENTIAL RELATIONS FOR A FLUID PARTICLE This chapter presents the development and application of the basic differential equations of fluid motion. Simplifications in the general equations and common
More informationAnnouncements. Tracking. Comptuer Vision I. The Motion Field. = ω. Pure Translation. Motion Field Equation. Rigid Motion: General Case
Announcements Tracking Computer Vision I CSE5A Lecture 17 HW 3 due toda HW 4 will be on web site tomorrow: Face recognition using 3 techniques Toda: Tracking Reading: Sections 17.1-17.3 The Motion Field
More information