What is computer graphic?

The science of turning the rules of geometry and physics into (digital) pictures that mean something to people

the formal statement of the meaning or significance of a word,phrase, idiom, etc., as found in dictionaries

an "animated corpse resurrected by mystical means, such as witchcraft"

are visual presentations on some surface, such as a wall, canvas, screen, paper, or stone to brand, inform, illustrate, or entertain.

A vector describes a length and a direction

is one of the basic shapes in geometry

What is a unit vector?

Unit vector is a vector of length 1

Unit vector is a vector of length 0

What is DOT Product of 2 vectors?(select 2 options)

a xb = (ya*zb – za*yb,za*xb – xa*zb ,xa*yb – ya*xb)

What is Cross Product?(select 2 options)

a x b = (ya*zb – za*yb,za*xb – xa*zb ,xa*yb – ya*xb)

|| a x b || = ||a|| * ||b|| * sinα

What represent point at infinity in Homogeneous coordinates.

Points at infinity have their last coordinate equal to zero

Points at infinity have their last coordinate equal to 1

Points at infinity have their last coordinate equal to 5

Points at infinity have their last coordinate equal to 6

What if Polygon Mesh?

A collection of polygons (vertices, edges, faces)

A collection of polyhedrons (vertices, edges, faces)

A collection of vertices (polygons, edges, faces)

A collection of faces (vertices, edges, polyhedrons)

Test

3d-Modeling

Csse 1502 158 preguntas

Hacer el test

Preguntas del test (158)

