DOCSLIB.ORG

Geometry and Learning Co-Supported Normal Estimation for Unstructured Point Cloud

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Geometry and Learning Co-Supported Normal Estimation for Unstructured Point Cloud Geometry and Learning Co-supported Normal Estimation for Unstructured Point Cloud Haoran Zhou1,2∗ Honghua Chen1∗ Yidan Feng1,2 Qiong Wang3 Jing Qin4 Haoran Xie5 Fu Lee Wang6 Mingqiang Wei1,2† Jun Wang1† 1Nanjing University of Aeronautics and Astronautics 2MIIT Key Laboratory of Pattern Analysis and Machine Intelligence 3Shenzhen Institutes of Advanced Technology 4The Hong Kong Polytechnic University 5Lingnan University 6The Open University of Hong Kong Abstract crucial task for unstructured point cloud. The problem of normal estimation has been extensively In this paper, we propose a normal estimation method researched, yet not well-solved. We can roughly divide ex- for unstructured point cloud. We observe that geometric es- isting normal estimation techniques into two categories: tra- timators commonly focus more on feature preservation but ditional methods and learning-based methods. Traditional are hard to tune parameters and sensitive to noise, while ones usually utilize several elaborately-designed regulari- learning-based approaches pursue an overall normal es- ties to preserve/recover sharp features, while learning-based timation accuracy but cannot well handle challenging re- methods pursue to learn a general mapping from noisy gions such as surface edges. This paper presents a novel inputs to ground truths. However, no existing algorithm normal estimation method, under the co-support of geomet- can serve as a normal estimation panacea: 1) Traditional ric estimator and deep learning. To lowering the learning methods always heavily rely on parameters tuning, like the difficulty, we first propose to compute a suboptimal initial neighborhood scale for plane fitting [31, 32]; 2) Learning- normal at each point by searching for a best fitting patch. based techniques, either using the convolutional neural net- Based on the computed normal field, we design a normal- works (CNN) architecture [6, 4], or the PointNet architec- based height map network (NH-Net) to fine-tune the sub- ture [15, 33], are both limited by the ability of feature rep- optimal normals. Qualitative and quantitative evaluations resentation. It is, therefore, hard to learn a straightforward demonstrate the clear improvements of our results over both mapping from severely degraded inputs to the ground-truth traditional methods and learning-based methods, in terms normals, especially in sharp feature regions. of estimation accuracy and feature recovery. Motivated by these challenges, in this work, we pro- pose a two-stage normal estimation method for unstruc- 1. Introduction tured 3D point clouds. The key idea of our approach is to solve the ill-posed normal estimation problem via two Various kinds of 3D laser scanners and depth cam- sub-steps: 1) computing a suboptimal intermediate normal eras have emerged in recent decades, making point clouds field with features as well-preserved as possible, by a ge- move into the focus of many practical applications, such ometric estimator; 2) formulating the final normal recov- as robotic grasping [20], 3D reconstruction [11], and au- ery procedure as a regression function that maps the in- tonomous driving [24]. Commonly, the scanned point termediate normal results to their ground truths. In detail, clouds only contain points’ spatial location information as- for lowering the difficulty of normal learning in challeng- sociated with the noise, incompleteness and sampling irreg- ing regions, we present a multi-scale fitting patch selection ularity, while lacking local surface geometry properties, like (MFPS) scheme to help estimate a suboptimal normal field, point normals. Quality normals can facilitate a huge amount which contributes more on the feature preservation. Since of downstream tasks, for example, point cloud consolida- in some challenging regions, where parameters are hard to tion [10], surface reconstruction [13], and model segmen- be tuned, the initial normals are still imperfect, we then de- tation [8]. Hence, estimating normals is an inevitable and sign a normal-based height map network (NH-Net), which ∗Co-first authors utilizes both the above estimated normals and the local sur- †Co-corresponding authors (mqwei/[email protected]) face information to obtain the final optimal normals. We 13238 Figure 1. The pipeline of our normal estimation method. We first compute the suboptimal normal at each point via multi-scale fitting patch selection (MFPS). Then, a multi-scale point descriptor is constructed based on bilateral normal filters (BNF) and local height-map patches (HMPs). Our NH-Net, consisting of an HMP-based module and a gathering module, receives MPDs and produces the final normal. experimentally prove that the combination of the geometric of method cannot well estimate the normals of points near/ estimator scheme and the learning-based recovery scheme on sharp features. Based on the observation that the neigh- outperforms either of them. bors belonging to different surface patches should be dis- Our main contributions are three-fold: carded, recent works dedicated to selecting a plane approx- • We design a two-stage normal estimation method by imating the neighbors from the same surface patch to esti- collaborating geometric estimator and deep neural network, mate normals [19, 32, 30, 31]. Under the assumption that which shows clear improvements over the state-of-the-arts. surfaces commonly are composed of piecewise flat patches, • We propose a multi-scale fitting patch selection sparsity-based methods [3, 28, 9] show impressive results, scheme, which can produce a feature-preserving initial nor- especially in sharp feature preservation. Some other meth- mal field as an input of the following recovery network. ods like Hough Transform [5] also yield pleasing results. • We propose a normal refining network (NH-Net), 2.2. Learning•based normal estimator which is able to compensate the imperfection of the sub- optimal normal results computed in the first step. Recently, learning-based methods gradually show its power for normal estimation. Boulch et al. [6] proposed 2. Related work to project a discretized Hough space representing normal directions onto a structure amenable to CNN-based deep Normal estimation for point clouds is a long-standing learning. Roveri et al. [26] defined a grid-like regular input problem in academic. We will review previous researches to the CNN to learn ideal normal results. Ben-Shabat et al. from traditional normal estimators to recent prevalent [4] presented a method that approximates the local normal learning-based techniques. vector using a point-wise, multi-scale 3D modified Fisher 2.1. Traditional normal estimator Vector representation which serves as an input to a deep 3D CNN architecture. In addition, they learn the neighborhood The simplest and best-known method for normal estima- size that minimizes the normal estimation error using a mix- tion is based on the Principal Component Analysis (PCA) ture of experts. The key of the three methods lies in param- [17], by analyzing the covariance in a local structure around eterizing the unstructured point cloud into a regular domain a point and defining the normal as the eigenvector corre- for directly applying the CNN architecture. Another point sponding to the smallest eigenvalue. Following this work, cloud learning framework, namely PointNet [25], becomes a lot of variants have been proposed [23, 7, 14]. In par- very popular in 3D domain, since it can directly learn fea- ticular, Mitra et al. [23] analyzed the effects of neighbor- tures from data of points. Inspired by it, Guerrero et al. [15] hood size, curvature, sampling density, and noise for esti- proposed a unified method for estimating normals and prin- mating normals. Another kind of normal estimation method cipal curvature values in noisy point clouds. This approach is based on Voronoi cells [2, 12, 1, 22]. However, this kind is based on a modification of the PointNet architecture, in 13239 points to construct a set of candidate planes and pick up one that best describes the underlying surface patch. Typ- ical methods are RNE [19] and PCV [31], in which they introduce a residual bandwidth to evaluate proximity of the candidate planes to the underlying surface. However, when they come to noisy inputs, the neighborhood of the target point for detecting candidate plane is often corrupted by (a) Noisy input (b) RNE [19] (c) PCV [31] (d) Ours points from another side of the intersection. This causes the selected plane deviating from the true surface (Fig. 2(b)). Figure 2. Comparison of the selected planes by different methods. PCV is better but still imperfect (Fig. 2(c)). From the left column to the rightmost: Noisy input, and the plane fitting results of RNE, PCV and our method. Red points represent 4.1. Fitting patch selection the noisy input and blue star in the first column is the target point. The green line means the selected plane and the blue points are Considering the problems stated above, we propose to neighbors considered to fit this plane in the corresponding method. select a more consistent and flexible neighborhood which We can easily observe that our method can select the most suitable provides better local structure information for robust normal plane, with the help of better neighboring information. estimation. For each candidate point pi, our method tries to find the best fitting patch that contains pi. Please note normals of smooth points are already computed by PCA. which they place special emphasis on extracting local prop- First, for each point in a point cloud, we define a local erties of a patch around a given central point. By leverag- pj patch Qj (the K-nearest neighboring points of pj). Then, ing both the PointNet and 3DCNN, Hashimoto et al. [16] ∗ the fitting plane θ of each Qj is determined by the fol- proposed a joint network that can accurately infer normal Qj lowing objective function: vectors from a point cloud. Based on the PointNet architec- ture, Zhou et al. [33] introduced an extra feature constraint 1 k mechanism and a multi-scale neighborhood selection strat- EQj (θ)= X Wσj (pj ,θ), (1) |Qj| pk Q egy to estimate normals for 3D point clouds.
Load more

