A multiview 3D modeling system based on stereo vision techniques

Size: px
Start display at page:

Download "A multiview 3D modeling system based on stereo vision techniques"

Transcription

1 Mchine Vision nd Applictions (2005) 16: Digitl Oject Identifier (DOI) /s Mchine Vision nd Applictions A multiview 3D modeling system sed on stereo vision techniques Soon-Yong Prk 1, Murli Suro 2 1 Computer Engineering Deprtment, Kyungpook Ntionl University, Degu, Kore 2 Electricl nd Computer Engineering Deprtment, Stte University of New York t Stony Brook, Stony Brook, NY , USA Received: 2 August 2003 / Accepted: 20 Septemer 2004 Pulished online: 25 Ferury 2005 c Springer-Verlg 2005 Astrct. This pper introduces stereo vision system to utomticlly generte 3D models of rel ojects. 3D model genertion is sed on the merging of multiview rnge imges otined from digitl stereo cmer. Stereo imges otined from the cmer re rectified, nd correltion-sed stereo mtching technique reconstructs rnge imges from them. A turntle stge is lso employed to otin multiple rnge imges of the ojects. To register rnge imges into common coordinte system utomticlly, we introduce nd clirte turntle coordinte system with respect to the cmer coordinte system. After the registrtion of multiview rnge imges, 3D model is reconstructed using volumetric integrtion technique. Error nlysis on turntle clirtion nd 3D model reconstruction shows the ccurcy of our 3D modeling system. Keywords: Stereo vision Multiview 3D modeling Turntle clirtion 1 Introduction Generting complete 3D model of n oject hs een topic of much interest in recent computer vision nd computer grphics reserch. Mny computer vision techniques hve een investigted to generte complete 3D models. There re two mjor pproches in this reserch.the first one is sed on merging multiview rnge imges into complete 3D model [4,7,23]. The second one is sed on processing photogrphic imges using volumetric reconstruction technique, such s voxel coloring nd shpe-from-silhouettes [5,21]. This pper presents computer vision system to utomticlly generte 3D computer models y merging multiview rnge imges of rel ojects. We employ stereo vision cmer nd turntle stge to develop n utomtic nd inexpensive vision system. Multiview 3D modeling hs een done y mny ctive or pssive rnging techniques. Lser rnge imging nd structured light techniques re the most common ctive techniques. These techniques project specil light ptterns onto the surfce of rel oject to mesure the depth to the surfce y simple tringultion technique [4,7]. Some common pproches Correspondence to: S.Y. Prk (e-mil: syprk@mil.knu.c.kr) of the structured light technique employ single line pttern [9], multiline pttern [17], color-coded pttern [24], nd spce-time coded pttern [19]. Advntges of using the ctive techniques re ccurcy nd speed of depth cquisition [24, 19]. However, ctive techniques re still more expensive thn pssive techniques. In contrst, however, reltively less reserch hs een done using pssive techniques, such s stereo imge nlysis. This is minly due to the inherent prolems (e.g., mismtching nd occlusion) of stereo mtching. Severl stereo mtching techniques hve een introduced; however, only few of them re empolyed for multiview 3D modeling [20]. Okutomi et l. [13] presented multiseline stereo mtching technique to reduce mtching miguity, nd their pproch is empolyed in mny multiview 3D modeling techniques [18]. Chen nd Medioni [3] used stereo cmer to otin rnge imges nd integrted them using volumetric method. In ech viewpoint, they used 3D voxel grid to find disprity surfce using dynmic progrmming technique. Rnder et l. [18] nd Vedulr et l. [22] lso used stereo vision techniques to crete 3D models of dynmic scene for virtul relity pplictions. They used considerle numer of video cmers nd multiple-seline stereo mtching technique proposed y [13]. In order to generte complete 3D models, we otin multiview rnge imges using stereo vision techniques. We use two inexpensive digitl still cmers to cpture stereo imges of n oject. The cmers re clirted y projective clirtion technique, nd stereo imges from them re rectified ccordingly. A rnge imge is then otined from pir of rectified stereo imges. Multiview rnge imges re otined y chnging the viewing direction to the oject. Different pproches to chnging viewing direction exist. Among them re moving oject on turntle with fixed sensor [4,5], moving sensor with fixed oject [1,12], nd other vritions [7,8]. One dvntge of using turntle is the ese of clirtion etween different views. We lso employ turntle stge to rotte the oject nd to otin multiple rnge imges. Multiple rnge imges re then registered nd integrted into single 3D model. In order to register rnge imges utomticlly, we define nd clirte turntle coordinte system (TCS) with respect to the cmer s coordinte system (CCS). To integrte multiple rnge imges into single mesh model, we use vol-

2 S.-Y. Prk, M. Suro: A multiview 3D modeling system sed on stereo vision techniques 149 umetric integrtion technique [10,14]. Error nlysis on rel ojects shows the ccurcy of our 3D model reconstruction. Section 2 presents the clirtion nd rectifiction of stereo imges nd comprison of 3D rnge reconstruction techniques. Section 3 presents the definition nd clirtion of the TCS with respect to the CCS. In Sect. 4, we present 3D modeling technique of merging multiview rnge imges nd error nlysis of our 3D modeling system. Finlly, we conclude the pper in Sect Rnge imge cquisition 2.1 Stereo clirtion nd rectifiction In this pper, we employ projective cmer model to clirte our stereo cmer. Clirtion of the projective cmer model cn e considered s n estimtion of projective trnsformtion mtrix from the world coordinte system (WCS) to the cmer s coordinte system (CCS). Let w =[xyz] T e the coordintes of 3D point W with respect to the WCS, p =[uv] T the coordintes of the projection of w to the retinl (CCD) plne of cmer, nd p =[u v ] T the coordintes of p in the picture plne (pixels). The mpping from 3D coordintes to 2D coordintes is the perspective projection, which is represented y liner trnsformtion in homogeneous coordintes. Let p =[uv1] T, p =[u v 1] T, nd w =[xyz1] T e the homogeneous coordintes of p, p, nd w, respectively. Then 3 4 perspective trnsformtion is given y mtrix M: p = K p = K M w, (1) where = mens equl up to scle fctor. The cmer is therefore modeled y trnsformtion mtrix K nd its perspective projection mtrix (PPM) M, which cn e decomposed into the product M = A[R t]. (2) The mtrices K nd A depend on the intrinsic prmeters only nd hve the following forms: K = k u k v 0, A = f u γu 0 0 f v v 0, (3) where, f u, f v re the focl lengths in the horizontl nd the verticl directions, k u, k v re the scling fctors from the retinl plne to the picture plne, (u 0,v 0 ) re the coordintes of the principl point in the retinl plne, nd γ is skew fctor. Stereo rectifiction determines trnsformtion of ech imge plne such tht pirs of conjugte epipolr lines ecome prllel to the horizontl imge xes. Using projection mtrices of the left nd the right cmers of the stereo vision system, we rectify stereo imges y using the rectifiction technique investigted y Fusiello et l. [6]. A trnsformtion mtrix T i tht rectifies homogeneous pixel p o in n originl imge plne to new pixel position p n is estimted s p n = T i p o. (4) The picture coordintes p n =[u,v, 1] T of the imge point p n re then otined y multiplying the trnsformtion mtrix K to the imge coordintes: p n = K p n. (5) However, when we sve rectified imge to 2D rry of picture frme, we need to consider the trnsltion of the principl point. Otherwise, we my lose some portion of the imge outside of the originl picture frme. This is ecuse of n offset etween the originl principl point (u o0,v o0 ) nd the new principl point (u n0,v n0 ), which is due to the rottion of the opticl xis of the cmer. In order to trnslte the rectified imge ck into the picture frme, we compute the new principl point (u n0,v n0 ) y dding the offset to the old principl point. The offset of the principl points cn e computed y mpping the origin of the retinl plne onto the new retinl plne: õ n = T i u o0 v o0, (6) 1 nd the new retinl coordintes re p n = K( p n õ n ). (7) We consider the offset only in the x direction ecuse rectifying the trnsformtion rottes the imge plne round the y xis. 2.2 Stereo system configurtion Our stereo cmer consists of two identicl digitl still cmers, which re Olympus C-3020 Zoom. The two cmers re instlled on verticl stereo mount. We fix the cmers on the mount with n ritrry toed-in ngle so tht the opticl xes of the cmers converge to out 600 mm from the cmer. Two digitl cmers re connected to personl computer, running on 1.8-GHz Intel Pentium, through two USB ports. Figure 1 shows picture of the stereo cmer nd turntle stge. Fig. 1. Stereo cmer system

