CSE 167: Introduction to Computer Graphics Lecture #8: Textures. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2017

Transcription

1 CSE 167: Introduction to Computer Graphics Lecture #8: Textures Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2017

2 Announcements Project 2 is due this Friday at 2pm Next Tuesday during lecture: midterm #1 2

3 Faculty Mentor Program UC San Diego faculty members can support undergraduate research by participating in the Faculty Mentor Program (FMP) and providing an undergraduate an opportunity to serve as a research assistant. In addition to the research experience, students in the program receive two quarters of 199 credit (10h/week), attend training sessions and workshops conducted by Academic Enrichment Programs (AEP), and present their findings at the annual Spring FMP Symposium. Students participating in FMP must have junior or senior standing, and must meet GPA and other requirements. Those faculty members who have a student in mind can refer the student to AEP for formal placement. Faculty members working with more than one student can work with AEP to create a cohort experience for them. Early application is encouraged (students have an application deadline of November 1st). More information is available at fmp.ucsd.edu. 3

4 Matlab project at Shiley Eye Center My name is Rohan Verma, a third-year ophthalmology resident at UCSD Shiley Eye Institute. We are developing a software program using matlab that will ideally become a smartphone application. The goal is to automate the measurement of eyelid contour using iris registration (see attached figure and video). This would allow physicians (ophthalmologist and primary care) to take a photo using a smartphone and be able to determine if there is any abnormality in eyelid position. This would help with early identification of patients at risk of ocular morbidity given eyelid malposition. As well as, help with preoperative planning and patient education. We are looking for someone with programming skills in matlab and ios. Do you know of anyone interested? I feel your experience as the director for UCSD center for visual computing would be able to ideally help us. If so can you please disseminate the and interested parties may respond to me at roverma@ucsd.edu 4

5 Lecture Overview Texture Mapping Overview Wrapping Texture coordinates Anti-aliasing 5

6 Large Triangles Pros: Often sufficient for simple geometry Fast to render Cons: Per vertex colors look boring and computer-generated 6

7 Texture Mapping Map textures (images) onto surface polygons Same triangle count, much more realistic appearance 7

8 Texture Mapping Goal: map locations in texture to locations on 3D geometry Texture coordinate space Texture pixels (texels) have texture coordinates (s,t) Convention Bottom left corner of texture is at (s,t) = (0,0) Top right corner is at (s,t) = (1,1) (1,1) t (0,0) s Texture coordinates 8

9 Texture Mapping Store 2D texture coordinates s,t with each triangle vertex v 1 (s,t) = (0.65,0.75) (1,1) v 0 (s,t) = (0.6,0.4) (0.65,0.75) v 2 (s,t) = (0.4,0.45) Triangle in any space before projection t (0.4,0.45) (0.6,0.4) 9 (0,0) Texture coordinates s

10 Texture Mapping Each point on triangle gets color from its corresponding point in texture v 1 (s,t) = (0.65,0.75) (1,1) (0.65,0.75) v 0 (s,t) = (0.6,0.4) t (0.4,0.45) (0.6,0.4) v 2 (s,t) = (0.4,0.45) Triangle in any space before projection (0,0) Texture coordinates s 10

11 Texture Mapping Primitives Modeling and viewing transformation Shading Projection Rasterization Fragment processing Includes texture mapping Frame-buffer access (z-buffering) 11 Image

12 Texture Look-Up Given interpolated texture coordinates (s, t) at current pixel Closest four texels in texture space are at (s 0,t 0 ), (s 1,t 0 ), (s 0,t 1 ), (s 1,t 1 ) How to compute pixel color? t 1 t t 0 s 0 s s 1 12

13 Nearest-Neighbor Interpolation Use color of closest texel t 1 t t 0 s 0 s s 1 Simple, but low quality and aliasing 13

