Estimating Velocity Fields on a Freeway from Low Resolution Video

Size: px
Start display at page:

Download "Estimating Velocity Fields on a Freeway from Low Resolution Video"

Transcription

1 Estimating Velocity Fiels on a Freeway from Low Resolution Vieo Young Cho Department of Statistics University of California, Berkeley Berkeley, CA young@stat.berkeley.eu John Rice Department of Statistics University of California, Berkeley Berkeley, CA rice@stat.berkeley.eu Abstract We present an algorithm to estimate velocity fiels from low resolution vieo recorings. The algorithm oes not attempt to ientify an track iniviual vehicles, nor oes it attempt to estimate erivatives of the fiel of pixel intensities. Rather, we compress a frame by obtaining an intensity profile in each lane along the irection of traffic flow. The spee estimate is then compute by searching for a best matching profile in a frame at a later time. Because the algorithm oes not nee high quality images, it is irectly applicable to a compresse format igital vieo stream, such as mpeg, from conventional traffic vieo cameras. We illustrate the proceure using a 15 minute long VHS recoring to obtain spee estimates on a one mile stretch of highway I-80 in Berkeley, California. I. INTRODUCTION Traffic cameras offer the potential to complement or substitute for loop etectors. Because they can provie finer spatial an temporal resolution, they have many avantages over loop etectors. In principle, vieo from cameras can also be use to etect lane-changing, accients, an queuing patterns an to extract macroscopic traffic parameters, such as flow, spee, an ensity. Also, cameras are becoming less expensive to purchase an maintain. However, in orer to use images from cameras to stuy traffic, a large amount of vieo must be processe an an efficient an practical system to extract traffic parameters is thus essential. After being igitize, an hour vieo can be up to a several gigabytes. The obective of this paper is to present a simple algorithm to estimate a velocity fiel, localize in space an time, from vieo ata covering a wie area with limite spatial resolution. The localization is fine enough to reveal the temporal an spatial formation an issipation of shockwaves. To emonstrate practicality of the algorithm, we present results from a 15 minute long vieo filme by a Berkeley Highway Laboratory camera. Figure 1(a) shows the layout of the Berkeley Highway Laboratory. Figure 1(b) shows a single frame covering about one mile of freeway. Kastrinaki et al. [1] provie an extensive survey of state of the art traffic applications of vieo processing, incluing roa traffic monitoring. Our methoology falls into the general category of optical flow, techniques of which are reviewe in Beauchemin an Barron [2]. Applications of optical flow to traffic monitoring have been base on etecting an tracking iniviual vehicles to estimate spee, ensity, an flow. The following are representative examples. Autoscope [3] etects an tracks vehicles within a etection zone (roughly a rectangle the size of a vehicle) an integrates their spatial an temporal signatures to measure their spees. The ACTIONS system [4], etects an tracks moving obects by estimating optical flow vectors which are then clustere to create caniate moving obects. The MORIO system [5] infers polyheral moels for obects moving relative to a stationary camera. The TITAN system [6] uses mathematical morphology to extract iniviual vehicle features, aggregates them into iniviual vehicles, an tracks them. It is capable of monitoring stretches of the motorway of up to about 1000 feet, epening on the height of the camera. The images of iniviual cars nee to be separate. In Fathy an Siyal [7], a morphological ege etector an backgroun ifferencing are use to ientify an track vehicles an calculate traffic parameters. Coifman et al. [8] evelope a feature-tracking algorithm to extract iniviual vehicle traectories from vieo ata by etecting preefine features from images, grouping them, an tracking the groups of features to prouce traectories. Dailey et al. [9] evelope a metho to estimate mean traffic spee, using an ege-etecting algorithm to fin centrois an estimating mean spee from centroi movement in successive images. However, algorithms that rely on ientifying an tracking iniviual vehicles are not feasible for use with images of poor quality an over a wie area. If the spatial resolution is poor, vehicles in the frame o not show istinctive lines or features throughout the whole span of view an thus can be neither clearly ientifie nor tracke. If a vehicle only occupies a small number of pixels, its features may be har to ientify an furthermore can change as the precise position of the vehicle within the pixel gri changes. Vibration ue to win causes further ifficulties, as o shaows an occlusions in congeste traffic. Grant et al. [10] report on an extensive test of Autoscope on freeways in Atlanta, Georgia, showing that counts egrae in accuracy as the istance of the count location to the camera increase out to a maximum of about 400 ft. Although they i not irectly measure the quality of spee estimation as a function of istance, they conecture that it is similar to that of the volume counts. In contrast, the metho set forth in this paper oes not