3 150 S.-Y. Prk, M. Suro: A multiview 3D modeling system sed on stereo vision techniques YZ plne Z w Fig. 2. Checkerord pttern z f O w Y w x f X w y d x d XY plne We use checkerord pttern to clirte the stereo cmer. The pttern hs two plnes tht re prllel to the xy nd the yz plnes of the WCS. On ech plne re 48 control points tht compose set of 3D world coordinte points. Figure 2 shows digrm of the clirtion pttern. The specifictions of the pttern re s follows: Size of lck squre in x direction: x d =17.2mm. Size of lck squre in y direction: y d =17.18 mm. Offset to yz plne in x direction from origin: x f =6mm, which mens x = 6mmon the yz plne. Offset to edge of rightmost squre on xy plne in z direction: z f =11.5mm. 2.3 Stereo mtching From rectified stereo imge pir we cquire rnge imge y employing multiresolution stereo mtching technique using Gussin pyrmid [2]. A Gussin pyrmid for n imge I is sequence of copies of I, where ech successive copy hs hlf the resolution nd smple rte. The levels of Gussin pyrmid for given imge I re clculted s g k (i, j) = 2 2 m= 2 n= 2 w(m, n)g k 1 (2i + m, 2j + n), (8) g 0 (i, j) =I(i, j), where w(m, n) is 5 5 Gussin kernel. Becuse this kernel is seprle, we use 1D Gussin kernel w(m) whose length is 5. The weights of the Gussin kernel re w(0) = 0.4, w(1) = w( 1) = 0.25, w(2) = w( 2) = Three levels of Gussin pyrmid re used from level 0 to level 2. The level 0 imge corresponds to the originl imge, nd the level 2 imge corresponds to the smllest imge. The originl imge size is , nd the imge size t level 2 is We use vrile size of mtching lock for stereo mtching (15-2k) (15-2k) for the kth pyrmid level. An oject s silhouettes in the stereo imges re segmented y lue screen technique. A inry morphologicl closing nd opening opertion is used to remove noise in the imge segmenttion. The mtching lgorithm finds stereo correspondence only on the oject res in the left nd right imges. The oject s silhouettes re lso used lter for volume intersections in multiview integrtion process. SSD (sum of squred difference)-sed stereo mtching is done t ech level of the Gussin pyrmid from low resolution to high resolution. At the first level of the stereo mtching, the initil serch rnge of stereo disprity SR 0 t level 0 is set to [0,sr 0 ]. Then, t the lowest level of the pyrmid, where k =2, initil stereo disprity SR 2 ecomes [0,sr 0 /(2k)]. At successive levels of the pyrmid, the result of the stereo disprity t the lower levels decides the serch rnge of the corresponding level. If the disprity t the lower level is D i, then the serch rnge of the current level SR i is restricted to within [2 D i 2, 2 D i +2]so tht the stereo mtching lgorithm cn correct possile mismtches in the previous level. When there is pir of stereo imges, g k (l) nd g k (r) for left nd right imges, which re t level k of the pyrmid, SSD(i,j) t imge coordinte (i, j) is SSD(i, j) = m m k= m l= m { } g (l) k (i, j) g (r) k (i + k, j + l), (9) where 2m +1is the size of mtching lock. Figure 3 shows pir of rectified stereo imges of humn fce, nd Fig. 3 shows the result of 3D reconstruction. The depth to 3D point is mesured using the disprity etween projected points in stereo imges. The horizontl imge offsets õ n of the principl points re tken into ccount for depth mesure. In the left nd right retinl plnes, they re out (0.0742, 0) nd ( 1.299, 0) mm, respectively. In the next section, we compre two methods of depth computtion from stereo disprity. 2.4 Depth from tringultion After stereo rectifiction, we consider the new stereo configurtion s prllel stereo cmer. Therefore, we use simple Fig. 3. Stereo mtching results. Rectified left nd right stereo imges of humn fce. Texture-mpped rnge imge

4 S.-Y. Prk, M. Suro: A multiview 3D modeling system sed on stereo vision techniques 151 eqution for depth computtion. Let p l nd p r e the projections of 3D point w to the left nd right retinl plnes. If the disprity etween two imge points is d u in the x direction, the depth w z to 3D point from the origin of the cmer coordinte system (CCS) is w z = f B d u/k u +(u n1 u n2 ), (10) where B = c 1 c 2 is the length of the seline of the stereo cmer; in our system it is mm. u n1 nd u n2 re x coordintes of the new principl points in the left nd right imges, respectively. For the focl length f of the cmer we verge the clirtion results for oth left nd right focl lengths f u,f v, nd it turns out to e mm. 2.5 Depth of liner eqution The depth from two conjugte imge points is lso reconstructed y using Eq. 1. Given two conjugte points p 1 = [u 1,v 1, 1] T nd p 2 =[u 2,v 2, 1] T nd the two projection mtrices M n1 nd M n2, we cn write n overconstrined liner system: Aw = y, (11) where ( 1 u 1 3 ) T 14 + u 1 34 A = ( 2 v 1 3 ) T ( 1 u 2 3 ) T y = 24 + v u 2. (12) 34 ( 2 v 2 3 ) T 24 + v 2 34 Then w gives the position of the 3D point projected to the conjugte points. Column vectors i nd i re entry vectors of M n1 nd M n2, respectively. The 3D point w is represented with respect to the WCS. In this pper, however, we trnsform the world point to reference coordintes in order to represent it with respect to the CCS. Suppose we let the right cmer s coordinte system (RCCS) e the reference. Then we cn trnsform the point y simply using the externl clirtion prmeters [R t] of the right cmers. However, two trnsformtions cn e considered. One is to the old RCCS efore rectifiction, nd the other is to the new RCCS fter rectifiction. By tking into ccount multiview registrtion, which will e presented in the next section, we trnsform the point to the old RCCS y p r =[R o2 t] w, (13) where [R o2 t] is the old externl clirtion prmeters of the RCCS. Becuse the cmer needs to clirte the turntle for registrtion of multiview rnge imges, we represent ll rnge imges with respect to the old RCCS. 2.6 Comprison of reconstruction methods We compre the ccurcy of the two 3D reconstruction methods. To compre the results with the ground truth, we use nother checkerord pttern to compute the 3D positions of Fig. 4. A test checkerord pttern t 0 nd 45 Tle 1. Results of the width of the test pttern (ground truth is 100 mm) Method w 0 w 45 Liner eq. (mm) Tringultion (mm) ll control points. The pttern is plced on the tle nd rotted y 0 nd y 45. We tke pir of stereo imges t ech ngle, detect ll corners, nd compute the depth of the corners using the disprity etween their conjugtes. As shown in Fig. 4, we mesure the horizontl length etween two control points t the upper-left nd upper-right corners on the pttern. In order to minimize noise effects in the mesurement, we lso verge ll eight horizontl lengths etween the leftmost nd rightmost corners. The tringultion method using Eq. 10 shows smll reconstruction error. As shown in Tle 1, there is lso difference etween the two lengths mesured t 0 nd t 45. This difference cn cuse serious prolems if some multiview models re registered nd integrted into single 3D model. In fct, when we use this method to integrte multiple rnge imges, geometric distortion occurs on the 3D model. In contrst, using Eq. 11, we cn reconstruct more ccurtely the 3D model. Tle 1 shows tht the liner eqution method is more ccurte thn the tringultion method. 3 Turntle clirtion 3.1 Rottion xis clirtion As presented in n erlier section, we employ turntle to chnge the stereo cmer s viewing direction to n oject. To merge multiple rnge imges, we need to know the rigid trnsformtion of ech imge with respect to common coordinte system. Becuse we clirte the stereo cmer only once efore tking multiple rnge imges, ech rnge imge otined t different ngles hs n independent coordinte system. To register ll multiview rnge imges, we hve to know the rigid motions etween ll viewpoints. Suppose there re N viewing directions from V 0 to V N 1 nd the V 0 is the reference viewpoint. When there is 3D point p i i tht is otined nd represented y the ith view point,