Recommended publications
  • Glossary Physics (I-Introduction)
    1 Glossary Physics (I-introduction) - Efficiency: The percent of the work put into a machine that is converted into useful work output; = work done / energy used [-]. = eta In machines: The work output of any machine cannot exceed the work input (<=100%); in an ideal machine, where no energy is transformed into heat: work(input) = work(output), =100%. Energy: The property of a system that enables it to do work. Conservation o. E.: Energy cannot be created or destroyed; it may be transformed from one form into another, but the total amount of energy never changes. Equilibrium: The state of an object when not acted upon by a net force or net torque; an object in equilibrium may be at rest or moving at uniform velocity - not accelerating. Mechanical E.: The state of an object or system of objects for which any impressed forces cancels to zero and no acceleration occurs. Dynamic E.: Object is moving without experiencing acceleration. Static E.: Object is at rest.F Force: The influence that can cause an object to be accelerated or retarded; is always in the direction of the net force, hence a vector quantity; the four elementary forces are: Electromagnetic F.: Is an attraction or repulsion G, gravit. const.6.672E-11[Nm2/kg2] between electric charges: d, distance [m] 2 2 2 2 F = 1/(40) (q1q2/d ) [(CC/m )(Nm /C )] = [N] m,M, mass [kg] Gravitational F.: Is a mutual attraction between all masses: q, charge [As] [C] 2 2 2 2 F = GmM/d [Nm /kg kg 1/m ] = [N] 0, dielectric constant Strong F.: (nuclear force) Acts within the nuclei of atoms: 8.854E-12 [C2/Nm2] [F/m] 2 2 2 2 2 F = 1/(40) (e /d ) [(CC/m )(Nm /C )] = [N] , 3.14 [-] Weak F.: Manifests itself in special reactions among elementary e, 1.60210 E-19 [As] [C] particles, such as the reaction that occur in radioactive decay.
    [Show full text]
  • Surface Regularized Geometry Estimation from a Single Image
    SURGE: Surface Regularized Geometry Estimation from a Single Image Peng Wang1 Xiaohui Shen2 Bryan Russell2 Scott Cohen2 Brian Price2 Alan Yuille3 1University of California, Los Angeles 2Adobe Research 3Johns Hopkins University Abstract This paper introduces an approach to regularize 2.5D surface normal and depth predictions at each pixel given a single input image. The approach infers and reasons about the underlying 3D planar surfaces depicted in the image to snap predicted normals and depths to inferred planar surfaces, all while maintaining fine detail within objects. Our approach comprises two components: (i) a four- stream convolutional neural network (CNN) where depths, surface normals, and likelihoods of planar region and planar boundary are predicted at each pixel, followed by (ii) a dense conditional random field (DCRF) that integrates the four predictions such that the normals and depths are compatible with each other and regularized by the planar region and planar boundary information. The DCRF is formulated such that gradients can be passed to the surface normal and depth CNNs via backpropagation. In addition, we propose new planar-wise metrics to evaluate geometry consistency within planar surfaces, which are more tightly related to dependent 3D editing applications. We show that our regularization yields a 30% relative improvement in planar consistency on the NYU v2 dataset [24]. 1 Introduction Recent efforts to estimate the 2.5D layout of a depicted scene from a single image, such as per-pixel depths and surface normals, have yielded high-quality outputs respecting both the global scene layout and fine object detail [2, 6, 7, 29]. Upon closer inspection, however, the predicted depths and normals may fail to be consistent with the underlying surface geometry.
    [Show full text]
  • CS 468 (Spring 2013) — Discrete Differential Geometry 1 the Unit Normal Vector of a Surface. 2 Surface Area
    CS 468 (Spring 2013) | Discrete Differential Geometry Lecture 7 Student Notes: The Second Fundamental Form Lecturer: Adrian Butscher; Scribe: Soohark Chung 1 The unit normal vector of a surface. Figure 1: Normal vector of level set. • The normal line is a geometric feature. The normal direction is not (think of a non-orientable surfaces such as a mobius strip). If possible, you want to pick normal directions that are consistent globally. For example, for a manifold, you can pick normal directions pointing out. • Locally, you can find a normal direction using tangent vectors (though you can't extend this globally). • Normal vector of a parametrized surface: E1 × E2 If TpS = spanfE1;E2g then N := kE1 × E2k This is just the cross product of two tangent vectors normalized by it's length. Because you take the cross product of two vectors, it is orthogonal to the tangent plane. You can see that your choice of tangent vectors and their order determines the direction of the normal vector. • Normal vector of a level set: > [DFp] N := ? TpS kDFpk This is because the gradient at any point is perpendicular to the level set. This makes sense intuitively if you remember that the gradient is the "direction of the greatest increase" and that the value of the level set function stays constant along the surface. Of course, you also have to normalize it to be unit length. 2 Surface Area. • We want to be able to take the integral of the surface. One approach to the problem may be to inegrate a parametrized surface in the parameter domain.
    [Show full text]
  • Curl, Divergence and Laplacian
    Curl, Divergence and Laplacian What to know: 1. The definition of curl and it two properties, that is, theorem 1, and be able to predict qualitatively how the curl of a vector field behaves from a picture. 2. The definition of divergence and it two properties, that is, if div F~ 6= 0 then F~ can't be written as the curl of another field, and be able to tell a vector field of clearly nonzero,positive or negative divergence from the picture. 3. Know the definition of the Laplace operator 4. Know what kind of objects those operator take as input and what they give as output. The curl operator Let's look at two plots of vector fields: Figure 1: The vector field Figure 2: The vector field h−y; x; 0i: h1; 1; 0i We can observe that the second one looks like it is rotating around the z axis. We'd like to be able to predict this kind of behavior without having to look at a picture. We also promised to find a criterion that checks whether a vector field is conservative in R3. Both of those goals are accomplished using a tool called the curl operator, even though neither of those two properties is exactly obvious from the definition we'll give. Definition 1. Let F~ = hP; Q; Ri be a vector field in R3, where P , Q and R are continuously differentiable. We define the curl operator: @R @Q @P @R @Q @P curl F~ = − ~i + − ~j + − ~k: (1) @y @z @z @x @x @y Remarks: 1.
    [Show full text]
  • Multidisciplinary Design Project Engineering Dictionary Version 0.0.2
    Multidisciplinary Design Project Engineering Dictionary Version 0.0.2 February 15, 2006 . DRAFT Cambridge-MIT Institute Multidisciplinary Design Project This Dictionary/Glossary of Engineering terms has been compiled to compliment the work developed as part of the Multi-disciplinary Design Project (MDP), which is a programme to develop teaching material and kits to aid the running of mechtronics projects in Universities and Schools. The project is being carried out with support from the Cambridge-MIT Institute undergraduate teaching programe. For more information about the project please visit the MDP website at http://www-mdp.eng.cam.ac.uk or contact Dr. Peter Long Prof. Alex Slocum Cambridge University Engineering Department Massachusetts Institute of Technology Trumpington Street, 77 Massachusetts Ave. Cambridge. Cambridge MA 02139-4307 CB2 1PZ. USA e-mail: [email protected] e-mail: [email protected] tel: +44 (0) 1223 332779 tel: +1 617 253 0012 For information about the CMI initiative please see Cambridge-MIT Institute website :- http://www.cambridge-mit.org CMI CMI, University of Cambridge Massachusetts Institute of Technology 10 Miller’s Yard, 77 Massachusetts Ave. Mill Lane, Cambridge MA 02139-4307 Cambridge. CB2 1RQ. USA tel: +44 (0) 1223 327207 tel. +1 617 253 7732 fax: +44 (0) 1223 765891 fax. +1 617 258 8539 . DRAFT 2 CMI-MDP Programme 1 Introduction This dictionary/glossary has not been developed as a definative work but as a useful reference book for engi- neering students to search when looking for the meaning of a word/phrase. It has been compiled from a number of existing glossaries together with a number of local additions.
    [Show full text]
  • AN INTRODUCTION to the CURVATURE of SURFACES by PHILIP ANTHONY BARILE a Thesis Submitted to the Graduate School-Camden Rutgers
    AN INTRODUCTION TO THE CURVATURE OF SURFACES By PHILIP ANTHONY BARILE A thesis submitted to the Graduate School-Camden Rutgers, The State University Of New Jersey in partial fulfillment of the requirements for the degree of Master of Science Graduate Program in Mathematics written under the direction of Haydee Herrera and approved by Camden, NJ January 2009 ABSTRACT OF THE THESIS An Introduction to the Curvature of Surfaces by PHILIP ANTHONY BARILE Thesis Director: Haydee Herrera Curvature is fundamental to the study of differential geometry. It describes different geometrical and topological properties of a surface in R3. Two types of curvature are discussed in this paper: intrinsic and extrinsic. Numerous examples are given which motivate definitions, properties and theorems concerning curvature. ii 1 1 Introduction For surfaces in R3, there are several different ways to measure curvature. Some curvature, like normal curvature, has the property such that it depends on how we embed the surface in R3. Normal curvature is extrinsic; that is, it could not be measured by being on the surface. On the other hand, another measurement of curvature, namely Gauss curvature, does not depend on how we embed the surface in R3. Gauss curvature is intrinsic; that is, it can be measured from on the surface. In order to engage in a discussion about curvature of surfaces, we must introduce some important concepts such as regular surfaces, the tangent plane, the first and second fundamental form, and the Gauss Map. Sections 2,3 and 4 introduce these preliminaries, however, their importance should not be understated as they lay the groundwork for more subtle and advanced topics in differential geometry.
    [Show full text]
  • Surface Normals and Tangent Planes
    Surface Normals and Tangent Planes Normal and Tangent Planes to Level Surfaces Because the equation of a plane requires a point and a normal vector to the plane, …nding the equation of a tangent plane to a surface at a given point requires the calculation of a surface normal vector. In this section, we explore the concept of a normal vector to a surface and its use in …nding equations of tangent planes. To begin with, a level surface U (x; y; z) = k is said to be smooth if the gradient U = Ux;Uy;Uz is continuous and non-zero at any point on the surface. Equivalently,r h we ofteni write U = Uxex + Uyey + Uzez r where ex = 1; 0; 0 ; ey = 0; 1; 0 ; and ez = 0; 0; 1 : Supposeh now thati r (t) =h x (ti) ; y (t) ; z (t) hlies oni a smooth surface U (x; y; z) = k: Applying the derivative withh respect to t toi both sides of the equation of the level surface yields dU d = k dt dt Since k is a constant, the chain rule implies that U v = 0 r where v = x0 (t) ; y0 (t) ; z0 (t) . However, v is tangent to the surface because it is tangenth to a curve on thei surface, which implies that U is orthogonal to each tangent vector v at a given point on the surface. r That is, U (p; q; r) at a given point (p; q; r) is normal to the tangent plane to r 1 the surface U(x; y; z) = k at the point (p; q; r).
    [Show full text]
  • Tilted Planes and Curvature in Three-Dimensional Space: Explorations of Partial Derivatives
    Tilted Planes and Curvature in Three-Dimensional Space: Explorations of Partial Derivatives By Andrew Grossfield, Ph. D., P. E. Abstract Many engineering students encounter and algebraically manipulate partial derivatives in their fluids, thermodynamics or electromagnetic wave theory courses. However it is possible that unless these students were properly introduced to these symbols, they may lack the insight that could be obtained from a geometric or visual approach to the equations that contain these symbols. We accept the approach that just as the direction of a curve at a point in two-dimensional space is described by the slope of the straight line tangent to the curve at that point, the orientation of a surface at a point in 3-dimensional space is determined by the orientation of the plane tangent to the surface at that point. A straight line has only one direction described by the same slope everywhere along its length; a tilted plane has the same orientation everywhere but has many slopes at each point. In fact the slope in almost every direction leading away from a point is different. How do we conceive of these differing slopes and how can they be evaluated? We are led to conclude that the derivative of a multivariable function is the gradient vector, and that it is wrong and misleading to define the gradient in terms of some kind of limiting process. This approach circumvents the need for all the unnecessary delta-epsilon arguments about obvious results, while providing visual insight into properties of multi-variable derivatives and differentials. This paper provides the visual connection displaying the remarkably simple and beautiful relationships between the gradient, the directional derivatives and the partial derivatives.
    [Show full text]
  • Against 3 N-Dimensional Space
    OUP UNCORRECTED PROOF – FIRST-PROOF, 07/18/12, NEWGEN 7 A g a i n s t 3N - D i m e n s i o n a l S p a c e Bradley Monton 1 Quantum Mechanics Is False Question 1: How many dimensions does space have? I maintain that the answer is “three.” (I recognize the possibility, though, that we live in a three-dimen- sional hypersurface embedded in a higher-dimensional space; I’ll set aside that possibility for the purposes of this chapter.) Why is the answer “three”? I have more to say about this later, but the short version of my argument is that our everyday commonsense constant experience is such that we’re living in three spatial dimensions, and nothing from our experience provides powerful enough reason to give up that prima facie obvious epistemic starting point. (My foils, as you presumably know from reading this volume, are those such as David Albert [1996] who hold that actually space is 3N -dimensional, where N i s t h e n u m - ber of particles [falsely] thought to exist in [nonexistent] three-dimensional space.) Question 2: How many dimensions does space have, according to quantum mechanics? If quantum mechanics were a true theory of the world, then the answer to Question 2 would be the same as the answer to Question 1. But quan- tum mechanics is not true, so the answers need not be the same. Why is quantum mechanics false? Well, our two most fundamental worked-out physical theories, quantum mechanics and general relativity, are incompatible, and the evidence in favor of general relativity suggests that quantum mech- anics is false.
    [Show full text]
  • Normal Curvature of Surfaces in Space Forms
    Pacific Journal of Mathematics NORMAL CURVATURE OF SURFACES IN SPACE FORMS IRWEN VALLE GUADALUPE AND LUCIO LADISLAO RODRIGUEZ Vol. 106, No. 1 November 1983 PACIFIC JOURNAL OF MATHEMATICS Vol. 106, No. 1, 1983 NORMAL CURVATURE OF SURFACES IN SPACE FORMS IRWEN VALLE GUADALUPE AND LUCIO RODRIGUEZ Using the notion of the ellipse of curvature we study compact surfaces in high dimensional space forms. We obtain some inequalities relating the area of the surface and the integral of the square of the norm of the mean curvature vector with topological invariants. In certain cases, the ellipse is a circle; when this happens, restrictions on the Gaussian and normal curvatures give us some rigidity results. n 1. Introduction. We consider immersions /: M -> Q c of surfaces into spaces of constant curvature c. We are going to relate properties of the mean curvature vector H and of the normal curvature KN to geometric properties, such as area and rigidity of the immersion. We use the notion of the ellipse of curvature studied by Little [10], Moore and Wilson [11] and Wong [12]. This is the subset of the normal space defined as (α(X, X): X E TpM, \\X\\ — 1}, where a is the second fundamental form of the immersion and 11 11 is the norm of the vectors. Let χ(M) denote the Euler characteristic of the tangent bundle and χ(N) denote the Euler characteristic of the plane bundle when the codimension is 2. We prove the following generalization of a theorem of Wintgen [13]. n THEOREM 1. Let f\M-*Q cbean isometric immersion of a compact oriented surf ace into an orientable n-dimensional manifold of constant curva- ture c.
    [Show full text]
  • Normal and Geodesic Curvatures, As Well As Some Material About the Second Fundamental Form and the Christoffel Symbols
    Math 120A Discussion Session Week 6 Notes February 14, 2019 This week we'll repeat some of what you heard in lecture about normal and geodesic curvatures, as well as some material about the second fundamental form and the Christoffel symbols. Normal and geodesic curvatures 3 Earlier in the quarter we spent some time defining the curvature κ of a curve in R and then the 2 planar curvature k of a curve in R . The planar curvature allowed us to extract a little more information than the original curvature. For instance, by integrating the planar curvature over a 2 closed curve in R we were able to obtain a topological invariant, the rotation index. The reason we were able to make sense of planar curvature is that in two dimensions we can choose a preferred normal vector for our curves. Specifically, if t(s) was the unit tangent vector to α at α(s) then the unit normal vector was obtained by rotating t(s) 90◦ counterclockwise. 3 Now suppose x: U! R parametrizes a patch on a surface S. So x produces coordinates on S, allowing us to (locally) treat S as the two-dimensional object that it is. In particular, we can use x to choose a preferred normal vector for curves in S. The parametrization x gives us a unit normal vector n(u; v) to our surface S. Let α(s) be a unit-speed curve in S, and let fT; N; Bg be its Frenet-Serret frame. Now consider the vector S(s) := n(α(s)) × T(s): This vector is perpendicular to n | thus tangent to S | and perpendicular to T.
    [Show full text]
  • Advanced Ray Tracing
    Advanced Ray Tracing (Recursive)(Recursive) RayRay TracingTracing AntialiasingAntialiasing MotionMotion BlurBlur DistributionDistribution RayRay TracingTracing RayRay TracingTracing andand RadiosityRadiosity Assumptions • Simple shading (OpenGL, z-buffering, and Phong illumination model) assumes: – direct illumination (light leaves source, bounces at most once, enters eye) – no shadows – opaque surfaces – point light sources – sometimes fog • (Recursive) ray tracing relaxes those assumptions, simulating: – specular reflection – shadows – transparent surfaces (transmission with refraction) – sometimes indirect illumination (a.k.a. global illumination) – sometimes area light sources – sometimes fog Computer Graphics 15-462 3 Ray Types for Ray Tracing Four ray types: – Eye rays: originate at the eye – Shadow rays: from surface point toward light source – Reflection rays: from surface point in mirror direction – Transmission rays: from surface point in refracted direction Computer Graphics 15-462 4 Ray Tracing Algorithm send ray from eye through each pixel compute point of closest intersection with a scene surface shade that point by computing shadow rays spawn reflected and refracted rays, repeat Computer Graphics 15-462 5 Ray Genealogy EYE Eye Obj3 L1 L2 Obj1 Obj1 Obj2 RAY TREE RAY PATHS (BACKWARD) Computer Graphics 15-462 6 Ray Genealogy EYE Eye Obj3 L1 L1 L2 L2 Obj1 T R Obj2 Obj3 Obj1 Obj2 RAY TREE RAY PATHS (BACKWARD) Computer Graphics 15-462 7 Ray Genealogy EYE Eye Obj3 L1 L1 L2 L2 Obj1 T R L1 L1 Obj2 Obj3 Obj1 L2 L2 R T R X X Obj2 X RAY TREE RAY PATHS (BACKWARD) Computer Graphics 15-462 8 When to stop? EYE Obj3 When a ray leaves the scene L1 L2 When its contribution becomes Obj1 small—at each step the contribution is attenuated by the K’s in the illumination model.
    [Show full text]