2 epen on explicitly ientifying an tracking iniviual vehicles. We emonstrate that it is robust to occlusion an shaows, which can be seen in Figure 1(b), an to the camera motion that is evient in the vieos. We compare the estimates obtaine from the vieo to those from high frequency loop etectors. II. DATA The ata use in this stuy were generate from a 15- minute vieo of about a one mile stretch of highway I-80 in Berkeley, California. A vieo test be, the Berkeley Highway Laboratory, consists of 12 cameras on the roof of Pacific Park Plaza, a 30-story builing besie the highway. The analog cameras have S-VHS vieo recorers attache. Figure 1(a) illustrates the setup an the coverage of each camera. Among six cameras looking north, the fiel of view of camera N6 is furthest own I-80E. It covers the longest stretch (about one mile long), from the Ashby Avenue on-ramp to University Avenue off-ramp. But it prouces relatively poor quality images ue to the poor angle an resolution. Figure 1(b) is a still frame from camera N6. The spatial resolution is such that a pixel in the near fiel of view is about 5 feet, whereas those furthest from the camera are about 15 feet. The images also suffer from occlusions by vehicles an their shaows an from camera motion. Despite the poor quality of the images, the ata from camera N6 is potentially informative, for example for stuying the effect of on-ramp flow on highway performance. Also, it covers the longest stretch, about one mile, an in principle, information extracte from this camera can be combine with that from the higher resolution cameras, which have smaller fiels of view. Algorithms evelope to analyze images from camera N6 shoul be applicable to other conventional traffic cameras. For the analysis, a 15 minute long tape was igitize at the rate of 10 frames per secon an the results save in ppm file format. Each frame, like Figure 1(b), has 800x640 pixels an each pixel has intensities for re, green, an blue channels. III. METHODOLOGY Because of the camera resolution, it woul be at best extremely ifficult to apply a feature etecting an tracking algorithm. Hence, it is necessary to evelop a new way to extract information from the images. We evelope an algorithm for this purpose. The algorithm procees as follows: First, an intensity profile of each lane in the irection of traffic flow is extracte from each frame. Arranging the profiles in time orer gives intensity flow in the time-space omain, in which vehicles appear as stripes, or moving peaks. Secon, the spee estimate at (t, x) in the time-space omain is compute via searching a pair of best matching patterns at time t + τ an t τ in terms of the L 1 norm (sum of absolute values of ifferences) an estimate as the slope of the line connecting the two centers of the pair. For iscussion an references to such correlation-base matching methos, see Beauchemin an Barron [2]. The algorithm has a number of avantages. First, it oes not involve vehicle tracking, which can be computationally very expensive, an hence makes it more efficient to process a large amount of ata. Seconly, in estimating local spee it oes not compute a graient, or a weighte average of spees of moving features aroun the location of interest. It uses the L 1 norm in fining the best matching pattern an hence is robust to noise. Later in this section, we show that uner certain conitions the algorithm is equivalent to fining a weighte meian of the spees of moving peaks. A. Intensity Profiles To generate the intensity profile for a lane, a mask (M) is create on a particular frame, a so-calle reference frame. The mask passes intensities of pixels in a region of interest. A maske image is presente at the top of Figure 2. Once maske, a frame contains intensities of pixels in the region. The pixels have three integers between 0 an 255 for re, green, an blue channels. Because these three intensities are strongly correlate at the pixel level, we take the average of re, green, an blue intensities. Then, we scan across the lane (orthogonal to the irection of traffic) an calculate the maximum average intensity along the irection of traffic, which we refer to as a maximum intensity profile. The maximum intensity profile corresponing to the top image of Figure 2 is presente in the bottom of Figure 2. The mask shoul be create for each frame, because the camera may be constantly shaking ue to strong win. To create masks automatically, we fin mappings (Ψ t ) from the reference frame to every frame uring the time perio an use the new transforme masks (Ψ t (M)). First, we choose four fixe obects (reference obects) on the reference frame an place square winows centere at them. Then, in each frame we search for the best matching patterns corresponing to the square areas centere at the reference obects. Once the patterns are foun, we use the coorinates of the center pixels of the square winows to compute the proection matrix. For more information, refer to chapter 5 of Hartley an Zisserman [11]. We repeat this process for each frame an stack the maximum intensity profiles in time orer to obtain an intensity flow on the time-space omain. The intensity faes as the vehicle moves away from camera, an the roa surface intensity varies epening on the location. To correct for this, at each location of the highway we etermine the maximum an minimum intensity uring the 15 minutes an form the ratio of the ifference between the intensity an minimum to the ifference between maximum an minimum. After this backgroun correction, the intensity is stanarize between 0 an 1. To change units from pixels to feet, we compute the proection matrix from image to the real worl, using the real imension of I-80 (For a etaile computation, also refer to chapter 5 of Hartley an Zisserman [11]). As a final step, we interpolate the intensities on a finer gri, which are equally space by about 5 feet. Two examples are presente in Figure 3.