5 152 S.-Y. Prk, M. Suro: A multiview 3D modeling system sed on stereo vision techniques we cn register it to new point p 0 i in the reference view s follows: p 0 i = T cs R i T 1 cs p i i, (14) where R i is the rottionl trnsformtion from V i to V 0, nd T cs is the trnsformtion from the TCS to the CCS s shown in Fig. 5, which is represented y T cs =[R cs t cs ]. (15) Let us define two independent coordinte systems in 3D spce, the WCS nd the TCS, whose origins re O w nd O s, respectively. Suppose we know the trnsformtion T cw, which is from the origin of the WCS O w to tht of the CCS O c.if we know nother trnsformtion T ws tht is from the origin of the TCS O s to tht of the WCS O w, then we cn derive the trnsformtion T cs = T cw T ws (16) =[R cw t cw ][R ws t ws ]. (17) Suppose there is the WCS in 3D spce with its origin t O w s shown in Fig. 6. In the figure, p 0 is the origin of the WCS (ut it is not necessry) nd p 0 is the sme point fter eing rotted y ngle θ long the Y s xis of the turntle. Given two 3D points nd the rottion xis Y s, we cn define plne Π s shown in the figure. Then we know the vector product (p 0 p 0 ) Y s =0. (18) In other words, p T 0x p 0x Y sx p 0y p 0y Y sy =0. (19) p 0z p 0z Y sz When we hve t lest three points in world coordintes, we cn solve n overdetermined liner eqution p 0x p 0x p 0y p 0y p 0z p 0z p 1x p 1x p 1y p 1y p 1z p Y sx 1z AY = Y sy =0... p Nx p Nx p Ny p Ny p Nz p Y sz Nz (20) X c O c Y c Z c T cw T cs Fig. 5. Geometry of the vision system θ Y w T ws X w O s Y s Z w Z s X s p' 0 O s θ -Y s Z w Z s t ws O w Fig. 6. Rottion xis clirtion with respect to the WCS using the SVD technique. When mtrix A is decomposed such tht A =(UDV T ), the solution of the eqution is column vector of V tht corresponds to the column of the lest eigenvlue in the D mtrix. We then normlize vector Y s to Ŷs. If the computed Y sy is negtive, then we chnge the direction of the xis so tht the xis is in the sme direction s the Y w xis of the WCS. To compute the X s nd Z s xes of the TCS, we pply the following computtions. Let us initilize the X s xis to (1.0,X sy, 1.0). Then X s Y s =0, X sy =( X sx Y sx X sz Y sz )/Y sy, ˆX s = X s / X s, nd Ẑs = ˆX s Ŷs. Finlly, the rottion mtrix from the turntle to the WCS is defined s ( ˆX s ) T T R ws = (Ŷs) T. (21) (Ẑs) T Let us now consider trnsltion from the origin of the TCS to the origin of the WCS. The origin of the TCS is defined s the intersection of the xis Y s nd the Π plne. If we trnsform two 3D points p 0 nd p 0 using the rottion in Eq. 21, the trnsformed points re on the xz plne of the TCS. Suppose the two points p 0 nd p 0 re trnsformed, with respect to the TCS, to new points p s0 nd p s0, respectively. Then the three points O s, p s0, nd p s0 re on the Π plne nd form n isosceles tringle. Therefore, using vector = p s0 p s0, where (p s0, p s0) =R T ws(p 0, p 0) nd the rottion ngle θ, we cn compute trnsltion vector t ws from p s0 to the origin O s. Let us consider the Π plne on which the origin is moved to p s0 nd the y component is zero. Then the center of rottion intersects with Π 3D point t i = [x, 0.0,z] T. Becuse the isosceles tringle is lso on the plne, the origin t i is one of the intersection points of the two circles c 1 nd c 2, s shown in Fig. 7. On the Π plne, the center of c 1 is X s p 0 Y w Xw Π

6 S.-Y. Prk, M. Suro: A multiview 3D modeling system sed on stereo vision techniques 153 Z s c 2 t i θ c 1 r X s Fig. 7. The rottion center is one of the intersections of two circles c 1 nd c 2 Fig. 8. Checkerord ptterns for turntle clirtion ()0 ;()45 t [0.0, 0.0, 0.0] T nd its dimeter is t i. Similrly, the center of c 2 is t [ x, 0.0, z ] T nd its dimeter is lso t i. Let r = t i nd = ; then we derive two circles equtions x 2 + z 2 = r 2, (22) (x x ) 2 +(z z ) 2 = r 2. Using the equtions we get z = 2 x + 2 z 2 x x. (23) 2 z From Eq. 22 we lso get r 2 = x 2 + (2 2 x x) 2 4 2, z 0=4 2 x 2 4 x 2 x +( 4 4r 2 2 z), (24) where r = /2 sin(θ/2). Therefore, the x coordinte of the two intersection points is the solution to the second-order inomil eqution s in Eq. 24. And the z coordinte is computed y Eq. 23. Given two intersection points, only one of them is the rel intersection point. If the intersection point is computed s t i =[x, 0.0,z] T on the Π plne, it should hve property such tht = t i, nd y > 0, ecuse we rotte point p 0 y positive ngle θ long the Y s xis of the turntle coordintes. Let us now derive the trnsformtion mtrix from the TCS to the CCS. Becuse we shift the origin O s to point p s0 to find point t i, the trnsltion from O w to O s ecomes (t i + p s0 ) with respect to the TCS nd R ws (t i + p s0 ) with respect to the WCS. Finlly, the trnsformtion from the turntle to the CCS is computed s T cs = T ws T cw where T ws =[R ws t ws ]=[R ws R ws (t i + p s0 )]. (25) To reduce the noise effect on computing t i, we verge the results of the vectors for some world points. 3.2 Turntle clirtion experiments To estimte the TCS, we use checkerord clirtion pttern s shown in Fig. 8. We plce the pttern on the turntle in such wy tht the xy plne of the pttern fces the cmer, leving the rottion xis ehind. Using the stereo cmer, we tke two pirs of stereo pictures t 0 nd t θ. Then we detect ll 48 corner points in ech picture. Using conjugte points in pir of stereo pictures, we compute the 3D position of the corner points with respect to the RCCS. Computing the trnsformtion from the WCS to the CCS is done s follows. As shown in Fig. 8, the trnsltion t cw is the vector from the cmer to the upper-left corner point p ul. The three xes of the WCS with respect to the cmer system re computed s ˆr wx = p ur p ul / p ur p ul, (26) ˆr wz = p ll p ul / p ll p ul, (27) ˆr wz = ˆr wz ˆr wz, (28) ˆr T T wx nd R cw =. (29) ˆr T wy ˆr T wz An exmple of the trnsformtion mtrix from the TCS to the CCS is computed s T cs = (30) We test our clirtion lgorithm t severl positions of the stereo cmer. Tle 2 shows the registrtion error etween two 3D control point sets, t 0 nd t 45, on the checkerord pttern. The trnsltion vector t cs shows the distnce from the CCS to the TCS. 4 3D model genertion nd error nlysis 4.1 Multiview registrtion nd integrtion Using the rnge imge cquisition nd clirtion techniques presented in erlier sections, we reconstruct 3D models of severl rel ojects. We otin multiple rnge imges of n oject from eight views of the oject. After otining rnge imges, we ring ll of them to common coordinte system

7 154 S.-Y. Prk, M. Suro: A multiview 3D modeling system sed on stereo vision techniques Tle 2. Registrtion error of turntle clirtion in mm t cs Men error Mx. error x y z using the turntle clirtion prmeters. Registered rnge imges re then refined gin y using the point-to-plne registrtion technique we introduced in [16]. After registrtion, rnge imges re integrted to otin 3D mesh model using volumetric modeling technique [10,14,15]. From multiview rnge imges of n oject we find the implicit surfce of the oject y computing the signed distnce of voxel to the surfce of the oject. The implicit surfce is then converted to 3D mesh model y the Mrching Cues lgorithm [10]. More detils of our multiview modeling techniques cn e found in [14,15] D model results Figure 9 shows 3D models of three rel ojects. The first column shows pictures of the ojects, the second column shows surfce representtions of the reconstructed models, nd the third column shows texture-mpped 3D models. If n oject hs little contrst on its surfce, we use slide projector to introduce rndom dot pttern to enhnce the performnce of stereo mtching. The oject in Fig. 9c is very complex nd difficult to reconstruct. It hs non-lmert surfces nd some concvities. We merge 16 multiview rnge imges in this cse. Texture-mpped 3D models show photorelistic reconstruction of the ojects. Tle 3 shows the processing time to generte 3D models of the ojects. The modeling time ctully depends on the resolution of the 3D grid of voxels in the Mrching Cues lgorithm is set. This tle shows only some exmples, where the voxel size of the ojects is 3 or 4 mm. Totl processing time is out 5 to 8 min depending on the complexity nd size of the ojects nd on the numer of views. In the duck oject, we use the slide projector to tke stereo pictures with rndom dot pttern. After tking multiview stereo pictures with norml illumintion, we tke nother set of stereo pictures gin with the rndom dot pttern. Imge cquisition for this oject tkes twice tht of the Mr. Pottohed oject. 4.3 Reconstruction error nlysis To nlyze the ccurcy of our modeling system, we reconstruct 3D models of two ground truth ojects. Two test ojects re shown in Figs. 10 nd 11. One is rectngulr prllelepiped, nd the other is cylinder. We reconstruct 3D models of them nd mesure dimensions of the models to compre c Fig. 9. Reconstruction results of rel ojects. Left to right: Picture of ojects, surfce models, texture-mpped models. Mr. Pottohed. Duck. c Indin couple Tle 3. 3D model genertion time (s) Oject Mr. Pottohed Duck Indin couple Voxel size (mm) No. of tringles No. of views Imge cquisition Rectifiction Stereo mtching Registrtion Integrtion Totl with those of the ground truth models. We choose these two ojects ecuse their dimensions re esily mesured. We use n ICP-sed registrtion technique to first register point clouds of the reconstructed 3D model to tht of the ground truth model. Then dimensionl errors re mesured etween ll points on the model nd their closest conjugtes on the ground truth. We itertively register the reconstructed 3D model to its ground truth until the registrtion error etween the 3D model nd the ground truth converge to constnt vlue. As n error metric, we mesure the verge distnce of the closest points etween the two models. Figure 12 shows the results of registering two ojects. We use 392 control points in the cues oject nd 104 points in cylinder. After the two 3D models the reconstructed model nd the ground truth model re registered, we mesure dimensionl errors on the reconstructed model with respect to the ground truth model. For the cues oject, the RMS errors