1What is computer graphic?
1. AThe science of turning the rules of geometry and physics into (digital) pictures that mean something to people
2. Bthe formal statement of the meaning or significance of a word,phrase, idiom, etc., as found in dictionaries
3. Can "animated corpse resurrected by mystical means, such as witchcraft"
4. Dare visual presentations on some surface, such as a wall, canvas, screen, paper, or stone to brand, inform, illustrate, or entertain.
2What is a vector?
1. AA vector describes a length and a direction
2. Bidealization of such objects
3. Cis one of the basic shapes in geometry
4. DI do not know
3What is the length of vector a?
1. A||a|| - length of vector a
2. Ba
3. C|a|
4. D5
4What is a unit vector?
1. AUnit vector is a vector of length 1
2. BUnit vector is a vector of length 0
3. CThere is no such vector
4. DJust vector
5What is DOT Product of 2 vectors?(select 2 options)
1. Aa .b = ||a|| * ||b|| * cosα
2. Ba .b = xa* xb + ya * yb+
3. Ca xb = (ya*zb – za*yb,za*xb – xa*zb ,xa*yb – ya*xb)
4. Dy = m*x + b
6What is Cross Product?(select 2 options)
1. Aa x b = (ya*zb – za*yb,za*xb – xa*zb ,xa*yb – ya*xb)
2. B|| a x b || = ||a|| * ||b|| * sinα
3. Ca .b = ||a|| * ||b|| * cosα
4. Da .b = xa* xb + ya * yb
7Common equation of Explicit Curve Representation.
1. Ay = f(x)
2. By = m*x + b
3. Cf(λ) = (x(λ), y(λ)
4. Df(λ) = (x(λ), y(λ))
8What is Explicit Representation of a 2D line?
1. Ay = m*x + b
2. Bf(λ) = (x(λ), y(λ)
3. Cf(λ) = (x(λ), y(λ))
4. Dy = f(x)
9What is equation of Parametric representation of 2D Curve?
1. Af(λ) = (x(λ), y(λ))
2. By = f(x)
3. Cy = m*x + b
4. Dy=m
10Full equation of Parametric Representation of a Circle.
1. A
2. B
3. C
4. D

11Full equation of Parametric Representation of an Ellipse.
1. A
2. B
3. C
4. D
12Equation of tangent vector.
1. A
2. B
3. C
4. D
13Equation of normal vector in tangent point.
1. A
2. B
3. C
4. D
14Common equation of Implicit Curve Representation
1. A
2. B
3. C
4. D
15Normal Vectors from the Implicit Equation.
1. A
2. B
3. C
4. D
16 Point in 2D Euclidian coordinates
1. A
2. B
3. C
4. D
17Point in Homogeneous coordinates(select 2 options)
1. A
2. B
3. C
4. D
18Coordinates of point P which located at infinity
1. A
2. B
3. C
4. D
19What represent point at infinity in Homogeneous coordinates.
1. APoints at infinity have their last coordinate equal to zero
2. BPoints at infinity have their last coordinate equal to 1
3. CPoints at infinity have their last coordinate equal to 5
4. DPoints at infinity have their last coordinate equal to 6
20Line equation in Homogeneous coordinates
1. A
2. B
3. C
4. D
21Equation of The Line Passing Through 2 Points
1. A
2. B
3. C
4. D
22Equation of Intersection Point of Two Lines
1. A
2. B
3. C
4. D
23Common Equation of General Linear 2D Transformations
1. A
2. B
3. C
4. D
24General form of Affine Transformations Matrix
1. A
2. B
3. C
4. D
25Equation of “Pure” rotation
1. A
2. B
3. C
4. D
26Equation of “Pure” translation
1. A
2. B
3. C
4. D
27Equation of “Pure” reflection
1. A
2. B
3. C
4. D
28Equation of “Pure” uniform scaling
1. A
2. B
3. C
4. D
29Plane Equation in Homogeneous Coordinates
1. Aax + by + cz +d = 0
2. B-ax + by + cz +d = 0
3. Cax + by + dz +d = 0
4. Dax - by + cz +d = 0
30Equation of Elementary Rotations in 3D by θ about x axis.
1. A
2. B
3. C
4. D
31Equation of Elementary Rotations in 3D by θ about y axis.
1. A
2. B
3. C
4. D
32Equation of Elementary Rotations in 3D by θ about z axis.
1. A
2. B
3. C
4. D
33Orthographic Projection Equation in Homogeneous Coordinates
1. A
2. B
3. C
4. D
34Equation of transformation from Canonical view to image.
1. A
2. B
3. C
4. D
35Equation of transformation from Camera to Canonical view.
1. A
2. B
3. C
4. D
36Equation of transformation from World to Camera
1. A
2. B
3. C
4. D
37Equation of transformation from Object to World
1. A
2. B
3. C
4. D
38The Perspective Projection Equations in 3D
1. A
2. B
3. C
4. D
39Thin lens low equation.
1. A
2. B
3. C
4. D
40Equation of parametric representation of planar patch
1. A
2. B
3. C
4. D
41What if Polygon Mesh?
1. AA collection of polyhedrons (vertices, edges, faces)
2. BA collection of polygons (vertices, edges, faces)
3. CA collection of vertices (polygons, edges, faces)
4. DA collection of faces (vertices, edges, polyhedrons)
42Cubic Curve equation for Interpolation with Splines
1. AP(t) = at3 + bt2 + ct
2. BP(t) = at3 + bt2 + d
3. CP(t) = -at3 + bt2 + ct + d
4. DP(t) = at3 + bt2 + ct + d
43Derivative equation of Cubic Hermite Interpolation
1. AP’(t) = 3at2 + 2bt - c
2. BP’(t) = 3at2 + 2bt + c
3. CP’(t) = 3at2 - 2bt + c
4. DP’(t) = 4at2 + 2bt + c
44Hermit constraint matrix
1. A
2. B
3. C
4. D
45Hermite basis matrix
1. A
2. B
3. C
4. D
46Hermit basis function
1. A
2. B
3. C
4. D
47Equation of Hermite polynomials
1. A
2. B
3. C
4. D
48Which one is H_0 (t) from Hermite Basis Function
1. A
2. B
3. C
4. D
49Which one is H_1 (t) from Hermite Basis Function
1. A
2. B
3. C
4. D
50Which one is H_2 (t) from Hermite Basis Function
1. A
2. B
3. C
4. D
51Which one is H_3 (t) from Hermite Basis Function
1. A
2. B
3. C
4. D
52Which one is Catmull-Rom Interpolation in terms of Hermit
Constrains.
1. A
2. B
3. CAll above
4. DNo true answer
53Goal of Polygon Clipping
1. ARemove points and parts of objects outside the view volume
2. BMain goal is remove surface patches that point away from the camera (backfacing patching)
3. CInstead of deciding the depth order pixel by pixel, draw the polygons back to front. Must sort polygons in decreasing z order
4. DAdd points and parts of objects outside the view volume
54Goal of Backface Culling
1. ARemove points and parts of objects outside the view volume
2. BMain goal is remove surface patches that point away from the camera (backfacing patching)
3. CInstead of deciding the depth order pixel by pixel, draw the polygons back to front. Must sort polygons in decreasing z order
4. DAdd points and parts of objects outside the view volume
55Which one is Backface Culling Criterion
1. A(p-e)*n > 0
2. B(p-e)*n < 0
3. C(p-e)*n >= 0
4. D(p-e)*n >> 0
56Which one is not Algorithm for visibility determination?
1. AZ-Buffering
2. BPainter’s algorithm
3. CBSP Trees
4. DPhong
57Which one is Z-Buffering main Idea?
1. AInstead of deciding the depth order pixel by pixel, draw the polygons back to front. Must sort polygons in decreasing z order
2. BVisibility determined pixel by pixel during polygon cscan-conversion
3. CRemove points and parts of objects outside the view volume
4. DAdd points and parts of objects outside the view volume
58Which one is The Heedless Painter’s Algorithm main Idea?
1. AInstead of deciding the depth order pixel by pixel, draw the polygons back to front. Must sort polygons in decreasing z order+
2. BVisibility determined pixel by pixel during polygon cscan-conversion
3. CRemove points and parts of objects outside the view volume
4. DAdd points and parts of objects outside the view volume
59The Jacobian of Inverse Kinematics
1. A
2. B
3. C
60The Jacobian of Inverse Kinematics
1. AО is different at each (V1, V2)->must recomputed after each step, it may not be invertible->take pseudoinverse
2. BSome other answe
3. CSome other answ
4. DSome other answer
61Equation of joint motion according Jacobian
1. Alinearization
2. B
3. C
62Equation of en-effector according Joacobian
1. A
2. B
3. C
63Which one is The Heedless Painter’s Algorithm main Idea?
1. AInstead of deciding the depth order pixel by pixel, draw the polygons back to front. Must sort polygons in decreasing z order+
2. BVisibility determined pixel by pixel during polygon cscan-conversion
3. CRemove points and parts of objects outside the view volume
4. DAdd points and parts of objects outside the view volume
64Which one is not Advantages of Ray Tracing
1. AOther answer
2. B
3. C
4. D
5. E
65Which one is BSP-Tree Algorithm main Idea?
1. AА) Maintain a data structure that allows slow computation of depth order for every eye position. B) Have mechanism to split polygons if necessary.
2. BА) Maintain a data structure that allows fast computation of depth order for every eye position. B) Have mechanism to split polygons if necessary.
3. CА) Maintain a data structure that allows fast computation of depth order for every eye position. B) Have mechanism to do not split polygons if necessary.
4. DА) Maintain a data structure that allows fast computation of depth order for every eye position. B) I am the King of the Lizards!
6661. By the rule of Z-Buffer Algorithm, what would be the result if drew closest triangle first?
1. Ao The result would be always different
2. Bo There is no any result, padavan
3. Co The result would be the same
4. Do LEROOOOOOOOOOOOOY
67Which one of the steps is not from Ray Tracing: Basic Algorithm
1. A1)cast ray r through q
2. B2)find 1st intersection of q with scene (i.e. poit p)
3. C3)estimate amount of light reaching p
4. D4)estimate amount of light travelling from p to q along ray r
5. ESome other answer
6862. Which are disadvantages of Z-Buffer Algorithm? (select 2 options)
1. AMemory for z-buffer. Wasted computation when over-writing distant points.
2. BGPU for z-buffer.Wasted computation when over-writing distant points.
3. CMemory for z-buffer.Wasted computation when creating distant points.
4. DMemory for z-buffer.Wasted computation when computing cosines.
69General implicit Equation of Computing Ray-Quadric Intersections
1. A
2. B
3. C
4. D
70Parametric equation of Ray-Quadric Intersections with parameter λ
1. A
2. B
3. C
7163. Which are advantages of Z-Buffer Algorithm? (select 2 options)
1. ASimple, accurate. Independent of order polygons are drawn.
2. BHard, but accurate.Independent of platform.
3. CDo not involve your brains, idiot.
4. DSimple, accurate. Independent of order polygons are drawn
72According The Heedless Painter’s Algorithm, how do we sort polygons that do not have a single Z-value?
1. ASort according to depth of farthest vertex.
2. BSort according to depth of closest vertex.
3. CSort according to size of farthest vertex.
4. DDo not sort! Let’s rock!
73Implicit form of equation of Computing Normal at a Hit Point
1. A
2. B
74The Diffuse Component of Phong model: Basic Equation for single light
1. A
2. B
3. C
75The Diffuse Component of Phong model: General Equation
1. A
2. B
3. C
76The Specular Component of Phong model: Basic Equation
1. A
2. B
3. C
77Equation of ambient component from Phong model.
1. A
2. B
3. C
78Main idea of Supersampling
1. ARender multiple samples for each pixel. Compute (weighted) average of samples.
2. BThese feelings won't go away. They've been knockin' me sideways
3. CRender one sample for each pixel. Compute (weighted) average of samples.
4. DRender multiple samples for each pixel. Compute absolute sum of samples.
79Phong Reflection: The General Equation
1. A
2. B
3. C
80What kind of pixel grid could be? (select 2 options only from CG course)
1. ARegular grid, Jittered grid
2. BNon-regular grid, Jittered grid.
3. CRegular grid, Very Jittered grid.
4. DIt’s Bum Bum Bigelow!
81Equation of Image Gradient
1. A1
2. B2
3. C3
4. D4
8269. Basic idea of Keyframe Animation
1. ADefine model parameter at key frames and interpolate (often using cubic splines).
2. BDefine model parameter at every possible frames and interpolate (often using cubic splines).
3. CMy eyes are blind, but I can see
4. DDefine model parameter and do nothing. Seriously. I do nothing. Trust me.
83Equation of Image Laplacian
1. A1
2. B2
3. C3
4. D4
84Basic idea of Forward Kinematics
1. AInstead of painstakingly specifying every little motion, specify very few keyframes (or just initial & goal). Interpolations are done automatically. Or another possible answer: Specify how joints should move.
2. BInstead of painstakingly specifying every little motion, specify all keyframes. Interpolation are done automatically
3. CБи-боп-боп-бип.Арггхх. Тыуженапалубе?
4. DDream of Californication!!!
85Basic idea of Motion Capture?
1. ARecord motions of real people/objects, then transfer to digital characters
2. BRecord standing of real people/objects, then transfer to digital characters.
3. CThe race is run, the book is read. The end begins to show.
4. DRecord motions of almost real people/objects, then transfer to digital characters.
86General Sum Notation of Cross-Correlation
1. A1
2. B2
3. C3
4. D4
87What is the set of points that are “reachable” by this 2-axis structure?
1. ADyson Sphere
2. BTorus
3. CCircle
4. DАфигего
88“Pure” translation Equation
1. A
2. B
3. C
4. D
89What is rasterization?
1. AProject geometry onto image. Compute pixel color using local shading model.
2. BЗачем вы вообще это учите? Идите гулять, развлекаться. Забейте на учебу.
3. CProject geometry onto screensaver. Compute pixel color using local shading model.
4. DProject pixels backwards onto scene. Compute pixel color using local shading model.
90General Linear 2D Transformations: Common Equation
1. A
2. B
3. C
91Ellipse: Full equation of Parametric Representation
1. A
2. B
3. C
92What is Ray tracing?
1. AProject pixels backwards onto scene. Compute pixel color at q by estimating light reaching p directly or indirectly.
2. BDear mama, you helped me write this. By showing me to give is priceless.
3. CProject pixels backwards onto scene saver. Compute pixel brightness at q by estimating light reaching p directly or indirectly.
4. DProject pixels forward onto image. Compute pixel color at q by estimating light reaching p directly or indirectly.
93Pros of Keyframe Animation
1. AVery expressive. Animator has full control of animation.
2. BVery labor intensive.Difficult to create convincing physical realism
3. CVery expressive. Animator has partial control of animation
94From Camera to Canonical view: Equation of transformation.
1. A
2. B
3. C
4. D
95What is Inverse Kinematics?
1. ASpecify where character should go, then deduce joint motion.
2. BSpecify how joints should move.
3. CSpecify the reality of this unreality in this reality of that realism
96Equation of Plane in Homogeneous Coordinates
1. A
2. B
3. C
97Pros of Key-Framing with Forward Kinematics
1. AVery easy to specify & implement.
2. BIt is easier to say what cons do key-framing has.
3. CVery easy to test & integrate
98Cons of Key-Framing with Forward Kinematics(select 3 options)
1. AOften we care about how the character looks like, not how to get there. Very hard to know how to move joints of a complicated figure in order to get the desired pose (esp. in presence of obstacles.). End-effector spaces quickly become very complicated
2. BOften we care more about where the character should go, not how to get there.
  Very hard to know how to move joints of a complicated figure in order to get the desired pose (esp. in presence of obstacles.).
  End-effector spaces quickly become very complicated.