3 (a) Berkeley Highway Laboratory Layout (b) A frame from Camera N6 Fig. 1. Camera Setup The resulting intensity flow is similar to a traectory plot in the time-space omain in that the stripes, or moving peaks, contain information about the traffic flow on the highway. But it iffers in that one curve oes not necessarily correspon to one vehicle. Rather one vehicle can be shown as two lines, or two vehicles traveling closely together can appear as one moving peak. Small or ark vehicles may be barely perceptible. Fine iscrimination is not neee for subsequent spee estimation. Fig. 2. B. Spee Estimation A filtere image an the corresponing intensity profile The iea behin the estimate is that a locally constant intensity pattern represents travel at a locally constant spee. Hence, after a short perio of time, the same pattern will show up again at the travel istance above the previous location in the time-space omain. To estimate the local spee at (t, x) in the time space omain, we choose two rectangular winows of size w t by w x an center one at (t + τ, x) an the other at (t τ, x). We then move the winow centere at t + τ up (increase x) an the other one at t τ own (ecrease x), computing the L 1 norms for the pair. The norm will be minimize at the travel istance. By the nature of the image, the shifts are integer-value. To eal with this iscretization, we fit the L 1 norms near the minimizer to a quaratic function to fin the interpolate istance which minimizes the norm. The spee is estimate as the ratio of the istance to the shifting parameter, τ, which is equivalent to the slope between the two centers of the pair of the best matching patterns. In the examples presente here, we use the L 1 norm criteria an set the winow size to 30 secons by 90 feet, τ as 3 secon, an the searching area as 0 to 80 MPH. The step by step outline of the algorithm is as follows. Let I(t, x) enote the intensity at location (t, x) in the timespace omain. 1) Fix the local winow size, w t w x, an the shift parameter τ, 2) For = 0,..., m, compute D() = t 0+w t x 0 +w x I(t+τ, x+) I(t τ, x ). x=x 0 w x t=t 0 w t 3) Fit D() near the minimum to a quaratic function of. 4) Fin 0, which minimizes D. 5) The spee is estimate as 0 /τ. Note that the algorithm oes not involve graient computation or slopes for iniviual lines on the intensity flow. After running the algorithm, we run a 2-imensional meian filter to remove noise, of size 40 secon by 370 feet. Also note that it simultaneously shifts two square winows (centere shifting), instea of fixing one winow centere at (t, x) an shifting the other winow at either t + τ (forwar shifting) or t τ (backwar shifting) in time. As can be seen

4 from a Taylor series expansion, erivatives are estimate more accurately by central ifferences than by un-centere ones. The erivative of a quaratic function is estimate exactly by central ifferencing, but not by one-sie ifferencing. Because the algorithm involves computing the sums of absolute ifference over 2 square winows, it can be quite slow. To spee up, we use a subgri within the square winow instea of using all the intensities. Base on the empirical comparisons, we fin even a coarse gri of resolution one secon by about 10 feet (using 5% of ata points) is sufficient to prouce an estimate equally goo as using all the ata. Also, we nee not evaluate the estimate at every location. Instea, we estimate the spee on a sparse gri an then interpolate. To gain some insight into the nature of the estimate prouce by the algorithm we now consier an iealize continuous version. Suppose features, A (t, x), have isoint supports I, are parabolic on I (3r an higher orer erivatives are zeros), an travel at the spee of v. The features correspon to the contributions of iniviual vehicles to the intensity profile, which we write as f(t, x) = A (t, x) = A (x v t). Now consier the minimizer of 1 2τ t 0 +w t x 0 +w x f(t + τ, x + ) f(t τ, x ) xt. t=t 0 w t x=x 0 w x For small an τ 1 ˆv f(t + τ, x + ) 2τ t x f(t τ, x ) xt 1 A (t + τ, x + ) 2τ t x A (t τ, x ) xt 1 2( v τ)a 2τ (x v t) xt t x τ v t S S τ v x A (x v t) xt where S = t 0 +w t x0 +w x t 0 w t x 0 w x A (x v t) xt an S = S. The minimizer of the final expression above is a weighte meian of the iniviual velocities v in which the weights are S /S. That is, it is the meian of a iscrete probability istribution which has masses S /S on the values v. Vehicles with large erivatives of their iniviual intensity profiles thus contribute most heavily to the estimate. The meian, however, is insensitive to extreme velocities. By contrast, if we were to use the sum of square eviations rather than the sum of absolute eviations, the argument above shows that the estimate woul be a weighte mean, an less robust to extreme v. This argument formalizes the notion that the shifting an matching algorithm estimates a weighte meian velocity over a region of space an time. IV. RESULTS Two intensity flows uring 15 minutes from 3:00pm on 17th of December 2001 to 3:15pm on the same ay are presente in Figure 3. We picke two lanes; the right-most (5th) lane of I-80E an the 3r lane of I-80W. We chose the two lanes for the following reasons. The 5th lane merges with the Ashby onramp at the near fiel of the frame (at aroun 500 feet) an the inflow creates congestion. The 3r lane of I-80W experience the worst stop-an-go traffic an ha more trucks than any other lanes uring the 15 minutes. During the 15 minutes, the east boun traffic experience moerate congestion, shown in the intensity flow as changes in slopes of lines. Examining the figure carefully, one can see some lines isappear an appear, cause by lane-changing an occlusions from the shaows of vehicles traveling in the next lane. The west boun lanes experience very heavy traffic. Also recall that in the 3r lane there were the most trucks. In the intensity flow, trucks appear as broa stripes. In the intensity flow, we observe flat patterns lining up, which shows shockwaves propagating against the traffic. The lane also experience the most frequent occlusion from vehicles an their shaows, ue to the stop an go traffic in the next lane. In this lane, there are marks on the roa to signify the off-ramp an they create horizontal stripes aroun 30, 60, 460 pixels even after backgroun correction. However, the spee estimate is robust to these artifacts. From the spee estimate of I-80E, we observe congestion ue to the inflow from the Ashby on-ramp an corresponing shockwaves. We suspect that a traffic signal on Ashby Avenue cause perioic fluctuations in inflow an hence the pulsating series of shockwaves. Also note a pronounce shockwave originating at aroun 360 secon an 0.5 mile from the University exit an travelling against the traffic at about 10 MPH. The I-80W spee estimate shows even stronger oscillations shockwave evolution, an some variation in their velocities of propagation. The figure shows that the shockwaves typically travel at about 10 MPH. Because we o not observe where they originate an issipate, we cannot verify how long the shockwaves travele before issipating, base solely on camera # 6. For now, we conecture that the shockwaves were create further ownstream on I-80W, about 1.3 miles south of the Ashby off-ramp, at the notorious split of I-80W into I-580S, I-880, an I-80W. Further investigation using tapes from cameras # 1-5 woul reveal more information. To check our estimates, we compare them to loop etector ata. Loop etectors are locate at stations 3, 4, an 5 in the orer of istance from the University exit; refer to Figure 1(a). Unfortunately, the stretch ha been pave recently an we coul not locate precisely where the loops were. So, we approximate the loop locations by those of the cabinets an pull-boxes of the loop counter stations, which are locate at the sie of the wall of I-80E. In Figure 5, the ots are the point

