wrobot k wwrobot hrobot (a) Observation area Horopter h(θ) (Virtual) horopters h(θ+ θ lim) U r U l h(θ+ θ) Base line Left camera Optical axis
|
|
- Marybeth Green
- 5 years ago
- Views:
Transcription
1 Selective Acquisition of 3-D Information Enoug for Finding Passable Free Spaces Using an Active Stereo Vision System Atsusi Nisikawa, Atsusi Okubo, and Fumio Miyazaki Department of Systems and Human Science Graduate Scool of Engineering Science, Osaka University, Osaka , Japan Abstract We address te acquisition of 3-D structure around free spaces needed for veicle navigation using an active stereo vision system tat can xate on any 3-D point of te scene. Our metod is based on te ypotesis tat te larger and deeper free spaces exist in te direction to wic te larger and farter visible objects exist. We rst estimate te direction of promising free spaces by xating on te innity point. Ten we acquire te partial 3-D structure around te free spaces by successively xating on several 3-D points in te estimated direction. We nally present experimental results of te proposed metod applied to actual scenes. 1. Introduction Wit a robot moving in an unknown 3-D environment, it is absolutely necessary to work out a metod for nding passable free spaces. It is also an important tecnology even in case tat te robot is given a map of te environment in advance, because te robot must cope wit unknown obstacles or errors of te map. Metods ave been so far proposed[3][4][5][7] tat suggest representation of te environment in terms of free spaces using stereo vision. Most of tese studies, owever, generate te scene description by uniformly analyzing te wole image data including unnecessary information for nding free spaces wic means a vast amount of computation is required. Wen te objective of a robot is to reac te goal, te robot does not require a full/detailed description of te wole scene but only needs te information about passable free spaces to te goal and te partial 3-D structure around te free spaces. Tere ave been several works on selectively acquiring tese data. Takizawa et al. [11] proposed a scene observation metod tat suggests generation of coarse 3-D description from low-resolution stereo images, and ten selective zooming-in on te most promising pat (image region) estimated troug detailed analysis of te 3-D description. Tis metod, owever, needs a lot of computation to make te initial scene description because it is based on te constrained Delaunay triangulation. Jasiobedzki[6] proposed a metod of selective detection of oor regions using a planar oor model and a vision guided range detection sensor. It, owever, requires detailed calibration of te sensor-world model in advance. We propose a new metod to selectively acquire 3- D information enoug for nding passable free spaces wit an active stereo vision system tat xates on a 3-D point of te scene. We start by describing an algoritm to acquire 3-D information around a xation point. 2. Basic algoritm Let us consider two pin-ole cameras wit teir optical axes in te same plane. Assume tat te cameras can pan independently to make vergence movements and tey are mounted on te common platform tat tilts up/down as well as pans full circle so tat te system can xate on any 3-D point of te scene. Now suppose tat te active stereo rig xates on a 3-D point P ; let be te xation angle. We consider a circle passing troug te two nodal points of te cameras and te xation point as sown in Fig. 1(a). Tis circle is te set of points wose binocular disparity is zero and in general referred to as oropter[2]. We denote te oropter wit te xation angle by (). Also, let U l and U r be te set of points wose projection exists on respectively te left and te rigt image window(see Fig. 1(a)). Now we dene an observation area A as A = U l \ U r \ f( + 1) j 0 1 < 1 lim g were 1 lim is te upper limit of 1. A metod for acquiring te 3-D structure of te ob-
2 servation area as been already proposed by ourselves. Tis metod is based on te use of virtual oropters 1 as was proposed by Rougeaux et al.[9]. Te principle of our metod is simple: rst te input left image is sifted orizontally by s pixels. Ten, te input rigt image witin te window and te sifted left image are respectively divided into a set of small patc regions (see Fig. 1(b)) and compared in te corresponding patc location by a simple correlation metod between local image regions so tat te paired patc region wose correlation value is larger tan a tresold is extracted. Repeating te above process for s = 0; 1;... ; s max, only te projection of object surfaces lying in te observation area A remains on te matcing output. Tese 3-D positions can be easily computed by using te triangulation principle wit te rotation angle of eac camera and te sift value. Denoting te focal lengt of te camera and te widt of a pixel by f and w pixel respectively, we ave te following equation: s max = round-up [f 1 tan(1 lim )=w pixel ] (1) were round-up(x) indicates te function for rounding up x to nearest ones position. Te details of tis metod can be found in [8]. In tis algoritm, te xation angle and 1 lim, te pose of cameras to realize, and te size of image window are te indenite parameters tat depend on te given task. We ave worked out a metod for acquiring 3-D information enoug to searc for passable free spaces troug determination of tese parameters. Te proposed metod consists of te following two steps: (1)initial observation process in wic te robot nds te direction to wic promising free spaces exist, and (2)selective observation process in wic te robot turns to te direction of te detected free space and acquires te partial 3-D structure around te direction wit te successive vergence movements of te stereo cameras. In te following sections, te aforementioned two steps are considered in detail. 3. Initial observation process Te initial observation process is based on te ypotesis tat te deeper and larger free spaces(te more 1 s generated by sifting te left(or rigt) image orizontally by some pixels. In Rougeaux et al.[9], it was pointed out tat, near te image center, small sifts(s pixel) of te left image are almost equivalent to small virtual rotations (1 = tan 01 (s 1 wpixel=f )) of te left camera. Here, f is te focal lengt and wpixel is te widt of a pixel. Observation Fixation area point A P U l Optical axis U r (θ) Rigt camera W w W w W P s (sifting) P W Left image θ Image window Optical axis (θ+ θ lim) Rigt image (a) Observation area (Virtual) oropters (θ+ θ) j comparison between te intensity values at te corresponding position (m,n) m m n n i Y Sifted left image X j i Y Rigt image (b)image segmentation robot k wwrobot W f Image plane d min (c)image eigt Image plane d min Ww (d)image widt Figure 1. Active stereo vision based scene observation ( 0+ θ lim) = ( θ lim) θ lim b (a) (1 lim ) dfar Rigt camera (θ imax ) θ imax b (b) ( i max ) f dmin Rigt camera Figure 2. geometry for deriving Eqs.(4) and (5) promising pats) exist in te direction to wic te farter and larger visible surfaces exist. Now we dene a far object as a 3-D object wose dept is greater tan d far. In tis process, in order to nd far objects at rst, te xation angle is set to = 0(deg) by rotating te stereo cameras suc tat teir optical axes are mutually parallel and perpendicular to te baseline. Besides, te widt of image window (below denoted by W w (0) ) is set as widely as possible for te purpose of covering a wide range of te scene, wile te eigt of te image window(below denoted by ) is decided based on te minimal dept of te scene, say d min, and te size of te robot as sown in Fig. 1(c). Tat is, we ave X k robot w = I w ; (2) = round-up [f(k 1 robot )=(d min 1 pixel )] (3) wrobot
3 were I w, robot and pixel mean te image widt, te eigt of te robot and te eigt of a pixel respectively. k is a coecient for navigating te robot safely (see Fig. 1(c)). Furtermore, denoting te baseline lengt by b, 1 lim is geometrically(see Fig. 2(a)) given by 1 lim = 2 tan 01 (b=2d far ): (4) Under tese settings, te basic algoritm is executed. As a result, only te projection of far objects remains in te matcing output. In te present paper, te blob-coloring algoritm[1] is applied to te matcing result for region growing, so tat te direction from te viewpoint troug te centroid of te far object region wose area(= te number of pixels) is greater tan a tresold is selected as te direction to be explored in wic promising free space exists. 4. Selective observation process Now we explain te selective observation process tat follows te initial observation process. In tis process, at rst te camera platform is rotated to te direction of te detected large and deep free space and ten te partial 3-D structure around te direction is acquired wit te successive vergence movements of te stereo cameras suc tat te xation angle is i = 1 lim 2 i(i = 1; 2;... ; i max ). In so doing, te left and rigt camera is rotated wit 1 lim =2(deg) in opposite directions respectively. As sown in Fig. 2(b), i max = imax =1 lim = round-up 2 (2 tan 01 (b=2d min ))=1 lim 3 (5) so tat te 3-D object wose dept is greater tan d min can be extracted along te selected direction. On te oter and, bot te widt and te eigt of image window(below denoted by W w and W respectively) are decided based on te minimal dept of te scene and te size of te robot as sown in Fig. 1(c)(d). Tat is, we ave W w = round-up [f(k w 1 w robot )=(d min 1 w pixel )] ;(6) W = (7) were w robot and w pixel indicate te widt of te robot and te widt of a pixel respectively. k w is anoter coecient for navigating te robot safely (see Fig. 1(d)). 5. Experiments Experiments were conducted wit selective 3-D reconstruction using te scene sown in Fig. 3(a), to validate te proposed metod. Doll3 Doll2 (a) Experimental scene Can Tilt Vergence Camera Pan Weel (b) Our mobile robot equipped wit an active stereo vision system Figure 3. Experimental setup 5.1. Scene and parameters Te experimental scene includes tree dolls(doll 13), a box() and a can(can). Te distance from our robot(see Fig. 3(b)) to tem is about 1:3 1:5(m). Beind tese objects, tere are a lot of objects suc as desks, cairs, and bookselves; te distance from te robot is about 3(m). Tus, we set te two tresolds about dept to d min = 1100(mm), d far = 2000(mm) respectively. Note tat tere is a large free space between and. In tis paper we only sow two experimental results: te proposed metod was rst applied to te scene of Fig. 3(a) (EXPERIMENT I). After removing Doll 2 from te scene in order to make anoter large free-space, te same experiment was ten conducted(experiment II). Main experimental parameters are as follows : te image size is (pixel), te baseline lengt b is 120(mm) and focal lengt f is 16(mm), and te pixel size (w pixel ; pixel ) = (0:0277; 0:0218)(mm), so tat 1 lim 3:44(deg)(from Eq.(4)), te maximal sift value s max is 35(pixel)(from Eq.(1)), and i max = 2(from Eq.(5)). On te oter and, (w robot ; robot ) = (292; 272)(mm) and k w = 1:3; k = 1:1, ten, from Eqs.(2) and (3), te size of image window (W w (0) ; ) = (512; 200)(pixel) and, from Eqs.(6) and (7), (W w ; W ) = (200; 200)(pixel) Results and discussion EXPERIMENT I (case tat tere is a large free space in te scene): First of all, our robot nds te direction to wic larger and deeper free spaces exist by te initial observation process. Fig. 4(a) sows one of te stereo images(left one) 2 witin te (W w (0) 2 ) sized image window and Fig. 4(b) sows te extraction 2 In order to eliminate bot te ig-frequency components suc as noise and te low-frequency components suc as sading, we used te tree intensity level image[10] generated by Laplacian-Gaussian ltering followed by dual-tresolding instead of te original gray level image.
4 Doll 3 Doll 2 Can (a) Left image witin te image window Doll3 Doll2 Can z(mm) Selected Viewing direction (te direction of free space) (but not considered in te selective observation process) 1000 (b) Detected objects Figure 4. Detection result of far objects(initial observation process, EXPERIMENT I) Mobile Robot (a) Actual 3-D structure 500 Mobile Robot Detected object x(mm) (b) Acquired 3-D structure Figure 6. Te partial 3-D structure acquired by te proposed metod (EXPERIMENT I) (a) Left image (b)rigt image (c) Objects Figure 5. Detection result of objects (Selective observation, = 1, EXPERIMENT I) result of far objects; te wite area indicates te objects in te observation area (far objects), tat is, te direction to wic deep free spaces exist. We can see te large wite area between te projection of and tat of. As a result, te robot understands tat tere is a large and deep free space in te front direction. Secondly, te robot turns to te direction of te detected large and deep free space and acquires te partial 3-D structure around te direction wit te successive vergence movements of te stereo cameras suc tat te xation angle is i (i = 1; 2;... ; i max ). Fig. 5 sows te extraction result of objects around te selected free space; (a) and (b) are te stereo images witin te (W w 2 W ) sized window and (c) indicates te extracted objects (wite area). Tese were all obtained at te xation angle = 1. It is seen tat te rigt part of and te left part of are detected. By using te triangulation principle wit te rotation angle of te camera ead, te xation angle, and te sift value, te robot can easily compute teir 3-D positions. Fig. 6 illustrates te acquired 3-D structure of te scene. Comparing (a)(actual 3-D structure) wit (b)(acquired one), we can easily see tat te partial 3-D structure around te selected viewing direction(a part of and ) is acquired correctly. EXPERIMENT II (case tat tere are two large free spaces in te scene): First, te robot detects free spaces in te same way as EXPERIMENT I was conducted. Fig. 7 sows te detection result of deep free spaces. As a result, te robot knows tat tere are two large and deep free-spaces in te front and left direction. Ten, te robot turns to te direction of te detected free spaces and, wit te vergence movements, makes a selective reconstruction of 3-D objects around te direction. Fig. 8 sows te extraction result of objects in te front direction((a)to(c)) and tose in te left direction((d)to(f)). We can see te wite area of te rigt part of and te left part of in Fig. 8(c) and tat of te rigt part of Doll 3 and te left part of in Fig. 8(f). Te actual and acquired 3-D structure are sown in Fig. 9(a) and (b) respectively. We nally evaluate te cost of computation of te proposed metod. In eac step(initial/selective observation process), te basic algoritm is repeated (s max + 1) times for eac image patc, wile te number of te patc regions is proportional to te processing image size. Let K denote te proportional constant. Ten, te total computational complexity of our metod(denoted by C partial ) in terms of te number of computation of correlation is: C partial = (K 2 W w (0) (s max + 1) 2 i max 2 n max were n max indicates te number of selected viewing directions. Next let us consider te case of acquiring 3-D information by uniformly analyzing te wole image data. As te dept range is [d min ;1], te range of stereo disparities is [0; D] were D = (f=w pixel ) 1 b=d min. Te ) 2 (s max + 1) + (K 2 W w 2 W ) 2
5 2nd Viewing direction 1st Viewing direction z(mm) V2 V Doll 3 Can (a) Left image witin te image window Doll (but not considered in te selective observation process) Can 1500 (b) Detected objects Mobile Robot Doll3 Figure 7. Detection result of far objects (Initial observation process, EXPERIMENT II) (a) Actual 3-D structure Detected object x(mm) (b) Acquired 3-D structure Figure 9. Te partial 3-D structure acquired by te proposed metod (EXPERIMENT II) (a) Left image (b)rigt image (c) Objects 1st View (Front direction) experiments wit actual scenes. In future, we are going to explore a metod/strategy to nd proper viewpoints(i.e.,sub-goals to reac te goal) were bot unknown/occluded region and positional errors can be reduced. Doll 3 Doll 3 References (d) Left image (e)rigt image (f) Objects 2nd View (Left direction) Figure 8. Detection result of objects (Selective observation, = 1, EXPERIMENT II) maximal disparity D corresponds to te maximal sift value s max. Terefore, te complexity of tis case, say C all, is: C all = K 2 I w 2 I 2 (D + 1) were I w and I mean te image widt and te image eigt respectively. In te experiments, C partial =C all 2 100(%) = 41.7(%) (for EXPERIMENT I) and 60.1(%) (for EX- PERIMENT II), wic demonstrates te eectiveness of our metod in terms of computational cost. 6. Conclusion In tis paper, a metod was proposed for selective acquisition of 3-D information enoug for a robot to nd passable free spaces using an active stereo vision system. Te ig eciency of te proposed metod in terms of computational cost was veried troug [1] D. H. Ballard and C. M. Brown. Computer Vision. Prentice- Hall, Inc., Englewood Clis, NJ, [2] D. J. Coombs and C. M. Brown. Cooperative gaze olding in binocular vision. IEEE Control Systems, pages 24{33, [3] T. Ecigo. Segmentation of a 3-D scene into free areas and object surfaces by using occluded edges of trinocular stereo. In 1991 IEEE/RSJ Int. Worksop on Intelligent Robots and Systems, pages 863{868, [4] O. D. Faugeras, E. L. Bras-Melman, and J. D. Boissonnat. Representing stereo data wit te delaunay triangulation. Artif. Intell., 44:41{87, [5] E. Grosso and M. Tistarelli. Active/dynamic stereo vision. IEEE Trans. on Pattern Analysis and Macine Intelligence, 17(9):868{879, [6] P. Jasiobedzki. Detecting driveable oor regions. In 1995 IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, pages 264{270, [7] J. Miura and Y. Sirai. Modeling obstacles and free spaces for a mobile robot using stereo vision wit uncertainty. In 1994 IEEE Int. Conf. on Robotics and Automation, pages 3368{ 3373, [8] A. Okubo, A. Nisikawa, and F. Miyazaki. Selective reconstruction of a 3-D scene wit an active stereo vision system. In 1997 IEEE Int. Conf. on Robotics and Automation, pages 751{758, [9] S. Rougeaux, N. Kita, Y. Kuniyosi, S. Sakane, and F. Cavand. Binocular tracking based on virtual oropters. In 1994 IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, pages 2052{2057, [10] K. Sumi, M. Hasimoto, and H. Okuda. Tree-level broadedge matcing based real-time robot vision. In 1995 IEEE Int. Conf. on Robotics and Automation, pages 1416{1422, [11] H. Takizawa, Y. Sirai, and J. Miura. Selective renement of 3-D scene description by attentive observation for mobile robot. In 1994 IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, pages 1118{1125, 1994.
UUV DEPTH MEASUREMENT USING CAMERA IMAGES
ABCM Symposium Series in Mecatronics - Vol. 3 - pp.292-299 Copyrigt c 2008 by ABCM UUV DEPTH MEASUREMENT USING CAMERA IMAGES Rogerio Yugo Takimoto Graduate Scool of Engineering Yokoama National University
More informationMAPI Computer Vision
MAPI Computer Vision Multiple View Geometry In tis module we intend to present several tecniques in te domain of te 3D vision Manuel Joao University of Mino Dep Industrial Electronics - Applications -
More informationVector Processing Contours
Vector Processing Contours Andrey Kirsanov Department of Automation and Control Processes MAMI Moscow State Tecnical University Moscow, Russia AndKirsanov@yandex.ru A.Vavilin and K-H. Jo Department of
More informationComputing geodesic paths on manifolds
Proc. Natl. Acad. Sci. USA Vol. 95, pp. 8431 8435, July 1998 Applied Matematics Computing geodesic pats on manifolds R. Kimmel* and J. A. Setian Department of Matematics and Lawrence Berkeley National
More informationSection 2.3: Calculating Limits using the Limit Laws
Section 2.3: Calculating Limits using te Limit Laws In previous sections, we used graps and numerics to approimate te value of a it if it eists. Te problem wit tis owever is tat it does not always give
More informationTraffic Sign Classification Using Ring Partitioned Method
Traffic Sign Classification Using Ring Partitioned Metod Aryuanto Soetedjo and Koici Yamada Laboratory for Management and Information Systems Science, Nagaoa University of Tecnology 603- Kamitomioamaci,
More informationChapter K. Geometric Optics. Blinn College - Physics Terry Honan
Capter K Geometric Optics Blinn College - Pysics 2426 - Terry Honan K. - Properties of Ligt Te Speed of Ligt Te speed of ligt in a vacuum is approximately c > 3.0µ0 8 mês. Because of its most fundamental
More informationCESILA: Communication Circle External Square Intersection-Based WSN Localization Algorithm
Sensors & Transducers 2013 by IFSA ttp://www.sensorsportal.com CESILA: Communication Circle External Square Intersection-Based WSN Localization Algoritm Sun Hongyu, Fang Ziyi, Qu Guannan College of Computer
More informationInterference and Diffraction of Light
Interference and Diffraction of Ligt References: [1] A.P. Frenc: Vibrations and Waves, Norton Publ. 1971, Capter 8, p. 280-297 [2] PASCO Interference and Diffraction EX-9918 guide (written by Ann Hanks)
More informationNumerical Derivatives
Lab 15 Numerical Derivatives Lab Objective: Understand and implement finite difference approximations of te derivative in single and multiple dimensions. Evaluate te accuracy of tese approximations. Ten
More information2 The Derivative. 2.0 Introduction to Derivatives. Slopes of Tangent Lines: Graphically
2 Te Derivative Te two previous capters ave laid te foundation for te study of calculus. Tey provided a review of some material you will need and started to empasize te various ways we will view and use
More information13.5 DIRECTIONAL DERIVATIVES and the GRADIENT VECTOR
13.5 Directional Derivatives and te Gradient Vector Contemporary Calculus 1 13.5 DIRECTIONAL DERIVATIVES and te GRADIENT VECTOR Directional Derivatives In Section 13.3 te partial derivatives f x and f
More informationNon-Interferometric Testing
NonInterferometric Testing.nb Optics 513 - James C. Wyant 1 Non-Interferometric Testing Introduction In tese notes four non-interferometric tests are described: (1) te Sack-Hartmann test, (2) te Foucault
More informationCE 221 Data Structures and Algorithms
CE Data Structures and Algoritms Capter 4: Trees (AVL Trees) Text: Read Weiss, 4.4 Izmir University of Economics AVL Trees An AVL (Adelson-Velskii and Landis) tree is a binary searc tree wit a balance
More informationYou Try: A. Dilate the following figure using a scale factor of 2 with center of dilation at the origin.
1 G.SRT.1-Some Tings To Know Dilations affect te size of te pre-image. Te pre-image will enlarge or reduce by te ratio given by te scale factor. A dilation wit a scale factor of 1> x >1enlarges it. A dilation
More information3.6 Directional Derivatives and the Gradient Vector
288 CHAPTER 3. FUNCTIONS OF SEVERAL VARIABLES 3.6 Directional Derivatives and te Gradient Vector 3.6.1 Functions of two Variables Directional Derivatives Let us first quickly review, one more time, te
More informationTwo Modifications of Weight Calculation of the Non-Local Means Denoising Method
Engineering, 2013, 5, 522-526 ttp://dx.doi.org/10.4236/eng.2013.510b107 Publised Online October 2013 (ttp://www.scirp.org/journal/eng) Two Modifications of Weigt Calculation of te Non-Local Means Denoising
More informationMulti-Stack Boundary Labeling Problems
Multi-Stack Boundary Labeling Problems Micael A. Bekos 1, Micael Kaufmann 2, Katerina Potika 1 Antonios Symvonis 1 1 National Tecnical University of Atens, Scool of Applied Matematical & Pysical Sciences,
More informationProc. Int. Symp. Robotics, Mechatronics and Manufacturing Systems 92 pp , Kobe, Japan, September 1992
Proc. Int. Symp. Robotics, Mechatronics and Manufacturing Systems 92 pp.957-962, Kobe, Japan, September 1992 Tracking a Moving Object by an Active Vision System: PANTHER-VZ Jun Miura, Hideharu Kawarabayashi,
More informationPedestrian Detection Algorithm for On-board Cameras of Multi View Angles
Pedestrian Detection Algoritm for On-board Cameras of Multi View Angles S. Kamijo IEEE, K. Fujimura, and Y. Sibayama Abstract In tis paper, a general algoritm for pedestrian detection by on-board monocular
More informationRECONSTRUCTING OF A GIVEN PIXEL S THREE- DIMENSIONAL COORDINATES GIVEN BY A PERSPECTIVE DIGITAL AERIAL PHOTOS BY APPLYING DIGITAL TERRAIN MODEL
IV. Évfolyam 3. szám - 2009. szeptember Horvát Zoltán orvat.zoltan@zmne.u REONSTRUTING OF GIVEN PIXEL S THREE- DIMENSIONL OORDINTES GIVEN Y PERSPETIVE DIGITL ERIL PHOTOS Y PPLYING DIGITL TERRIN MODEL bsztrakt/bstract
More informationProceedings. Seventh ACM/IEEE International Conference on Distributed Smart Cameras (ICDSC 2013) Palm Spring, CA
Proceedings Of te Sevent ACM/IEEE International Conference on Distributed Smart Cameras (ICDSC ) Palm Spring, CA October 9 November st Parameter-Unaware Autocalibration for Occupancy Mapping David Van
More informationANTENNA SPHERICAL COORDINATE SYSTEMS AND THEIR APPLICATION IN COMBINING RESULTS FROM DIFFERENT ANTENNA ORIENTATIONS
NTNN SPHRICL COORDINT SSTMS ND THIR PPLICTION IN COMBINING RSULTS FROM DIFFRNT NTNN ORINTTIONS llen C. Newell, Greg Hindman Nearfield Systems Incorporated 133. 223 rd St. Bldg. 524 Carson, C 9745 US BSTRCT
More informationNOTES: A quick overview of 2-D geometry
NOTES: A quick overview of 2-D geometry Wat is 2-D geometry? Also called plane geometry, it s te geometry tat deals wit two dimensional sapes flat tings tat ave lengt and widt, suc as a piece of paper.
More information19.2 Surface Area of Prisms and Cylinders
Name Class Date 19 Surface Area of Prisms and Cylinders Essential Question: How can you find te surface area of a prism or cylinder? Resource Locker Explore Developing a Surface Area Formula Surface area
More informationMATH 5a Spring 2018 READING ASSIGNMENTS FOR CHAPTER 2
MATH 5a Spring 2018 READING ASSIGNMENTS FOR CHAPTER 2 Note: Tere will be a very sort online reading quiz (WebWork) on eac reading assignment due one our before class on its due date. Due dates can be found
More informationA Cost Model for Distributed Shared Memory. Using Competitive Update. Jai-Hoon Kim Nitin H. Vaidya. Department of Computer Science
A Cost Model for Distributed Sared Memory Using Competitive Update Jai-Hoon Kim Nitin H. Vaidya Department of Computer Science Texas A&M University College Station, Texas, 77843-3112, USA E-mail: fjkim,vaidyag@cs.tamu.edu
More informationMeasuring Length 11and Area
Measuring Lengt 11and Area 11.1 Areas of Triangles and Parallelograms 11.2 Areas of Trapezoids, Romuses, and Kites 11.3 Perimeter and Area of Similar Figures 11.4 Circumference and Arc Lengt 11.5 Areas
More informationSection 3. Imaging With A Thin Lens
Section 3 Imaging Wit A Tin Lens 3- at Ininity An object at ininity produces a set o collimated set o rays entering te optical system. Consider te rays rom a inite object located on te axis. Wen te object
More informationBounding Tree Cover Number and Positive Semidefinite Zero Forcing Number
Bounding Tree Cover Number and Positive Semidefinite Zero Forcing Number Sofia Burille Mentor: Micael Natanson September 15, 2014 Abstract Given a grap, G, wit a set of vertices, v, and edges, various
More informationMore on Functions and Their Graphs
More on Functions and Teir Graps Difference Quotient ( + ) ( ) f a f a is known as te difference quotient and is used exclusively wit functions. Te objective to keep in mind is to factor te appearing in
More information12.2 Techniques for Evaluating Limits
335_qd /4/5 :5 PM Page 863 Section Tecniques for Evaluating Limits 863 Tecniques for Evaluating Limits Wat ou sould learn Use te dividing out tecnique to evaluate its of functions Use te rationalizing
More information4.2 The Derivative. f(x + h) f(x) lim
4.2 Te Derivative Introduction In te previous section, it was sown tat if a function f as a nonvertical tangent line at a point (x, f(x)), ten its slope is given by te it f(x + ) f(x). (*) Tis is potentially
More information, 1 1, A complex fraction is a quotient of rational expressions (including their sums) that result
RT. Complex Fractions Wen working wit algebraic expressions, sometimes we come across needing to simplify expressions like tese: xx 9 xx +, xx + xx + xx, yy xx + xx + +, aa Simplifying Complex Fractions
More informationTHANK YOU FOR YOUR PURCHASE!
THANK YOU FOR YOUR PURCHASE! Te resources included in tis purcase were designed and created by me. I ope tat you find tis resource elpful in your classroom. Please feel free to contact me wit any questions
More informationVOLUMES. The volume of a cylinder is determined by multiplying the cross sectional area by the height. r h V. a) 10 mm 25 mm.
OLUME OF A CYLINDER OLUMES Te volume of a cylinder is determined by multiplying te cross sectional area by te eigt. r Were: = volume r = radius = eigt Exercise 1 Complete te table ( =.14) r a) 10 mm 5
More informationFast Calculation of Thermodynamic Properties of Water and Steam in Process Modelling using Spline Interpolation
P R E P R N T CPWS XV Berlin, September 8, 008 Fast Calculation of Termodynamic Properties of Water and Steam in Process Modelling using Spline nterpolation Mattias Kunick a, Hans-Joacim Kretzscmar a,
More information2.3 Additional Relations
3 2.3 Additional Relations Figure 2.3 identiies additional relations, indicating te locations o te object and image, and te ratio o teir eigts (magniication) and orientations. Ray enters te lens parallel
More information12.2 Investigate Surface Area
Investigating g Geometry ACTIVITY Use before Lesson 12.2 12.2 Investigate Surface Area MATERIALS grap paper scissors tape Q U E S T I O N How can you find te surface area of a polyedron? A net is a pattern
More informationSome Handwritten Signature Parameters in Biometric Recognition Process
Some Handwritten Signature Parameters in Biometric Recognition Process Piotr Porwik Institute of Informatics, Silesian Uniersity, Bdziska 39, 41- Sosnowiec, Poland porwik@us.edu.pl Tomasz Para Institute
More informationObstacle Avoiding Real-Time Trajectory Generation and Control of Omnidirectional Vehicles
2009 American Control Conference Hyatt Regency Riverfront, St. Louis, MO, USA June 10-12, 2009 FrC10.6 Obstacle Avoiding Real-Time Trajectory Generation and Control of Omnidirectional Veicles Ji-wung Coi,
More informationA Bidirectional Subsethood Based Similarity Measure for Fuzzy Sets
A Bidirectional Subsetood Based Similarity Measure for Fuzzy Sets Saily Kabir Cristian Wagner Timoty C. Havens and Derek T. Anderson Intelligent Modelling and Analysis (IMA) Group and Lab for Uncertainty
More information4.1 Tangent Lines. y 2 y 1 = y 2 y 1
41 Tangent Lines Introduction Recall tat te slope of a line tells us ow fast te line rises or falls Given distinct points (x 1, y 1 ) and (x 2, y 2 ), te slope of te line troug tese two points is cange
More informationGeo-Registration of Aerial Images using RANSAC Algorithm
NCTAESD0 GeoRegistration of Aerial Images using RANSAC Algoritm Seema.B.S Department of E&C, BIT, seemabs80@gmail.com Hemant Kumar Department of E&C, BIT, drkar00@gmail.com VPS Naidu MSDF Lab, FMCD,CSIRNAL,
More informationAll truths are easy to understand once they are discovered; the point is to discover them. Galileo
Section 7. olume All truts are easy to understand once tey are discovered; te point is to discover tem. Galileo Te main topic of tis section is volume. You will specifically look at ow to find te volume
More informationCHAPTER 7: TRANSCENDENTAL FUNCTIONS
7.0 Introduction and One to one Functions Contemporary Calculus 1 CHAPTER 7: TRANSCENDENTAL FUNCTIONS Introduction In te previous capters we saw ow to calculate and use te derivatives and integrals of
More informationLinear Interpolating Splines
Jim Lambers MAT 772 Fall Semester 2010-11 Lecture 17 Notes Tese notes correspond to Sections 112, 11, and 114 in te text Linear Interpolating Splines We ave seen tat ig-degree polynomial interpolation
More informationPiecewise Polynomial Interpolation, cont d
Jim Lambers MAT 460/560 Fall Semester 2009-0 Lecture 2 Notes Tese notes correspond to Section 4 in te text Piecewise Polynomial Interpolation, cont d Constructing Cubic Splines, cont d Having determined
More informationLocal features and image matching May 8 th, 2018
Local features and image matcing May 8 t, 2018 Yong Jae Lee UC Davis Last time RANSAC for robust fitting Lines, translation Image mosaics Fitting a 2D transformation Homograpy 2 Today Mosaics recap: How
More informationSection 1.2 The Slope of a Tangent
Section 1.2 Te Slope of a Tangent You are familiar wit te concept of a tangent to a curve. Wat geometric interpretation can be given to a tangent to te grap of a function at a point? A tangent is te straigt
More informationθ R = θ 0 (1) -The refraction law says that: the direction of refracted ray (angle θ 1 from vertical) is (2)
LIGHT (Basic information) - Considering te ligt of a projector in a smoky room, one gets to geometrical optics model of ligt as a set of tiny particles tat travel along straigt lines called "optical rays.
More information12.2 TECHNIQUES FOR EVALUATING LIMITS
Section Tecniques for Evaluating Limits 86 TECHNIQUES FOR EVALUATING LIMITS Wat ou sould learn Use te dividing out tecnique to evaluate its of functions Use te rationalizing tecnique to evaluate its of
More informationLow-complexity Image-based 3D Gaming
Low-complexity Image-based 3D Gaming Ingo Bauermann and Eckeard Steinbac Institute of Communication Networks, Media Tecnology Group Tecnisce Universität Müncen Munic, Germany {ingo.bauermann,eckeard.steinbac}@tum.de
More informationDesign of Map Decomposition and Wiimote-based Localization for Vacuuming Robots
Design of Map Decomposition and Wiimote-based Localization for Vacuuming Robots Cia-Pin Kuo, Sy-In Hwang Department of Computer Science and Engineering Yuan Ze University s956007@mail.yzu.edu.tw, syin@cs.yzu.edu.tw
More information2.8 The derivative as a function
CHAPTER 2. LIMITS 56 2.8 Te derivative as a function Definition. Te derivative of f(x) istefunction f (x) defined as follows f f(x + ) f(x) (x). 0 Note: tis differs from te definition in section 2.7 in
More informationPLK-B SERIES Technical Manual (USA Version) CLICK HERE FOR CONTENTS
PLK-B SERIES Technical Manual (USA Version) CLICK ERE FOR CONTENTS CONTROL BOX PANEL MOST COMMONLY USED FUNCTIONS INITIAL READING OF SYSTEM SOFTWARE/PAGES 1-2 RE-INSTALLATION OF TE SYSTEM SOFTWARE/PAGES
More informationAreas of Triangles and Parallelograms. Bases of a parallelogram. Height of a parallelogram THEOREM 11.3: AREA OF A TRIANGLE. a and its corresponding.
11.1 Areas of Triangles and Parallelograms Goal p Find areas of triangles and parallelograms. Your Notes VOCABULARY Bases of a parallelogram Heigt of a parallelogram POSTULATE 4: AREA OF A SQUARE POSTULATE
More informationThe navigability variable is binary either a cell is navigable or not. Thus, we can invert the entire reasoning by substituting x i for x i : (4)
A Multi-Resolution Pyramid for Outdoor Robot Terrain Perception Micael Montemerlo and Sebastian Trun AI Lab, Stanford University 353 Serra Mall Stanford, CA 94305-9010 {mmde,trun}@stanford.edu Abstract
More informationSUPER OBLIQUE INCIDENCE INTERFEROMETER USING SWS PRISM
SUPER OBLIQUE INCIDENCE INTERFEROMETER USING SWS PRISM Yukitosi OTANI 1,2), Yasuiro MIZUTANI 2), Noriiro UMEDA 2) 1) Optical Sciences Center, University of Arizona, Arizona 85721 2) Dept, of Mec. Sys.
More informationSymmetric Tree Replication Protocol for Efficient Distributed Storage System*
ymmetric Tree Replication Protocol for Efficient Distributed torage ystem* ung Cune Coi 1, Hee Yong Youn 1, and Joong up Coi 2 1 cool of Information and Communications Engineering ungkyunkwan University
More informationAVL Trees Outline and Required Reading: AVL Trees ( 11.2) CSE 2011, Winter 2017 Instructor: N. Vlajic
1 AVL Trees Outline and Required Reading: AVL Trees ( 11.2) CSE 2011, Winter 2017 Instructor: N. Vlajic AVL Trees 2 Binary Searc Trees better tan linear dictionaries; owever, te worst case performance
More informationA novel hob cutter design for the manufacture of spur-typed cutters
journal of materials processing tecnology 29 (29) 847 855 journal omepage: www.elsevier.com/locate/jmatprotec A novel ob cutter design for te manufacture of spur-typed cutters Jen-Kuei Hsie a, Huang-Ci
More informationBinocular Tracking Based on Virtual Horopters. ys. Rougeaux, N. Kita, Y. Kuniyoshi, S. Sakane, yf. Chavand
Binocular Tracking Based on Virtual Horopters ys. Rougeaux, N. Kita, Y. Kuniyoshi, S. Sakane, yf. Chavand Autonomous Systems Section ylaboratoire de Robotique d'evry Electrotechnical Laboratory Institut
More informationAn Effective Sensor Deployment Strategy by Linear Density Control in Wireless Sensor Networks Chiming Huang and Rei-Heng Cheng
An ffective Sensor Deployment Strategy by Linear Density Control in Wireless Sensor Networks Ciming Huang and ei-heng Ceng 5 De c e mbe r0 International Journal of Advanced Information Tecnologies (IJAIT),
More informationHaar Transform CS 430 Denbigh Starkey
Haar Transform CS Denbig Starkey. Background. Computing te transform. Restoring te original image from te transform 7. Producing te transform matrix 8 5. Using Haar for lossless compression 6. Using Haar
More informationUnsupervised Learning for Hierarchical Clustering Using Statistical Information
Unsupervised Learning for Hierarcical Clustering Using Statistical Information Masaru Okamoto, Nan Bu, and Tosio Tsuji Department of Artificial Complex System Engineering Hirosima University Kagamiyama
More informationOptimal In-Network Packet Aggregation Policy for Maximum Information Freshness
1 Optimal In-etwork Packet Aggregation Policy for Maimum Information Fresness Alper Sinan Akyurek, Tajana Simunic Rosing Electrical and Computer Engineering, University of California, San Diego aakyurek@ucsd.edu,
More informationFault Localization Using Tarantula
Class 20 Fault localization (cont d) Test-data generation Exam review: Nov 3, after class to :30 Responsible for all material up troug Nov 3 (troug test-data generation) Send questions beforeand so all
More informationeach node in the tree, the difference in height of its two subtrees is at the most p. AVL tree is a BST that is height-balanced-1-tree.
Data Structures CSC212 1 AVL Trees A binary tree is a eigt-balanced-p-tree if for eac node in te tree, te difference in eigt of its two subtrees is at te most p. AVL tree is a BST tat is eigt-balanced-tree.
More informationAn Algorithm for Loopless Deflection in Photonic Packet-Switched Networks
An Algoritm for Loopless Deflection in Potonic Packet-Switced Networks Jason P. Jue Center for Advanced Telecommunications Systems and Services Te University of Texas at Dallas Ricardson, TX 75083-0688
More informationWhen the dimensions of a solid increase by a factor of k, how does the surface area change? How does the volume change?
8.4 Surface Areas and Volumes of Similar Solids Wen te dimensions of a solid increase by a factor of k, ow does te surface area cange? How does te volume cange? 1 ACTIVITY: Comparing Surface Areas and
More informationAreas of Parallelograms and Triangles. To find the area of parallelograms and triangles
10-1 reas of Parallelograms and Triangles ommon ore State Standards G-MG..1 Use geometric sapes, teir measures, and teir properties to descrie ojects. G-GPE..7 Use coordinates to compute perimeters of
More informationOur Calibrated Model has No Predictive Value: An Example from the Petroleum Industry
Our Calibrated Model as No Predictive Value: An Example from te Petroleum Industry J.N. Carter a, P.J. Ballester a, Z. Tavassoli a and P.R. King a a Department of Eart Sciences and Engineering, Imperial
More informationA Practical Approach of Selecting the Edge Detector Parameters to Achieve a Good Edge Map of the Gray Image
Journal of Computer Science 5 (5): 355-362, 2009 ISSN 1549-3636 2009 Science Publications A Practical Approac of Selecting te Edge Detector Parameters to Acieve a Good Edge Map of te Gray Image 1 Akram
More informationA UPnP-based Decentralized Service Discovery Improved Algorithm
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Vol.1, No.1, Marc 2013, pp. 21~26 ISSN: 2089-3272 21 A UPnP-based Decentralized Service Discovery Improved Algoritm Yu Si-cai*, Wu Yan-zi,
More informationOn the use of FHT, its modification for practical applications and the structure of Hough image
On te use of FHT, its modification for practical applications and te structure of Houg image M. Aliev 1,3, E.I. Ersov, D.P. Nikolaev,3 1 Federal Researc Center Computer Science and Control of Russian Academy
More informationInvestigating an automated method for the sensitivity analysis of functions
Investigating an automated metod for te sensitivity analysis of functions Sibel EKER s.eker@student.tudelft.nl Jill SLINGER j..slinger@tudelft.nl Delft University of Tecnology 2628 BX, Delft, te Neterlands
More informationAnnouncements. Lilian s office hours rescheduled: Fri 2-4pm HW2 out tomorrow, due Thursday, 7/7. CSE373: Data Structures & Algorithms
Announcements Lilian s office ours resceduled: Fri 2-4pm HW2 out tomorrow, due Tursday, 7/7 CSE373: Data Structures & Algoritms Deletion in BST 2 5 5 2 9 20 7 0 7 30 Wy migt deletion be arder tan insertion?
More informationLecture 4: Geometry II
Lecture 4: Geometry II LPSS MATHCOUNTS 19 May 2004 Some Well-Known Pytagorean Triples A Pytagorean triple is a set of tree relatively prime 1 natural numers a,, and c satisfying a 2 + 2 = c 2 : 3 2 + 4
More informationDesign of PSO-based Fuzzy Classification Systems
Tamkang Journal of Science and Engineering, Vol. 9, No 1, pp. 6370 (006) 63 Design of PSO-based Fuzzy Classification Systems Cia-Cong Cen Department of Electronics Engineering, Wufeng Institute of Tecnology,
More informationProceedings of the 8th WSEAS International Conference on Neural Networks, Vancouver, British Columbia, Canada, June 19-21,
Proceedings of te 8t WSEAS International Conference on Neural Networks, Vancouver, Britis Columbia, Canada, June 9-2, 2007 3 Neural Network Structures wit Constant Weigts to Implement Dis-Jointly Removed
More informationTest Generation for Acyclic Sequential Circuits with Hold Registers
Test Generation for Acyclic Sequential Circuits wit Hold Registers Tomoo Inoue, Debes Kumar Das, Ciio Sano, Takairo Miara, and Hideo Fujiwara Faculty of Information Sciences Computer Science and Engineering
More informationThe (, D) and (, N) problems in double-step digraphs with unilateral distance
Electronic Journal of Grap Teory and Applications () (), Te (, D) and (, N) problems in double-step digraps wit unilateral distance C Dalfó, MA Fiol Departament de Matemàtica Aplicada IV Universitat Politècnica
More informationMinimizing Memory Access By Improving Register Usage Through High-level Transformations
Minimizing Memory Access By Improving Register Usage Troug Hig-level Transformations San Li Scool of Computer Engineering anyang Tecnological University anyang Avenue, SIGAPORE 639798 Email: p144102711@ntu.edu.sg
More informationDensity Estimation Over Data Stream
Density Estimation Over Data Stream Aoying Zou Dept. of Computer Science, Fudan University 22 Handan Rd. Sangai, 2433, P.R. Cina ayzou@fudan.edu.cn Ziyuan Cai Dept. of Computer Science, Fudan University
More informationCoarticulation: An Approach for Generating Concurrent Plans in Markov Decision Processes
Coarticulation: An Approac for Generating Concurrent Plans in Markov Decision Processes Kasayar Roanimanes kas@cs.umass.edu Sridar Maadevan maadeva@cs.umass.edu Department of Computer Science, University
More informationTREES. General Binary Trees The Search Tree ADT Binary Search Trees AVL Trees Threaded trees Splay Trees B-Trees. UNIT -II
UNIT -II TREES General Binary Trees Te Searc Tree DT Binary Searc Trees VL Trees Treaded trees Splay Trees B-Trees. 2MRKS Q& 1. Define Tree tree is a data structure, wic represents ierarcical relationsip
More information1.4 RATIONAL EXPRESSIONS
6 CHAPTER Fundamentals.4 RATIONAL EXPRESSIONS Te Domain of an Algebraic Epression Simplifying Rational Epressions Multiplying and Dividing Rational Epressions Adding and Subtracting Rational Epressions
More informationNonprehensile Manipulation for Orienting Parts in the Plane
Nonpreensile Manipulation for Orienting Parts in te Plane Nina B. Zumel Robotics Institute Carnegie Mellon University zumel@ri.cmu.edu Micael A. Erdmann Robotics Institute and Scool of Computer Science
More informationRobotics and Autonomous Systems. Joint origin identification of articulated robots with marker-based multi-camera optical tracking systems
Robotics and Autonomous Systems 61 (2013) 580 592 Contents lists available at SciVerse ScienceDirect Robotics and Autonomous Systems journal omepage: wwwelseviercom/locate/robot Joint origin identification
More informationAlternating Direction Implicit Methods for FDTD Using the Dey-Mittra Embedded Boundary Method
Te Open Plasma Pysics Journal, 2010, 3, 29-35 29 Open Access Alternating Direction Implicit Metods for FDTD Using te Dey-Mittra Embedded Boundary Metod T.M. Austin *, J.R. Cary, D.N. Smite C. Nieter Tec-X
More informationA Novel QC-LDPC Code with Flexible Construction and Low Error Floor
A Novel QC-LDPC Code wit Flexile Construction and Low Error Floor Hanxin WANG,2, Saoping CHEN,2,CuitaoZHU,2 and Kaiyou SU Department of Electronics and Information Engineering, Sout-Central University
More informationDeveloping an Efficient Algorithm for Image Fusion Using Dual Tree- Complex Wavelet Transform
ISSN(Online): 30-980 ISSN (Print): 30-9798 (An ISO 397: 007 Certified Organization) Vol. 3, Issue 4, April 05 Developing an Efficient Algoritm for Image Fusion Using Dual Tree- Complex Wavelet Transform
More informationCSE 332: Data Structures & Parallelism Lecture 8: AVL Trees. Ruth Anderson Winter 2019
CSE 2: Data Structures & Parallelism Lecture 8: AVL Trees Rut Anderson Winter 29 Today Dictionaries AVL Trees /25/29 2 Te AVL Balance Condition: Left and rigt subtrees of every node ave eigts differing
More informationPROTOTYPE OF LOAD CELL APPLICATION IN TORQE MEASUREMENT
IMEKO 21 TC3, TC5 and TC22 Conferences Metrology in Modern Context November 22 25, 21, Pattaya, Conburi, Tailand PROTOTYPE OF LOAD CELL APPLICATION IN TORQE MEASUREMENT Tassanai Sanponpute 1, Cokcai Wattong
More informationRedundancy Awareness in SQL Queries
Redundancy Awareness in QL Queries Bin ao and Antonio Badia omputer Engineering and omputer cience Department University of Louisville bin.cao,abadia @louisville.edu Abstract In tis paper, we study QL
More information15-122: Principles of Imperative Computation, Summer 2011 Assignment 6: Trees and Secret Codes
15-122: Principles of Imperative Computation, Summer 2011 Assignment 6: Trees and Secret Codes William Lovas (wlovas@cs) Karl Naden Out: Tuesday, Friday, June 10, 2011 Due: Monday, June 13, 2011 (Written
More informationEfficient Content-Based Indexing of Large Image Databases
Efficient Content-Based Indexing of Large Image Databases ESSAM A. EL-KWAE University of Nort Carolina at Carlotte and MANSUR R. KABUKA University of Miami Large image databases ave emerged in various
More informationEngineering Mechanics (Statics) (Centroid) Dr. Hayder A. Mehdi
Engineering Mecanics (Statics) (Centroid) Dr. Hader A. Medi Centroid of an Area: If an area lies in te x plane and is ounded te curve = f (x), as sown in te following figure ten its centroid will e in
More informationSingle and Multi-View Reconstruction of Structured Scenes
ACCV2002: Te 5t Asian Conference on Computer Vision 23 25 January 2002 Melbourne Australia 1 Single and Multi-View econstruction of Structured Scenes Etienne Grossmann Diego Ortin and José Santos-Victor
More information