Using Ray Tracing for Site-Specific Indoor Radio Signal Strength Analysis 1

Size: px
Start display at page:

Download "Using Ray Tracing for Site-Specific Indoor Radio Signal Strength Analysis 1"

Transcription

1 Using Ray Tracing for Site-Specific Inoor Raio Signal Strength Analysis 1 Michael Ni, Stephen Mann, an Jay Black Computer Science Department, University of Waterloo, Waterloo, Ontario, NL G1, Canaa Abstract A variation of cone-tracing is use to preict the signal strength in wireless networks. Differences between light an raio waves necessitate certain changes to the basic ray/cone tracing algorithm, as oes the information require of the solution. The new algorithm is compare to a previous algorithm for signal strength preiction, an verifie on some examples. I. Introuction Cellular raio is a victim of its own success. As more uses are foun for the fixe banwith available in the electromagnetic spectrum, the availability of that banwith is ecreasing. The only extensible solution is to ecrease the transmission area use by a single evice, meaning lower power transmissions an smaller cells. When the transmission power is low, it is important to make the most of the available coverage. This means that care must be taken when placing antennas to minimize both the area of poor coverage an the overlap between ifferent antennas regions. In this paper, we present a technique for analyzing signal strength in a room or set of rooms. Raio waves are similar to light waves, just at a much lower frequency. Although the rules for reflection, refraction, an scattering are similar for both types of waves, the longer waves in raio (0cm) are significantly ifferent from light in two important respects. First, the systematic interference cause by the coherence of the transmitte waves an the long wavelengths means that the signal strength oes not fae uniformly along a line of sight from the transmitter. Secon, the interactions between the signal an a surface that is only one or two wavelengths across is no longer the same as for visible light. The first of these ifficulties is aresse by the technique presente in this paper. Dealing properly with the secon problem requires an exact solution, which is more complicate an timeconsuming [10]. In this paper we avoi this secon problem by ealing only with objects having planar surfaces at least two meters on each sie. The strength of the transmitte signal epens on the type of transmitter being use, but more important is the rop in signal that the receiver can etect. Common receivers can resolve signals that are 0.1% of the transmitte intensity. Typically, only 10% of the signal strength remains after reflection or transmission, although these number vary wiely ue to the large variation of materials foun in builings. See the papers by Cox et al. [, ] for a range of examples. Areas of poor coverage are the result of multiple propagation paths existing between the transmitter an a given receiver position. Because these paths have ifferent lengths, the relative 1 This work was supporte in part by the Avance Raioata Research Center of Motorola Canaa Lt. an the Natural Sciences an Engineering Research Council of Canaa phases of the receive carrier waves are not preictable. If they are 180 egrees out of phase, then they completely cancel each other out. This is calle multipath interference. When preicting this interference, the optical istance travele by each component signal must be known to within a fixe tolerance. The ifficulty presente by this restriction is that this tolerance oes not relax at large istances from the transmitter. In the case of 1GHz waves, a 1cm error in istance will cause the phase to be inverte, resulting in estructive interference being preicte where constructive shoul have been observe, an vice versa. Because wavelength is constant, that 1cm error causes the same error in phase angle near the antenna as it oes far from the antenna. Previous work on etermining signal strength for inoor wireless networks falls into two major categories, statistical methos (see [6]) an site-specific methos. Statistical methos essentially average all the objects in the scene, an o not report variations in signal strength aroun any particular object. While this is useful in escribing an average propagation pattern for an antenna (e.g. X has a range of 0 meters, given line-of-sight, in a factory floor environment. ) it oes not help the system planner ecie how to position the antenna for optimal performance. Most of the site-specific techniques have been variations on ray tracing. For example, Seiel an Rappaport [11, 1, 1] use a ray tracing technique to preict the signal strength at a particular location. However, their technique is limite to preicting the signal strength at a single, one pointreceiver. Lecours et al. [] use a similar ray tracing metho that they verifie with physical measurements. A paper by McKown an Hamilton [7] also employs ray tracing, but it uses a very ifferent technique for intersecting rays with objects, an for ynamically ajusting the resolution in areas with a high signal strength graient. The technique closest to that use here has been propose by Sipilä an Heiska [14]. Their metho iffers only in the use of a pre-set maximum number of reflecte rays, rather than the cone moels iscusse below. See [9] for a more complete survey of previous work in signal strength preiction. Ieally, we woul be able to preict the signal strength at all points within the room(s) of interest. However, it shoul be sufficient to preict the signal strength on a single plane in the room (parallel to the floor) because the wireless evices using the network are usually either esktop or hanhel, which we expect to be at a roughly constant istance above the floor. Most of the site-specific techniques only compute the signal strength at a single point, the exceptions being Keenan an Motley [8] an McKown an Hamilton [7]. Keenan an Motley compute the signal strength solely as a function of istance an the number of walls between the source an receiver. McKown an Hamilton calculate the strength at a gri of receiver points, then ynamically increase the resolution of the receiver gri in 1

2 areas of high variability. Their technique is expensive because for each receiver point they reflect in every possible surface to etermine all paths to the transmitter. In this paper, we escribe a metho for using ray tracing techniques for signal strength preiction. In computer graphics, stanar ray tracing [4, p.701] reners a scene by casting rays from the esire viewing location through an imagine vieo isplay. This technique requires the eye-point, isplay location, resolution, an orientation to be efine a priori, thereby etermining the initial rays. The color of the pixel through which each ray passes is etermine by casting rays from the nearest intersecte surface to all light sources. In a room-size environment, the physical properties of visible frequency raiation are fairly simple. However, several important ifferences are encountere when translating this style approach to a raiofrequency environment. First, we are intereste in the signal strength at a particular plane in the room. Although similar to the projection plane of ray tracing, for signal strength analysis we are intereste in all signals passing through this plane, regarless of the irection of propagation. Secon, we are intereste in the phase of the waves at each point, as there will be both constructive an estructive interference of these waves. These two ifferences require us to trace all signals emitte from the source until their strength has attenuate below a given tolerance. The solution we propose gives an approximation of signal strength for a particular altitue throughout a room. The plane for which the signal is approximate is a collection of iscrete squares, which we call the signal intensity gri. The approximation technique first ivies the raiate signal into a collection of cones with triangular cross-sections that originate from a single common point, an completely span three-space without overlap. These cones are trace through the room, an reflecte off an transmitte through surfaces. We then recor the phase an strength of these cones as they pass through the signal intensity gri. Ientifying similarly behave volumes allows the effect of incient signals to be more efficiently recore within these areas. If rays are use, care must be taken to avoi having two rays that represent the same optical path from being ae to the same iscrete area. It is similarly important to avoi having rays strale a particular area. Using soli cones instea of a ense collections of rays avois the ifficulty of ensuring that each optical path to a iscrete portion of a surface is consiere exactly once. II. Cone Tracing Cone tracing has been use in computer graphics as an antialiasing technique for ray tracing [1]. Instea of casting rays, cones are cast into the scene. If the cone partially hits an object, this partial coverage is use to weight the color compute for that cone. Our use of cones for signal strength preiction iffers in that we use the cones to trace the wavefront emitting from a transmitter in all irections. The initial approximation ivies the raiate signal into a collection of cones with triangular crosssection that originate from the transmitter, an completely span three-space without overlap. Figure 1: Cone Tracing. Gri squares in both the signal intensity gri an the various wall panels are fille in arker in areas of stronger raiate intensity (from a single emitte cone). Each of these cones can be completely escribe by three bounary rays an an origin. Each cone is examine to fin the closest object intersecte by part of the cone. If the entire cone oes not strike that object, then the cone is subivie on the bounaries of the object. Cones that strike exactly one object are use to generate aughter cones corresponing to reflecte an transmitte signals. Furthermore, once a cone is seen to be well behave, (i.e. it strikes only one wall) its intersection with the signal intensity gri is foun, an its effect on this gri is recore. Fig. 1 gives two ifferent perspective views of this process for a single cone. A. Phase Calculation Once a well-behave cone has been foun that intersects exactly one wall, it must be reflecte an transmitte. An image of the source (also referre to as a virtual source ) is associate with each cone. The initial location of the virtual source is the actual transmission antenna. Each time the cone is reflecte, the source location is also reflecte in the plane of the wall (to a point on the other sie of the wall having the same perpenicular istance). Thus the straight-line istance to the virtual source is the same as the optical istance to the true source. If a cone passes through the signal strength intensity gri, its effect on each iscrete section of this gri must be foun. Both signal strength an phase must be accounte for. As mentione above, the calculation of optical istance to each of these points must be accurate. Since the current implementation uses only plane p reflections, we can use a simple istance calculation ( = (x) + (y) + (z) ) from each point on the wall to an image of the source. One problem with this solution is the number of square root calculations involve. One optimization is to calculate the istances to the three corners of the intersection (since the cone is well-behave, the area of intersection will always be a triangle) an use bilinear interpolation to etermine the istances to the intermeiate points. This will be faster, but it is less accurate. The inaccuracy results from the fact that the istance between two points oes not vary linearly as one point moves in an arbitrary plane. Fig. shows a two-imensional cross-section of a cone intersecting a wall. In this figure, the istance ~ is the result of varying the istance from the origin linearly between the two enpoints (i.e. ~ = t1 + (1? t) ; 0 t 1). The maximum error cause by this ifference (in the three imensional case) is boune by the following [9]: r 1 + cos Error max " # 1 + cos? 4 + (1)