5 estimates(vehicle by vehicle) from the loop ata. The spee estimates corresponing to the cabinet(pull-box) locations are shown as the soli lines. TABLE I MEANS AND STANDARD DEVIATIONS (MPH) East boun West boun Station (2.1) -2.0 (3.8) Station (1.6) 0.0 (1.8) Station (1.8) 1.6 (3.1) The figures show that the estimates are very close to the loop ata uring the 15 minutes an pick up most of the oscillations. There are some systematic ifferences, which may be attributable to the imprecision of loop etector locations. Note that the spee ranges an traffic conitions for the west an east boun lanes are very ifferent, yet the estimates are very consistent in both cases. The means an stanar eviations of the errors between the estimates an the loop ata are reporte in Table I. V. CONCLUSIONS AND DISCUSSION The results above emonstrate the potential of our algorithm for processing a vieo recoring from a traffic camera, proviing a useful tool to stuy numerous traffic issues, such as the effect of an on-ramp, the evolution an issipation of queuing an congestion, an for monitoring highway performance. Despite its poor quality image, camera N6 provies very useful information in these regars. For some purposes, simple functionals of the estimate velocity fiel may be sufficient. For example, travel times can be estimate by tracing through the fiel, or the average velocity over space at a given time can be compute. Although the results we have shown are quite reasonable, we will stuy several issues in more etail in the future. One is the choice of the region on which to base shifting an matching. In principle, the rectangle coul be as small as one pixel in time an several pixels in space, or vice-versa. The computing time is faster for smaller rectangles, but the results are noisier (a efect which can be ameliorate, however, by smoothing the estimates). Smaller rectangles yiel a finer resolution in space an time, but again at the cost of noise. Larger rectangles localize less an are computationally more expensive, but prouce less noisy estimates. In principle, the regions nee not be rectangular an weight functions, such as Gaussian kernels, can be use instea of uniform weighting. Initial experimentation inicates that the final results are quite insensitive to these choices, but further stuy is necessary to optimize the algorithm for spee an accuracy. In aition to further improving spee estimation, we are eveloping algorithms to extract the other macroscopic parameters, flow an ensity, from the intensity profiles. This is more ifficult than velocity estimation. Counting is more feasible in the near fiel of view, an the results can be propagate through the estimate velocity fiel to obtain estimates of ensity an flow in the far fiel of view. We will also investigate the still more challenging problem of etecting lane changing. Finally we mention that we have use our metho on MPEG an AVI compresse vieo, with little egraation of the results. This may be useful if ata are to be transmitte prior to analysis. ACKNOWLEDGEMENTS This research was supporte by Partners in Avance Highways an Transportation an by a grant from the National Science Founation. We wish to thank Dan Lyy for assistance with the ata, Ryan Lovett an Phil Spector for assistance with computation an Peter Bickel, Z Kim, Jaimyoung Kwon, an Erik van Zwet for helpful iscussions. REFERENCES [1] V. Kastrinaki, M. Zervakis, an K. Kalaitzakis, A survey of vieo processing techniques for traffic applications, Image an Vision Computing 21, pp , [2] S. Beauchemin an J. Barron, The computation of optical flow, ACM Computing Surveys, vol. 27, no. 3, pp , Nov [3] P. Michalopoulos, Vehicle etection vieo through image processing: the autoscope system, IEEE Trans. Veh. Technol., vol. 40, pp [4] W. Enkelmann, Interpretation of traffic scenes by evaluation of optical flow fiels from image sequences, IFAC Control, Computers, Communications in Transportation, [5] L. Dreschler an H.-H. Nagel, Volumetric moel an 3-traectory of a moving car erive from monocular tv-frame sequences of a street scene, Computer Vision, Graphics, an Image Processing, vol. 20, pp , [6] J. Blosserville, C. Krafft, F. Lenoir, V. Motvka, an S. T. Beucher, New traffic measurements by image processing, IFAC Control, Computers, Communications in Transportation, pp , [7] M. Fathy an M. Siyal, An image etection technique base on morphological ege etection an backgroun ifferencing for real-time traffic analysis, Pattern Recognition Letters, vol. 16, pp , [8] B. Coifman, D. Beymer, P. Mclauchlan, an J. Malik, A real-time computer vision system for vehicle tracking an traffic surveillance, Transportation Research, Part C, vol. 6C(4), pp , Aug [9] D. Dailey, F. Cathey, an S. Pumrin, An algorithm to estimate mean traffic spee using uncalibrate cameras, IEEE Trans. Intell. Transport. Syst., vol. 1, no. 2, pp , June [10] C. Grant, B. Gillis, an R. Guensler, Collection of vehicle activity ata by vieo etection for use in transportation planning, ITS Journal 5, pp , [11] R. Hartley an A. Zisserman, Multiple View Geometry in Computer Vision. Cambrige, UK: Cambrige University Press, 2000.