8 S.-Y. Prk, M. Suro: A multiview 3D modeling system sed on stereo vision techniques 155 W = 60 D = 60 H = 90 c Fig. 10. Cues oject for error nlysis. () Picture. () Dimension (mm). c Point clouds model R = mm Tle 4. RMS nd mximum errors of cues Dimension W (mm) D (mm) H (mm) V (mm 3 ) Size RMS error MAX error (%) error (RMS) Tle 5. RMS nd mximum errors of cylinder Dimension H (mm) R (mm) V (mm 3 ) Size RMS error MAX error (%) error (RMS) H = mm c Fig. 11. Cylinder oject for error nlysis. Picture. Dimension (mm). c Point clouds model RMS registrtion error (mm) RMS registrtion error (mm) Itertion Cues Cylinder Itertion Fig. 12. RMS registrtion error etween the ground truth nd the reconstructed 3D models. Cues. Cylinder in the W, H, nd D dimensions re mesured for ll vertices on corresponding plnes for exmple the top nd the ottom plnes for the H dimension with respect to the closest vertices on the ground truth. Similrly for the cylinder oject, errors in the R nd H dimensions re mesured using points on side surfces, nd top nd ottom surfces, respectively. Tle 4 shows RMS nd mximum errors in ll dimensions of the cues oject. We lso mesure the volume V of the reconstructed model using volume-mesuring technique descried in reference pper [11]. Tle 5 shows the results of the Cylinder oject. 5 Conclusions We hve introduced stereo vision system to utomticlly generte 3D computer models of rel ojects. The system consists of n inexpensive stereo cmer, turntle, nd personl computer. Clirtion of the stereo cmer nd the turntle stge is presented. We rectify stereo imges nd otin rnge imges of n oject from multiple viewpoints. Those rnge imges re then utomticlly registered to common coordinte system nd integrted into 3D mesh model. We hve introduced new turntle coo rdinte system nd simple nd ccurte clirtion technique. Reconstruction error nlysis shows the ccurcy of our 3D reconstruction. References 1. Allen P, Yng R (1998) Registering, integrting, nd uilding CAD models from rnge dt. In: IEEE interntionl conference on rootics nd utomtion, pp Burt P (1983) The Lplcin pyrmid s compct imge code. IEEE Trns Commun 31(4): Chen Q, Medioni G (1999) A volumetric stereo mtching method: pplictions to imge-sed modeling. In: Proceedings of the conference on computer vision nd pttern recognition 4. Curless B, Levoy M (1996) A volumetric method for uilding complex models from rnge imges. In: Proceedings of SIG- GRAPH, pp Fitzgion A, Cross G, Zissermn A (1998) Automtic 3D model construction for turn-tle sequences. In: Europen workshop SMILE 98. Lecture notes in computer science, vol Springer, Berlin Heidelerg New York, pp

9 156 S.-Y. Prk, M. Suro: A multiview 3D modeling system sed on stereo vision techniques 6. Fussiello A, Trucco E, Verri A (2000) A compct lgorithm for rectifiction of stereo pirs. Mch Vis Appl 12: Huer D (2001) Automtic 3D modeling using rnge imges otined from unknown viewpoints. In: Proceedings of the 3rd interntionl conference on 3D digitl imging nd modeling. IEEE Press, New York pp Lnder P (1998) A multi-cmer method for 3D digitiztion of dynmic, rel-world events. PhD disserttion, Crnegie Mellon University, Pittsurgh, PA 9. Levoy M et l (2000) The digitl Michelngelo project: 3D scnning of lrge sttues. In: Proceedings of SIGGRAPH, pp Lorensen W, Cline H (1987) Mrching Cues: high resolution 3D surfce construction lgorithm. Comput Grph 21(4): Mirtich B (1996) Fst nd ccurte computtion of polyhedrl mss properties. J Grph Tools 1(2): Niem W (1999) Automtic reconstruction of 3D ojects using moile cmer. Imge Vis Comput 17: Okutomi M, Knde T (1993) A multiple-seline stereo. IEEE Trns Pttern Anl Mch Intell 15(4): Prk S, Suro M (2002) Automtic 3D model reconstruction using voxel coding nd pose integrtion. In: Proceedings of the interntionl conference on imge processing, pp Prk S, Suro M (2003) Automtic 3D reconstruction sed on novel pose estimtion nd integrtion techniques. Imge Vis Comput 22(8): Prk S, Suro M (2003) An ccurte nd fst point-to-plne registrtion technique. Pttern Recog Lett 24 (16): Pulli K, Ai-Rched H, Duchmp T, Shpiro L, Stuetzle W (1998) Acquisition nd visuliztion of colored 3D ojects. In: IEEE interntionl conference on pttern recognition, pp Rnder P, Nrynn P, Knde T (1996) Recovery of dynmic scene structure from multiple imge sequences. In: Proceedings of the interntionl conference on multisensor fusion nd integrtion for intelligence systems, pp Rusinkiewicz S, Hll-Holt O, Levoy M (2002) Rel-time 3D model cquisition. In: Proceedings of SIGGRAPH Schrstein D, Szeliski R (2002) A txonomy nd evlution of dense two-frme stereo correspondence lgorithms. Int J Comput Vis 47(1 3): Seitz S, Dyer CR (1997) Photorelistic scene reconstruction y voxel coloring. In: Proceedings of the IEEE conference on computer vision nd pttern recognition, pp Vedul S, Rnder P, Sito H, Knde T (1998) Modeling, comining, nd rendering dynmic rel-world events from imge sequences. In: Proceedings of the 4th conference virtul systems nd multimedi, 1: Wheeler M, Sto Y, Ikenuchi K (1998) Consensus surfces for modeling 3D ojects from multiple rnge imges. In: IEEE conference on computer vision, pp Zhng L, Curless B, Seitz S (2002) Rpid shpe cquisition using color structured light nd multi-pss dynmic progrmming. In: 1st interntionl symposium on 3D dt processing, visuliztion, nd trnsmission, pp Soon-Yong Prk otined his B.S. nd M.S. in Electronics Engineering from Kyungpook Ntionl University, Tegu, Kore, in 1991 nd 1993, respectively. He otined his Ph.D in Electricl nd Computer Engineering from Stte University of New York (SUNY) t Stony Brook in From 1993 to 1999, he ws senior reserch stff in the Advnced Rootics L. t Kore Atomic Energy Reserch Institute. He is currently Postdoctorl Reserch Associte in the Deprtment of Electricl nd Computer Engineering t SUNY t Stony Brook. His reserch interests include 3D Sensing nd Modeling, 3D Pose Estimtion, nd Computer Grphics. Murli Suro otined B. Tech. in Electricl Engineering from the Indin Institute of Technology, Mdrs, nd M.S. nd Ph.D. in Computer Science from the University of Mrylnd, College Prk. He joined the fculty of the Deprtment of Electricl nd Computer Engineering, SUNY t Stony Brook, soon fter his Ph.D. He is the Founder nd Director of the Computer Vision Lortory in the deprtment. His reserch nd teching res include Computer Vision, Digitl Imge Processing, Softwre Engineering, Digitl Systems Design, nd We nd Internet Technology.

2 Computing all Intersections of a Set of Segments Line Segment Intersection

2 Computing all Intersections of a Set of Segments Line Segment Intersection 15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design

More information

GENERATING ORTHOIMAGES FOR CLOSE-RANGE OBJECTS BY AUTOMATICALLY DETECTING BREAKLINES

GENERATING ORTHOIMAGES FOR CLOSE-RANGE OBJECTS BY AUTOMATICALLY DETECTING BREAKLINES GENEATING OTHOIMAGES FO CLOSE-ANGE OBJECTS BY AUTOMATICALLY DETECTING BEAKLINES Efstrtios Stylinidis 1, Lzros Sechidis 1, Petros Ptis 1, Spiros Sptls 2 Aristotle University of Thessloniki 1 Deprtment of

More information

CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE

CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE 3.1 Scheimpflug Configurtion nd Perspective Distortion Scheimpflug criterion were found out to be the best lyout configurtion for Stereoscopic PIV, becuse