3 α ~ 1 (x,y) Figure : Cross-section of a cone where max is the maximum istance along any of the three corner rays, an is the largest angle between two rays. While this equation still contains a square root, istance is use only as a multiplier. Therefore, the contents of the square brackets above can be calculate ahea of time, an a table lookup can be use at runtime, since the angle of emission is boune by the largest angle use in sening the initial cone. If the error is too large, then we can subivie the cones. B. Subivision There are three reasons for subiviing our cones into smaller cones. The first occurs if we are using linear interpolation to simplify the istance calculation an the error is too large. Since the three corners are alreay known, only one new ray must be trace. This can be one by aing a single ray through the centroi, an recursively examining each of the three cones create by joining an existing ege to this point. Alternatively, one coul use either a four-to-one or a two-to-one subivision of the cones. Initial Intersection Resulting Cones a c a c b b Figure : (left) A wall is misse, but will be etecte in the next iteration. (right) A wall is misse, an will not be etecte. Another reason for subiviing is to prevent the cones from getting so large that they might strale a wall. Since the current implementation etects interactions with walls only when a corner point intersects one, allowing the ege length to get as large as wall sizes coul result in cones passing through walls without having any interaction etecte. Because ege length epens on the angle at which the cone is cut, a choice must be mae about what shoul be boune. We chose to use the I I lengths of the eges forme when the cone is cut by a plane perpenicular to its irection of propagation, an at a istance equal to the length of the longest ege intersecting a wall (the test is one immeiately after etermining the intersections of the corner rays). Since there exists a minimum ege-length for walls, this provies a guieline for choosing a maximum cone size. In practice, 0% of the minimum ege-length has worke well. It shoul be note here that pieces of the signal that o not strike the other walls will be etecte, as in the left example of Fig.. In that case, the portion of the cone that i not strike any of the (up to) three walls etecte will be recursively passe back to the tracing function, at which time the new wall will be etecte. In the right example of Fig., the whole cone struck parts of the walls that were etecte, so there are no remaining fractions to be passe to the next iteration, an the walls that were not etecte will remain unetecte. However, for our application we o not expect this to occur as we only consier large walls an our limit on the cone size will ensure that all walls are etecte. C. Occlusion Another ifficulty in etermining which parts of cones strike walls is the occlusion of one wall by another. The natural solution to this problem is to process the closest wall first, clip on the borers of that wall, an pass the remaining fragments of the cone to the remaining walls. The ifficulty with this is the usual problem with occlusion: how to efine closest. We cast three rays for each cone to fin which walls these rays intersect. We then use a variation of the painter s algorithm to etermine an orering on these walls. Details of our variation on the painter s algorithm can be foun in [9]. One particular aspect of our metho is worth mentioning here. The stanar painter s algorithm sorts the polygons base on their istance from the eye-point, using a coorinate system having the eyepoint at the origin an with the viewing irection along one axis. However, we will be casting our cones in a large number of irections. We coul transform all the polygons to a coorinate system base at the cone s origin, but instea we istinguish epth using the cone s origin, a point on each polygon, an the normal to one of the polygons, as illustrate in Fig. 4. This calculation is performe after any require splitting. III. Results Lecours et al. [] evelope a simulator base on ray tracing, an publishe its behavior in both real an imaginary situations. The real situations emonstrate goo agreement, an that was presente as an argument that the analysis of imaginary situations also reflecte a realistic approximation of the actual signal behavior. As a emonstration of their technique, Lecours et al. generate signal intensity graphs for a single strip of the imaginary room. The reaer is referre to the Lecours et al. paper f or etails of the wall sizes an material properties of this room. We teste our technique on the Lecours et al. imaginary room. Fig. shows the results of our technique for the portion of this room use in their paper. These are the signal strength preictions for an isotropic raiator one meter from the front wall, an one meter below the ceiling. The graphs show the signal strength meters above the floor, along a line one meter from the left wall (the position of this line relative to the room

4 Pick a point in each half-plane. Let S be in half-plane 1, P be in half-plane, E be the eye point, an N be a normal to half-plane I ((S-E) ot N) * ((P-S) ot N) > 0 then 1 might occlue. E S-E S #1 P-S P N # (In this example, #1 might occlue #.) Figure 4: Metho for etermining possible occlusion between two half planes Figure 6: The signal strength preicte by cone tracing the Lecours et al. room (transmitter is at the left sie). Darker areas represent regions of highest signal strength. The black line is the strip use in Fig. an is not part of the signal strength ata Figure : Cone tracing signal strength for Lecours et al. room. The top row are our simulations. The bottom row are their results. The left column simulates the floor only. The right column simulates the complete room. The y-axis gives the signal strength in ecibels, an the x-axis is the istance from the back wall. Differences in magnitue are ue to antenna gain. an transmitter is illustrate Fig. 6). The room is six meters by twelve meters in imension. Our results match theirs for the simple case of floor only, an also once the ceiling an sie walls are ae, in that both sets of results show an area of poor reception in the region from four to six meters along the sie wall. In both cases, reception improves in an area six to eight meters along the wall, an the signal quickly egraes after passing the nine meter mark. This latter region (from nine to twelve meters) is strongly influence by reflections from the en wall, once that wall is ae to the moel. While the large-scale behaviors agree between our metho an the Lecours et al. metho, there is isagreement about the small-scale signal behavior. These ifferences can be explaine by the failure of the current implementation of cone tracing to consier angle of incience when fining reflection coefficients. The values use were the coefficients for a 4 egree angle of incience. However, there is actually a significant variation in reflection as a function of incience angle [1]. This variation accounts for the ifferences between our results an the results of Lecours et al. Theoretically, the agreement of the two methos is not a sur- Figures from []. Reprinte by author s permission Y 1e+04 1e+0 1e+0 Times vs. Max Bounces Figure 7: Execution times for four rooms room 1 room room room 4 prise. Although blocks of signal are consiere, instea of infinitely thin components, the same reflections are use, so the total interference shoul be similar. What this experiment shows, however, is that the cone tracing technique can be applie in practice. The graphs in Fig. were generate by a post-analysis loop through one row of the signal strength matrix, an represent only one strip of the room. In fact, by the time they were known, the analysis for the whole room was complete (Fig. 6). This particular analysis took thirty secons on a lightly loae RS/6000. Timings were mae for four moels. Each room was analyze for various limits on the number of bounces permitte. Ten trials were performe for each bounce limit in each room, an the averages were use. The user time elapse was roughly exponential with respect to the bounce limit (Fig. 7). Exponential growth seems natural, since each cone gives birth to some group of aughter cones, an the average number of aughter cones from an incient cone shoul be inepenent of the generation numbers of the cones involve. However, another interesting iscovery arising from these trials was how low the bounce limit coul be set without significantly affecting the results. The results (shown in Fig. 8) emonstrate that, while the time cost of each step increases, the effect on results ecreases. Note that the bounce limit counts only reflections. This allows the weaker signals foun in rooms istant from the transmitter to still interfere with each other, even though they may have been severely attenuate by intervening walls. Combining these results suggests that setting a low limit on X

5 Signal Level (B) 1e-01 1e-0 Signal Level (B) 1e-01 1e-0 1e-0 Lecours, Grenier, Baqarhi, an Cherkaoui room tmp.room1.xgraph.1.1 tmp.room1.xgraph..1 Lecours, Grenier, Baqarhi, an Cherkaoui room Distance (m) tmp.room1.xgraph..1 tmp.room1.xgraph..1 tmp.room1.xgraph.4.1 tmp.room1.xgraph..1 Distance (m) Figure 8: Bounce limits: The preicte signal strength for the room escribe in [] The top graph compares bounce limits of 1 vs., an the bottom shows,, 4, an together. Note that there is very little qualitative ifference between limiting the number of bounces to two, an limiting them to five. Compare this with the execution times shown in Fig. 7. the number of bounces will greatly benefit overall efficiency. IV. Conclusions This paper has shown an efficient application of cone tracing, which prouces useful approximations of signal behavior in specific inoor environments. Using the technique escribe avois the mathematical complexities of approximating a soli wavefront with a collection of rays, the reunancies of analyzing the same room for multiple receiver locations, an the inefficiencies of choosing arbitrary initial signal resolutions. It oes so by using cones instea of rays, recoring signal intensity for the entire room in one pass, an ynamically subiviing cones that become too big. In aition to many optimizations possible for our current technique (such as computing signal strength for a volume, improving the intersection technique, moeling non-isotropic raiators, etc), there are two interesting effects that coul also be moele. First, surfaces in the presence of an electric fiel can become seconary emitters. These seconary emissions are uniform in all irections, suggesting that a raiosity technique [4, p.79] coul moel them effectively. Secon, when a wavefront hits a corner or an ege of an object, iffraction effects cause the signal to propagate uniformly from the surface iscontinuity. For corners, this results in a spherical wavefront that can be moele as a new transmitter, but for eges the wavefront will be cylinrical an will require a new moel for the signal. A iscussion on how to implement these extensions can be foun in [9]. References [1] John Amanaties. Ray tracing with cones. In Computer Graphics (SIGGRAPH 84 Proceeings), pages 19 1, July [] D. C. Cox, R. R. Murray, an A. W. Norris. Measurements of 800 MHz raio transmission into builings with metallic walls. The Bell System Technical Journal, 6(9):69 717, November 198. [] D. C. Cox, R. R. Murray, an A. W. Norris. 800 MHz attenuation measure in an aroun suburban houses. The Bell System Technical Journal, 6(6):91 94, July- August [4] James D. Foley, Anries van Dam, Steven K. Feiner, an John F. Hughes. Computer Graphics (secon eition). Aison-Wesley, [] M. Lecours, D. Grenier, M. Baqarhi, an S. Cherkaoui. Measurements an simulation of receive signals in rooms an corriors at 900 MHz an in the 0-60 GHz ban. In 4n annual IEEE Vehicular Technology Conference, pages , 199. [6] W. C. Lee. Mobile Communications Engineering. Mc- Graw Hill, New York, 198. [7] John W. McKown an R. Lee Hamilton Jr. Ray tracing as a esign tool for raio networks. IEEE Network Magazine, pages 7 0, November [8] A. Motley an J. Keenan. Personal communication raio coverage in builings at 900 MHz an 1700 MHz. Electronics Letters, 4(1):76 764, June [9] Michael Ni. Using ray tracing for site-specific inoor raio signal strength analysis. Master s thesis, University of Waterloo, Waterloo, Ontario, Canaa, 199. [10] Keith D. Paulsen, Daniel R. Lynch, an Weiping Liu. Conjugate irection methos for helmholz problems with complex-value wavenumbers. International Journal for Numberical Methos in Engineering, :601 6, 199. [11] Scott Y. Seiel an Theoore S. Rappaport. A ray tracing technique to preict path loss an elay sprea insie builings. In Globecom 9, pages 649 6, 199. [1] Scott Y. Seiel an Theoore S. Rappaport. Site-specific propagation preiction for wireless in-builing personal communication system esign. IEEE Transactions on Vehicular Technology, 4(4): , November [1] Scott Y. Seiel, Kurt R. Schaubach, Thomas T. Tran, an Theoore S. Rappaport. Research in site-specific propagation moeling for pcs system esign. In 4n annual IEEE Vehicular Technology Conference, pages 61 64, 199. [14] Kari Sipilä an Kari Heiska. Can ray tracing be use as a faing generator in simulating micro-cellular mobile raio systems? In Wireless 96, volume, pages 8 44, Calgary, Alberta, Canaa, July TRLabs, TRIO, IEEE Canaa.

Computer Graphics Chapter 7 Three-Dimensional Viewing Viewing

Computer Graphics Chapter 7 Three-Dimensional Viewing Viewing Computer Graphics Chapter 7 Three-Dimensional Viewing Outline Overview of Three-Dimensional Viewing Concepts The Three-Dimensional Viewing Pipeline Three-Dimensional Viewing-Coorinate Parameters Transformation

More information

Module13:Interference-I Lecture 13: Interference-I

Module13:Interference-I Lecture 13: Interference-I Moule3:Interference-I Lecture 3: Interference-I Consier a situation where we superpose two waves. Naively, we woul expect the intensity (energy ensity or flux) of the resultant to be the sum of the iniviual

More information

Physics INTERFERENCE OF LIGHT

Physics INTERFERENCE OF LIGHT Physics INTERFERENCE OF LIGHT Q.1 State the principle of superposition of waves an explain the concept of interference of light. Ans. Principle of superposition of waves : When two or more waves, traveling

More information

Interference and diffraction are the important phenomena that distinguish. Interference and Diffraction

Interference and diffraction are the important phenomena that distinguish. Interference and Diffraction C H A P T E R 33 Interference an Diffraction 33- Phase Difference an Coherence 33-2 Interference in Thin Films 33-3 Two-Slit Interference Pattern 33-4 Diffraction Pattern of a Single Slit * 33-5 Using

More information

UNIT 9 INTERFEROMETRY

UNIT 9 INTERFEROMETRY UNIT 9 INTERFEROMETRY Structure 9.1 Introuction Objectives 9. Interference of Light 9.3 Light Sources for 9.4 Applie to Flatness Testing 9.5 in Testing of Surface Contour an Measurement of Height 9.6 Interferometers

More information

Almost Disjunct Codes in Large Scale Multihop Wireless Network Media Access Control

Almost Disjunct Codes in Large Scale Multihop Wireless Network Media Access Control Almost Disjunct Coes in Large Scale Multihop Wireless Network Meia Access Control D. Charles Engelhart Anan Sivasubramaniam Penn. State University University Park PA 682 engelhar,anan @cse.psu.eu Abstract

More information

Lesson 11 Interference of Light

Lesson 11 Interference of Light Physics 30 Lesson 11 Interference of Light I. Light Wave or Particle? The fact that light carries energy is obvious to anyone who has focuse the sun's rays with a magnifying glass on a piece of paper an

More information

Calculation on diffraction aperture of cube corner retroreflector

Calculation on diffraction aperture of cube corner retroreflector November 10, 008 / Vol., No. 11 / CHINESE OPTICS LETTERS 8 Calculation on iffraction aperture of cube corner retroreflector Song Li (Ó Ø, Bei Tang (», an Hui Zhou ( ï School of Electronic Information,

More information

Shift-map Image Registration

Shift-map Image Registration Shift-map Image Registration Linus Svärm Petter Stranmark Centre for Mathematical Sciences, Lun University {linus,petter}@maths.lth.se Abstract Shift-map image processing is a new framework base on energy

More information

FINDING OPTICAL DISPERSION OF A PRISM WITH APPLICATION OF MINIMUM DEVIATION ANGLE MEASUREMENT METHOD

FINDING OPTICAL DISPERSION OF A PRISM WITH APPLICATION OF MINIMUM DEVIATION ANGLE MEASUREMENT METHOD Warsaw University of Technology Faculty of Physics Physics Laboratory I P Joanna Konwerska-Hrabowska 6 FINDING OPTICAL DISPERSION OF A PRISM WITH APPLICATION OF MINIMUM DEVIATION ANGLE MEASUREMENT METHOD.

More information

LECTURE 20: Interference, Diffraction, Resolution. Interference. Interference: Double Slit (for very narrow slits) Interference: Double Slit (DEMO)

LECTURE 20: Interference, Diffraction, Resolution. Interference. Interference: Double Slit (for very narrow slits) Interference: Double Slit (DEMO) LECTURE 0: Interference, Diffraction, Resolution Interference *Three ways in which the phase ifference between two waves can change: 1. By traveling though meia of ifferent inexes of refraction. By traveling

More information

Shift-map Image Registration

Shift-map Image Registration Shift-map Image Registration Svärm, Linus; Stranmark, Petter Unpublishe: 2010-01-01 Link to publication Citation for publishe version (APA): Svärm, L., & Stranmark, P. (2010). Shift-map Image Registration.

More information

Q. No. 1 Newton postulated his corpuscular theory of light on the basis of

Q. No. 1 Newton postulated his corpuscular theory of light on the basis of Q. No. 1 Newton postulate his corpuscular theory of light on the basis of Newton s rings Option Rectilinear propagation of light Colour through thin films Dispersion of white light into colours. Correct

More information

Depth Sizing of Surface Breaking Flaw on Its Open Side by Short Path of Diffraction Technique

Depth Sizing of Surface Breaking Flaw on Its Open Side by Short Path of Diffraction Technique 17th Worl Conference on Nonestructive Testing, 5-8 Oct 008, Shanghai, China Depth Sizing of Surface Breaking Flaw on Its Open Sie by Short Path of Diffraction Technique Hiroyuki FUKUTOMI, Shan LIN an Takashi

More information

AN INVESTIGATION OF FOCUSING AND ANGULAR TECHNIQUES FOR VOLUMETRIC IMAGES BY USING THE 2D CIRCULAR ULTRASONIC PHASED ARRAY

AN INVESTIGATION OF FOCUSING AND ANGULAR TECHNIQUES FOR VOLUMETRIC IMAGES BY USING THE 2D CIRCULAR ULTRASONIC PHASED ARRAY AN INVESTIGATION OF FOCUSING AND ANGULAR TECHNIQUES FOR VOLUMETRIC IMAGES BY USING THE D CIRCULAR ULTRASONIC PHASED ARRAY S. Monal Lonon South Bank University; Engineering an Design 103 Borough Roa, Lonon

More information

10. WAVE OPTICS ONE MARK QUESTIONS

10. WAVE OPTICS ONE MARK QUESTIONS 1 10. WAVE OPTICS ONE MARK QUESTIONS 1. Define wavefront.. What is the shape of wavefront obtaine from a point source at a (i) small istance (ii) large istance? 3. Uner what conitions a cylinrical wavefront

More information

Transient analysis of wave propagation in 3D soil by using the scaled boundary finite element method

Transient analysis of wave propagation in 3D soil by using the scaled boundary finite element method Southern Cross University epublications@scu 23r Australasian Conference on the Mechanics of Structures an Materials 214 Transient analysis of wave propagation in 3D soil by using the scale bounary finite

More information

Refinement of scene depth from stereo camera ego-motion parameters

Refinement of scene depth from stereo camera ego-motion parameters Refinement of scene epth from stereo camera ego-motion parameters Piotr Skulimowski, Pawel Strumillo An algorithm for refinement of isparity (epth) map from stereoscopic sequences is propose. The metho

More information

Chapter 5 Proposed models for reconstituting/ adapting three stereoscopes

Chapter 5 Proposed models for reconstituting/ adapting three stereoscopes Chapter 5 Propose moels for reconstituting/ aapting three stereoscopes - 89 - 5. Propose moels for reconstituting/aapting three stereoscopes This chapter offers three contributions in the Stereoscopy area,

More information

1 Surprises in high dimensions

1 Surprises in high dimensions 1 Surprises in high imensions Our intuition about space is base on two an three imensions an can often be misleaing in high imensions. It is instructive to analyze the shape an properties of some basic

More information

Figure 1: 2D arm. Figure 2: 2D arm with labelled angles

Figure 1: 2D arm. Figure 2: 2D arm with labelled angles 2D Kinematics Consier a robotic arm. We can sen it commans like, move that joint so it bens at an angle θ. Once we ve set each joint, that s all well an goo. More interesting, though, is the question of

More information

Image Segmentation using K-means clustering and Thresholding

Image Segmentation using K-means clustering and Thresholding Image Segmentation using Kmeans clustering an Thresholing Preeti Panwar 1, Girhar Gopal 2, Rakesh Kumar 3 1M.Tech Stuent, Department of Computer Science & Applications, Kurukshetra University, Kurukshetra,

More information

Section 19. Thin Prisms

Section 19. Thin Prisms Section 9 Thin Prisms 9- OPTI-50 Optical Design an Instrumentation I opyright 08 John E. Greivenkamp Thin Prism Deviation Thin prisms introuce small angular beam eviations an are useful as alignment evices.

More information

Estimation of large-amplitude motion and disparity fields: Application to intermediate view reconstruction

Estimation of large-amplitude motion and disparity fields: Application to intermediate view reconstruction c 2000 SPIE. Personal use of this material is permitte. However, permission to reprint/republish this material for avertising or promotional purposes or for creating new collective works for resale or

More information

CS 106 Winter 2016 Craig S. Kaplan. Module 01 Processing Recap. Topics

CS 106 Winter 2016 Craig S. Kaplan. Module 01 Processing Recap. Topics CS 106 Winter 2016 Craig S. Kaplan Moule 01 Processing Recap Topics The basic parts of speech in a Processing program Scope Review of syntax for classes an objects Reaings Your CS 105 notes Learning Processing,

More information

Section 20. Thin Prisms

Section 20. Thin Prisms OPTI-0/0 Geometrical an Instrumental Optics opyright 08 John E. Greivenkamp 0- Section 0 Thin Prisms Thin Prism Deviation Thin prisms introuce small angular beam eviations an are useful as alignment evices.

More information

Bends, Jogs, And Wiggles for Railroad Tracks and Vehicle Guide Ways

Bends, Jogs, And Wiggles for Railroad Tracks and Vehicle Guide Ways Ben, Jogs, An Wiggles for Railroa Tracks an Vehicle Guie Ways Louis T. Klauer Jr., PhD, PE. Work Soft 833 Galer Dr. Newtown Square, PA 19073 lklauer@wsof.com Preprint, June 4, 00 Copyright 00 by Louis

More information

Optics Wave Behavior in Optics Interference from Multiple Slits Diffraction Gratings

Optics Wave Behavior in Optics Interference from Multiple Slits Diffraction Gratings Optics Wave Behavior in Optics Interference from Multiple Slits Diffraction Gratings Lana Sherian De Anza College June 14, 2018 Last time images forme by lens combinations Huygen s Principle Interference

More information

Coupling the User Interfaces of a Multiuser Program

Coupling the User Interfaces of a Multiuser Program Coupling the User Interfaces of a Multiuser Program PRASUN DEWAN University of North Carolina at Chapel Hill RAJIV CHOUDHARY Intel Corporation We have evelope a new moel for coupling the user-interfaces

More information

MORA: a Movement-Based Routing Algorithm for Vehicle Ad Hoc Networks

MORA: a Movement-Based Routing Algorithm for Vehicle Ad Hoc Networks : a Movement-Base Routing Algorithm for Vehicle A Hoc Networks Fabrizio Granelli, Senior Member, Giulia Boato, Member, an Dzmitry Kliazovich, Stuent Member Abstract Recent interest in car-to-car communications

More information

Skyline Community Search in Multi-valued Networks

Skyline Community Search in Multi-valued Networks Syline Community Search in Multi-value Networs Rong-Hua Li Beijing Institute of Technology Beijing, China lironghuascut@gmail.com Jeffrey Xu Yu Chinese University of Hong Kong Hong Kong, China yu@se.cuh.eu.h

More information

Figure 1: Schematic of an SEM [source: ]

Figure 1: Schematic of an SEM [source:   ] EECI Course: -9 May 1 by R. Sanfelice Hybri Control Systems Eelco van Horssen E.P.v.Horssen@tue.nl Project: Scanning Electron Microscopy Introuction In Scanning Electron Microscopy (SEM) a (bunle) beam

More information

Intensive Hypercube Communication: Prearranged Communication in Link-Bound Machines 1 2

Intensive Hypercube Communication: Prearranged Communication in Link-Bound Machines 1 2 This paper appears in J. of Parallel an Distribute Computing 10 (1990), pp. 167 181. Intensive Hypercube Communication: Prearrange Communication in Link-Boun Machines 1 2 Quentin F. Stout an Bruce Wagar

More information

Questions? Post on piazza, or Radhika (radhika at eecs.berkeley) or Sameer (sa at berkeley)!

Questions? Post on piazza, or  Radhika (radhika at eecs.berkeley) or Sameer (sa at berkeley)! EE122 Fall 2013 HW3 Instructions Recor your answers in a file calle hw3.pf. Make sure to write your name an SID at the top of your assignment. For each problem, clearly inicate your final answer, bol an

More information

Analysis of half-space range search using the k-d search skip list. Here we analyse the expected time for half-space

Analysis of half-space range search using the k-d search skip list. Here we analyse the expected time for half-space Analysis of half-space range search using the k- search skip list Mario A. Lopez Brafor G. Nickerson y 1 Abstract We analyse the average cost of half-space range reporting for the k- search skip list.

More information

Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama and Hayato Ohwada Faculty of Sci. and Tech. Tokyo University of Scien

Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama and Hayato Ohwada Faculty of Sci. and Tech. Tokyo University of Scien Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama an Hayato Ohwaa Faculty of Sci. an Tech. Tokyo University of Science, 2641 Yamazaki, Noa-shi, CHIBA, 278-8510, Japan hiroyuki@rs.noa.tus.ac.jp,

More information

Classifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means

Classifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means Classifying Facial Expression with Raial Basis Function Networks, using Graient Descent an K-means Neil Allrin Department of Computer Science University of California, San Diego La Jolla, CA 9237 nallrin@cs.ucs.eu

More information

NEW METHOD FOR FINDING A REFERENCE POINT IN FINGERPRINT IMAGES WITH THE USE OF THE IPAN99 ALGORITHM 1. INTRODUCTION 2.

NEW METHOD FOR FINDING A REFERENCE POINT IN FINGERPRINT IMAGES WITH THE USE OF THE IPAN99 ALGORITHM 1. INTRODUCTION 2. JOURNAL OF MEDICAL INFORMATICS & TECHNOLOGIES Vol. 13/009, ISSN 164-6037 Krzysztof WRÓBEL, Rafał DOROZ * fingerprint, reference point, IPAN99 NEW METHOD FOR FINDING A REFERENCE POINT IN FINGERPRINT IMAGES

More information

Estimating Velocity Fields on a Freeway from Low Resolution Video

Estimating Velocity Fields on a Freeway from Low Resolution Video Estimating Velocity Fiels on a Freeway from Low Resolution Vieo Young Cho Department of Statistics University of California, Berkeley Berkeley, CA 94720-3860 Email: young@stat.berkeley.eu John Rice Department

More information

WLAN Indoor Positioning Based on Euclidean Distances and Fuzzy Logic

WLAN Indoor Positioning Based on Euclidean Distances and Fuzzy Logic WLAN Inoor Positioning Base on Eucliean Distances an Fuzzy Logic Anreas TEUBER, Bern EISSFELLER Institute of Geoesy an Navigation, University FAF, Munich, Germany, e-mail: (anreas.teuber, bern.eissfeller)@unibw.e

More information

PLANCESS RANK ACCELERATOR

PLANCESS RANK ACCELERATOR PLANCESS RANK ACCELERATOR PHYSICS FOR JEE MAIN & ADVANCED Wave Optics 4000+questions with topic wise exercises 000+ problems of IIT-JEE & AIEEE exams of last 5 years 4 Levels of Exercises categorize into

More information

6 Gradient Descent. 6.1 Functions

6 Gradient Descent. 6.1 Functions 6 Graient Descent In this topic we will iscuss optimizing over general functions f. Typically the function is efine f : R! R; that is its omain is multi-imensional (in this case -imensional) an output

More information

A Plane Tracker for AEC-automation Applications

A Plane Tracker for AEC-automation Applications A Plane Tracker for AEC-automation Applications Chen Feng *, an Vineet R. Kamat Department of Civil an Environmental Engineering, University of Michigan, Ann Arbor, USA * Corresponing author (cforrest@umich.eu)

More information

Animated Surface Pasting

Animated Surface Pasting Animate Surface Pasting Clara Tsang an Stephen Mann Computing Science Department University of Waterloo 200 University Ave W. Waterloo, Ontario Canaa N2L 3G1 e-mail: clftsang@cgl.uwaterloo.ca, smann@cgl.uwaterloo.ca

More information

Wavelength Crest. Amp litude. is the highest point of that portion of a transverse wave above the equilibrium position.

Wavelength Crest. Amp litude. is the highest point of that portion of a transverse wave above the equilibrium position. Chapter Twenty-Four: Interference of Light interference patterns are prouce when two (or more) coherent sources prouce waves of the same frequency an amplitue which superimpose in the same region of space

More information

chapter In Chapter 36, we studied light rays passing through a lens or reflecting from a mirror

chapter In Chapter 36, we studied light rays passing through a lens or reflecting from a mirror chapter 37 Wave Optics 37.1 Young s Double-Slit Experiment 37.2 Analysis Moel: Waves in Interference 37.3 Intensity Distribution of the Double-Slit Interference Pattern 37.4 Change of Phase Due to Reflection

More information

An Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources

An Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources An Algorithm for Builing an Enterprise Network Topology Using Wiesprea Data Sources Anton Anreev, Iurii Bogoiavlenskii Petrozavosk State University Petrozavosk, Russia {anreev, ybgv}@cs.petrsu.ru Abstract

More information

Generalized Edge Coloring for Channel Assignment in Wireless Networks

Generalized Edge Coloring for Channel Assignment in Wireless Networks Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu Institute of Information Science Acaemia Sinica Taipei, Taiwan Da-wei Wang Jan-Jan Wu Institute of Information Science

More information

Robust Camera Calibration for an Autonomous Underwater Vehicle

Robust Camera Calibration for an Autonomous Underwater Vehicle obust Camera Calibration for an Autonomous Unerwater Vehicle Matthew Bryant, Davi Wettergreen *, Samer Aballah, Alexaner Zelinsky obotic Systems Laboratory Department of Engineering, FEIT Department of

More information

Using Vector and Raster-Based Techniques in Categorical Map Generalization

Using Vector and Raster-Based Techniques in Categorical Map Generalization Thir ICA Workshop on Progress in Automate Map Generalization, Ottawa, 12-14 August 1999 1 Using Vector an Raster-Base Techniques in Categorical Map Generalization Beat Peter an Robert Weibel Department

More information

Message Transport With The User Datagram Protocol

Message Transport With The User Datagram Protocol Message Transport With The User Datagram Protocol User Datagram Protocol (UDP) Use During startup For VoIP an some vieo applications Accounts for less than 10% of Internet traffic Blocke by some ISPs Computer

More information

Fast Window Based Stereo Matching for 3D Scene Reconstruction

Fast Window Based Stereo Matching for 3D Scene Reconstruction The International Arab Journal of Information Technology, Vol. 0, No. 3, May 203 209 Fast Winow Base Stereo Matching for 3D Scene Reconstruction Mohamma Mozammel Chowhury an Mohamma AL-Amin Bhuiyan Department

More information

Generalized Edge Coloring for Channel Assignment in Wireless Networks

Generalized Edge Coloring for Channel Assignment in Wireless Networks TR-IIS-05-021 Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu, Pangfeng Liu, Da-Wei Wang, Jan-Jan Wu December 2005 Technical Report No. TR-IIS-05-021 http://www.iis.sinica.eu.tw/lib/techreport/tr2005/tr05.html

More information

Spherical Billboards and their Application to Rendering Explosions

Spherical Billboards and their Application to Rendering Explosions Spherical Billboars an their Application to Renering Explosions Tamás Umenhoffer László Szirmay-Kalos Gábor Szijártó Department of Control Engineering an Information Technology Buapest University of Technology,

More information

State Indexed Policy Search by Dynamic Programming. Abstract. 1. Introduction. 2. System parameterization. Charles DuHadway

State Indexed Policy Search by Dynamic Programming. Abstract. 1. Introduction. 2. System parameterization. Charles DuHadway State Inexe Policy Search by Dynamic Programming Charles DuHaway Yi Gu 5435537 503372 December 4, 2007 Abstract We consier the reinforcement learning problem of simultaneous trajectory-following an obstacle

More information

Lecture 1 September 4, 2013

Lecture 1 September 4, 2013 CS 84r: Incentives an Information in Networks Fall 013 Prof. Yaron Singer Lecture 1 September 4, 013 Scribe: Bo Waggoner 1 Overview In this course we will try to evelop a mathematical unerstaning for the

More information

Characterizing Decoding Robustness under Parametric Channel Uncertainty

Characterizing Decoding Robustness under Parametric Channel Uncertainty Characterizing Decoing Robustness uner Parametric Channel Uncertainty Jay D. Wierer, Wahee U. Bajwa, Nigel Boston, an Robert D. Nowak Abstract This paper characterizes the robustness of ecoing uner parametric

More information

CAMERAS AND GRAVITY: ESTIMATING PLANAR OBJECT ORIENTATION. Zhaoyin Jia, Andrew Gallagher, Tsuhan Chen

CAMERAS AND GRAVITY: ESTIMATING PLANAR OBJECT ORIENTATION. Zhaoyin Jia, Andrew Gallagher, Tsuhan Chen CAMERAS AND GRAVITY: ESTIMATING PLANAR OBJECT ORIENTATION Zhaoyin Jia, Anrew Gallagher, Tsuhan Chen School of Electrical an Computer Engineering, Cornell University ABSTRACT Photography on a mobile camera

More information

Learning convex bodies is hard

Learning convex bodies is hard Learning convex boies is har Navin Goyal Microsoft Research Inia navingo@microsoftcom Luis Raemacher Georgia Tech lraemac@ccgatecheu Abstract We show that learning a convex boy in R, given ranom samples

More information

Automation of Bird Front Half Deboning Procedure: Design and Analysis

Automation of Bird Front Half Deboning Procedure: Design and Analysis Automation of Bir Front Half Deboning Proceure: Design an Analysis Debao Zhou, Jonathan Holmes, Wiley Holcombe, Kok-Meng Lee * an Gary McMurray Foo Processing echnology Division, AAS Laboratory, Georgia

More information

Local Path Planning with Proximity Sensing for Robot Arm Manipulators. 1. Introduction

Local Path Planning with Proximity Sensing for Robot Arm Manipulators. 1. Introduction Local Path Planning with Proximity Sensing for Robot Arm Manipulators Ewar Cheung an Vlaimir Lumelsky Yale University, Center for Systems Science Department of Electrical Engineering New Haven, Connecticut

More information

THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE

THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE БСУ Международна конференция - 2 THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE Evgeniya Nikolova, Veselina Jecheva Burgas Free University Abstract:

More information

Research Article Inviscid Uniform Shear Flow past a Smooth Concave Body

Research Article Inviscid Uniform Shear Flow past a Smooth Concave Body International Engineering Mathematics Volume 04, Article ID 46593, 7 pages http://x.oi.org/0.55/04/46593 Research Article Invisci Uniform Shear Flow past a Smooth Concave Boy Abullah Mura Department of

More information

Loop Scheduling and Partitions for Hiding Memory Latencies

Loop Scheduling and Partitions for Hiding Memory Latencies Loop Scheuling an Partitions for Hiing Memory Latencies Fei Chen Ewin Hsing-Mean Sha Dept. of Computer Science an Engineering University of Notre Dame Notre Dame, IN 46556 Email: fchen,esha @cse.n.eu Tel:

More information

Coordinating Distributed Algorithms for Feature Extraction Offloading in Multi-Camera Visual Sensor Networks

Coordinating Distributed Algorithms for Feature Extraction Offloading in Multi-Camera Visual Sensor Networks Coorinating Distribute Algorithms for Feature Extraction Offloaing in Multi-Camera Visual Sensor Networks Emil Eriksson, György Dán, Viktoria Foor School of Electrical Engineering, KTH Royal Institute

More information

Queueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks

Queueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Queueing Moel an Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Marc Aoun, Antonios Argyriou, Philips Research, Einhoven, 66AE, The Netherlans Department of Computer an Communication

More information

Online Appendix to: Generalizing Database Forensics

Online Appendix to: Generalizing Database Forensics Online Appenix to: Generalizing Database Forensics KYRIACOS E. PAVLOU an RICHARD T. SNODGRASS, University of Arizona This appenix presents a step-by-step iscussion of the forensic analysis protocol that

More information

Classical Mechanics Examples (Lagrange Multipliers)

Classical Mechanics Examples (Lagrange Multipliers) Classical Mechanics Examples (Lagrange Multipliers) Dipan Kumar Ghosh Physics Department, Inian Institute of Technology Bombay Powai, Mumbai 400076 September 3, 015 1 Introuction We have seen that the

More information

Physics 111 Homework Solutions Week #8 - Monday

Physics 111 Homework Solutions Week #8 - Monday Physics 111 Homework Solutions Week #8 - Monay Thursay, February 18, 2010 Chapter 19 Questions - None Multiple-Choice 1914 D 1915 B Problems 1913 The istance away is given by 1914 The istance away is given

More information

Progress In Electromagnetics Research M, Vol. 20, 29 42, 2011

Progress In Electromagnetics Research M, Vol. 20, 29 42, 2011 Progress In Electromagnetics Research M, Vol. 20, 29 42, 2011 BEAM TRACING FOR FAST RCS PREDICTION OF ELECTRICALLY LARGE TARGETS H.-G. Park, H.-T. Kim, and K.-T. Kim * Department of Electrical Engineering,

More information

Offloading Cellular Traffic through Opportunistic Communications: Analysis and Optimization

Offloading Cellular Traffic through Opportunistic Communications: Analysis and Optimization 1 Offloaing Cellular Traffic through Opportunistic Communications: Analysis an Optimization Vincenzo Sciancalepore, Domenico Giustiniano, Albert Banchs, Anreea Picu arxiv:1405.3548v1 [cs.ni] 14 May 24

More information

Additional Divide and Conquer Algorithms. Skipping from chapter 4: Quicksort Binary Search Binary Tree Traversal Matrix Multiplication

Additional Divide and Conquer Algorithms. Skipping from chapter 4: Quicksort Binary Search Binary Tree Traversal Matrix Multiplication Aitional Divie an Conquer Algorithms Skipping from chapter 4: Quicksort Binary Search Binary Tree Traversal Matrix Multiplication Divie an Conquer Closest Pair Let s revisit the closest pair problem. Last

More information

Video-based Characters Creating New Human Performances from a Multi-view Video Database

Video-based Characters Creating New Human Performances from a Multi-view Video Database Vieo-base Characters Creating New Human Performances from a Multi-view Vieo Database Feng Xu Yebin Liu? Carsten Stoll? James Tompkin Gaurav Bharaj? Qionghai Dai Hans-Peter Seiel? Jan Kautz Christian Theobalt?

More information

Approximation with Active B-spline Curves and Surfaces

Approximation with Active B-spline Curves and Surfaces Approximation with Active B-spline Curves an Surfaces Helmut Pottmann, Stefan Leopolseer, Michael Hofer Institute of Geometry Vienna University of Technology Wiener Hauptstr. 8 10, Vienna, Austria pottmann,leopolseer,hofer

More information

Animação e Visualização Tridimensional. Collision Detection Corpo docente de AVT / CG&M / DEI / IST / UTL

Animação e Visualização Tridimensional. Collision Detection Corpo docente de AVT / CG&M / DEI / IST / UTL Animação e Visualização Triimensional Collision Detection Collision Hanling Collision Detection Collision Determination Collision Response Collision Hanling Collision Detection Collision Determination

More information

Learning Polynomial Functions. by Feature Construction

Learning Polynomial Functions. by Feature Construction I Proceeings of the Eighth International Workshop on Machine Learning Chicago, Illinois, June 27-29 1991 Learning Polynomial Functions by Feature Construction Richar S. Sutton GTE Laboratories Incorporate

More information

Blind Data Classification using Hyper-Dimensional Convex Polytopes

Blind Data Classification using Hyper-Dimensional Convex Polytopes Blin Data Classification using Hyper-Dimensional Convex Polytopes Brent T. McBrie an Gilbert L. Peterson Department of Electrical an Computer Engineering Air Force Institute of Technology 9 Hobson Way

More information

SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH

SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH Galen H Sasaki Dept Elec Engg, U Hawaii 2540 Dole Street Honolul HI 96822 USA Ching-Fong Su Fuitsu Laboratories of America 595 Lawrence Expressway

More information

A Versatile Model-Based Visibility Measure for Geometric Primitives

A Versatile Model-Based Visibility Measure for Geometric Primitives A Versatile Moel-Base Visibility Measure for Geometric Primitives Marc M. Ellenrieer 1,LarsKrüger 1, Dirk Stößel 2, an Marc Hanheie 2 1 DaimlerChrysler AG, Research & Technology, 89013 Ulm, Germany 2 Faculty

More information

Evolutionary Optimisation Methods for Template Based Image Registration

Evolutionary Optimisation Methods for Template Based Image Registration Evolutionary Optimisation Methos for Template Base Image Registration Lukasz A Machowski, Tshilizi Marwala School of Electrical an Information Engineering University of Witwatersran, Johannesburg, South

More information

Viewing Transformations I Comp 535

Viewing Transformations I Comp 535 Viewing Transformations I Comp 535 Motivation Want to see our virtual 3-D worl on a 2-D screen 2 Graphics Pipeline Moel Space Moel Transformations Worl Space Viewing Transformation Ee/Camera Space Projection

More information

Navigation Around an Unknown Obstacle for Autonomous Surface Vehicles Using a Forward-Facing Sonar

Navigation Around an Unknown Obstacle for Autonomous Surface Vehicles Using a Forward-Facing Sonar Navigation Aroun an nknown Obstacle for Autonomous Surface Vehicles sing a Forwar-Facing Sonar Patrick A. Plonski, Joshua Vaner Hook, Cheng Peng, Narges Noori, Volkan Isler Abstract A robotic boat is moving

More information

Politehnica University of Timisoara Mobile Computing, Sensors Network and Embedded Systems Laboratory. Testing Techniques

Politehnica University of Timisoara Mobile Computing, Sensors Network and Embedded Systems Laboratory. Testing Techniques Politehnica University of Timisoara Mobile Computing, Sensors Network an Embee Systems Laboratory ing Techniques What is testing? ing is the process of emonstrating that errors are not present. The purpose

More information

Dense Disparity Estimation in Ego-motion Reduced Search Space

Dense Disparity Estimation in Ego-motion Reduced Search Space Dense Disparity Estimation in Ego-motion Reuce Search Space Luka Fućek, Ivan Marković, Igor Cvišić, Ivan Petrović University of Zagreb, Faculty of Electrical Engineering an Computing, Croatia (e-mail:

More information

Improving Spatial Reuse of IEEE Based Ad Hoc Networks

Improving Spatial Reuse of IEEE Based Ad Hoc Networks mproving Spatial Reuse of EEE 82.11 Base A Hoc Networks Fengji Ye, Su Yi an Biplab Sikar ECSE Department, Rensselaer Polytechnic nstitute Troy, NY 1218 Abstract n this paper, we evaluate an suggest methos

More information

Uninformed search methods

Uninformed search methods CS 1571 Introuction to AI Lecture 4 Uninforme search methos Milos Hauskrecht milos@cs.pitt.eu 539 Sennott Square Announcements Homework assignment 1 is out Due on Thursay, September 11, 014 before the

More information

Advanced method of NC programming for 5-axis machining

Advanced method of NC programming for 5-axis machining Available online at www.scienceirect.com Proceia CIRP (0 ) 0 07 5 th CIRP Conference on High Performance Cutting 0 Avance metho of NC programming for 5-axis machining Sergej N. Grigoriev a, A.A. Kutin

More information

Exploring Context with Deep Structured models for Semantic Segmentation

Exploring Context with Deep Structured models for Semantic Segmentation 1 Exploring Context with Deep Structure moels for Semantic Segmentation Guosheng Lin, Chunhua Shen, Anton van en Hengel, Ian Rei between an image patch an a large backgroun image region. Explicitly moeling

More information

Polygon Simplification by Minimizing Convex Corners

Polygon Simplification by Minimizing Convex Corners Polygon Simplification by Minimizing Convex Corners Yeganeh Bahoo 1, Stephane Durocher 1, J. Mark Keil 2, Saee Mehrabi 3, Sahar Mehrpour 1, an Debajyoti Monal 1 1 Department of Computer Science, University

More information

Sampling the Disparity Space Image

Sampling the Disparity Space Image Accepte for publication, June 2003. To appear in IEEE Transactions on Pattern Analysis an Machine Intelligence (PAMI) Sampling the Disparity Space Image Richar Szeliski Daniel Scharstein Microsoft Research

More information

4.2 Implicit Differentiation

4.2 Implicit Differentiation 6 Chapter 4 More Derivatives 4. Implicit Differentiation What ou will learn about... Implicitl Define Functions Lenses, Tangents, an Normal Lines Derivatives of Higher Orer Rational Powers of Differentiable

More information

Architecture Design of Mobile Access Coordinated Wireless Sensor Networks

Architecture Design of Mobile Access Coordinated Wireless Sensor Networks Architecture Design of Mobile Access Coorinate Wireless Sensor Networks Mai Abelhakim 1 Leonar E. Lightfoot Jian Ren 1 Tongtong Li 1 1 Department of Electrical & Computer Engineering, Michigan State University,

More information

Super-resolution Frame Reconstruction Using Subpixel Motion Estimation

Super-resolution Frame Reconstruction Using Subpixel Motion Estimation Super-resolution Frame Reconstruction Using Subpixel Motion Estimation ABSTRACT When vieo ata is use for forensic analysis, it may transpire that the level of etail available is insufficient. This is particularly

More information

Technical Report TR Navigation Around an Unknown Obstacle for Autonomous Surface Vehicles Using a Forward-Facing Sonar

Technical Report TR Navigation Around an Unknown Obstacle for Autonomous Surface Vehicles Using a Forward-Facing Sonar Technical Report Department of Computer Science an Engineering niversity of Minnesota 4-192 Keller Hall 2 nion Street SE Minneapolis, MN 55455-159 SA TR 15-5 Navigation Aroun an nknown Obstacle for Autonomous

More information

Modifying ROC Curves to Incorporate Predicted Probabilities

Modifying ROC Curves to Incorporate Predicted Probabilities Moifying ROC Curves to Incorporate Preicte Probabilities Cèsar Ferri DSIC, Universitat Politècnica e València Peter Flach Department of Computer Science, University of Bristol José Hernánez-Orallo DSIC,

More information

Comparison of Wireless Network Simulators with Multihop Wireless Network Testbed in Corridor Environment

Comparison of Wireless Network Simulators with Multihop Wireless Network Testbed in Corridor Environment Comparison of Wireless Network Simulators with Multihop Wireless Network Testbe in Corrior Environment Rabiullah Khattak, Anna Chaltseva, Laurynas Riliskis, Ulf Boin, an Evgeny Osipov Department of Computer

More information

On Effectively Determining the Downlink-to-uplink Sub-frame Width Ratio for Mobile WiMAX Networks Using Spline Extrapolation

On Effectively Determining the Downlink-to-uplink Sub-frame Width Ratio for Mobile WiMAX Networks Using Spline Extrapolation On Effectively Determining the Downlink-to-uplink Sub-frame With Ratio for Mobile WiMAX Networks Using Spline Extrapolation Panagiotis Sarigianniis, Member, IEEE, Member Malamati Louta, Member, IEEE, Member

More information

Using the disparity space to compute occupancy grids from stereo-vision

Using the disparity space to compute occupancy grids from stereo-vision The 2010 IEEE/RSJ International Conference on Intelligent Robots an Systems October 18-22, 2010, Taipei, Taiwan Using the isparity space to compute occupancy gris from stereo-vision Mathias Perrollaz,

More information

Study of Network Optimization Method Based on ACL

Study of Network Optimization Method Based on ACL Available online at www.scienceirect.com Proceia Engineering 5 (20) 3959 3963 Avance in Control Engineering an Information Science Stuy of Network Optimization Metho Base on ACL Liu Zhian * Department

More information

AnyTraffic Labeled Routing

AnyTraffic Labeled Routing AnyTraffic Labele Routing Dimitri Papaimitriou 1, Pero Peroso 2, Davie Careglio 2 1 Alcatel-Lucent Bell, Antwerp, Belgium Email: imitri.papaimitriou@alcatel-lucent.com 2 Universitat Politècnica e Catalunya,

More information