6 (a) I-80 East Boun (b) I-80 West Boun Fig. 3. Intensity flows (a) I-80 East Boun (b) I-80 West Boun Fig. 4. Estimate velocity fiels

7 (a) I-80 East Boun Fig. 5. Comparsion between the estimate an the loop ata (b) I-80 West Boun

ESTIMATING VELOCITY FIELDS ON A FREEWAY FROM LOW RESOLUTION VIDEO

ESTIMATING VELOCITY FIELDS ON A FREEWAY FROM LOW RESOLUTION VIDEO ESTIMATING VELOCITY FIELDS ON A FREEWAY FROM LOW RESOLUTION VIDEO Young Cho Department of Statistics University of California, Berkeley Berkeley, CA 94720-3860 Tel: (510) 642-7624 Fax: (510) 642-7892 young@stat.berkeley.edu

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

An Investigation in the Use of Vehicle Reidentification for Deriving Travel Time and Travel Time Distributions

An Investigation in the Use of Vehicle Reidentification for Deriving Travel Time and Travel Time Distributions An Investigation in the Use of Vehicle Reientification for Deriving Travel Time an Travel Time Distributions Carlos Sun Department of Civil an Environmental Engineering, University of Missouri-Columbia,

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

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

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

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

SMART IMAGE PROCESSING OF FLOW VISUALIZATION

SMART IMAGE PROCESSING OF FLOW VISUALIZATION SMAR IMAGE PROCESSING OF FLOW VISUALIZAION H Li (A Rinoshika) 1, M akei, M Nakano 1, Y Saito 3 an K Horii 4 1 Department of Mechanical Systems Engineering, Yamagata University, Yamagata 99-851, JAPAN Department

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

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

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

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

A multiple wavelength unwrapping algorithm for digital fringe profilometry based on spatial shift estimation

A multiple wavelength unwrapping algorithm for digital fringe profilometry based on spatial shift estimation University of Wollongong Research Online Faculty of Engineering an Information Sciences - Papers: Part A Faculty of Engineering an Information Sciences 214 A multiple wavelength unwrapping algorithm for

More information

Analytical approximation of transient joint queue-length distributions of a finite capacity queueing network

Analytical approximation of transient joint queue-length distributions of a finite capacity queueing network Analytical approximation of transient joint queue-length istributions of a finite capacity queueing network Gunnar Flötterö Carolina Osorio March 29, 2013 Problem statements This work contributes to the

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

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

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

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

Exercises of PIV. incomplete draft, version 0.0. October 2009

Exercises of PIV. incomplete draft, version 0.0. October 2009 Exercises of PIV incomplete raft, version 0.0 October 2009 1 Images Images are signals efine in 2D or 3D omains. They can be vector value (e.g., color images), real (monocromatic images), complex or binary

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

Comparison of Methods for Increasing the Performance of a DUA Computation

Comparison of Methods for Increasing the Performance of a DUA Computation Comparison of Methos for Increasing the Performance of a DUA Computation Michael Behrisch, Daniel Krajzewicz, Peter Wagner an Yun-Pang Wang Institute of Transportation Systems, German Aerospace Center,

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

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

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

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

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

Multimodal Stereo Image Registration for Pedestrian Detection

Multimodal Stereo Image Registration for Pedestrian Detection Multimoal Stereo Image Registration for Peestrian Detection Stephen Krotosky an Mohan Trivei Abstract This paper presents an approach for the registration of multimoal imagery for peestrian etection when

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

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed. Preface Here are my online notes for my Calculus I course that I teach here at Lamar University. Despite the fact that these are my class notes, they shoul be accessible to anyone wanting to learn Calculus

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

A Neural Network Model Based on Graph Matching and Annealing :Application to Hand-Written Digits Recognition