99How many algorithms of Computing Ray-Triangle Intersection(select 1 option according the course)
1. A2
2. B1
3. C3
4. D4
100Which one is not Light Source
1. Apoint source
2. Bdistant source (spotlight)
3. Cextended source (aka area source)
4. Dmain sources of light
101What is defuse reflection?
1. ARepresents “matte” component of reflected light, usually caused by “rough” surfaces (clay, eggshell, etc.)
2. BRepresents shiny component of reflected light, caused by mirror-like reflection off of smooth or polished surfaces (plastics, polished metal, etc.)
3. CCaused by materials that are not perfectly opaque. Examples include glass, water and translucent materials such as skin.
4. DRepresents the component of reflected light that scatters in the material’s interior (after transmission) before exiting again Examples include skin, milk, fog, etc.
102What is Specular Reflection?
1. ARepresents shiny component of reflected light, caused by mirror-like reflection off of smooth or polished surfaces (plastics, polished metal, etc.)
2. BCaused by materials that are not perfectly opaque. Examples include glass, water and translucent materials such as skin.
3. CRepresents the component of reflected light that scatters in the material’s interior (after transmission) before exiting again Examples include skin, milk, fog, etc.
4. DRepresents “matte” component of reflected light, usually caused by “rough” surfaces (clay, eggshell, etc.)
103Implicit Equation of Normal Vectors
1. A
2. B
3. C
4. D
104What is Transmission?
1. ACaused by materials that are not perfectly opaque. Examples include glass, water and translucent materials such as skin.
2. BRepresents “matte” component of reflected light, usually caused by “rough” surfaces (clay, eggshell, etc.)
3. CRepresents the component of reflected light that scatters in the material’s interior (after transmission) before exiting again Examples include skin, milk, fog, etc.
4. DRepresents shiny component of reflected light, caused by mirror-like reflection off of smooth or polished surfaces (plastics, polished metal, etc.)
105What is Sub-surface Scattering?
1. ARepresents the component of reflected light that scatters in the material’s interior (after transmission) before exiting again Examples include skin, milk, fog, etc.
2. BCaused by materials that are not perfectly opaque. Examples include glass, water and translucent materials such as skin.
3. CRepresents “matte” component of reflected light, usually caused by “rough” surfaces (clay, eggshell, etc.)
4. DRepresents shiny component of reflected light, caused by mirror-like reflection off of smooth or polished surfaces (plastics, polished metal, etc.)
106Phong model: equation of ambient component.
1. A
2. B
3. C
107Rasterization is
1. AThe task of taking an image described in a vector graphics format (shapes) and converting it into a raster image (pixels or dots) for output on a video display or printer, or for storage in a bitmap file format.
2. BThe task of taking an image described in a hard graphics format (shapes) and converting it into a raster image (pixels or dots) for output on a video display or printer, or for storage in a bitmap file format.
3. CThe task of taking a pixel described in a vector graphics format (shapes) and converting it into a raster image (pixels or dots) for output on a video display or printer, or for storage in a bitmap file format.
108“+” of Key-Framing with Forward Kinematics
1. AVery easy to specify & implement
2. BVery hard to specify & implement
3. CVery easy to specify &work with
109Inverse Kinematics is
1. ASpecify where character should go, then deduce joint motion
2. BSpecify where people should go, then deduce joint motion
3. CSpecify where character should go, then apply joint motion
110“+”of Keyframe Animation
1. AVery expressive, Animator has full control of animation
2. BVery expensive, Animator has full control of animation
3. CVery expensive, Animator has not to control of animation
111Ray Tracing: which one is not Advantages
1. AHighly customize, can model shadows, arbitrary reflection, parallelizable, allows trading off speed for accuracy – advantages
2. BHighly not customizable
3. CNot arbitrary reflection
112Gouraud shading: main idea
1. ADraws all triangle points p with identical color/intensity
2. BCompute Li-L(bi ,ni , si ) for each vertex, Inter[plate the Li s to get value at p
3. CInterpolate bi ,ni , si to get b,n,s at p , then Compute L(b,n,s)
113Matting is
1. AMatting refers to the problem of accurate foreground estimation in images and video. It is one of the key techniques in many image editing and film production applications
2. BMatting refers to the advantages of accurate foreground estimation in images and video. It is one of the key techniques in many image editing and film production applications
3. CMatting refers to the problem of not foreground estimation in images and video. It is one of the key techniques in many image editing and film production applications
114Main Idea of Flat shading
1. ADraw all triangle points p with identical colour/intensity
2. BDraw all triangle points p with identical colour
3. CDraw all triangle points p with identical intensity
115Phong shading: main idea
1. AInterpolate bi ,ni , si to get b,n,s at p , then Compute L(b,n,s)
2. BCompute Li-L(bi ,ni , si ) for each vertex, Inter[plate the Li s to get value at p
3. CDraws all triangle points p with identical color/intensity
116Amount of algorithms of Computing Ray-Triangle Intersection(select 1 option according the course)
1. A2
2. B5
3. C3
117Computer graphic is
1. AThe science of turning the rules of geometry and physics into (digital) pictures that mean something to people
2. BThe science of turning the rules of geometry pictures that mean something to people
3. CThe science geometry and physics into (digital) pictures that mean something to people
118Gouraud shading vs Flat shading, which one is “-”?
1. ASpecular highlights stil a problem for large triangles
2. BNo visible seams between mesh triangles
3. CSmooth, visually pleasing intensity variations that mask coarse geometry
4. DComputationally less efficient (mut interpolate 3 vectors and evaluate Phong reflection model at each triangle pixel)
119Vector is
1. AA vector describes a length and a direction(A vector is a quantity or phenomenon that has two independent properties: magnitude and direction.)
2. BA vector describes a scalar coordinate
3. CA vector describes a direction coordinate
120Motion Capture: Basic idea
1. AMotion capture is the process of recording the movement of objects or people.
2. BMotion capture is the process of playing the movement of objects or people
3. CMotion capture is the process of moving the objects or people
121Phong shading vsGouraud shading, which one is “-”?
1. AComputationally less efficient (mut interpolate 3 vectors and evaluate Phong reflection model at each triangle pixel)
2. BSpecular highlights stil a problem for large triangles
3. CNo visible seams between mesh triangles
4. DSmooth, visually pleasing intensity variations that mask coarse geometry
122Ray tracing is
1. Aray tracing is a technique for generating an image by tracing the path of light through pixelsin an image plane and simulating the effects of its encounters with virtual objects.
2. Bray tracing is a technique for generating a pixels by tracing the path of light through image
3. Cray tracing is a technique for planning an image by tracing the path of light through pixels
123Specular Reflection is
1. ARepresents shiny component of reflected light, caused by mirror-like reflection off of smooth or polished surfaces (plastics, polished metal, etc.)
2. BRepresents ambient component of reflected light
3. CRepresents mirror component of reflected light
124What is the “-” of Phong shading?
1. ASo in Phong Shading the attribute interpolated are the vertex normals, rather than vertex intensities. Interpolation of normal allows highlights smaller than a polygon.
2. BComputationally less efficient (mut interpolate 3 vectors and evaluate Phong reflection model at each triangle pixel)
3. CNo visible seams between mesh triangles
4. DSmooth, visually pleasing intensity variations that mask coarse geometry
125Main Idea: Flat shading
1. ADraw all triangle points p with identical colour/intensity
2. BDraw all triangle points p with identical colour
3. CDraw all triangle points p with identical intensity
126Main Idea : Flat shading
1. ADraw all points with identical color/intensity
2. BDraw all points with random color/intensity
3. CInterpolate color/intensity from vertices
4. DApproach of Interpolative Shading
127What is OpenCV?
1. AOpenCV is an open source computer vision library
2. Bis an open source program for generating 3B images
3. CIs a tool for extracting foreground images from any background
128Which one is interpolated shading?
1. APhong and gouraud are interpolated
2. BFlat is interpolated
3. COnly gouraud is interpolated
4. DOnly phong is interpolated
129What is visible spectrum corresponds to light wavelength?
1. A400 to 700 nm
2. B300 to 700 nm
3. C100 to 500 nm
4. D700 to 900 nm
1302D Taylor series expansion near (0,0)
1. A
2. Bучите ; не знаю как это будет
131What is matting?
1. ASeparating a desired foreground image from a background of a constant color
2. BSeparating two images and combining them into 3d image
3. CPainting image from pieces to other image
4. DBinding different pieces
132How many components (color) in array of each pixel are used in computer graphic?
1. A4
2. B3
3. C2
4. D1
133Which is matting equation?
1. AC= C0 +(1-a0)Ck
2. BC= C0 +(a0-1)Ca
3. CC= (C0 + a0)Ck
4. DC= (1-a0)Ck -C0
134Direction derivative of I in direction (cosθ,sinθ)
1. A
2. B
135In one of matting solution if we know that there is NO Blue Color, what is the value of component B in RGB?
1. A0
2. B1
3. C1.5
4. D1.7
136What is the goal of Gaussian pyramid
1. Ao Develop representation to decompose images into information at multiple scales, to extract features or structures of interest, to attenuate noise
2. Bsome other answer
3. Csome other answer.
137Which one is not limitation of matting algorithm?
1. A
2. Bучите
138How many arguments can take function cvLoadImage()
1. A2
2. B1
3. C3
4. D4
139How many arguments can take function cvReleaseImage()
1. A1
2. B2
3. C3
4. D4
140How many arguments if function glTranslatef()
1. A3
2. B1
3. C2
4. D4
141How many arguments if function gluSphere()
1. A4
2. B1
3. C2
4. D3
142Equation of Convolution
1. A
2. B
3. C
4. D
143How many arguments in function glRotatef()
1. A4
2. B1
3. C2
4. D3
144What mean the 1st argument in function glRotatef()
1. AAngle
2. BAxis
3. CMode
4. DControl variable
145How many arguments in function glScalef()
1. A3
2. B1
3. C2
4. D4
146Equation of Convolution in 2D(MxN -image)
1. A
2. B
3. C
4. D
147The unit vector is
1. Avector is a vector of length 1
2. Bunique vector
3. Cvector orthogonal to normal
4. Dusual vector
148Interpolated shading is
1. APhong and Gouraud shading
2. BFlat Shading
3. CPhong Shading
4. DGouraud shading
149Matting is
1. ASeparating a desired foreground image from background of constant or almost constant color
2. BShading model
3. CDefining shape of curve
4. DThe same as Smoothing
150Equation of Downsampled and Smoothed Image g_(l+1)
1. A
2. B
3. C
4. D
151Transmission is
1. ALightpassesthrough the object
2. Bthe component of reflected light that scattersin the material’s interior (after transmission) before exiting againLight absorbed by the object
3. CLight reflected by the object
152Forward Kinematics: Basic idea
1. ASpecify how joints should move
2. BSpecify where character should go, then deduce joint motion
3. CRecord motions of real people/objects, then transfer to digital characters
4. DSpecify how end effector should move
153General Expression of REDUCE() function
1. A
2. B
3. C
4. D
154Sub-surface Scattering is
1. AComponent of reflected light that scattersin the material’s interior (after transmission) before exiting again
2. BLight absorbed by the object
3. CLightpassesthrough the object
4. DLight reflected by the object
155What is the goal of Gaussian pyramid
1. ADevelop representation to decompose images into information at multiple scales, to extract features or structures of interest, to attenuate noise
2. Bsome other answ
3. Csome other answer
156Equation of EXPAND(g_l) function
1. A
2. B
3. C
4. D
157Equation of EXPAND(g_l) function in 1D
1. A
2. B
3. C
4. D
158Main Idea of Laplacian Pyramid
1. ARather than store smoothed images, store only the convolution coefficient, between levels Gl and G(l+1)
2. BExtract features or structures of interest
3. CDevelop representation of decomposed images into information at multiple scales
4. DRather than store smoothed images, store only the difference, between levels Gl and G(l+1)

Información

Descripción: Трудных предметов нет, но есть бездна вещей, которых мы просто не знаем, и еще больше таких, которые знаем дурно, бессвязно, отрывочно, даже ложно. И эти-то ложные сведения еще больше нас останавливают и сбивают, чем те, которых мы совсем не знаем.
Autor: Csse 1502
Idioma: English
Visitas: 56
Etiquetas: high
Valoración: Aún sin valoraciones
Valora este test
Valora este test

3d-Modeling

Crea una cuenta gratis para terminar este test

Preguntas del test (158)

Información

Escríbenos

¿Qué te parece el nuevo diseño?