More information

Stained Glass Design. Teaching Goals:

Stained Glass Design. Teaching Goals: Stined Glss Design Time required 45-90 minutes Teching Gols: 1. Students pply grphic methods to design vrious shpes on the plne.. Students pply geometric trnsformtions of grphs of functions in order to

More information

6.3 Volumes. Just as area is always positive, so is volume and our attitudes towards finding it.

6.3 Volumes. Just as area is always positive, so is volume and our attitudes towards finding it. 6.3 Volumes Just s re is lwys positive, so is volume nd our ttitudes towrds finding it. Let s review how to find the volume of regulr geometric prism, tht is, 3-dimensionl oject with two regulr fces seprted

More information

Geometric transformations

Geometric transformations Geometric trnsformtions Computer Grphics Some slides re bsed on Shy Shlom slides from TAU mn n n m m T A,,,,,, 2 1 2 22 12 1 21 11 Rows become columns nd columns become rows nm n n m m A,,,,,, 1 1 2 22

More information

Modeling and Simulation of Short Range 3D Triangulation-Based Laser Scanning System

Modeling and Simulation of Short Range 3D Triangulation-Based Laser Scanning System Modeling nd Simultion of Short Rnge 3D Tringultion-Bsed Lser Scnning System Theodor Borngiu Anmri Dogr Alexndru Dumitrche April 14, 2008 Abstrct In this pper, simultion environment for short rnge 3D lser

More information

Analysis of Computed Diffraction Pattern Diagram for Measuring Yarn Twist Angle

Analysis of Computed Diffraction Pattern Diagram for Measuring Yarn Twist Angle Textiles nd Light ndustril Science nd Technology (TLST) Volume 3, 2014 DO: 10.14355/tlist.2014.0301.01 http://www.tlist-journl.org Anlysis of Computed Diffrction Pttern Digrm for Mesuring Yrn Twist Angle

More information

Section 10.4 Hyperbolas

Section 10.4 Hyperbolas 66 Section 10.4 Hyperbols Objective : Definition of hyperbol & hyperbols centered t (0, 0). The third type of conic we will study is the hyperbol. It is defined in the sme mnner tht we defined the prbol

More information

MTH 146 Conics Supplement

MTH 146 Conics Supplement 105- Review of Conics MTH 146 Conics Supplement In this section we review conics If ou ne more detils thn re present in the notes, r through section 105 of the ook Definition: A prol is the set of points

More information

a < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1

a < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1 Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the

More information

MATH 2530: WORKSHEET 7. x 2 y dz dy dx =

MATH 2530: WORKSHEET 7. x 2 y dz dy dx = MATH 253: WORKSHT 7 () Wrm-up: () Review: polr coordintes, integrls involving polr coordintes, triple Riemnn sums, triple integrls, the pplictions of triple integrls (especilly to volume), nd cylindricl

More information

Presentation Martin Randers

Presentation Martin Randers Presenttion Mrtin Rnders Outline Introduction Algorithms Implementtion nd experiments Memory consumption Summry Introduction Introduction Evolution of species cn e modelled in trees Trees consist of nodes

More information

1 Drawing 3D Objects in Adobe Illustrator

1 Drawing 3D Objects in Adobe Illustrator Drwing 3D Objects in Adobe Illustrtor 1 1 Drwing 3D Objects in Adobe Illustrtor This Tutoril will show you how to drw simple objects with three-dimensionl ppernce. At first we will drw rrows indicting

More information

ZZ - Advanced Math Review 2017

ZZ - Advanced Math Review 2017 ZZ - Advnced Mth Review Mtrix Multipliction Given! nd! find the sum of the elements of the product BA First, rewrite the mtrices in the correct order to multiply The product is BA hs order x since B is

More information

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork MA1008 Clculus nd Liner Algebr for Engineers Course Notes for Section B Stephen Wills Deprtment of Mthemtics University College Cork s.wills@ucc.ie http://euclid.ucc.ie/pges/stff/wills/teching/m1008/ma1008.html

More information