A Neural Network Model Based on Graph Matching and Annealing :Application to Hand-Written Digits Recognition ITERATIOAL JOURAL OF MATHEMATICS AD COMPUTERS I SIMULATIO A eural etwork Moel Base on Graph Matching an Annealing :Application to Han-Written Digits Recognition Kyunghee Lee Abstract We present a neural

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

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

Bayesian localization microscopy reveals nanoscale podosome dynamics

Bayesian localization microscopy reveals nanoscale podosome dynamics Nature Methos Bayesian localization microscopy reveals nanoscale poosome ynamics Susan Cox, Ewar Rosten, James Monypenny, Tijana Jovanovic-Talisman, Dylan T Burnette, Jennifer Lippincott-Schwartz, Gareth

More information

Non-homogeneous Generalization in Privacy Preserving Data Publishing

Non-homogeneous Generalization in Privacy Preserving Data Publishing Non-homogeneous Generalization in Privacy Preserving Data Publishing W. K. Wong, Nios Mamoulis an Davi W. Cheung Department of Computer Science, The University of Hong Kong Pofulam Roa, Hong Kong {wwong2,nios,cheung}@cs.hu.h

More information

Real Time On Board Stereo Camera Pose through Image Registration*

Real Time On Board Stereo Camera Pose through Image Registration* 28 IEEE Intelligent Vehicles Symposium Einhoven University of Technology Einhoven, The Netherlans, June 4-6, 28 Real Time On Boar Stereo Camera Pose through Image Registration* Fai Dornaika French National

More information

A Duality Based Approach for Realtime TV-L 1 Optical Flow

A Duality Based Approach for Realtime TV-L 1 Optical Flow A Duality Base Approach for Realtime TV-L 1 Optical Flow C. Zach 1, T. Pock 2, an H. Bischof 2 1 VRVis Research Center 2 Institute for Computer Graphics an Vision, TU Graz Abstract. Variational methos

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

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

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

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

Using Ray Tracing for Site-Specific Indoor Radio Signal Strength Analysis 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

More information

Comparative Study of Projection/Back-projection Schemes in Cryo-EM Tomography

Comparative Study of Projection/Back-projection Schemes in Cryo-EM Tomography Comparative Stuy of Projection/Back-projection Schemes in Cryo-EM Tomography Yu Liu an Jong Chul Ye Department of BioSystems Korea Avance Institute of Science an Technology, Daejeon, Korea ABSTRACT In

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

A Convex Clustering-based Regularizer for Image Segmentation

A Convex Clustering-based Regularizer for Image Segmentation Vision, Moeling, an Visualization (2015) D. Bommes, T. Ritschel an T. Schultz (Es.) A Convex Clustering-base Regularizer for Image Segmentation Benjamin Hell (TU Braunschweig), Marcus Magnor (TU Braunschweig)

More information

Preamble. Singly linked lists. Collaboration policy and academic integrity. Getting help

Preamble. Singly linked lists. Collaboration policy and academic integrity. Getting help CS2110 Spring 2016 Assignment A. Linke Lists Due on the CMS by: See the CMS 1 Preamble Linke Lists This assignment begins our iscussions of structures. In this assignment, you will implement a structure

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

Handling missing values in kernel methods with application to microbiology data

Handling missing values in kernel methods with application to microbiology data an Machine Learning. Bruges (Belgium), 24-26 April 2013, i6oc.com publ., ISBN 978-2-87419-081-0. Available from http://www.i6oc.com/en/livre/?gcoi=28001100131010. Hanling missing values in kernel methos

More information

Multi-camera tracking algorithm study based on information fusion

Multi-camera tracking algorithm study based on information fusion International Conference on Avance Electronic Science an Technolog (AEST 016) Multi-camera tracking algorithm stu base on information fusion a Guoqiang Wang, Shangfu Li an Xue Wen School of Electronic

More information

Feature Extraction and Rule Classification Algorithm of Digital Mammography based on Rough Set Theory

Feature Extraction and Rule Classification Algorithm of Digital Mammography based on Rough Set Theory Feature Extraction an Rule Classification Algorithm of Digital Mammography base on Rough Set Theory Aboul Ella Hassanien Jafar M. H. Ali. Kuwait University, Faculty of Aministrative Science, Quantitative

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

Rough Set Approach for Classification of Breast Cancer Mammogram Images

Rough Set Approach for Classification of Breast Cancer Mammogram Images Rough Set Approach for Classification of Breast Cancer Mammogram Images Aboul Ella Hassanien Jafar M. H. Ali. Kuwait University, Faculty of Aministrative Science, Quantitative Methos an Information Systems

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

EFFICIENT STEREO MATCHING BASED ON A NEW CONFIDENCE METRIC. Won-Hee Lee, Yumi Kim, and Jong Beom Ra

EFFICIENT STEREO MATCHING BASED ON A NEW CONFIDENCE METRIC. Won-Hee Lee, Yumi Kim, and Jong Beom Ra th European Signal Processing Conference (EUSIPCO ) Bucharest, omania, August 7-3, EFFICIENT STEEO MATCHING BASED ON A NEW CONFIDENCE METIC Won-Hee Lee, Yumi Kim, an Jong Beom a Department of Electrical