14 Bilinear Interpolation 1. Linear interpolation horizontally: Ratio in s direction r s : s s0 r s = s s 1 0 c top = tex(s 0,t 1 ) (1-r s ) + tex(s 1,t 1 ) r s c bot = tex(s 0, t 0 ) (1-r s ) + tex(s 1,t 0 ) r s t 1 t c top c bot t 0 s 0 s s 1 14

15 Bilinear Interpolation 2. Linear interpolation vertically Ratio in t direction r t : t t0 r t = t1 t0 c = c bot (1-r t ) + c top r t t 1 c top t c c bot t 0 s 0 s s 1 15

16 Texture Filtering in OpenGL GL_NEAREST: Nearest-Neighbor interpolation GL_LINEAR: Bilinear interpolation Example: gltexparameteri(gl_texture_2d, GL_TEXTURE_MIN_FILTER, GL_LINEAR); gltexparameteri(gl_texture_2d, GL_TEXTURE_MAG_FILTER, GL_LINEAR); Source: 16

17 Lecture Overview Texture Mapping Wrapping Texture coordinates Anti-aliasing 17

18 Wrap Modes Texture image extends from [0,0] to [1,1] in texture space What if (s,t) texture coordinates are beyond that range? Texture wrap modes 18

19 Repeat Repeat the texture Creates discontinuities at edges unless texture is designed to line up (1,1) t (0,0) s Seamless brick wall texture (by Christopher Revoir) 19 Texture Space

20 Clamp Use edge value everywhere outside data range [0..1] Or use specified border color outside of range [0..1] (1,1) t (0,0) s 20 Texture Space

21 Wrap Modes in OpenGL Default: gltexparameterf( GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT ); gltexparameterf( GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT ); Options for wrap mode: GL_REPEAT GL_MIRRORED_REPEAT GL_CLAMP_TO_EDGE: repeats last pixel in the texture GL_CLAMP_TO_BORDER: requires border color to be set 21 Source:

22 Lecture Overview Texture Mapping Wrapping Texture coordinates Anti-aliasing 22

23 Texture Coordinates What if texture extends across multiple polygons? Surface parameterization Mapping between 3D positions on surface and 2D texture coordinates Defined by texture coordinates of triangle vertices Options for mapping: Cylindrical Spherical Orthographic Parametric Skin 23

24 Cylindrical Mapping Similar to spherical mapping, but with cylindrical coordinates 24

25 Spherical Mapping Use spherical coordinates Shrink-wrap sphere to object Texture map Mapping result 25

26 Orthographic Mapping Use linear transformation of object s xyz coordinates Example: 26 = w z y x t s xyz in object space xyz in camera space

27 Parametric Mapping Surface given by parametric functions Very common in CAD Clamp (u,v) parameters to [0..1] and use as texture coordinates (s,t) 27

28 Skin Mapping 28

29 Lecture Overview Texture Mapping Wrapping Texture coordinates Anti-aliasing 29

30 Aliasing What could cause this aliasing effect? 30

31 Aliasing Sufficiently sampled, no aliasing Insufficiently sampled, aliasing Image: Robert L. Cook High frequencies in the input data can appear as lower frequencies in the sampled signal 31

32 Antialiasing: Intuition Pixel may cover large area on triangle in camera space Corresponds to many texels in texture space Need to compute average Image plane Camera space Texture space Texels Pixel area 32

33 Antialiasing Using Mip-Maps Averaging over texels is expensive Many texels as objects get smaller Large memory access and compuation cost Precompute filtered (averaged) textures Mip-maps Practical solution to aliasing problem Fast and simple Available in OpenGL, implemented in GPUs Reasonable quality 33

34 Mipmaps MIP stands for multum in parvo = much in little (Williams 1983) Before rendering Pre-compute and store down scaled versions of textures Reduce resolution by factors of two successively Use high quality filtering (averaging) scheme Increases memory cost by 1/3 1/3 = ¼+1/16+1/64+ Width and height of texture should be powers of two (nonpower of two supported since OpenGL 2.0) 34