P(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have

P(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have Rndom Numers nd Monte Crlo Methods Rndom Numer Methods The integrtion methods discussed so fr ll re sed upon mking polynomil pproximtions to the integrnd. Another clss of numericl methods relies upon using

More information

In the last lecture, we discussed how valid tokens may be specified by regular expressions.

In the last lecture, we discussed how valid tokens may be specified by regular expressions. LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.

More information

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1): Overview (): Before We Begin Administrtive detils Review some questions to consider Winter 2006 Imge Enhncement in the Sptil Domin: Bsics of Sptil Filtering, Smoothing Sptil Filters, Order Sttistics Filters

More information

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming Lecture 10 Evolutionry Computtion: Evolution strtegies nd genetic progrmming Evolution strtegies Genetic progrmming Summry Negnevitsky, Person Eduction, 2011 1 Evolution Strtegies Another pproch to simulting

More information

CS380: Computer Graphics Modeling Transformations. Sung-Eui Yoon ( 윤성의 ) Course URL:

CS380: Computer Graphics Modeling Transformations. Sung-Eui Yoon ( 윤성의 ) Course URL: CS38: Computer Grphics Modeling Trnsformtions Sung-Eui Yoon ( 윤성의 ) Course URL: http://sgl.kist.c.kr/~sungeui/cg/ Clss Ojectives (Ch. 3.5) Know the clssic dt processing steps, rendering pipeline, for rendering

More information

Fig.25: the Role of LEX

Fig.25: the Role of LEX The Lnguge for Specifying Lexicl Anlyzer We shll now study how to uild lexicl nlyzer from specifiction of tokens in the form of list of regulr expressions The discussion centers round the design of n existing

More information

International Conference on Mechanics, Materials and Structural Engineering (ICMMSE 2016)

International Conference on Mechanics, Materials and Structural Engineering (ICMMSE 2016) \ Interntionl Conference on Mechnics, Mterils nd tructurl Engineering (ICMME 2016) Reserch on the Method to Clibrte tructure Prmeters of Line tructured Light Vision ensor Mingng Niu1,, Kngnin Zho1, b,

More information

Viewing and Projection

Viewing and Projection 15-462 Computer Grphics I Lecture 5 Viewing nd Projection Sher Trnsformtion Cmer Positioning Simple Prllel Projections Simple Perspective Projections [Angel, Ch. 5.2-5.4] Jnury 30, 2003 [Red s Drem, Pixr,

More information

Graphing Conic Sections

Graphing Conic Sections Grphing Conic Sections Definition of Circle Set of ll points in plne tht re n equl distnce, clled the rdius, from fixed point in tht plne, clled the center. Grphing Circle (x h) 2 + (y k) 2 = r 2 where

More information

TOWARDS GRADIENT BASED AERODYNAMIC OPTIMIZATION OF WIND TURBINE BLADES USING OVERSET GRIDS

TOWARDS GRADIENT BASED AERODYNAMIC OPTIMIZATION OF WIND TURBINE BLADES USING OVERSET GRIDS TOWARDS GRADIENT BASED AERODYNAMIC OPTIMIZATION OF WIND TURBINE BLADES USING OVERSET GRIDS S. H. Jongsm E. T. A. vn de Weide H. W. M. Hoeijmkers Overset symposium 10-18-2012 Deprtment of mechnicl engineering

More information

Agilent Mass Hunter Software

Agilent Mass Hunter Software Agilent Mss Hunter Softwre Quick Strt Guide Use this guide to get strted with the Mss Hunter softwre. Wht is Mss Hunter Softwre? Mss Hunter is n integrl prt of Agilent TOF softwre (version A.02.00). Mss

More information

COLOUR IMAGE MATCHING FOR DTM GENERATION AND HOUSE EXTRACTION

COLOUR IMAGE MATCHING FOR DTM GENERATION AND HOUSE EXTRACTION Hee Ju Prk OLOUR IMAGE MATHING FOR DTM GENERATION AND HOUSE EXTRATION Hee Ju PARK, Petr ZINMMERMANN * Swiss Federl Institute of Technology, Zuric Switzerlnd Institute for Geodesy nd Photogrmmetry heeju@ns.shingu-c.c.kr

More information

Naming 3D objects. 1 Name the 3D objects labelled in these models. Use the word bank to help you.

Naming 3D objects. 1 Name the 3D objects labelled in these models. Use the word bank to help you. Nming 3D ojects 1 Nme the 3D ojects lelled in these models. Use the word nk to help you. Word nk cue prism sphere cone cylinder pyrmid D A C F A B C D cone cylinder cue cylinder E B E prism F cue G G pyrmid

More information

Complete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li

Complete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li 2nd Interntionl Conference on Electronic & Mechnicl Engineering nd Informtion Technology (EMEIT-212) Complete Coverge Pth Plnning of Mobile Robot Bsed on Dynmic Progrmming Algorithm Peng Zhou, Zhong-min

More information

Area & Volume. Chapter 6.1 & 6.2 September 25, y = 1! x 2. Back to Area:

Area & Volume. Chapter 6.1 & 6.2 September 25, y = 1! x 2. Back to Area: Bck to Are: Are & Volume Chpter 6. & 6. Septemer 5, 6 We cn clculte the re etween the x-xis nd continuous function f on the intervl [,] using the definite integrl:! f x = lim$ f x * i )%x n i= Where fx

More information

Topic 3: 2D Transformations 9/10/2016. Today s Topics. Transformations. Lets start out simple. Points as Homogeneous 2D Point Coords

Topic 3: 2D Transformations 9/10/2016. Today s Topics. Transformations. Lets start out simple. Points as Homogeneous 2D Point Coords Tody s Topics 3. Trnsformtions in 2D 4. Coordinte-free geometry 5. (curves & surfces) Topic 3: 2D Trnsformtions 6. Trnsformtions in 3D Simple Trnsformtions Homogeneous coordintes Homogeneous 2D trnsformtions

More information

Computer Vision and Image Understanding

Computer Vision and Image Understanding Computer Vision nd Imge Understnding 116 (2012) 25 37 Contents lists ville t SciVerse ScienceDirect Computer Vision nd Imge Understnding journl homepge: www.elsevier.com/locte/cviu A systemtic pproch for

More information

HW Stereotactic Targeting

HW Stereotactic Targeting HW Stereotctic Trgeting We re bout to perform stereotctic rdiosurgery with the Gmm Knife under CT guidnce. We instrument the ptient with bse ring nd for CT scnning we ttch fiducil cge (FC). Above: bse

More information

8.2 Areas in the Plane

8.2 Areas in the Plane 39 Chpter 8 Applictions of Definite Integrls 8. Ares in the Plne Wht ou will lern out... Are Between Curves Are Enclosed Intersecting Curves Boundries with Chnging Functions Integrting with Respect to

More information

Grade 7/8 Math Circles Geometric Arithmetic October 31, 2012

Grade 7/8 Math Circles Geometric Arithmetic October 31, 2012 Fculty of Mthemtics Wterloo, Ontrio N2L 3G1 Grde 7/8 Mth Circles Geometric Arithmetic Octoer 31, 2012 Centre for Eduction in Mthemtics nd Computing Ancient Greece hs given irth to some of the most importnt

More information

Real-Time Stereo Vision Techniques

Real-Time Stereo Vision Techniques Rel-Time Stereo Vision Techniques Christos Georgouls nd Ionnis Andredis Lortory of Electronics, Deprtment of Electricl nd Computer Engineering Democritus University of Thrce Xnthi 6700, Greece {cgeorg,indred}@ee.duth.gr

More information

If f(x, y) is a surface that lies above r(t), we can think about the area between the surface and the curve.

If f(x, y) is a surface that lies above r(t), we can think about the area between the surface and the curve. Line Integrls The ide of line integrl is very similr to tht of single integrls. If the function f(x) is bove the x-xis on the intervl [, b], then the integrl of f(x) over [, b] is the re under f over the

More information

COMP 423 lecture 11 Jan. 28, 2008

COMP 423 lecture 11 Jan. 28, 2008 COMP 423 lecture 11 Jn. 28, 2008 Up to now, we hve looked t how some symols in n lphet occur more frequently thn others nd how we cn sve its y using code such tht the codewords for more frequently occuring

More information

15. 3D-Reconstruction from Vanishing Points

15. 3D-Reconstruction from Vanishing Points 15. 3D-Reconstruction from Vnishing Points Christin B.U. Perwss 1 nd Jon Lseny 2 1 Cvendish Lortory, Cmridge 2 C. U. Engineering Deprtment, Cmridge 15.1 Introduction 3D-reconstruction is currently n ctive

More information

Order these angles from smallest to largest by wri ng 1 to 4 under each one. Put a check next to the right angle.

Order these angles from smallest to largest by wri ng 1 to 4 under each one. Put a check next to the right angle. Lines nd ngles Connect ech set of lines to the correct nme: prllel perpendiculr Order these ngles from smllest to lrgest y wri ng to 4 under ech one. Put check next to the right ngle. Complete this tle

More information

Spectral Analysis of MCDF Operations in Image Processing

Spectral Analysis of MCDF Operations in Image Processing Spectrl Anlysis of MCDF Opertions in Imge Processing ZHIQIANG MA 1,2 WANWU GUO 3 1 School of Computer Science, Northest Norml University Chngchun, Jilin, Chin 2 Deprtment of Computer Science, JilinUniversity

More information

Algorithm Design (5) Text Search

Algorithm Design (5) Text Search Algorithm Design (5) Text Serch Tkshi Chikym School of Engineering The University of Tokyo Text Serch Find sustring tht mtches the given key string in text dt of lrge mount Key string: chr x[m] Text Dt:

More information

B. Definition: The volume of a solid of known integrable cross-section area A(x) from x = a

B. Definition: The volume of a solid of known integrable cross-section area A(x) from x = a Mth 176 Clculus Sec. 6.: Volume I. Volume By Slicing A. Introduction We will e trying to find the volume of solid shped using the sum of cross section res times width. We will e driving towrd developing

More information

50 AMC LECTURES Lecture 2 Analytic Geometry Distance and Lines. can be calculated by the following formula:

50 AMC LECTURES Lecture 2 Analytic Geometry Distance and Lines. can be calculated by the following formula: 5 AMC LECTURES Lecture Anlytic Geometry Distnce nd Lines BASIC KNOWLEDGE. Distnce formul The distnce (d) between two points P ( x, y) nd P ( x, y) cn be clculted by the following formul: d ( x y () x )

More information

Hyperbolas. Definition of Hyperbola

Hyperbolas. Definition of Hyperbola CHAT Pre-Clculus Hyperols The third type of conic is clled hyperol. For n ellipse, the sum of the distnces from the foci nd point on the ellipse is fixed numer. For hyperol, the difference of the distnces

More information

Chapter44. Polygons and solids. Contents: A Polygons B Triangles C Quadrilaterals D Solids E Constructing solids

Chapter44. Polygons and solids. Contents: A Polygons B Triangles C Quadrilaterals D Solids E Constructing solids Chpter44 Polygons nd solids Contents: A Polygons B Tringles C Qudrilterls D Solids E Constructing solids 74 POLYGONS AND SOLIDS (Chpter 4) Opening prolem Things to think out: c Wht different shpes cn you

More information

Tilt-Sensing with Kionix MEMS Accelerometers

Tilt-Sensing with Kionix MEMS Accelerometers Tilt-Sensing with Kionix MEMS Accelerometers Introduction Tilt/Inclintion sensing is common ppliction for low-g ccelerometers. This ppliction note describes how to use Kionix MEMS low-g ccelerometers to

More information

Section 9.2 Hyperbolas

Section 9.2 Hyperbolas Section 9. Hperols 597 Section 9. Hperols In the lst section, we lerned tht plnets hve pproimtel ellipticl orits round the sun. When n oject like comet is moving quickl, it is le to escpe the grvittionl

More information

9.1 apply the distance and midpoint formulas

9.1 apply the distance and midpoint formulas 9.1 pply the distnce nd midpoint formuls DISTANCE FORMULA MIDPOINT FORMULA To find the midpoint between two points x, y nd x y 1 1,, we Exmple 1: Find the distnce between the two points. Then, find the

More information

Class-XI Mathematics Conic Sections Chapter-11 Chapter Notes Key Concepts

Class-XI Mathematics Conic Sections Chapter-11 Chapter Notes Key Concepts Clss-XI Mthemtics Conic Sections Chpter-11 Chpter Notes Key Concepts 1. Let be fixed verticl line nd m be nother line intersecting it t fixed point V nd inclined to it t nd ngle On rotting the line m round

More information

Pythagoras theorem and trigonometry (2)

Pythagoras theorem and trigonometry (2) HPTR 10 Pythgors theorem nd trigonometry (2) 31 HPTR Liner equtions In hpter 19, Pythgors theorem nd trigonometry were used to find the lengths of sides nd the sizes of ngles in right-ngled tringles. These

More information

Lecture 4 Single View Metrology

Lecture 4 Single View Metrology Lecture 4 Single View Metrology Professor Silvio Svrese Computtionl Vision nd Geometry Lb Silvio Svrese Lecture 4-4-Jn-5 Lecture 4 Single View Metrology Review clibrtion nd 2D trnsformtions Vnishing points

More information

A Study on Eye Gaze Estimation Method Based on Cornea Model of Human Eye

A Study on Eye Gaze Estimation Method Based on Cornea Model of Human Eye A Study on Eye Gze Estimtion Method Bsed on Corne Model of Humn Eye Eui Chul Lee 1 nd Kng Ryoung Prk 2 1 Dept. of Computer Science, Sngmyung University, 7 Hongji-dong, Jongro-Ku, Seoul, Republic of Kore

More information

A HYDRAULIC SIMULATOR FOR AN EXCAVATOR

A HYDRAULIC SIMULATOR FOR AN EXCAVATOR P-06 Proceedings of the 7th JFPS Interntionl Symposium on Fluid Power TOYAMA 008 September 5-8 008 A HYDRAULIC SIMULATOR FOR AN EXCAVATOR Soon-Kwng Kwon* Je-Jun Kim* Young-Mn Jung* Chn-Se Jung* Chng-Don

More information

called the vertex. The line through the focus perpendicular to the directrix is called the axis of the parabola.

called the vertex. The line through the focus perpendicular to the directrix is called the axis of the parabola. Review of conic sections Conic sections re grphs of the form REVIEW OF CONIC SECTIONS prols ellipses hperols P(, ) F(, p) O p =_p REVIEW OF CONIC SECTIONS In this section we give geometric definitions

More information

INTRODUCTION TO SIMPLICIAL COMPLEXES

INTRODUCTION TO SIMPLICIAL COMPLEXES INTRODUCTION TO SIMPLICIAL COMPLEXES CASEY KELLEHER AND ALESSANDRA PANTANO 0.1. Introduction. In this ctivity set we re going to introduce notion from Algebric Topology clled simplicil homology. The min

More information

CSCI 104. Rafael Ferreira da Silva. Slides adapted from: Mark Redekopp and David Kempe

CSCI 104. Rafael Ferreira da Silva. Slides adapted from: Mark Redekopp and David Kempe CSCI 0 fel Ferreir d Silv rfsilv@isi.edu Slides dpted from: Mrk edekopp nd Dvid Kempe LOG STUCTUED MEGE TEES Series Summtion eview Let n = + + + + k $ = #%& #. Wht is n? n = k+ - Wht is log () + log ()

More information

If you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs.

If you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs. Lecture 5 Wlks, Trils, Pths nd Connectedness Reding: Some of the mteril in this lecture comes from Section 1.2 of Dieter Jungnickel (2008), Grphs, Networks nd Algorithms, 3rd edition, which is ville online

More information

CS143 Handout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexical Analysis

CS143 Handout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexical Analysis CS143 Hndout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexicl Anlysis In this first written ssignment, you'll get the chnce to ply round with the vrious constructions tht come up when doing lexicl

More information

Today. CS 188: Artificial Intelligence Fall Recap: Search. Example: Pancake Problem. Example: Pancake Problem. General Tree Search.

Today. CS 188: Artificial Intelligence Fall Recap: Search. Example: Pancake Problem. Example: Pancake Problem. General Tree Search. CS 88: Artificil Intelligence Fll 00 Lecture : A* Serch 9//00 A* Serch rph Serch Tody Heuristic Design Dn Klein UC Berkeley Multiple slides from Sturt Russell or Andrew Moore Recp: Serch Exmple: Pncke

More information

Topics in Analytic Geometry

Topics in Analytic Geometry Nme Chpter 10 Topics in Anltic Geometr Section 10.1 Lines Objective: In this lesson ou lerned how to find the inclintion of line, the ngle between two lines, nd the distnce between point nd line. Importnt

More information

A Tautology Checker loosely related to Stålmarck s Algorithm by Martin Richards

A Tautology Checker loosely related to Stålmarck s Algorithm by Martin Richards A Tutology Checker loosely relted to Stålmrck s Algorithm y Mrtin Richrds mr@cl.cm.c.uk http://www.cl.cm.c.uk/users/mr/ University Computer Lortory New Museum Site Pemroke Street Cmridge, CB2 3QG Mrtin

More information

Date: 9.1. Conics: Parabolas

Date: 9.1. Conics: Parabolas Dte: 9. Conics: Prols Preclculus H. Notes: Unit 9 Conics Conic Sections: curves tht re formed y the intersection of plne nd doulenpped cone Syllus Ojectives:. The student will grph reltions or functions,

More information

6.2 Volumes of Revolution: The Disk Method

6.2 Volumes of Revolution: The Disk Method mth ppliction: volumes by disks: volume prt ii 6 6 Volumes of Revolution: The Disk Method One of the simplest pplictions of integrtion (Theorem 6) nd the ccumultion process is to determine so-clled volumes

More information

Unit 5 Vocabulary. A function is a special relationship where each input has a single output.

Unit 5 Vocabulary. A function is a special relationship where each input has a single output. MODULE 3 Terms Definition Picture/Exmple/Nottion 1 Function Nottion Function nottion is n efficient nd effective wy to write functions of ll types. This nottion llows you to identify the input vlue with

More information

Fig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1.

Fig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1. Answer on Question #5692, Physics, Optics Stte slient fetures of single slit Frunhofer diffrction pttern. The slit is verticl nd illuminted by point source. Also, obtin n expression for intensity distribution

More information

CALIBRATION OF A STRUCTURED LIGHT-BASED STEREO CATADIOPTRIC SENSOR *

CALIBRATION OF A STRUCTURED LIGHT-BASED STEREO CATADIOPTRIC SENSOR * AIBRATION OF A STRUTURED IGHT-BASED STEREO ATADIOPTRI SENSOR * Rdu Orghidn, Joquim Slvi, El Mustph Mouddi omputer Vision nd Rootics Group, Institute of Informtics nd Applictions, Universitt de Giron, Avd.

More information

A COLOUR CORRECTION PREPROCESSING METHOD FOR MULTIVIEW VIDEO CODING

A COLOUR CORRECTION PREPROCESSING METHOD FOR MULTIVIEW VIDEO CODING A COLOR CORRECTO REROCESSG METHOD FOR MLTEW DEO CODG Colin Doutre nd nos siopoulos Deprtment of Electricl nd Computer Engineering, niversity of British Columbi 66 Min Mll, 6T Z4, ncouver, BC, Cnd emil:

More information

II. THE ALGORITHM. A. Depth Map Processing

II. THE ALGORITHM. A. Depth Map Processing Lerning Plnr Geometric Scene Context Using Stereo Vision Pul G. Bumstrck, Bryn D. Brudevold, nd Pul D. Reynolds {pbumstrck,brynb,pulr2}@stnford.edu CS229 Finl Project Report December 15, 2006 Abstrct A

More information

USING HOUGH TRANSFORM IN LINE EXTRACTION

USING HOUGH TRANSFORM IN LINE EXTRACTION Stylinidis, Efstrtios USING HOUGH TRANSFORM IN LINE EXTRACTION Efstrtios STYLIANIDIS, Petros PATIAS The Aristotle University of Thessloniki, Deprtment of Cdstre Photogrmmetry nd Crtogrphy Univ. Box 473,

More information

such that the S i cover S, or equivalently S

such that the S i cover S, or equivalently S MATH 55 Triple Integrls Fll 16 1. Definition Given solid in spce, prtition of consists of finite set of solis = { 1,, n } such tht the i cover, or equivlently n i. Furthermore, for ech i, intersects i

More information

Systems I. Logic Design I. Topics Digital logic Logic gates Simple combinational logic circuits

Systems I. Logic Design I. Topics Digital logic Logic gates Simple combinational logic circuits Systems I Logic Design I Topics Digitl logic Logic gtes Simple comintionl logic circuits Simple C sttement.. C = + ; Wht pieces of hrdwre do you think you might need? Storge - for vlues,, C Computtion

More information

Automated Stereo Camera Calibration System

Automated Stereo Camera Calibration System Automted Stereo Cmer Clibrtion System Brin J O Kennedy, Ben Herbst Deprtment of Electronic Engineering, niversity of Stellenbosch, Stellenbosch, 7, South Afric, brokenn@dspsuncz, herbst@ibissuncz Abstrct

More information

F. R. K. Chung y. University ofpennsylvania. Philadelphia, Pennsylvania R. L. Graham. AT&T Labs - Research. March 2,1997.

F. R. K. Chung y. University ofpennsylvania. Philadelphia, Pennsylvania R. L. Graham. AT&T Labs - Research. March 2,1997. Forced convex n-gons in the plne F. R. K. Chung y University ofpennsylvni Phildelphi, Pennsylvni 19104 R. L. Grhm AT&T Ls - Reserch Murry Hill, New Jersey 07974 Mrch 2,1997 Astrct In seminl pper from 1935,

More information

Summer Review Packet For Algebra 2 CP/Honors

Summer Review Packet For Algebra 2 CP/Honors Summer Review Pcket For Alger CP/Honors Nme Current Course Mth Techer Introduction Alger uilds on topics studied from oth Alger nd Geometr. Certin topics re sufficientl involved tht the cll for some review

More information

Ray surface intersections

Ray surface intersections Ry surfce intersections Some primitives Finite primitives: polygons spheres, cylinders, cones prts of generl qudrics Infinite primitives: plnes infinite cylinders nd cones generl qudrics A finite primitive

More information

Lecture 7: Building 3D Models (Part 1) Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)