More information

A Discrete Search Method for Multi-modal Non-Rigid Image Registration

A Discrete Search Method for Multi-modal Non-Rigid Image Registration A Discrete Search Metho for Multi-moal on-rigi Image Registration Alexaner Shekhovtsov Juan D. García-Arteaga Tomáš Werner Center for Machine Perception, Dept. of Cybernetics Faculty of Electrical Engineering,

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

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

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

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

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

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

A Comparative Evaluation of Iris and Ocular Recognition Methods on Challenging Ocular Images

A Comparative Evaluation of Iris and Ocular Recognition Methods on Challenging Ocular Images A Comparative Evaluation of Iris an Ocular Recognition Methos on Challenging Ocular Images Vishnu Naresh Boeti Carnegie Mellon University Pittsburgh, PA 523 naresh@cmu.eu Jonathon M Smereka Carnegie Mellon

More information

Cluster Center Initialization Method for K-means Algorithm Over Data Sets with Two Clusters

Cluster Center Initialization Method for K-means Algorithm Over Data Sets with Two Clusters Available online at www.scienceirect.com Proceia Engineering 4 (011 ) 34 38 011 International Conference on Avances in Engineering Cluster Center Initialization Metho for K-means Algorithm Over Data Sets

More information

1/5/2014. Bedrich Benes Purdue University Dec 12 th 2013 INRIA Imagine. Modeling is an open problem in CG

1/5/2014. Bedrich Benes Purdue University Dec 12 th 2013 INRIA Imagine. Modeling is an open problem in CG Berich Benes Purue University Dec 12 th 213 INRIA Imagine Inverse Proceural Moeling (IPM) Motivation IPM Classification Case stuies IPM of volumetric builings IPM of stochastic trees Urban reparameterization

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

0607 CAMBRIDGE INTERNATIONAL MATHEMATICS

0607 CAMBRIDGE INTERNATIONAL MATHEMATICS CAMBRIDGE INTERNATIONAL EXAMINATIONS International General Certificate of Seconary Eucation MARK SCHEME for the May/June 03 series 0607 CAMBRIDGE INTERNATIONAL MATHEMATICS 0607/4 Paper 4 (Extene), maximum

More information

A Framework for Dialogue Detection in Movies

A Framework for Dialogue Detection in Movies A Framework for Dialogue Detection in Movies Margarita Kotti, Constantine Kotropoulos, Bartosz Ziólko, Ioannis Pitas, an Vassiliki Moschou Department of Informatics, Aristotle University of Thessaloniki

More information

1/5/2014. Bedrich Benes Purdue University Dec 6 th 2013 Prague. Modeling is an open problem in CG

1/5/2014. Bedrich Benes Purdue University Dec 6 th 2013 Prague. Modeling is an open problem in CG Berich Benes Purue University Dec 6 th 213 Prague Inverse Proceural Moeling (IPM) Motivation IPM Classification Case stuies IPM of volumetric builings IPM of stochastic trees Urban reparameterization IPM

More information

0607 CAMBRIDGE INTERNATIONAL MATHEMATICS

0607 CAMBRIDGE INTERNATIONAL MATHEMATICS PAPA CAMBRIDGE CAMBRIDGE INTERNATIONAL EXAMINATIONS International General Certificate of Seconary Eucation MARK SCHEME for the May/June 0 series CAMBRIDGE INTERNATIONAL MATHEMATICS /4 4 (Extene), maximum

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

Implicit and Explicit Functions

Implicit and Explicit Functions 60_005.q //0 :5 PM Page SECTION.5 Implicit Differentiation Section.5 EXPLORATION Graphing an Implicit Equation How coul ou use a graphing utilit to sketch the graph of the equation? Here are two possible

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

Research Article Research on Law s Mask Texture Analysis System Reliability

Research Article Research on Law s Mask Texture Analysis System Reliability Research Journal of Applie Sciences, Engineering an Technology 7(19): 4002-4007, 2014 DOI:10.19026/rjaset.7.761 ISSN: 2040-7459; e-issn: 2040-7467 2014 Maxwell Scientific Publication Corp. Submitte: November

More information

New Geometric Interpretation and Analytic Solution for Quadrilateral Reconstruction

New Geometric Interpretation and Analytic Solution for Quadrilateral Reconstruction New Geometric Interpretation an Analytic Solution for uarilateral Reconstruction Joo-Haeng Lee Convergence Technology Research Lab ETRI Daejeon, 305 777, KOREA Abstract A new geometric framework, calle

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

Computer Organization

Computer Organization Computer Organization Douglas Comer Computer Science Department Purue University 250 N. University Street West Lafayette, IN 47907-2066 http://www.cs.purue.eu/people/comer Copyright 2006. All rights reserve.

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

Solution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation

Solution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation Solution Representation for Job Shop Scheuling Problems in Ant Colony Optimisation James Montgomery, Carole Faya 2, an Sana Petrovic 2 Faculty of Information & Communication Technologies, Swinburne University

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

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