35 Mipmaps Example: resolutions 512x512, 256x256, 128x128, 64x64, 32x32 pixels Level 1 35 Level multum in parvo

36 Mipmaps One texel in level 4 is the average of 4 4 =256 texels in level 0 Level 1 36 Level multum in parvo

37 Mipmaps Level 0 Level 1 Level 2 37 Level 3 Level 4

38 Rendering With Mipmaps Mipmapping Interpolate texture coordinates of each pixel as without mipmapping Compute approximate size of pixel in texture space Look up color in nearest mipmap E.g., if pixel corresponds to 10x10 texels use mipmap level 3 Use nearest neighbor or bilinear interpolation as before 38

39 Mipmapping Image plane Camera space Texture space Texels Pixel area 39 Mip-map level 0 Mip-map level 1 Mip-map level 2 Mip-map level 3

40 Nearest Mipmap, Nearest Neighbor Visible transition between mipmap levels 40

41 Nearest Mipmap, Bilinear Visible transition between mipmap levels 41

42 Trilinear Mipmapping Use two nearest mipmap levels E.g., if pixel corresponds to 10x10 texels, use mipmap levels 3 (8x8) and 4 (16x16) 2-Step approach: Step 1: perform bilinear interpolation in both mip-maps Step 2: linearly interpolate between the results Requires access to 8 texels for each pixel Supported by hardware without performance penalty 42

43 Addendum: Anisotropic Filtering Method of enhancing the image quality of textures on surfaces that are at oblique viewing angles Different degrees or ratios of anisotropic filtering can be applied The degree refers to the maximum ratio of anisotropy supported by the filtering process. For example, 4:1 anisotropic filtering supports presampled textures up to four times wider than tall 43

44 More Info Mipmapping tutorial w/source code: 44

45 OpenGL Example: Loading a Texture // Loads image as texture, returns ID of texture GLuint loadtexture(image* image) { GLuint textureid; glgentextures(1, &textureid); // Get unique ID for texture glbindtexture(gl_texture_2d, textureid); // Tell OpenGL which texture to edit gltexparameteri(gl_texture_2d, GL_TEXTURE_MIN_FILTER, GL_LINEAR); // set bi-linear interpolation gltexparameteri(gl_texture_2d, GL_TEXTURE_MAG_FILTER, GL_LINEAR); // for both filtering modes gltexparameteri(gl_texture_2d, GL_TEXTURE_WRAP_S, GL_CLAMP_TO_EDGE); // set texture edge mode gltexparameteri(gl_texture_2d, GL_TEXTURE_WRAP_T, GL_CLAMP_TO_EDGE); Image* image = loadjpg( photo.jpg"); // load image from disk; uses third party Image library // Depending on the image library, the texture image may have to be flipped vertically // Load image into OpenGL texture in GPU memory: glteximage2d(gl_texture_2d, // Always GL_TEXTURE_2D for image textures 0, // 0 for now GL_RGB, // Format OpenGL uses for image without alpha channel image->width, image->height, // Width and height 0, // The border of the image GL_RGB, // GL_RGB, because pixels are stored in RGB format GL_UNSIGNED_BYTE, // GL_UNSIGNED_BYTE, because pixels are stored as unsigned numbers image->pixels); // The actual RGB image data } return textureid; // Return the ID of the texture 45

46 Vertex Shader #version 150 in vec3 vert; in vec2 verttexcoord; out vec2 fragtexcoord; void main() { // Pass the tex coord straight through to the fragment shader fragtexcoord = verttexcoord; } gl_position = vec4(vert, 1); 46

47 Fragment Shader #version 150 uniform sampler2d tex; // this is the texture in vec2 fragtexcoord; // these are the texture coordinates out vec4 finalcolor; // this is the output color of the pixel void main() { finalcolor = texture(tex, fragtexcoord); } 47