Lecture 7: Building 3D Models (Part 1) Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI) Computer Grphics (CS 4731) Lecture 7: Building 3D Models (Prt 1) Prof Emmnuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) Stndrd d Unit itvectors Define y i j 1,0,0 0,1,0 k i k 0,0,1

More information

Machine vision system for surface inspection on brushed industrial parts.

Machine vision system for surface inspection on brushed industrial parts. Mchine vision system for surfce inspection on rushed industril prts. Nicols Bonnot, Rlph Seulin, Frederic Merienne Lortoire Le2i, CNRS UMR 5158, University of Burgundy, Le Creusot, Frnce. ABSTRACT This

More information

CS321 Languages and Compiler Design I. Winter 2012 Lecture 5

CS321 Languages and Compiler Design I. Winter 2012 Lecture 5 CS321 Lnguges nd Compiler Design I Winter 2012 Lecture 5 1 FINITE AUTOMATA A non-deterministic finite utomton (NFA) consists of: An input lphet Σ, e.g. Σ =,. A set of sttes S, e.g. S = {1, 3, 5, 7, 11,

More information

Slides for Data Mining by I. H. Witten and E. Frank

Slides for Data Mining by I. H. Witten and E. Frank Slides for Dt Mining y I. H. Witten nd E. Frnk Simplicity first Simple lgorithms often work very well! There re mny kinds of simple structure, eg: One ttriute does ll the work All ttriutes contriute eqully

More information

SUPPLEMENTARY INFORMATION

SUPPLEMENTARY INFORMATION Supplementry Figure y (m) x (m) prllel perpendiculr Distnce (m) Bird Stndrd devition for distnce (m) c 6 prllel perpendiculr 4 doi:.8/nture99 SUPPLEMENTARY FIGURE Confirmtion tht movement within the flock

More information

this grammar generates the following language: Because this symbol will also be used in a later step, it receives the

this grammar generates the following language: Because this symbol will also be used in a later step, it receives the LR() nlysis Drwcks of LR(). Look-hed symols s eplined efore, concerning LR(), it is possile to consult the net set to determine, in the reduction sttes, for which symols it would e possile to perform reductions.

More information

A dual of the rectangle-segmentation problem for binary matrices

A dual of the rectangle-segmentation problem for binary matrices A dul of the rectngle-segmenttion prolem for inry mtrices Thoms Klinowski Astrct We consider the prolem to decompose inry mtrix into smll numer of inry mtrices whose -entries form rectngle. We show tht

More information

4-1 NAME DATE PERIOD. Study Guide. Parallel Lines and Planes P Q, O Q. Sample answers: A J, A F, and D E

4-1 NAME DATE PERIOD. Study Guide. Parallel Lines and Planes P Q, O Q. Sample answers: A J, A F, and D E 4-1 NAME DATE PERIOD Pges 142 147 Prllel Lines nd Plnes When plnes do not intersect, they re sid to e prllel. Also, when lines in the sme plne do not intersect, they re prllel. But when lines re not in

More information

3 4. Answers may vary. Sample: Reteaching Vertical s are.

3 4. Answers may vary. Sample: Reteaching Vertical s are. Chpter 7 Answers Alterntive Activities 7-2 1 2. Check students work. 3. The imge hs length tht is 2 3 tht of the originl segment nd is prllel to the originl segment. 4. The segments pss through the endpoints

More information

Math 35 Review Sheet, Spring 2014

Math 35 Review Sheet, Spring 2014 Mth 35 Review heet, pring 2014 For the finl exm, do ny 12 of the 15 questions in 3 hours. They re worth 8 points ech, mking 96, with 4 more points for netness! Put ll your work nd nswers in the provided

More information

x )Scales are the reciprocal of each other. e

