All in-focus View Synthesis from Under-Sampled Light Fields
|
|
- Blanche Gregory
- 5 years ago
- Views:
Transcription
1 ICAT 2003 December 3-5, Tokyo, Japan All in-focu View Synthei from Under-Sampled Light Field Keita Takahahi,AkiraKubota and Takehi Naemura TheUniverityofTokyo Carnegie Mellon Univerity 7-3-1, Hongo, Bunkyo-ku, Tokyo 5000 Forbe Ave, Pittburgh, PA, , Japan 15213, USA Abtract Light field rendering (LFR) i a fundamental method for generating new view from a et of pre-acquired image. We ue denely-aligned camera for the proce of acquiring the et of image. In mot practical cae, the denity of the aligned camera i not high enough to yntheize appropriate view. Thi under-ampling condition caue focu-like effect in the yntheized view. Thi paper propoe a new method for olving thi problem. Firt, a et of differently focued view i yntheized from the underampled et of pre-acquired image. Then, an all in-focu view i generated from the et of differently focued view. Thi i baed on a new focu meaurement algorithm pecialized for light field rendering and plenoptic ampling theory. Experimental reult how the effectivene of our approach. Key word: Light Field Rendering, Focal Plane, All-in Focu, Focu Meaure, Plenoptic Sampling 1. Introduction In virtual reality and telecommunication ytem, interactive viewing of photo-realitic 3D cene i one of the mot important technical iue. A a fundamental method of image-baed rendering, light field rendering (LFR) [1] offer a promiing olution for thi iue. By thi method, we can yntheize free-viewpoint image (ynthetic view) from a et of pre-acquired image (input image) with little or no geometric model of the cene. It i poible to yntheize highly photo-realitic image in real time with graphic hardware acceleration. The algorithm of LFR i imple. Each pixel value of input image i parameterized a a light-ray data, and tored in a light-ray databae. We can yntheize a view of a given viewpoint from the databae by picking up the date of uch light-ray thoe pa through the viewpoint. In thi proce, light-ray data are interpolated on the aumption that object in the cene are ituated on a plane, which i called a focal plane. In mot practical cae, the et of input image cannot not be acquired denely enough to produce free-viewpoint image with adequate quality. In other word, light-ray data i under-ampled. Thi under-ampling condition caue focu-like effect 1 on the ynthetic view [2]. Objectituatednearthefocal plane are yntheized clearly and harply (in focu), while object apart from the focal plane are with blurring and ghoting (out of focu). Thi i a eriou problem in the ene of ynthei quality. Therefore, our concern in thi paper i how to yntheize all in-focu image at arbitrary viewpoint without increaing the number of input image. A main approach to that problem i utilization of geometric information of the cene in addition to the lightray databae [2, 3, 4, 5, 6]. In thi approach, the tructure of the cene i approximated by a focal urface, aet of depth layer or a 3D meh model which repreent the cene tructure more preicely than a imple focal plane. In general, more precie geometry can generate more favorable ynthetic view. However, thee method need a pre-etimation proce to recover the cene tructure before the image ynthei proce. It conume much time and computation power, and in ome cae it need ome manual procedure. Even the mot ophiticated computer viion technologie might fail to etimate the hape of object with adequate quality, ince their reult are ubject to the material of the object and lighting condition. Defectivene of geometric model would caue highly viible hole and cum in the ynthetic view. In thi paper, we propoe a different approach from the one mentioned above for yntheizing all in-focu image. Firt, for a given viewpoint, we yntheize ome equence of differently focued image by changing the depth of the focal plane of the LFR method. Then, we apply a new focu meaure to detect in-focu region in the differently focued image by comparing the equence. Finally, we integrate them into an all in-focu image. Thi mean that a view-dependent depth map i generated for each viewpoint. Thu, the propoed method doe not ue a global depth map that require pre-etimation proce. The merit of the view-dependent depth map i that it i good enough for the correponding viewpoint. Our approach ha a cloe connection to the conventional depth from focu method [7, 8] or image fuion method [9], which utilize multiple differently focued im- 1 In LFR, input image are aumed to have no defocu blurring. Notice that what i called focu here i an unique effect in LFR.
2 f z min Ω u + Ω = 0 Ω u O Recontruction Filter K Ω u f z max 2 2 Ω +Ω = 0 u Ω Fig. 1: Signal analyi of light field in the frequency domain. age taken by phyical camera. However, the focu-like effect generated by the LFR method have different nature from the one by phyical camera. For example, in the cae of LFR, not only the blurring but alo the ghoting effect appear in defocued region. Therefore, we need a new focu meaure that i pecialized for LFR. The remainder of thi paper i a follow. In Section 2, related work are ummarized to explain the phenomenon of focu in LFR from the theoretical viewpoint. In Section 3, we propoe a new focu meaure that i pecialized for a et of image yntheized by the LFR method. We alo decribe a pecific method for yntheizing an all infocu image from the et of image uing focu meaurement. In Section 4, our implementation and experimental reult are decribed. Finally we conclude our paper in Section Background In thi ection, we introduce the theory of plenoptic ampling [10] that analye light field ignal in the frequency domain. Thi theory give an inightful view to clarify the reaon why the focu-like effect appear on the ynthetic view by the LFR method [2, 11]. In thi paper, we adopt the parameterization of light field decribed in [2]. 2.1 Spectrum of Light Field Signal Input image are captured at 2D grid point on a plane which i called a camera plane. We conider that the optical axi of each camera i orthogonal to the camera plane. The poition of a camera and a pixel on the camera are denoted by (, t) and(u, v). Then, each light-ray captured by input camera i uniquely determined by a et of 4 parameter a (, t, u, v). For implicity, we dicu the 2D ubpace (, u) of the original 4D light field (, t, u, v). In the plenoptic ampling theory, light field ignal are analyzed in the frequency domain. (Ω, Ω u)denote the frequency pace correponding to the (, u) pace. A decribed in [10], the ignal pectrum appear only in the hadowed area in Figure 1. That i to ay: (1) When the range of depth (ditance from the camera plane) of the cene i repreented a z min Z z max, the pectrum i bounded by the following two line: f f Ω u +Ω =0, Ω u +Ω =0, (1) z min z max where f denote the focal length of the input camera. (2) the maximum frequency in the Ω u axi i denoted a K Ωu (= 2K fu ), which i determined by the complexity of the cene texture, the reolution of the input camera or the reolution of the yntheized image. Since the light field i ampled dicretely, replication of the original pectrum appear in a contant interval a hown in Figure 1. When the ditance between input camera i, the interval in the frequency domain i repreented by 2/. The original pectrum would not overlap the neighboring replication, when the following relation i atified: z min z max K fu f. (2) 2.2 Focu in Synthetic View In the image ynthei proce, the light-ray data are interpolated and re-ampled. To undertand focu in yntheized image, we conider how to recontruct a continuou ignal from the dicretely ampled ignal. In uch cae that Equation (2) i atified, the ideal box filter hown in Figure 1 recontruct the continuou ignal without aliaing artifact. The filter let through the entire pectrum component inide the box, while it completely cut off them outide the box. A decribed in [10], the lope of the box correpond to the depth of the focal plane. Actually, the gradient of the idewie line of the box i z 0/f,wherez 0 denote the depth of the focal plane. The filter i optimized when z 0 i equal to z opt that i defined a 1 = 1 z opt 2 ( ). (3) z max z min Shown in Figure 2 i the relationhip between z 0 and the hape of the recontruction filter. Even if Equation (2) i atified, when z 0 i much larger or maller than z opt, the continuou ignal i not recontructed properly a hown in Figure 2(a) and (c). The leakage of high frequency component and the interfuion of the neighboring replication caue blurring and ghoting artifact in the ynthetic view. In mot practical cae, Equation (2) i not atified for the whole cene ince the ampling denity (1/) i not high enough. In thi paper, we conider uch a mall region of the cene where the depth variation i mall enough to atify Equation (2). When the value of z 0 i optimized for the region, the light field ignal of
3 (a) z 0 <z opt (b) z 0 = z opt (c) z 0 >z opt Fig. 2: Relation between the depth of the focal plane z 0 and the hape of the recontruction filter. the region i recontructed clearly and harply (in focu) without aliaing. In other word, when the value of z 0 i not optimized, the region i recontructed out of focu. 3. All in-focu View Synthei from Under- Sampled Light Field In thi ection, we propoe a new algorithm for yntheizing all in-focu view from under-ampled light field. In our method, we firt yntheize equence of view by the conventional LFR method. What i important here i that their focal plane are different from each other. Then, we integrate their in-focu region to generate an all in-focu view. Thi i baed on our propoal of focu meaure pecialized for LFR. 3.1 Focu Meaure in LFR In the cae of phyical camera, defocu blurring can be modeled a the degradation of high-frequency component. Therefore, the high-frequency energy i ued a a good meaure of focu. Given a equence of differently focued image, we could eaily detect the in-focu region by earching uch region that ha the highet energy in the high-frequency domain among them. In the cae of image yntheized by LFR, however, not only blurring but alo ghoting artifact that contain ome high-frequency component arie in the defocued region. Therefore, we need a novel focu meaure pecialized for LFR. Our propoal for thi focu meaurement i to utilize the difference among image yntheized by different recontruction filter which are to interpolate dicretelyampled light field. Conider a et of image generated by different filter at an identical focued depth. The focued region would be almot the ame in all the image regardle which filter i ued. The defocued region, however, would how the difference of the characteritic of the filter. Therefore, ubtraction of image generated by different filter can be ued a the focu meaure for LFR. That i to ay, if a region i in focu, pixel value of the region are zero or very mall in the ubtraction image. Now, we give a theoretical explanation on the principle mentioned above in frequency domain analyi. Conider uch a mall region that the depth variation i mall enough to atify the following equation z min z max 2 1 (4) K fu f The condition of thi equation i more trict than that of Equation (2), ince we need to ue ome other recontruction filter in addition to the one decribed in [10]. In thi paper, we ue three different recontruction filter hown a dahed parallelogram in Figure 3, 4 and 5. But, the number of filter i not limited to three in our method. (1) normal filter (Figure 3): the mot fundamental boxhaped filter. The width i 2/. Whenz 0 i z opt, it i the optimal filter decribed in [10]. (2) wide-aperture filter (Figure 4) [2]: The width of thi filter i maller than 2/. Thi lead to that the yntheized image would look like image taken by a wide-aperture camera. In thi paper, the width i et to / a hown in Figure 4. (3) camera-kipped filter (Figure 5): The input image ued for the recontruction are kipped alternately. In thi cae, The repeating interval of the pectrum become /. We apply the normal filter, the widthofwidthi/, for the reduced light-ray data. When the region i in focu (z 0 = z opt), all the filter would produce the ame reult, a hown in Figure 3(a), 4(a) and 5(a). When the region i out of focu (z 0 z opt), however, different filter would produce different reult. Thi i becaue the frequency component paed through by the filter are obviouly different from each other; the leakage of the original pectrum and the interfuion of the replication pectrum are caued differently a illutrated in Figure 3(b), 4(b) and 5(b). Now, conider a ubtraction image between image yntheized by different kind of filter for the ame depth value of z 0. According to the Pareval identity, the total energy of a ignal i contant in the patial domain and in the frequency domain. Therefore, the following concluion are drawn from the frequency domain analyi. In a region that i in focu, every pixel in the region mut be 0 theoretically. In a region that i out of focu, ome pixel might have non-zero value.
4 2 2 Input image 2 2 Step (1),(2) h1 h2 h3 (a) z 0 = z opt (b) z 0 <z opt Sequence of multiple focued image Fig. 3: Normal filter. 2 2 Step (3) Subtraction (a) z 0 = z opt (b) z 0 <z opt Smoothing Sequence of evaluation image Fig. 4: Wide-aperture filter. Step (4) Minimum earch Step (5) Depth index map Pixel read (a) z 0 <z opt (b) z 0 <z opt Fig. 5: Camera-kipped filter. All in-focu image Fig. 6: Diagram of the propoed method. 3.2 All in-fouc View Synthei Firt of all, we determine depth candidate z n (n = 0, 1..., N 1) where the focal plane i placed, in uch a waythateachobjectwouldbein focu at leat one image in the equence. There are ome ueful theorie [12, 13] for thi configuration that dicu how much range of depth i in focu in front and rear of the focal plane. The outline of our method i hown in Figure 6. The following tep are iterated for each novel view. (1) The viewpoint for novel view ynthei i given. (2) Three different et of differently focued image, I <n> k (x, y) (n = 0, 1..., N 1, k = 1, 2, 3), are generated by the LFR method correponding to the filter h k and the focued depth z n. (x, y) denote poition of pixel on the yntheized image. (3) For each depth z n, an evaluation image for the focu evaluation, E <n> (x, y), i calculated a follow: E 0 <n> (x, y) = a k,l I <n> k (x, y) I <n> l (x, y) (5) k<l E <n> (x, y) = M<i,j<M E <n> 0 (x + i, y + j). (6) By taking combination of more than two kind of filter and umming E 0 <n> (x, y) in a window region, the ize of which i (2M +1) (2M +1), we aim to enhance the tability of the focu meaurement. a k,l denote weighting coefficient. (4) For each pixel (x, y), the index of the optimal depth where the pixel i motly in focu can be given by n(x, y) that yield the minimum of E <n> (x, y): n(x, y) =arg min 0 n N 1 E<n> (x, y) (7) (5) An all in-focu image I(x, y) i generated a follow. I(x, y) =I <n(x,y)> k (x, y) (8) In thi way, each pixel value i read from the image yntheizedinstep(2)wherethepixelimotlyin focu, and an all in-focu image i generated. 4. Implementation and Experiment 4.1 Implementation of LFR Firt of all, thi ection explain our implementation of the LFR method, ince our method conit of iteration of image ynthei by LFR. We adopt an implementation with texture mapping [4, 5], which can be accelerated by graphic hardware. In thi method, each input image i projected onto the focal plane a a texture data weighted
5 t w(x,y)= (1- x/ )(1- y/ t ) (a) Normal filter. t w(x,y)= 4 1 (1- x/(2) )(1- y/(2 t) ) (b) Wide-aperture filter. t w(x,y)=(1- x/(2) )(1- y/(2 t) ) (c) Camera-kipped filter. Fig. 8: Reult of free-viewpoint image ynthei by the LFR method. From the top to the bottom, the viewpoint move from the right to the left while gazing at the nearet building. Thi lead to that the background move from the right to the left. Fig. 7: Weighting pattern for the filter. by uch a pattern that decribe the contribution of each input image for the interpolation of light-ray data. Shown in Figure 7 are weighting pattern adopted in our implementation and their formula for each recontruction filter. The weighting value i a function of poition (x, y), having a peak at the center and decreaing to zero at the edge. Circle repreent the grid point of the camera plane which denote the poition where input image were captured. For each texture data, the weighting pattern i aligned in uch a way that it center i on the grid point where the correponding input image wa captured. Then, the weighting pattern and the texture data are multiplied and projected onto the focal plane. The above proce i iterated for all the input image to yntheize an image. Figure 7(a), (b) and (c) correpond to a normal filter, a wide-aperture filter and a camera-kipped filter, repec- tively. Note that thee are approximation of the low-pa filter hown in Figure 3, 4 and 5. Thoe approximation are uitable for real-time implementation and ufficient to yntheize image with acceptable quality. The above decription correpond to the tep (1) and (2) in Subection 3.2 which are executed on graphic hardware fat enough for interactive frame rate. Then, yntheized image are tored in main memory, and a CPU execute the remaining procee of Step (3), (4) and (5). 4.2 Experiment For our experiment, we ue a Pentium GHz, Linux baed PC with 2.0 GB main memory. The video board load a nvidia Geforce4 Ti 4200 GPU and 128 MB video memory. Our method i implemented with OpenGL enhanced by GLUT librarie. A et of multi-viewpoint tatic image i ued for input image, which i from The multiview image databae courtey of Univerity of Tukuba, Japan. Thee image are captured at 81 (9 by 9, in the horizontal/vertical direction) viewpoint. The interval of viewpoint i 8 mm.
6 (a) z 0 = 300 (around the nearet building). (a) Normal filter. (b) z 0 = 600 (around the furthet building). (b) Wide-aperture filter. (c) z 0 = 1800 (around the background wall). (c) Camera-kipped filter. Fig. 9: Fouc effect appear according to the depth of the focal plane. Region near the focal plane are yntheized clearly and harply, while region apart from it eem blurry and noiy. Fig. 10: Syntheized image by different recontruction filter. In-focu region (further building) look imilar regardle of the filter, while defocued region have different artifact from each other.
7 The horizontal field of view i 27, and the reolution i reduced from pixel to pixel for the convenience of our implementation. Ditance from the camera plane to the nearet object, the farthet object and the background wall are 33 cm, 66 cm and 184 cm, repectively. Shown in Figure 8 are yntheized image by the LFR method. Photo-realitic view are yntheized depending on the uer viewpoint interactively. But thi conventional method uffer from the focu, which i noticeable in Figure 9. In Figure 9(a), (b) and (c), the focal plane i placed at 30 cm (around the nearet building), 60 cm (around the farthet building), and at 180 cm (around the background wall), repectively. Object near the focal plane are yntheized clearly and harply (in focu), while object apart from the focal plane are with blurring and ghoting (out of focu). To make everything in focu, the conventional method require that the interval of input camera hould be maller than 1.34 mm according to the plenoptic ampling theory [10]. It mean that the number of input image needed for thi cene amount to 2916, which i 36 time (6 by 6) larger than that of the original input image. However, our method generate all in-focu image without requiring any increae in the number of input image. All image mentioned above are produced by the normal filter. Shown in Figure 10 are yntheized image by the normal filter, the wide-aperture filter and the camerakipped filter with the focal plane placed at 60 cm. They how the important fact that the focued region are yntheized imilarly regardle of the filter, while the defocued region are yntheized differently according to the filter. Thi i the nature we utilize for focu meaure a decribed in Section 3.. Now we decribe the reult of our propoed method. Firt, the number of depth candidate i et a N =13, where in principle, all the object in the cene would be in focu at leat in one image of the equence of differently focued image. The recontruction filter h 1, h 2 and h 3 are aigned to the normal filter, the wide-aperture filter and the camera-kipped filter, repectively. We et that a 0,1 = a 0,2 =1,anda 1,2 = 0 in Equation (5), M =7in Equation (6), and k = 1 in Equation (8), are determined empirically. Their optimization i our future work. Shown in Figure 11(a) i a depth map, each pixel of which repreent the index of the optimal depth (n(x, y) in Equation (7)). The brighter pixel indicate an object cloer to the camera ytem. The tructure of the cene i etimated approximately. Thi reult i not o accurate for the ue of the 3D recontruction, but ufficient for the image ynthei. Figure 11(b) i a final image at the ame viewpoint, it can be een that all object are recontructed clearly and harply in comparion with thoe in Figure 9. Note that we can yntheize image like thi one at arbitrary viewpoint. It take econd to yntheize an image with pixel. There could be overhead cot in data tranfer from video memory to main mem- (a) Depth map. (b) All in-focu image. Fig. 11: The propoed method produce (a) depth map and (b) all in-fouc image. ory, and the procee on CPU are not well-optimized yet. Our future work include optimization and implementation technique to achieve interactive frame rate. 5. Concluion In thi paper, we have propoed a free-viewpoint image ynthei method that overcome the limitation of the conventional LFR method with no pre-etimated depth/ hape information. The propoed method generate all infocu image from differently focued image yntheized by LFR. Our approach i reaonable ince it utilize the focu of LFR to etimate the depth, which i directly related to the appearance of yntheized image. We have alo given a theoretical explanation on how to meaure focu in the yntheized image by LFR. Experimental reult how the effectivene of the propoed method.
8 Acknowledgement Thank to Prof. Hirohi Harahima of the Univerity of Tokyo for hi helpful dicuion. Reference 1. Marc Levoy and Pat Hanrahan. Light Field Rendering, Proc. ACM Conference on Computer Graphic (SIGGRAPH 96), pp (1996) 2. Aaron Iaken, Leonard McMillan and Steven J. Gortler. Dynamically Reparameterized Light Field, Proc. ACM Conference on Computer Graphic (SIGGRAPH 2000), pp (2000) 3. Daniel N. Wood, Daniel I. Azuma, Ken Aldinger, Brian Curle, Tom Duchamp, David H. Salein and Werner Stuetzle. Surface Light Field for 3D Photography, Proc. ACM Conference on Computer Graphic (SIGGRAPH 2000), pp (2000) 4. Steven J. Gortler, Radek Grzezczuk, Richard Szeliki and Michael F. Cohen. The Lumigraph, Proc. ACM Conference on Computer Graphic (SIGGRAPH 96), pp (1996) 5. Chri Buehler, Michael Boe, Leonard McMillan, Steven J. Gortler and Michael F. Cohen. Untructured Lumigraph Rendering, Proc. ACM Conference on Computer Graphic (SIGGRAPH 2001), pp (2001) 6. Takehi Naemura, Junji Tago and Hirohi Harahima. Real-Time Video-Baed Modeling and Rendering of 3D cene, IEEE Computer Graphic and Application, Vol. 22, No. 2, pp (2002) 7. Eric Krotkov. Focuing, International Journal of Computer Viion, Vol. 1, No. 3, pp (1987) 8. Shree K. Nayer. Shape from Focu Sytem, Proc. IEEE Computer Viion and Pattern Recognition (CVPR), pp (1992) 9. Peter J. Burt and Raymond J. Kolczynki, Enhanced Image Capture through Fuion, Proc. IEEE International Conference on Computer Viion (ICCV), pp (1993) 10. Jin-Xiang Chai, Shing-Chow Chan, Heung-Yeung Shum and Xin Tong. Plenoptic Sampling, Proc. ACM Conference on Computer Graphic (SIG- GRAPH 2000), pp (2000) 11. Jaon Stewart, Jingyi Yu, Steven J. Gortler and Leonard McMillan. A New Recontruction Filter for Underampled Light Field, Proc. Eurographic Sympoium on Rendering 2003, pp (2003) 12. Yutaka Kunita, Maahiko Inami, Taro Maeda and Suumu Tachi. Real-Time Rendering Sytem of Moving Object, Proc. IEEE Workhop on Multi-View Modeling & Analyi of Viual Scene (MVIEW 99), pp (1999) 13. Keita Takahahi, Takehi Naemura and Hirohi Harahima. Depth of Field in Light Field Rendering, Proc. IEEE International Conference on Image Proceing (ICIP 2003), Vol. 1, pp (2003)
Universität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.
Univerität Augburg à ÊÇÅÍÆ ËÀǼ Approximating Optimal Viual Senor Placement E. Hörter, R. Lienhart Report 2006-01 Januar 2006 Intitut für Informatik D-86135 Augburg Copyright c E. Hörter, R. Lienhart Intitut
More informationPlanning of scooping position and approach path for loading operation by wheel loader
22 nd International Sympoium on Automation and Robotic in Contruction ISARC 25 - September 11-14, 25, Ferrara (Italy) 1 Planning of cooping poition and approach path for loading operation by wheel loader
More informationFocused Video Estimation from Defocused Video Sequences
Focued Video Etimation from Defocued Video Sequence Junlan Yang a, Dan Schonfeld a and Magdi Mohamed b a Multimedia Communication Lab, ECE Dept., Univerity of Illinoi, Chicago, IL b Phyical Realization
More informationCENTER-POINT MODEL OF DEFORMABLE SURFACE
CENTER-POINT MODEL OF DEFORMABLE SURFACE Piotr M. Szczypinki Iintitute of Electronic, Technical Univerity of Lodz, Poland Abtract: Key word: Center-point model of deformable urface for egmentation of 3D
More informationOn the Use of Shadows in Stance Recovery
On the Ue of Shadow in Stance Recovery Alfred M. Brucktein, 1 Robert J. Holt, 1 Yve D. Jean, 2 Arun N. Netravali 1 1 Bell Laboratorie, Lucent Technologie, Murray Hill, NJ 094 2 Avaya Communication, Murray
More informationA METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS
Vietnam Journal of Science and Technology 55 (5) (017) 650-657 DOI: 10.1565/55-518/55/5/906 A METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS Nguyen Huu Quang *, Banh
More informationDrawing Lines in 2 Dimensions
Drawing Line in 2 Dimenion Drawing a traight line (or an arc) between two end point when one i limited to dicrete pixel require a bit of thought. Conider the following line uperimpoed on a 2 dimenional
More informationMAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc
MAT 155: Decribing, Exploring, and Comparing Data Page 1 of 8 001-oteCh-3.doc ote for Chapter Summarizing and Graphing Data Chapter 3 Decribing, Exploring, and Comparing Data Frequency Ditribution, Graphic
More informationUC Berkeley International Conference on GIScience Short Paper Proceedings
UC Berkeley International Conference on GIScience Short Paper Proceeding Title A novel method for probabilitic coverage etimation of enor network baed on 3D vector repreentation in complex urban environment
More informationPerformance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks
Performance of a Robut Filter-baed Approach for Contour Detection in Wirele Senor Network Hadi Alati, William A. Armtrong, Jr., and Ai Naipuri Department of Electrical and Computer Engineering The Univerity
More informationA PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED
A PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED Jutin Domke and Yianni Aloimono Computational Viion Laboratory, Center for Automation Reearch Univerity of Maryland College Park,
More informationMirror shape recovery from image curves and intrinsic parameters: Rotationally symmetric and conic mirrors. Abstract. 2. Mirror shape recovery
Mirror hape recovery from image curve and intrinic parameter: Rotationally ymmetric and conic mirror Nuno Gonçalve and Helder Araújo Λ Intitute of Sytem and Robotic Univerity of Coimbra Pinhal de Marroco
More informationAnalyzing Hydra Historical Statistics Part 2
Analyzing Hydra Hitorical Statitic Part Fabio Maimo Ottaviani EPV Technologie White paper 5 hnode HSM Hitorical Record The hnode i the hierarchical data torage management node and ha to perform all the
More informationDistributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router
Ditributed Packet Proceing Architecture with Reconfigurable Hardware Accelerator for 100Gbp Forwarding Performance on Virtualized Edge Router Satohi Nihiyama, Hitohi Kaneko, and Ichiro Kudo Abtract To
More information3D SMAP Algorithm. April 11, 2012
3D SMAP Algorithm April 11, 2012 Baed on the original SMAP paper [1]. Thi report extend the tructure of MSRF into 3D. The prior ditribution i modified to atify the MRF property. In addition, an iterative
More informationDAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications
DAROS: Ditributed Uer-Server Aignment And Replication For Online Social Networking Application Thuan Duong-Ba School of EECS Oregon State Univerity Corvalli, OR 97330, USA Email: duongba@eec.oregontate.edu
More informationHow to Select Measurement Points in Access Point Localization
Proceeding of the International MultiConference of Engineer and Computer Scientit 205 Vol II, IMECS 205, March 8-20, 205, Hong Kong How to Select Meaurement Point in Acce Point Localization Xiaoling Yang,
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each type of circuit will be implemented in two
More informationSLA Adaptation for Service Overlay Networks
SLA Adaptation for Service Overlay Network Con Tran 1, Zbigniew Dziong 1, and Michal Pióro 2 1 Department of Electrical Engineering, École de Technologie Supérieure, Univerity of Quebec, Montréal, Canada
More informationCutting Stock by Iterated Matching. Andreas Fritsch, Oliver Vornberger. University of Osnabruck. D Osnabruck.
Cutting Stock by Iterated Matching Andrea Fritch, Oliver Vornberger Univerity of Onabruck Dept of Math/Computer Science D-4909 Onabruck andy@informatikuni-onabrueckde Abtract The combinatorial optimization
More informationOn successive packing approach to multidimensional (M-D) interleaving
On ucceive packing approach to multidimenional (M-D) interleaving Xi Min Zhang Yun Q. hi ankar Bau Abtract We propoe an interleaving cheme for multidimenional (M-D) interleaving. To achieved by uing a
More informationAn Active Stereo Vision System Based on Neural Pathways of Human Binocular Motor System
Journal of Bionic Engineering 4 (2007) 185 192 An Active Stereo Viion Sytem Baed on Neural Pathway of Human Binocular Motor Sytem Yu-zhang Gu 1, Makoto Sato 2, Xiao-lin Zhang 2 1. Department of Advanced
More informationTexture-Constrained Active Shape Models
107 Texture-Contrained Active Shape Model Shuicheng Yan, Ce Liu Stan Z. Li Hongjiang Zhang Heung-Yeung Shum Qianheng Cheng Microoft Reearch Aia, Beijing Sigma Center, Beijing 100080, China Dept. of Info.
More information3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES
MAKARA, TEKNOLOGI, VOL. 9, NO., APRIL 5: 3-35 3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES Mochammad Zulianyah Informatic Engineering, Faculty of Engineering, ARS International Univerity,
More informationTrainable Context Model for Multiscale Segmentation
Trainable Context Model for Multicale Segmentation Hui Cheng and Charle A. Bouman School of Electrical and Computer Engineering Purdue Univerity Wet Lafayette, IN 47907-1285 {hui, bouman}@ ecn.purdue.edu
More informationImplementation of a momentum-based distance metric for motion graphs. Student: Alessandro Di Domenico (st.no ), Supervisor: Nicolas Pronost
Implementation of a momentum-baed ditance metric for motion graph Student: Aleandro Di Domenico (t.no 3775682), Supervior: Nicola Pronot April 3, 2014 Abtract Thi report preent the procedure and reult
More informationMore and More on Light Fields. Last Lecture
More and More on Light Fields Topics in Image-Based Modeling and Rendering CSE291 J00 Lecture 4 Last Lecture Re-review with emphasis on radiometry Mosaics & Quicktime VR The Plenoptic function The main
More information/06/$ IEEE 364
006 IEEE International ympoium on ignal Proceing and Information Technology oie Variance Etimation In ignal Proceing David Makovoz IPAC, California Intitute of Technology, MC-0, Paadena, CA, 95 davidm@ipac.caltech.edu;
More informationES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK
ES05 Analyi and Deign of Engineering Sytem: Lab : An Introductory Tutorial: Getting Started with SIMULINK What i SIMULINK? SIMULINK i a oftware package for modeling, imulating, and analyzing dynamic ytem.
More informationMotion Control (wheeled robots)
3 Motion Control (wheeled robot) Requirement for Motion Control Kinematic / dynamic model of the robot Model of the interaction between the wheel and the ground Definition of required motion -> peed control,
More informationAUTOMATIC TEST CASE GENERATION USING UML MODELS
Volume-2, Iue-6, June-2014 AUTOMATIC TEST CASE GENERATION USING UML MODELS 1 SAGARKUMAR P. JAIN, 2 KHUSHBOO S. LALWANI, 3 NIKITA K. MAHAJAN, 4 BHAGYASHREE J. GADEKAR 1,2,3,4 Department of Computer Engineering,
More informationnp vp cost = 0 cost = c np vp cost = c I replacing term cost = c+c n cost = c * Error detection Error correction pron det pron det n gi
Spoken Language Paring with Robutne and ncrementality Yohihide Kato, Shigeki Matubara, Katuhiko Toyama and Yauyohi nagaki y Graduate School of Engineering, Nagoya Univerity y Faculty of Language and Culture,
More informationComparison of Methods for Horizon Line Detection in Sea Images
Comparion of Method for Horizon Line Detection in Sea Image Tzvika Libe Evgeny Gerhikov and Samuel Koolapov Department of Electrical Engineering Braude Academic College of Engineering Karmiel 2982 Irael
More informationShortest Paths with Single-Point Visibility Constraint
Shortet Path with Single-Point Viibility Contraint Ramtin Khoravi Mohammad Ghodi Department of Computer Engineering Sharif Univerity of Technology Abtract Thi paper tudie the problem of finding a hortet
More informationA note on degenerate and spectrally degenerate graphs
A note on degenerate and pectrally degenerate graph Noga Alon Abtract A graph G i called pectrally d-degenerate if the larget eigenvalue of each ubgraph of it with maximum degree D i at mot dd. We prove
More informationA Novel Feature Line Segment Approach for Pattern Classification
12th International Conference on Information Fuion Seattle, WA, USA, July 6-9, 2009 A Novel Feature Line Segment Approach for Pattern Claification Yi Yang Intitute of Integrated Automation Xi an Jiaotong
More informationDelaunay Triangulation: Incremental Construction
Chapter 6 Delaunay Triangulation: Incremental Contruction In the lat lecture, we have learned about the Lawon ip algorithm that compute a Delaunay triangulation of a given n-point et P R 2 with O(n 2 )
More informationxy-monotone path existence queries in a rectilinear environment
CCCG 2012, Charlottetown, P.E.I., Augut 8 10, 2012 xy-monotone path exitence querie in a rectilinear environment Gregory Bint Anil Mahehwari Michiel Smid Abtract Given a planar environment coniting of
More informationQuadrilaterals. Learning Objectives. Pre-Activity
Section 3.4 Pre-Activity Preparation Quadrilateral Intereting geometric hape and pattern are all around u when we tart looking for them. Examine a row of fencing or the tiling deign at the wimming pool.
More informationHassan Ghaziri AUB, OSB Beirut, Lebanon Key words Competitive self-organizing maps, Meta-heuristics, Vehicle routing problem,
COMPETITIVE PROBABIISTIC SEF-ORGANIZING MAPS FOR ROUTING PROBEMS Haan Ghaziri AUB, OSB Beirut, ebanon ghaziri@aub.edu.lb Abtract In thi paper, we have applied the concept of the elf-organizing map (SOM)
More informationA User-Attention Based Focus Detection Framework and Its Applications
A Uer-Attention Baed Focu Detection Framework and It Application Chia-Chiang Ho, Wen-Huang Cheng, Ting-Jian Pan, Ja-Ling Wu Communication and Multimedia Laboratory, Department of Computer Science and Information
More informationLecture Outline. Global flow analysis. Global Optimization. Global constant propagation. Liveness analysis. Local Optimization. Global Optimization
Lecture Outline Global flow analyi Global Optimization Global contant propagation Livene analyi Adapted from Lecture by Prof. Alex Aiken and George Necula (UCB) CS781(Praad) L27OP 1 CS781(Praad) L27OP
More informationIMPLEMENTATION OF AREA, VOLUME AND LINE SOURCES
December 01 ADMS 5 P503I1 IMPEMENTATION OF AREA, VOUME AND INE SOURCES The Met. Office (D J Thomon) and CERC 1. INTRODUCTION ADMS model line ource, and area and volume ource with conve polgon bae area.
More information( ) subject to m. e (2) L are 2L+1. = s SEG SEG Las Vegas 2012 Annual Meeting Page 1
A new imultaneou ource eparation algorithm uing frequency-divere filtering Ying Ji*, Ed Kragh, and Phil Chritie, Schlumberger Cambridge Reearch Summary We decribe a new imultaneou ource eparation algorithm
More informationVariable Resolution Discretization in the Joint Space
Variable Reolution Dicretization in the Joint Space Chritopher K. Monon, David Wingate, and Kevin D. Seppi {c,wingated,keppi}@c.byu.edu Computer Science, Brigham Young Univerity Todd S. Peteron peterto@uvc.edu
More informationRouting Definition 4.1
4 Routing So far, we have only looked at network without dealing with the iue of how to end information in them from one node to another The problem of ending information in a network i known a routing
More informationComputer Arithmetic Homework Solutions. 1 An adder for graphics. 2 Partitioned adder. 3 HDL implementation of a partitioned adder
Computer Arithmetic Homework 3 2016 2017 Solution 1 An adder for graphic In a normal ripple carry addition of two poitive number, the carry i the ignal for a reult exceeding the maximum. We ue thi ignal
More informationA Linear Interpolation-Based Algorithm for Path Planning and Replanning on Girds *
Advance in Linear Algebra & Matrix Theory, 2012, 2, 20-24 http://dx.doi.org/10.4236/alamt.2012.22003 Publihed Online June 2012 (http://www.scirp.org/journal/alamt) A Linear Interpolation-Baed Algorithm
More informationAalborg Universitet. Published in: Proceedings of the Working Conference on Advanced Visual Interfaces
Aalborg Univeritet Software-Baed Adjutment of Mobile Autotereocopic Graphic Uing Static Parallax Barrier Paprocki, Martin Marko; Krog, Kim Srirat; Kritofferen, Morten Bak; Krau, Martin Publihed in: Proceeding
More informationelse end while End References
621-630. [RM89] [SK76] Roenfeld, A. and Melter, R. A., Digital geometry, The Mathematical Intelligencer, vol. 11, No. 3, 1989, pp. 69-72. Sklanky, J. and Kibler, D. F., A theory of nonuniformly digitized
More informationMarkov Random Fields in Image Segmentation
Preented at SSIP 2011, Szeged, Hungary Markov Random Field in Image Segmentation Zoltan Kato Image Proceing & Computer Graphic Dept. Univerity of Szeged Hungary Zoltan Kato: Markov Random Field in Image
More informationThe Association of System Performance Professionals
The Aociation of Sytem Performance Profeional The Computer Meaurement Group, commonly called CMG, i a not for profit, worldwide organization of data proceing profeional committed to the meaurement and
More informationAn Approach to a Test Oracle for XML Query Testing
An Approach to a Tet Oracle for XML Query Teting Dae S. Kim-Park, Claudio de la Riva, Javier Tuya Univerity of Oviedo Computing Department Campu of Vieque, /n, 33204 (SPAIN) kim_park@li.uniovi.e, claudio@uniovi.e,
More informationGray-level histogram. Intensity (grey-level) transformation, or mapping. Use of intensity transformations:
Faculty of Informatic Eötvö Loránd Univerity Budapet, Hungary Lecture : Intenity Tranformation Image enhancement by point proceing Spatial domain and frequency domain method Baic Algorithm for Digital
More informationModeling of underwater vehicle s dynamics
Proceeding of the 11th WEA International Conference on YTEM, Agio Nikolao, Crete Iland, Greece, July 23-25, 2007 44 Modeling of underwater vehicle dynamic ANDRZEJ ZAK Department of Radiolocation and Hydrolocation
More informationSee chapter 8 in the textbook. Dr Muhammad Al Salamah, Industrial Engineering, KFUPM
Goal programming Objective of the topic: Indentify indutrial baed ituation where two or more objective function are required. Write a multi objective function model dla a goal LP Ue weighting um and preemptive
More informationImage authentication and tamper detection using fragile watermarking in spatial domain
International Journal of Advanced Reearch in Computer Engineering & Technology (IJARCET) Volume 6, Iue 7, July 2017, ISSN: 2278 1323 Image authentication and tamper detection uing fragile watermarking
More informationAnisotropic filtering on normal field and curvature tensor field using optimal estimation theory
Aniotropic filtering on normal field and curvature tenor field uing optimal etimation theory Min Liu Yuhen Liu and Karthik Ramani Purdue Univerity, Wet Lafayette, Indiana, USA Email: {liu66 liu28 ramani}@purdue.edu
More informationAnalysis of Surface Wave Propagation Based on the Thin Layered Element Method
ABSTACT : Analyi of Surface Wave Propagation Baed on the Thin ayered Element Method H. AKAGAWA 1 and S. AKAI 1 Engineer, Technical Centre, Oyo Corporation, Ibaraki, Japan Profeor, Graduate School of Engineering,
More informationAnalysis of slope stability
Engineering manual No. 8 Updated: 02/2016 Analyi of lope tability Program: Slope tability File: Demo_manual_08.gt In thi engineering manual, we are going to how you how to verify the lope tability for
More informationKS3 Maths Assessment Objectives
KS3 Math Aement Objective Tranition Stage 9 Ratio & Proportion Probabilit y & Statitic Appreciate the infinite nature of the et of integer, real and rational number Can interpret fraction and percentage
More informationNew DSP to measure acoustic efficiency of road barriers. Part 2: Sound Insulation Index
New DSP to meaure acoutic efficiency of road barrier. Part 2: Sound Inulation Index LAMBERTO TRONCHIN 1, KRISTIAN FABBRI 1, JELENA VASILJEVIC 2 1 DIENCA CIARM, Univerity of Bologna, Italy 2 Univerity of
More informationA Practical Model for Minimizing Waiting Time in a Transit Network
A Practical Model for Minimizing Waiting Time in a Tranit Network Leila Dianat, MASc, Department of Civil Engineering, Sharif Univerity of Technology, Tehran, Iran Youef Shafahi, Ph.D. Aociate Profeor,
More informationChapter 13 Non Sampling Errors
Chapter 13 Non Sampling Error It i a general aumption in the ampling theory that the true value of each unit in the population can be obtained and tabulated without any error. In practice, thi aumption
More informationLecture 14: Minimum Spanning Tree I
COMPSCI 0: Deign and Analyi of Algorithm October 4, 07 Lecture 4: Minimum Spanning Tree I Lecturer: Rong Ge Scribe: Fred Zhang Overview Thi lecture we finih our dicuion of the hortet path problem and introduce
More informationMinimum congestion spanning trees in bipartite and random graphs
Minimum congetion panning tree in bipartite and random graph M.I. Otrovkii Department of Mathematic and Computer Science St. John Univerity 8000 Utopia Parkway Queen, NY 11439, USA e-mail: otrovm@tjohn.edu
More informationStochastic Search and Graph Techniques for MCM Path Planning Christine D. Piatko, Christopher P. Diehl, Paul McNamee, Cheryl Resch and I-Jeng Wang
Stochatic Search and Graph Technique for MCM Path Planning Chritine D. Piatko, Chritopher P. Diehl, Paul McNamee, Cheryl Rech and I-Jeng Wang The John Hopkin Univerity Applied Phyic Laboratory, Laurel,
More informationDesign of a Stewart Platform for General Machining Using Magnetic Bearings
eign of a Stewart Platform for eneral Machining Uing Magnetic earing Jeff Pieper epartment of Mechanical and Manufacturing Engineering Univerity of algary algary lberta anada N N4 pieper@ucalgary.ca Preented
More informationUSING ARTIFICIAL NEURAL NETWORKS TO APPROXIMATE A DISCRETE EVENT STOCHASTIC SIMULATION MODEL
USING ARTIFICIAL NEURAL NETWORKS TO APPROXIMATE A DISCRETE EVENT STOCHASTIC SIMULATION MODEL Robert A. Kilmer Department of Sytem Engineering Unite State Military Acaemy Wet Point, NY 1996 Alice E. Smith
More informationDomain-Specific Modeling for Rapid System-Wide Energy Estimation of Reconfigurable Architectures
Domain-Specific Modeling for Rapid Sytem-Wide Energy Etimation of Reconfigurable Architecture Seonil Choi 1,Ju-wookJang 2, Sumit Mohanty 1, Viktor K. Praanna 1 1 Dept. of Electrical Engg. 2 Dept. of Electronic
More informationCompressed Sensing Image Processing Based on Stagewise Orthogonal Matching Pursuit
Senor & randucer, Vol. 8, Iue 0, October 204, pp. 34-40 Senor & randucer 204 by IFSA Publihing, S. L. http://www.enorportal.com Compreed Sening Image Proceing Baed on Stagewie Orthogonal Matching Puruit
More informationLinkGuide: Towards a Better Collection of Hyperlinks in a Website Homepage
Proceeding of the World Congre on Engineering 2007 Vol I LinkGuide: Toward a Better Collection of Hyperlink in a Webite Homepage A. Ammari and V. Zharkova chool of Informatic, Univerity of Bradford anammari@bradford.ac.uk,
More informationLocalized Minimum Spanning Tree Based Multicast Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Sensor Networks
Localized Minimum Spanning Tree Baed Multicat Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Senor Network Hanne Frey Univerity of Paderborn D-3398 Paderborn hanne.frey@uni-paderborn.de
More information1 The secretary problem
Thi i new material: if you ee error, pleae email jtyu at tanford dot edu 1 The ecretary problem We will tart by analyzing the expected runtime of an algorithm, a you will be expected to do on your homework.
More informationMulti-Target Tracking In Clutter
Multi-Target Tracking In Clutter John N. Sander-Reed, Mary Jo Duncan, W.B. Boucher, W. Michael Dimmler, Shawn O Keefe ABSTRACT A high frame rate (0 Hz), multi-target, video tracker ha been developed and
More informationKeywords: Defect detection, linear phased array transducer, parameter optimization, phased array ultrasonic B-mode imaging testing.
Send Order for Reprint to reprint@benthamcience.ae 488 The Open Automation and Control Sytem Journal, 2014, 6, 488-492 Open Acce Parameter Optimization of Linear Phaed Array Tranducer for Defect Detection
More informationIncreasing Throughput and Reducing Delay in Wireless Sensor Networks Using Interference Alignment
Int. J. Communication, Network and Sytem Science, 0, 5, 90-97 http://dx.doi.org/0.436/ijcn.0.50 Publihed Online February 0 (http://www.scirp.org/journal/ijcn) Increaing Throughput and Reducing Delay in
More informationKey Terms - MinMin, MaxMin, Sufferage, Task Scheduling, Standard Deviation, Load Balancing.
Volume 3, Iue 11, November 2013 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Tak Aignment in
More informationManeuverable Relays to Improve Energy Efficiency in Sensor Networks
Maneuverable Relay to Improve Energy Efficiency in Senor Network Stephan Eidenbenz, Luka Kroc, Jame P. Smith CCS-5, MS M997; Lo Alamo National Laboratory; Lo Alamo, NM 87545. Email: {eidenben, kroc, jpmith}@lanl.gov
More informationKaren L. Collins. Wesleyan University. Middletown, CT and. Mark Hovey MIT. Cambridge, MA Abstract
Mot Graph are Edge-Cordial Karen L. Collin Dept. of Mathematic Weleyan Univerity Middletown, CT 6457 and Mark Hovey Dept. of Mathematic MIT Cambridge, MA 239 Abtract We extend the definition of edge-cordial
More informationA System Dynamics Model for Transient Availability Modeling of Repairable Redundant Systems
International Journal of Performability Engineering Vol., No. 3, May 05, pp. 03-. RAMS Conultant Printed in India A Sytem Dynamic Model for Tranient Availability Modeling of Repairable Redundant Sytem
More informationIMPROVED JPEG DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION. Tak-Shing Wong, Charles A. Bouman, and Ilya Pollak
IMPROVED DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION Tak-Shing Wong, Charle A. Bouman, and Ilya Pollak School of Electrical and Computer Engineering Purdue Univerity ABSTRACT We propoe
More informationA Boyer-Moore Approach for. Two-Dimensional Matching. Jorma Tarhio. University of California. Berkeley, CA Abstract
A Boyer-Moore Approach for Two-Dimenional Matching Jorma Tarhio Computer Science Diviion Univerity of California Berkeley, CA 94720 Abtract An imple ublinear algorithm i preented for two-dimenional tring
More informationBuilding a Compact On-line MRF Recognizer for Large Character Set using Structured Dictionary Representation and Vector Quantization Technique
202 International Conference on Frontier in Handwriting Recognition Building a Compact On-line MRF Recognizer for Large Character Set uing Structured Dictionary Repreentation and Vector Quantization Technique
More informationANALYSIS OF PILE DRIVING IN VERTICAL AND HORIZONTAL DIRECTIONS USING A HYBRID MODEL
ANALYSIS OF PILE DRIVING IN VERTICAL AND HORIZONTAL DIRECTIONS USING A HYBRID MODEL TATSUNORI MATSUMOTO i) PASTSAKORN KITIYODOM ii) EIJI KOJIMA iii) HIROMICHI KUMAGAI iv) SATOSHI NISHIMOTO v) and KOUICHI
More informationA Multi-objective Genetic Algorithm for Reliability Optimization Problem
International Journal of Performability Engineering, Vol. 5, No. 3, April 2009, pp. 227-234. RAMS Conultant Printed in India A Multi-objective Genetic Algorithm for Reliability Optimization Problem AMAR
More informationPolygon Side Lengths NAME DATE TIME
Home Link 5- Polygon Side Length Find any miing coordinate. Plot and label the point on the coordinate grid. Draw the polygon by connecting the point. y a. Rectangle ABCD A: (, ) B: (-, ) The length of
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in Verilog and implemented
More informationTracking High Speed Skater by Using Multiple Model
Vol. 2, No. 26 Tracing High Speed Sater by Uing Multiple Model Guojun Liu & Xianglong Tang School of Computer Science & Engineering Harbin Intitute of Technology Harbin 5000, China E-mail: hitliu@hit.edu.cn
More informationSymmetric Stereo Matching for Occlusion Handling
Symmetric Stereo Matching for Occluion Handling Jian Sun 1 Yin Li 1 Sing Bing Kang 2 Heung-Yeung Shum 1 1 Microoft Reearch Aia 2 Microoft Reearch Beijing, P.R. China Redmond, WA, USA Abtract In thi paper,
More information3-D Visualization of a Gene Regulatory Network: Stochastic Search for Layouts
3-D Viualization of a Gene Regulatory Network: Stochatic Search for Layout Naoki Hooyama Department of Electronic Engineering, Univerity of Tokyo, Japan hooyama@iba.k.u-tokyo.ac.jp Abtract- In recent year,
More informationAn Intro to LP and the Simplex Algorithm. Primal Simplex
An Intro to LP and the Simplex Algorithm Primal Simplex Linear programming i contrained minimization of a linear objective over a olution pace defined by linear contraint: min cx Ax b l x u A i an m n
More informationMid-term review ECE 161C Electrical and Computer Engineering University of California San Diego
Mid-term review ECE 161C Electrical and Computer Engineering Univerity of California San Diego Nuno Vaconcelo Spring 2014 1. We have een in cla that one popular technique for edge detection i the Canny
More informationRefining SIRAP with a Dedicated Resource Ceiling for Self-Blocking
Refining SIRAP with a Dedicated Reource Ceiling for Self-Blocking Mori Behnam, Thoma Nolte Mälardalen Real-Time Reearch Centre P.O. Box 883, SE-721 23 Väterå, Sweden {mori.behnam,thoma.nolte}@mdh.e ABSTRACT
More informationHow to. write a paper. The basics writing a solid paper Different communities/different standards Common errors
How to write a paper The baic writing a olid paper Different communitie/different tandard Common error Reource Raibert eay My grammar point Article on a v. the Bug in writing Clarity Goal Conciene Calling
More informationA Local Mobility Agent Selection Algorithm for Mobile Networks
A Local Mobility Agent Selection Algorithm for Mobile Network Yi Xu Henry C. J. Lee Vrizlynn L. L. Thing Intitute for Infocomm Reearch, 21 Heng Mui Keng Terrace, Singapore 119613 Email: {yxu, hlee, vriz}@i2r.a-tar.edu.g
More informationHardware-Based IPS for Embedded Systems
Hardware-Baed IPS for Embedded Sytem Tomoaki SATO, C&C Sytem Center, Hiroaki Univerity Hiroaki 036-8561 Japan Shuya IMARUOKA and Maa-aki FUKASE Graduate School of Science and Technology, Hiroaki Univerity
More informationInterface Tracking in Eulerian and MMALE Calculations
Interface Tracking in Eulerian and MMALE Calculation Gabi Luttwak Rafael P.O.Box 2250, Haifa 31021,Irael Interface Tracking in Eulerian and MMALE Calculation 3D Volume of Fluid (VOF) baed recontruction
More informationOperational Semantics Class notes for a lecture given by Mooly Sagiv Tel Aviv University 24/5/2007 By Roy Ganor and Uri Juhasz
Operational emantic Page Operational emantic Cla note for a lecture given by Mooly agiv Tel Aviv Univerity 4/5/7 By Roy Ganor and Uri Juhaz Reference emantic with Application, H. Nielon and F. Nielon,
More informationDynamically Reconfigurable Neuron Architecture for the Implementation of Self- Organizing Learning Array
Dynamically Reconfigurable Neuron Architecture for the Implementation of Self- Organizing Learning Array Januz A. Starzyk,Yongtao Guo, and Zhineng Zhu School of Electrical Engineering & Computer Science
More information