Dual Arm Robot Research Report

Dual Arm Robot Research Report Dual Arm Robot Research Report Analytical Inverse Kinematics Solution for Moularize Dual-Arm Robot With offset at shouler an wrist Motivation an Abstract Generally, an inustrial manipulator such as PUMA

More information

P. Fua and Y. G. Leclerc. SRI International. 333 Ravenswood Avenue, Menlo Park, CA

P. Fua and Y. G. Leclerc. SRI International. 333 Ravenswood Avenue, Menlo Park, CA Moel Driven Ege Detection P. Fua an Y. G. Leclerc SI International 333 avenswoo Avenue, Menlo Park, CA 9425 (fua@ai.sri.com leclerc@ai.sri.com) Machine Vision an Applications, 3, 199 Abstract Stanar ege

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

EXTRACTION OF MAIN AND SECONDARY ROADS IN VHR IMAGES USING A HIGHER-ORDER PHASE FIELD MODEL

EXTRACTION OF MAIN AND SECONDARY ROADS IN VHR IMAGES USING A HIGHER-ORDER PHASE FIELD MODEL EXTRACTION OF MAIN AND SECONDARY ROADS IN VHR IMAGES USING A HIGHER-ORDER PHASE FIELD MODEL Ting Peng a,b, Ian H. Jermyn b, Véronique Prinet a, Josiane Zerubia b a LIAMA & PR, Institute of Automation,

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

WATER MIST SPRAY MODELLING WITH FDS

WATER MIST SPRAY MODELLING WITH FDS PROCEEDINGS, Fire an Evacuation Moeling Technical Conference 0 Baltimore, Marylan, August 5-6, 0 WATER MIST SPRAY MODELLING WITH FDS Simo Hostikka, Jukka Vaari, Topi Sikanen, Antti Paajanen VTT Technical

More information

Data Mining: Clustering

Data Mining: Clustering Bi-Clustering COMP 790-90 Seminar Spring 011 Data Mining: Clustering k t 1 K-means clustering minimizes Where ist ( x, c i t i c t ) ist ( x m j 1 ( x ij i, c c t ) tj ) Clustering by Pattern Similarity

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

Learning Subproblem Complexities in Distributed Branch and Bound

Learning Subproblem Complexities in Distributed Branch and Bound Learning Subproblem Complexities in Distribute Branch an Boun Lars Otten Department of Computer Science University of California, Irvine lotten@ics.uci.eu Rina Dechter Department of Computer Science University

More information

Threshold Based Data Aggregation Algorithm To Detect Rainfall Induced Landslides

Threshold Based Data Aggregation Algorithm To Detect Rainfall Induced Landslides Threshol Base Data Aggregation Algorithm To Detect Rainfall Inuce Lanslies Maneesha V. Ramesh P. V. Ushakumari Department of Computer Science Department of Mathematics Amrita School of Engineering Amrita

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

Inuence of Cross-Interferences on Blocked Loops: to know the precise gain brought by blocking. It is even dicult to determine for which problem

Inuence of Cross-Interferences on Blocked Loops: to know the precise gain brought by blocking. It is even dicult to determine for which problem Inuence of Cross-Interferences on Blocke Loops A Case Stuy with Matrix-Vector Multiply CHRISTINE FRICKER INRIA, France an OLIVIER TEMAM an WILLIAM JALBY University of Versailles, France State-of-the art

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

Image compression predicated on recurrent iterated function systems

Image compression predicated on recurrent iterated function systems 2n International Conference on Mathematics & Statistics 16-19 June, 2008, Athens, Greece Image compression preicate on recurrent iterate function systems Chol-Hui Yun *, Metzler W. a an Barski M. a * Faculty

More information

A shortest path algorithm in multimodal networks: a case study with time varying costs

A shortest path algorithm in multimodal networks: a case study with time varying costs A shortest path algorithm in multimoal networks: a case stuy with time varying costs Daniela Ambrosino*, Anna Sciomachen* * Department of Economics an Quantitative Methos (DIEM), University of Genoa Via

More information

THE APPLICATION OF ARTICLE k-th SHORTEST TIME PATH ALGORITHM

THE APPLICATION OF ARTICLE k-th SHORTEST TIME PATH ALGORITHM International Journal of Physics an Mathematical Sciences ISSN: 2277-2111 (Online) 2016 Vol. 6 (1) January-March, pp. 24-6/Mao an Shi. THE APPLICATION OF ARTICLE k-th SHORTEST TIME PATH ALGORITHM Hua Mao

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

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

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

Design of Controller for Crawling to Sitting Behavior of Infants

Design of Controller for Crawling to Sitting Behavior of Infants Design of Controller for Crawling to Sitting Behavior of Infants A Report submitte for the Semester Project To be accepte on: 29 June 2007 by Neha Priyaarshini Garg Supervisors: Luovic Righetti Prof. Auke

More information

Particle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem

Particle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 17, No 3 Sofia 017 Print ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.1515/cait-017-0030 Particle Swarm Optimization Base

More information