x )Scales are the reciprocal of each other. e 9. Reciprocls A Complete Slide Rule Mnul - eville W Young Chpter 9 Further Applictions of the LL scles The LL (e x ) scles nd the corresponding LL 0 (e -x or Exmple : 0.244 4.. Set the hir line over 4.

More information

Video-rate Image Segmentation by means of Region Splitting and Merging

Video-rate Image Segmentation by means of Region Splitting and Merging Video-rte Imge Segmenttion y mens of Region Splitting nd Merging Knur Anej, Florence Lguzet, Lionel Lcssgne, Alin Merigot Institute for Fundmentl Electronics, University of Pris South Orsy, Frnce knur.nej@gmil.com,

More information

Parametric ego-motion estimation for vehicle surround analysis using an omnidirectional camera

Parametric ego-motion estimation for vehicle surround analysis using an omnidirectional camera Mchine Vision nd Applictions (25) 16: 85 95 Digitl Oject Identifier (DOI) 1.17/s138-4-168-z Mchine Vision nd Applictions Prmetric ego-motion estimtion for vehicle surround nlysis using n omnidirectionl

More information

LU Decomposition. Mechanical Engineering Majors. Authors: Autar Kaw

LU Decomposition. Mechanical Engineering Majors. Authors: Autar Kaw LU Decomposition Mechnicl Engineering Mjors Authors: Autr Kw Trnsforming Numericl Methods Eduction for STEM Undergrdutes // LU Decomposition LU Decomposition LU Decomposition is nother method to solve

More information

Approximation by NURBS with free knots

Approximation by NURBS with free knots pproximtion by NURBS with free knots M Rndrinrivony G Brunnett echnicl University of Chemnitz Fculty of Computer Science Computer Grphics nd Visuliztion Strße der Ntionen 6 97 Chemnitz Germny Emil: mhrvo@informtiktu-chemnitzde

More information

An Integrated Simulation System for Human Factors Study

An Integrated Simulation System for Human Factors Study An Integrted Simultion System for Humn Fctors Study Ying Wng, Wei Zhng Deprtment of Industril Engineering, Tsinghu University, Beijing 100084, Chin Foud Bennis, Dmien Chblt IRCCyN, Ecole Centrle de Nntes,

More information

PARALLEL AND DISTRIBUTED COMPUTING

PARALLEL AND DISTRIBUTED COMPUTING PARALLEL AND DISTRIBUTED COMPUTING 2009/2010 1 st Semester Teste Jnury 9, 2010 Durtion: 2h00 - No extr mteril llowed. This includes notes, scrtch pper, clcultor, etc. - Give your nswers in the ville spce

More information

Approximation of Two-Dimensional Rectangle Packing

Approximation of Two-Dimensional Rectangle Packing pproximtion of Two-imensionl Rectngle Pcking Pinhong hen, Yn hen, Mudit Goel, Freddy Mng S70 Project Report, Spring 1999. My 18, 1999 1 Introduction 1-d in pcking nd -d in pcking re clssic NP-complete

More information

On the Detection of Step Edges in Algorithms Based on Gradient Vector Analysis

On the Detection of Step Edges in Algorithms Based on Gradient Vector Analysis On the Detection of Step Edges in Algorithms Bsed on Grdient Vector Anlysis A. Lrr6, E. Montseny Computer Engineering Dept. Universitt Rovir i Virgili Crreter de Slou sin 43006 Trrgon, Spin Emil: lrre@etse.urv.es

More information

Lighting Analysis and Texture Modification of 3D Human Face Scans

Lighting Analysis and Texture Modification of 3D Human Face Scans Digitl Imge Computing Techniques n Applictions Lighting Anlysis n Texture Moifiction of 3D Humn Fce Scns Xiozheng Zhng, Snqing Zho n Yongsheng Go Computer Vision n Imge Processing Lbortory, Griffith School

More information

1.1. Interval Notation and Set Notation Essential Question When is it convenient to use set-builder notation to represent a set of numbers?

1.1. Interval Notation and Set Notation Essential Question When is it convenient to use set-builder notation to represent a set of numbers? 1.1 TEXAS ESSENTIAL KNOWLEDGE AND SKILLS Prepring for 2A.6.K, 2A.7.I Intervl Nottion nd Set Nottion Essentil Question When is it convenient to use set-uilder nottion to represent set of numers? A collection

More information

Suffix trees, suffix arrays, BWT

Suffix trees, suffix arrays, BWT ALGORITHMES POUR LA BIO-INFORMATIQUE ET LA VISUALISATION COURS 3 Rluc Uricru Suffix trees, suffix rrys, BWT Bsed on: Suffix trees nd suffix rrys presenttion y Him Kpln Suffix trees course y Pco Gomez Liner-Time

More information

Unit #9 : Definite Integral Properties, Fundamental Theorem of Calculus

Unit #9 : Definite Integral Properties, Fundamental Theorem of Calculus Unit #9 : Definite Integrl Properties, Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl

More information