OPERATING INSTRUCTIONS FOR. COPA (Computer Aided Photoelastic Analysis) PROGRAMME: VERSION 3. Philip Siegmann & Eann Patterson

Size: px
Start display at page:

Download "OPERATING INSTRUCTIONS FOR. COPA (Computer Aided Photoelastic Analysis) PROGRAMME: VERSION 3. Philip Siegmann & Eann Patterson"

Transcription

1 OPERATNG NSTRUCTONS FOR COPA (Computer Aie Photoelasti Analysis) PROGRAMME: VERSON 3 Philip Siegmann & Eann Patterson ntroution This oument aompanies a new piee of software initially proue in the Experimental Stress Analysis Laboratory in the Department of mehanial Engineering at the University of Sheffiel. COPA version 3 is written in matlab p-files an uses an improve unwrapping algorithm with respet to previous versions. t is base on an algorithms whih are esribe in [Siegmann P., Bekman D. an Patterson E.A. A robust approah to emoulate an unwrapping phase-steppe photoelasti ata, Exp. Meh. 45(3), pp , 005] an are exeute in MatLab. The objetive is to proess phase-steppe photoelasti images aquire in either a transmission or refletion polarisope. The input for the software is.six files generate by the Cathsix software also proue by the Experimental Stress Analysis Laboratory. Data output is in several forms as esribe below inluing a new file suffixe pa. A paper esribing the algorithms an proviing examples an valiation is in preparation for submission for publiation in the open literature. For more information ontat Philip Siegmann (philip.siegmann@uah.es). nstallation The urrent COPA program is written in Matlab, therefore you nee to have the Matlab program installe in your omputer. Copy the COPA iretory into any iretory of your hoie in your omputer. Open Matlab an selet as Current Diretory: the COPA iretory, or set a path to it (press File, Set path, ). Write COPA in the Matlab omman line an press enter. Operation The COPA winow will isplay a front page an then move the main winow. To proess photoelasti images, start from the top left an work leftwars an own using at least one button in eah ark grey zone. The results of eah operation will be shown in the figure spae 1

2 in the bottom left of the winow an a re aption below the figure will give an instrution on what to o next. Data Aquisition Data shoul be aquire using the Cathsix program to apture six phase-steppe images an pakage them in a.six file. Use the Open button to ientify the appropriate.six file. Note that other file formats an be rea, please onsult the authors for more information. After seleting the file to be opene the six images will be isplaye in a new winow labelle as shown in table 1 in the Appenix using pseuo-olour to represent intensity. This winow is remove automatially after a few seons, an the wrappe isolini map orresponing to equation (1) in the Appenix is isplaye in the main winow. Saving ata One a file has been opene the ata isplaye in the figure in the main winow an be save using the Save button after seleting the appropriate file format using the rop-own menu to the left of the button. f no seletion is mae the efault file type is txt. Bakgroun Removal / Applying a Mask The ark grey box in the top right orner of the main winow offers two hoies: importing a mask or reating a new one. A mask that has been reate by Cathsix an be importe by opening a.bng file via the mport mask button. The mask is applie automatially an the bakgroun in the image will be remove in the figure isplaye in the winow. The ata save as.pa save the six phase shifte image an the reate mask in Crate Mask option. By open a.pa file also the orresponing mask is loae automatially. (The pa file, like.six, is an aapte.bmp file, but with aitional mask inlue). Alternatively, a new mask an be reate by using the Create Mask button. A new winow will appear with the image orresponing to a ark fiel irular polarisope on the left an a series of buttons of on the right. You an hoose to efine a mask using a irle, a polygon or any ombination of these shapes. Selet the require shape an follow the on-sreen instrutions. t is possible to ut out an enlarge an area of the image using the Cut out button to efine the area of interest. One a shape has been efine you must iniate whether the area to be maske is insie or outsie the shape using the buttons: Mask insie or Mask outsie respetively. Press Finishe Mask to return to the main winow. t is possible to use the funtions repeate to buil a omplex shape for the mask. f a mistake has been one by

3 reating mask you an either lik the right mouse button uring the input of points, or lose the reate mask winow without pressing Finishe Mask. solini Demoulation This funtion is not essential but is reommene when the isohromati fringe range is greater than half a fringe, beause the half orer fringes will ause errors in the isolini map as a result of moulation. Also 45º isolinis ause errors in the isohromati map via the same moulation. The proess esribe in the Appenix in lines 43 to 14 is applie when the solini emoulation button is use. This proess is almost entirely automati exept the operator being aske to selet the loation from whih to start the unwrapping of the areas esribe starting at line 64 in the Appenix. t is best to hoose the largest area isplaye in the temporary winow beause this will provie the fastest solution. The emoulate isolini map is isplaye in the figure in the main winow when the proess is finishe. t is possible to ajust the winow size, w use in the emoulation proess using the slier bar below the button. However, the efault value is usually satisfatory. More etails about this winow size are given in lines 108 to 118 in the Appenix. The efault is for a Wiener filter to be applie to the isolini ata prior to emoulation as esribe in lines 91 to 99 of the Appenix. This filtering an be omitte by removing the tik from the box beneath the Demoulation button. t shoul be note that regarless of the use or otherwise of this filter, unfiltere isolini ata is always use in the alulation of the relative retaration ata. Relative retaration/sohromati Phase Map On seleting the sohromati Phase Map button the wrappe relative retaration is alulate using equation (4) in the Appenix an isplaye in the figure. The efault alulation is to use the emoulate isolini map, but the raw isolini ata an be employe instea by removing the tik in the box beneath the sohromati Phase Map button. sohromati Fringe Orer The relative retaration or isohromati phase map (same ata but alternative names) is perioi or wrappe an must be unwrappe to generate a ontinuous map of fringe orer. This proess is performe when the Unwrap isohromati button is presse an is esribe in lines 15 to 137. The proess an be performe ompletely automatially with the see point being selete as the pixel having the highest quality. To selet the see point manually 3

4 tik the box uner the Unwrap isohromati button an a temporary winow will appear. n this winow the quality map is isplaye in grey sale for eah pixel, arker pixels have less quality value. The unwrappe (ontinuous) map of isohromati fringe orer is isplaye in the figure in the main winow at the en the proess. The unwrapping proess automatially sets the lowest fringe orer in the map to zero so that no alibration maybe neee, otherwise see below. There is some ambiguity in the efinition of isolini angle an hene in the solution for the isohromati fringe orer, suh that the resultant map maybe inverte as explaine in line 140 to 144 of the Appenix simply press the nvert button to reverse the istribution. Selet 5 bins Unwrapping for a faster unwrapping, for more preise but slower unwrapping selet 10 or 100 bins Unwrapping. The respetive quality maps an be seen when the option of Selet nitial Pixel is ativate. For noisier ata, more bins shoul be onsiere for the unwrapping. Calibration The unwrappe isohromati map may require alibration if there is no zero orer fringe present. Enter the value of the fringe orer you inten to use for alibration in the box in the ark grey zone in the bottom right orner of the main winow. The use of half orer or integer fringes is reommene. Then, press the Calibration in N button an a temporary winow will appear with a isplay of ¼ orer ontours. Selet a point on an appropriate ontour with the mouse an right lik. The proess an be performe as many times as neessary. Subsequently a map of maximum shear stress or strain (or ifferene in prinipal values) an be generate by performing a further alibration. Again enter the value of the stress or strain metri in the same box, but also type in the appropriate units in the box below, then press the Calib. Stress/strain button an selet the point at whih the stress or strain is known. This might the same or a ifferent point to the one use for the fringe orer alibration. Data Display The figure (inluing the olour bar) an be save using the Save urrent figure as.eps,.tif,.jpg button. The ata in the urrent figure an be save using Save urrent figure as.txt (asii file), the ata will be save in matrix format (same size as the figure) an in the hea line of the 4

5 reate asii file are given the units. The button Save *.pa file o not save the proesse image, only the six phase shifte images an the mask. Profiles aross the ata isplaye in the figure an be obtaine by pressing the Profile button an then left liking on a start point in the map followe by a left lik of the en point of the esire profile followe by pressing the Enter key. A temporary winow is isplaye with the plot of the ata as a funtion of pixel loation along the profile. After ata proessing the map isplaye in the figure an be selete using the rop-own menu marke Show below the Profile button. Similarly, the units of the ata an be hange using the ajaent rop-own menu marke Units. The olour sheme for the figure an be selete using the rop-own menu marke Color Map. 5

6 Appenix: Desription of the algorithm Nomenlature Α(i) Α(i+1) h nitial area for proessing Next area for proessing Threshol height use in spike removal proess applie to partial erivative ata i 1...i 6 ntensity measure in polarisope orientate as shown in Table 1 i m i v Ι = i 4 i 6 Ι = i 1 i Ι s = i 5 i 3 n,m N,M Q θ (n,m) w 1 w ψ x (i,j), ψ y (i,j) ψ x m), ψ y m) θ ρ σ 1, σ ntensity term to aount for stray light entering the polarisope ntensity observe in a polarisope when the fast axes of all the elements are aligne Co-orinates of pixel of interest Number of pixels in x, y iretion in ata map Quality value for the pixel loate at (n,m) Winow imension use in evaluating quality map Winow imension use in reuing number of areas to be proesse. Relative retaration Differene in partial erivative of the phase ata with respet to the x, y iretions Mean of the ifferenes in partial erivative of the phase ata with respet to the x, y iretions within the winow solini angle Perentage area left unwrappe Maximum an minimum prinipal stresses 5 10 ntroution The aim is to generate a ontinuous map of isohromati fringe orer that is inepenent of the isolini angle an similarly to proue a moulo π map of isolini angle efining the iretion of one ientifie prinipal stress that is inepenent of the isohromati fringe orer. Possession of the latter enables a relatively straightforwar alulation of the former using the phase-stepping relationships. Ramesh an Ganapathy [1996] ientifie the phase-stepping algorithm given by Patterson an Wang [1991] as the most robust so it is use here as the funamental step to obtain phase ata. Six phase steps are employe in a irular polarisope as provie in Table 1 suh that the isolini angle is obtaine as: 6

7 15 1 s θ = artan (1) where s = i 5 - i 3 an = i 4 - i 6. The relative retaration an be obtaine using many alternative formulae but will always ontain the moulation introue by the ambiguity in the isolini ata. The relative retaration is usually efine as: = artan () osθ 0 5 where = i 1 - i. Patterson an Taroni [003] have reently shown that if the usual artangent operator is replae by an arotangent funtion by inverting expression () then the perio bounaries in the relative retaration are translate from -π/4, π/4, 3π/4 to 0, π/, π This is more onvenient for unwrapping an interpretation of the ata beause the perio bounaries orrespon to half orer an integer fringes whih are reaily observe in a manual polarisope; an beause fewer unwrapping operations may be neessary. To further reue the number of unwrapping operations, a simple logi operation has been employe to effetively exten the range of relative retaration from π/ to π [Sparling et al], using: osθ = π + ot for i 1 > i & i 4 < i 6 (3a) ar 30 osθ = π + arot for i 1 < i (3b) osθ = arot else (3) A further refinement was introue to ensure high moulation over the entire ata fiel an hene to reue noise by merging the ieas given above with the expression given by Quiroga an Gonzalez [1997] to give: 35 osθ + osθ s = π + artan for i 1 > i & i 4 < i 6 (4a) osθ + osθ s = π + artan for i 1 < i (4b) osθ + osθ s = artan else (4) 7

8 Maps of the isolini angle an relative retaration obtaine using expressions (1) an (4) are shown in figures 1a an b. The influene of the isolini angle on the relative retaration map is learly seen at loations where the isolini angle is 45 egrees an similarly the influene of the relative retaration on the map of isolini angle is learly seen at the loations of half orer an integer fringes. n orer to emoulate this ata, the map of isolini angle is examine an the bounaries of the regions assoiate with eah prinipal stress are ientifie using a zero-rossing bounary etetion tehnique. This tehnique is similar to ege etetion methos in image proessing. Briefly, in this tehnique two matries, terme positive an negative are reate that are equal in size to the ata array being onsiere an initially populate with zero values. A raster san of the isolini map is performe pixel by pixel with a two by two winow forme by the pixels to the right, below an iagonal to the right of the pixel being onsiere. The sign of the isolini angle at eah pixel in the winow is examine, if the sign of all the values are the same then no ation is taken an the san moves on the next pixel, otherwise for those pixels in the winow with a negative values of isolini angle the orresponing zero in the negative matrix is hange to one an similarly for the pixels with positive values the orresponing zero in the positive matrix is hange to one. The san ontinues so that when it is omplete the loation of all the zero-rossings is ientifie by unity values in the positive an negative matries. Negative areas are efine as those enlose by a isontinuity represente by a positive or upwar step in the isolini angle whih will our at pixel loations efine by the unity values in positive matrix, similarly positive areas are enlose by a negative or ownwar step in the isolini angle efine in the negative matrix. The zero-rossing bounaries an orresponing areas for the ata in figure 1a are shown in figure 1 with the positive areas outline in white an the negative ones in blak. These areas are subsequently unwrappe ommening from A(i), whih is best assume to be the largest, an employing a quality map, base on the phase erivative variane proeure propose by Pritt [1996]. The quality of a pixel at loation (n,m) was ientifie using Q θ ( ) + ( ψ ( i, j) ψ m) ) 1 = x x w1 i, j w1 xw1 i, j 1 (5) m) ψ ( i, j) ψ m) w xw1 y y 8

9 where ψ x ( i, j) is the ifferene in the partial erivative with respet to x of the isolini angle obtaine from equation (1) for the pixel loate at (i,j) in a winow w 1 xw 1 entre on the pixel (n,m). Prior to applying the ifferene operation, the partial erivative is smoothe in a wrapping operation that involves sanning the partial erivative ata for spikes of height h/ an translating the values in the spike by h, where h is π/ for the isolini ata. ψ x m) is the mean value of the ifferene in the partial erivative over the winow. ψ y ( i, j) an ψ y m) are orresponing parameters in the y iretion. t is worthy of omment the ψ ( i j) x, y, term is effetively a seon orer partial erivative of the phase map.. The bounary of A(i) is searhe for the highest quality pixel an the area on the other sie of the bounary at this point is A(i+1). When a isontinuity exists between areas A(i) an A(i+1) of magnitue between π/4 an 3π/4 then value of the isolini angle for all points within A(i+1) are translate by -π/; similarly when isontinuities between areas A(i) an A(i+1) of magnitue between -π/4 an -3π/4 are ientifie then all the points with A(i+1) are translate by π/. Then, the area A(i+1) is inorporate into A(i) an the pixel with the highest quality value on the new bounary is ientifie an the proess repeate until all the areas have been onsiere. t shoul be note that only the isontinuity aross the bounary at the pixel with the value is Q θmax is onsiere at eah step. The impliations of the above proess is that isontinuities of height π are allowe to remain in the map whih is onsistent with the lassial efinition of the isolini angle [Froht, 1940]; an seonly that zero-rossings ourring beause the isolini is zero value are ignore. Real ata, partiularly from refletion photoelastiity, tens to ontain spekle whih auses an enormous number of small areas to be ientifie by the bounary etetion tehnique an the subsequent analysis of these areas extens the proessing time unaeptably. The proessing time an be reue by an orer of magnitue if the isolini map is filtere prior to applying the bounary etetion tehnique an if the smallest areas are left wrappe. The filtering proess employe was a Wiener filter [Press et al, 199] whih is an aaptive filtering tehnique that employs a small amount of smoothing when large varianes an vie versa. The filter was applie to the s an ata prior to their use in equation (1) to generate the isolini angle. 9

10 The spekle generate by the iffuse nature of the refletive layer in a photoelasti oating an ause many very small areas to be ientifie by the zero-rossing bounary etetion tehnique. However, these small areas were foun to not signifiantly effet the form of the isohromati map of when a quality-guie unwrapping routine was employe although their influene oul be very severe when a raster or floo-fill routine is use. Hene it is possible to leave the smallest areas unproesse an ahieve a signifiant reution in the proessing time for emoulation. Typially, between 5% an 10% of the area in the map of isolini angle is left unproesse. n the program written to implement the new approah the size of the winow (w x w ) for the filter an the perentage (ρ) of area left wrappe were linearly relate as: 10 ρ = w (6) ( w ) max where w max is epenent on the size of the ata array suh that 0MN w = (7) 56 ( ) max where N an M are the number of pixels in the x an y iretion of the ata map an w an be set by the operator to be 0 w ( w ) max < but has a efault value of 0.5(w ) max. The seletion of w allows the algorithm to be ajuste base on experiene to optimise its performane with ata sets from ifferent experimental environments suh as transmission an refletion photoelasti arrangements. Another important feature of the implementation of the above proess is that the filtere isolini ata is only use to generate the zero-rossing bounaries an the unfiltere isolini ata is unwrappe so that any errors introue by the filtering proess are not propagate into the maps of stress iretion an magnitue. For the ata shown in figure 1 the winow size, w was 0 pixels an the emoulation proess results in the isolini map shown in figure 1. The emoulate isolini angle is substitute into expression (4) to obtain a map of the relative retaration whih is also emoulate from the influene of the isolini angle (figure 1e). A quality-guie approah [Pritt, 1996] is use to unwrap the relative retaration using a phase erivative variane quality map [Ghigli & Pritt, 1998] whih is similar to the one use in the emoulation proess esribe above 10

11 exept that the partial erivatives of the relative retaration are employe in equation (5) an the threshol height, h for the spike removal is π. n this ase an unwrapping algorithm prepare for the fringe projetion tehnique [Hereia & Patterson, 003] has been use beause it was reaily available an alreay been optimise for spee of proessing. Proessing times were foun to be similar to those require by the Wang & Patterson [1995] algorithm. At the en of the unwrapping proess the results are translate along the fringe orer axis so that the minimum fringe orer is assigne as zero. f a zero orer fringe is present in the ata fiel, then no alibration of the unwrappe map will be neessary, otherwise the map of isohromati fringe orer an be alibrate by proviing a known fringe orer at any point in the ata fiel. The assoiation with either the maximum or minimum prinipal stress iretion of the see or initial area A(i) in the emoulation proess ontrols whether the isohromati map that results from the unwrapping proess is upright or requires inversion. n the latter ase, the isohromati fringe orer istribution is reflete about its meian value. A typial result is shown in figure 1f. Referenes Froht, M.M., 1940, Photoelastiity, vol.1, John Wiley & Sons n., New York, Ghiglia, D.C., Pritt, M.D., 1998, Two-imensional phase unwrapping; Wiley- ntersiene, New York. Hereia-Ortiz, M., Patterson, E.A., 003, On the inustrial appliations of moiré an fringe projetion tehniques, Strain, 39: Patterson, E.A., an Wang, Z.F., Towars full-fiel automate photoelasti analysis of omplex omponents. Strain, 7: Patterson, E.A., & Taroni, M., 003, High frequeny quantitative photoelastiity applie to jet engine omponents, Pro SEM Ann Conf. Experimental & Applie Mehanis, Charlotte, NC. paper no. 5, also submitte for publiation in Experimental Mehanis. Press, W.H.; Flannery, B.P.; Teukolsky, S.A.; an Vetterling, W.T., 199, Optimal (Wiener) Filtering with the FFT in Numerial Reipes in FORTRAN: The Art of Sientifi Computing, n e. Cambrige, Englan: Cambrige University Press, pp Pritt, M.D., 1996, Phase unwrapping by means of multi-gri tehniques for interferometri SAR. EEE Trans. Geo. & Remote Sensing, 34(3): Quiroga, J.A., an Gonzalez-Cano, A., 1997, Phase measuring algorithm from extration of isohromatis of photoelasti fringe patterns, Appl. Optis 36(3):

12 170 Ramesh, K., an Ganapathy, V., Phsae-shifting methoologies in photoelasti analysis appliation of Jones alulus. J. Strain Analysis 31: Sparling, S., Gagnon, J., Komorowski, J., Photoelasti analysis by 6-image phasestepping with RGB input. NRC nternal report LTR-St-154 4, NRC Ottawa Wang, Z.F., an Patterson, E.A., 1995, Use of phase-stepping with emoulation an fuzzy sets for birefringene measurement. Optis an Lasers in Engineering, : Table 1 Six-step shemes for igital transmission photoelastiity [Patterson & Wang, 1991] mage No φ β Light intensity i 1 0 π/4 i = i m + i os 1 v i 0 -π/4 i = i m i os v i i = i m i sin sin θ 3 v i 4 π/4 π/4 i = i m + i os sin θ 4 v i 5 π/ π/ i = i m + i sin sin θ 5 v i 6 3π/4 3π/4 i = i m i os sin θ 6 v 1

13 Figure 1: Simulation results from a is loae in iametral ompression (from top by rows): (a) Map of the isolini angle obtaine using expression (1) from six images base on those esribe in Table 1. The influene of half an integer fringe orers an be seen as isontinuities an the isolini angle swithes allegiane between the prinipal stresses aross these isontinuities. The map is wrappe with perios of π/. (b) Map of the relative retaration obtaine using expression (3) from six images as in (a). The influene of the isolini angle an be seen at loations with an isolini angle of 45 egrees. The map is wrappe with perios of with perio ens at 0, π, π () Zero-rossing bounaries. Areas within the bounaries are assoiate with a single prinipal stress. Positive areas are enlose by white lines an negative ones by blak lines. Positive areas are protrusions surroune by a step own to their neighbours whilst negative areas are inents surroune by a step up to their neighbours. The winow size, w use to ompute this map was 0 pixels. () Demoulate map of isolini angle generate using the zero-rossing bounaries in () to unwrap the ata in (a). Some noise remains at the loations of half an integer fringe orers. The perioiity of the ata is orresponing to the lassial efinition of isolini angle, an it is everywhere assoiate with the same prinipal stress. (e) Demoulate map of relative retaration proue using the ata in (b) an (). (f) Unwrappe map of relative retaration generate from the ata in (e) using the quality guie algorithm. 13

LAB 4: Operations on binary images Histograms and color tables

LAB 4: Operations on binary images Histograms and color tables LAB 4: Operations on binary images Histograms an olor tables Computer Vision Laboratory Linköping University, Sween Preparations an start of the lab system You will fin a ouple of home exerises (marke

More information

Unsupervised Segmentation of Stereoscopic Video Objects: Proposal. and Comparison of Two Depth-Based Approaches

Unsupervised Segmentation of Stereoscopic Video Objects: Proposal. and Comparison of Two Depth-Based Approaches Unsupervise Segmentation of Stereosopi Vieo Objets: Proposal an Comparison of Two Depth-Base Approahes Klimis S. Ntalianis an Athanasios S.Drigas Net Meia Lab, NCSR Demokritos, Athens, Greee E-mail: kntal@image.ntua.gr

More information

Solutions to Tutorial 2 (Week 9)

Solutions to Tutorial 2 (Week 9) The University of Syney Shool of Mathematis an Statistis Solutions to Tutorial (Week 9) MATH09/99: Disrete Mathematis an Graph Theory Semester, 0. Determine whether eah of the following sequenes is the

More information

An Efficient Image Distortion Correction Method for an X-ray Digital Tomosynthesis System

An Efficient Image Distortion Correction Method for an X-ray Digital Tomosynthesis System An Effiient Image Distortion Corretion Metho for an X-ray Digital Tomosynthesis System J.Y. Kim Dept. of Mehatronis Engineering, Tongmyong University of Information Tehnology, 55 Yongang-ong, Nam-gu, Busan

More information

The Thresholding MLEM Algorithm

The Thresholding MLEM Algorithm Journal of Meial an Biologial Engineering, 24(2: 85-9 85 The Thresholing MLEM Algorithm Keh-Shih Chuang, Meei-Ling Jan,2 Jay Wu Sharon Chen Yu-Ching Ni Ying-Kai Fu 2 epartment of Nulear Siene, National

More information

1 Disjoint-set data structure.

1 Disjoint-set data structure. CS 124 Setion #4 Union-Fin, Greey Algorithms 2/20/17 1 Disjoint-set ata struture. 1.1 Operations Disjoint-set ata struture enale us to effiiently perform operations suh as plaing elements into sets, querying

More information

Philip Siegmann, Eann Patterson, Francisco Díaz-Garrido and Chiara Colombo.

Philip Siegmann, Eann Patterson, Francisco Díaz-Garrido and Chiara Colombo. OPERATING INSTRUCTIONS RICO (Regularized Isochromatic Phase Map Computation) PROGRAMME VERSION 2.0, March 2009 Philip Siegmann, Eann Patterson, Francisco Díaz-Garrido and Chiara Colombo. Introduction This

More information

Register Allocation III. Interference Graph Allocators. Computing the Interference Graph (in MiniJava compiler)

Register Allocation III. Interference Graph Allocators. Computing the Interference Graph (in MiniJava compiler) Register Alloation III Announements Reommen have interferene graph onstrution working by Monay Last leture Register alloation aross funtion alls Toay Register alloation options Interferene Graph Alloators

More information

E200 ORT series Torque Transducer 10mNm to 500Nm

E200 ORT series Torque Transducer 10mNm to 500Nm E200 ORT series Torque Transuer 10mNm to 500Nm E200 ORT Series Optial Rotary Torque Transuer The E200 ORT Series (Optial Rotary Torque) Transuer offers, in onjuntion with an E201/2 Display Interfae, an

More information

Optimization of Image Processing in Video-based Traffic Monitoring

Optimization of Image Processing in Video-based Traffic Monitoring http://x.oi.org/0.5755/j0.eee.8.8.634 Optimization of Image Proessing in Vieo-base Traffi Monitoring Fei Zhu, Jiamin Ning, Yong Ren, Jingyu Peng Shool of Computer Siene an Tehnology, Soohow University,

More information

Performance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application

Performance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application World Aademy of Siene, Engineering and Tehnology 8 009 Performane of Histogram-Based Skin Colour Segmentation for Arms Detetion in Human Motion Analysis Appliation Rosalyn R. Porle, Ali Chekima, Farrah

More information

Math 2201 Unit 3: Acute Triangle Trigonometry. Ch. 3 Notes

Math 2201 Unit 3: Acute Triangle Trigonometry. Ch. 3 Notes Rea Learning Goals, p. 17 text. Math 01 Unit 3: ute Triangle Trigonometry h. 3 Notes 3.1 Exploring Sie-ngle Relationships in ute Triangles (0.5 lass) Rea Goal p. 130 text. Outomes: 1. Define an aute triangle.

More information

And, the (low-pass) Butterworth filter of order m is given in the frequency domain by

And, the (low-pass) Butterworth filter of order m is given in the frequency domain by Problem Set no.3.a) The ideal low-pass filter is given in the frequeny domain by B ideal ( f ), f f; =, f > f. () And, the (low-pass) Butterworth filter of order m is given in the frequeny domain by B

More information

Register Allocation III. Interference Graph Allocators. Coalescing. Granularity of Allocation (Renumber step in Briggs) Chaitin

Register Allocation III. Interference Graph Allocators. Coalescing. Granularity of Allocation (Renumber step in Briggs) Chaitin Register Alloation III Last time Register alloation aross funtion alls Toay Register alloation options Interferene Graph Alloators Chaitin Briggs CS553 Leture Register Alloation III 1 CS553 Leture Register

More information

LARGE-SCALE INVERSE MICROWAVE BACKSCATTER MODELING OF SEA ICE

LARGE-SCALE INVERSE MICROWAVE BACKSCATTER MODELING OF SEA ICE LARGE-SCALE INVERSE MICROWAVE BACKSCATTER MODELING OF SEA ICE Quinn P Remun Mirowave Earth Remote Sensing Laboratory Brigham Young University Provo Utah Abstrat Polar sea ie harateristi provie important

More information

Chapter 2: Introduction to Maple V

Chapter 2: Introduction to Maple V Chapter 2: Introdution to Maple V 2-1 Working with Maple Worksheets Try It! (p. 15) Start a Maple session with an empty worksheet. The name of the worksheet should be Untitled (1). Use one of the standard

More information

PLANE-BASED CAMERA CALIBRATION WITHOUT DIRECT OPTIMIZATION ALGORITHMS. Jorge A. Sánchez, Eduardo A. Destefanis, Luis R. Canali

PLANE-BASED CAMERA CALIBRATION WITHOUT DIRECT OPTIMIZATION ALGORITHMS. Jorge A. Sánchez, Eduardo A. Destefanis, Luis R. Canali PLANE-BASED CAMERA CALIBRAION WIHOU DIREC OPIMIZAION ALGORIHMS Jorge A. Sánhez, Euaro A. Destefanis, Luis R. Canali Centro e Investigaión en Informátia para Ingeniería, Univ. enológia Naional, Faulta Regional

More information

Generalized Buffering of PTL Logic Stages using Boolean Division and Don t Cares

Generalized Buffering of PTL Logic Stages using Boolean Division and Don t Cares Generalize Buffering of PTL Logi Stages using Boolean Division an Don t Cares Rajesh Garg Sunil P Khatri Department of ECE, Texas A&M University, College Station, TX 77843 Abstrat Pass Transistor Logi

More information

Keeping Things Simple: Finding Frequent Item Sets by Recursive Elimination

Keeping Things Simple: Finding Frequent Item Sets by Recursive Elimination Keeping Things Simple: Fining Frequent Item Sets y Reursive Elimination Christian Borgelt Department of Knowlege Proessing an Language Engineering Shool of Computer Siene, Otto-von-Guerike-University of

More information

Calculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem

Calculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem Calulation of typial running time of a branh-and-bound algorithm for the vertex-over problem Joni Pajarinen, Joni.Pajarinen@iki.fi Otober 21, 2007 1 Introdution The vertex-over problem is one of a olletion

More information

An Event Display for ATLAS H8 Pixel Test Beam Data

An Event Display for ATLAS H8 Pixel Test Beam Data An Event Display for ATLAS H8 Pixel Test Beam Data George Gollin Centre de Physique des Partiules de Marseille and University of Illinois April 17, 1999 g-gollin@uiu.edu An event display program is now

More information

Multitarget Data Association with Higher-Order Motion Models

Multitarget Data Association with Higher-Order Motion Models Multitarget Data Assoiation with Higher-Orer Motion Moels Robert T. Collins The Pennsylvania State University University Park, PA 16802, USA Abstrat We present an iterative approximate solution to the

More information

CleanUp: Improving Quadrilateral Finite Element Meshes

CleanUp: Improving Quadrilateral Finite Element Meshes CleanUp: Improving Quadrilateral Finite Element Meshes Paul Kinney MD-10 ECC P.O. Box 203 Ford Motor Company Dearborn, MI. 8121 (313) 28-1228 pkinney@ford.om Abstrat: Unless an all quadrilateral (quad)

More information

Pipelined Multipliers for Reconfigurable Hardware

Pipelined Multipliers for Reconfigurable Hardware Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,

More information

Learning Non-Linear Reconstruction Models for Image Set Classification

Learning Non-Linear Reconstruction Models for Image Set Classification Testing Training Learning Non-Linear Reonstrution Moels for Image Set Classifiation Munawar Hayat, Mohamme Bennamoun, Senian An Shool of Computer Siene an Software Enginnering The University of Western

More information

Conflicts Analysis for Inter-Enterprise Business Process Model

Conflicts Analysis for Inter-Enterprise Business Process Model Conflits Analysis for nter-enterprise Business Proess Moel Wei DNG, Zhong TAN, Jian WANG, Jun ZHU, Haiqi LANG,Lei ZHANG {ingw, tianz, wangwj, zhujun, lianghq, lzhang}@n.ibm.om BM China Researh Lab, BM

More information

NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman

NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION Ken Sauer and Charles A. Bouman Department of Eletrial Engineering, University of Notre Dame Notre Dame, IN 46556, (219) 631-6999 Shool of

More information

Abstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1.

Abstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1. Fuzzy Weighted Rank Ordered Mean (FWROM) Filters for Mixed Noise Suppression from Images S. Meher, G. Panda, B. Majhi 3, M.R. Meher 4,,4 Department of Eletronis and I.E., National Institute of Tehnology,

More information

Anchoring quartet-based phylogenetic distances and applications to species tree reconstruction

Anchoring quartet-based phylogenetic distances and applications to species tree reconstruction Anhoring quartet-base phylogeneti istanes an appliations to speies tree reonstrution Erfan Sayyari an Siavash Mirarab Department of Eletrial an Computer Engineering University of California at San Diego

More information

Drawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0;

Drawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0; Naïve line drawing algorithm // Connet to grid points(x0,y0) and // (x1,y1) by a line. void drawline(int x0, int y0, int x1, int y1) { int x; double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx;

More information

CA Test Data Manager 4.x Implementation Proven Professional Exam (CAT-681) Study Guide Version 1.0

CA Test Data Manager 4.x Implementation Proven Professional Exam (CAT-681) Study Guide Version 1.0 Implementation Proven Professional Study Guide Version 1.0 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer

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

The influence of defeated arguments in defeasible argumentation

The influence of defeated arguments in defeasible argumentation The influene of efeate arguments in efeasible argumentation Bart Verheij University of Limburg, Department of Metajuriia P.O. Box 616, 6200 MD Maastriht, The Netherlans fax: +31 43 256538 email: bart.verheij@metajur.rulimburg.nl

More information

Connection Guide. Installing the printer locally (Windows) What is local printing? Installing the printer using the Software and Documentation CD

Connection Guide. Installing the printer locally (Windows) What is local printing? Installing the printer using the Software and Documentation CD Page 1 of 7 Connetion Guide Installing the printer loally (Windows) Note: When installing a loally attahed printer, if the operating system is not supported y the Software and Doumentation CD, then the

More information

13.1 Numerical Evaluation of Integrals Over One Dimension

13.1 Numerical Evaluation of Integrals Over One Dimension 13.1 Numerial Evaluation of Integrals Over One Dimension A. Purpose This olletion of subprograms estimates the value of the integral b a f(x) dx where the integrand f(x) and the limits a and b are supplied

More information

Searching for Entities: When Retrieval Meets Extraction

Searching for Entities: When Retrieval Meets Extraction Searhing for Entities: When Retrieval Meets Extration Qi Li, Daqing He Shool of Information Sienes, University of Pittsburgh Pittsburgh, Pennsylvania, U. S. {qili, aqing}@sis.pitt.eu Abstrat. Retrieving

More information

Measurement of the stereoscopic rangefinder beam angular velocity using the digital image processing method

Measurement of the stereoscopic rangefinder beam angular velocity using the digital image processing method Measurement of the stereosopi rangefinder beam angular veloity using the digital image proessing method ROMAN VÍTEK Department of weapons and ammunition University of defense Kouniova 65, 62 Brno CZECH

More information

Outline: Software Design

Outline: Software Design Outline: Software Design. Goals History of software design ideas Design priniples Design methods Life belt or leg iron? (Budgen) Copyright Nany Leveson, Sept. 1999 A Little History... At first, struggling

More information

Image-based Automatic Object Localisation in ispace Environment

Image-based Automatic Object Localisation in ispace Environment Magyar Kutatók 10. Nemzetközi Szimpóziuma 10 th International Symposium of Hungarian Researhers on Computational Intelligene an Informatis Image-base Automati Objet Loalisation in ispae Environment Péter

More information

arxiv: v2 [cs.hc] 28 Apr 2018

arxiv: v2 [cs.hc] 28 Apr 2018 Clustrophile 2: Guie Visual Clustering Analysis Maro Cavallo an Çağatay Demiralp a arxiv:1804.03048v2 [s.hc] 28 Apr 2018 Fig. 1: Clustrophile 2 is an interative tool for guie exploratory lustering analysis.

More information

Detection and Recognition of Non-Occluded Objects using Signature Map

Detection and Recognition of Non-Occluded Objects using Signature Map 6th WSEAS International Conferene on CIRCUITS, SYSTEMS, ELECTRONICS,CONTROL & SIGNAL PROCESSING, Cairo, Egypt, De 9-31, 007 65 Detetion and Reognition of Non-Oluded Objets using Signature Map Sangbum Park,

More information

Multi-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality

Multi-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality INTERNATIONAL CONFERENCE ON MANUFACTURING AUTOMATION (ICMA200) Multi-Piee Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality Stephen Stoyan, Yong Chen* Epstein Department of

More information

Algorithms to Accelerate Multiple Regular Expressions Matching for Deep Packet Inspection

Algorithms to Accelerate Multiple Regular Expressions Matching for Deep Packet Inspection Algorithms to Aelerate Multiple Regular Expressions Mathing for Deep Paket Inspetion Sailesh Kumar Washington University Computer Siene an Engineering St. Louis, MO 60-899 +--9-06 sailesh@arl.wustl.eu

More information

Dynamic Restoration in Multi-layer IP/MPLS-over- Flexgrid Networks

Dynamic Restoration in Multi-layer IP/MPLS-over- Flexgrid Networks Dynami Restoration in Multi-layer IP/MPLS-over- Flexgri Networks Alberto Castro, Luis Velaso, Jaume Comellas, an Gabriel Junyent Universitat Politènia e Catalunya (UPC), Barelona, Spain E-mail: aastro@a.up.eu

More information

CA Release Automation 5.x Implementation Proven Professional Exam (CAT-600) Study Guide Version 1.1

CA Release Automation 5.x Implementation Proven Professional Exam (CAT-600) Study Guide Version 1.1 Exam (CAT-600) Study Guide Version 1.1 PROPRIETARY AND CONFIDENTIAL INFORMATION 2016 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized

More information

Learning Spatiotemporal Features for Infrared Action Recognition with 3D Convolutional Neural Networks

Learning Spatiotemporal Features for Infrared Action Recognition with 3D Convolutional Neural Networks Learning Spatiotemporal Features for Infrare Ation Reognition with 3D Convolutional Neural Networks Zhuolin Jiang, Viktor Rozgi, Sanar Aali Raytheon BBN Tehnologies, Cambrige, MA, 02138 {zjiang, vrozgi,

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

Comparing Fisheye and Full-Zoom Techniques for Navigation of Hierarchically Clustered Networks

Comparing Fisheye and Full-Zoom Techniques for Navigation of Hierarchically Clustered Networks Comparing Fisheye an Full-Zoom Tehniques for Navigation of Hierarhially Clustere Networks Doug Shaffer*, Zhengping Zuo, Lyn Bartram, John Dill, Shelli Dus, Saul Greenerg*, Mark Roseman* 1 * Dept of Computer

More information

A Novel Validity Index for Determination of the Optimal Number of Clusters

A Novel Validity Index for Determination of the Optimal Number of Clusters IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers

More information

Connection Guide. Supported operating systems. Installing the printer using the Software and Documentation CD. Connection Guide

Connection Guide. Supported operating systems. Installing the printer using the Software and Documentation CD. Connection Guide Connetion Guide Page 1 of 6 Connetion Guide Supported operating systems Using the software CD, you an install the printer software on the following operating systems: Windows 8.1 Windows Server 2012 R2

More information

INTRODUCTION. USB Connection Cable included

INTRODUCTION. USB Connection Cable included INTRODUCTION USB Connetion Cable inlue PRG007 is the new programming interfae for alarms, l, parking now available an future proution. It s Winows sw base on. After owloaing an installing the software

More information

Connection Guide. Installing the printer locally (Windows) What is local printing? Installing the printer using the Software and Documentation CD

Connection Guide. Installing the printer locally (Windows) What is local printing? Installing the printer using the Software and Documentation CD Connetion Guide Page 1 of 5 Connetion Guide Installing the printer loally (Windows) Note: If the Software and Doumentation CD does not support the operating system, you must use the Add Printer Wizard.

More information

Advanced Algorithms for Fast and Scalable Deep Packet Inspection

Advanced Algorithms for Fast and Scalable Deep Packet Inspection Avane Algorithms for Fast an Salale Deep Paket Inspetion Sailesh Kumar Washington University sailesh@arl.wustl.eu Jonathan Turner Washington University jon.turner@wustl.eu John Williams Ciso Systems jwill@iso.om

More information

Graph-Based vs Depth-Based Data Representation for Multiview Images

Graph-Based vs Depth-Based Data Representation for Multiview Images Graph-Based vs Depth-Based Data Representation for Multiview Images Thomas Maugey, Antonio Ortega, Pasal Frossard Signal Proessing Laboratory (LTS), Eole Polytehnique Fédérale de Lausanne (EPFL) Email:

More information

PROJECT PERIODIC REPORT

PROJECT PERIODIC REPORT FP7-ICT-2007-1 Contrat no.: 215040 www.ative-projet.eu PROJECT PERIODIC REPORT Publishable Summary Grant Agreement number: ICT-215040 Projet aronym: Projet title: Enabling the Knowledge Powered Enterprise

More information

Video Data and Sonar Data: Real World Data Fusion Example

Video Data and Sonar Data: Real World Data Fusion Example 14th International Conferene on Information Fusion Chiago, Illinois, USA, July 5-8, 2011 Video Data and Sonar Data: Real World Data Fusion Example David W. Krout Applied Physis Lab dkrout@apl.washington.edu

More information

Kinematic Analysis of a Family of 3R Manipulators

Kinematic Analysis of a Family of 3R Manipulators Kinematic Analysis of a Family of R Manipulators Maher Baili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S. 6597 1, rue e la Noë, BP 92101,

More information

Chromaticity-matched Superimposition of Foreground Objects in Different Environments

Chromaticity-matched Superimposition of Foreground Objects in Different Environments FCV216, the 22nd Korea-Japan Joint Workshop on Frontiers of Computer Vision Chromatiity-mathed Superimposition of Foreground Objets in Different Environments Yohei Ogura Graduate Shool of Siene and Tehnology

More information

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2 On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,

More information

Inverse Design of Urban Procedural Models

Inverse Design of Urban Procedural Models Inverse Design of Uran Proeural Moels Carlos A. Vanegas Purue University U.C. Berkeley Ignaio Garia-Dorao Purue University Daniel G. Aliaga Purue University Development site Paul Waell U.C. Berkeley Non-optimize

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

Enumerating pseudo-triangulations in the plane

Enumerating pseudo-triangulations in the plane Enumerating pseuo-triangulations in the plane Sergey Bereg Astrat A pseuo-triangle is a simple polygon with exatly three onvex verties. A pseuo-triangulation of a finite point set S in the plane is a partition

More information

Predicting Project Outcome Leveraging Socio-Technical Network Patterns

Predicting Project Outcome Leveraging Socio-Technical Network Patterns 203 7th European Conferene on Software Maintenane an Reengineering Preiting Projet Outome Leveraging Soio-Tehnial Network Patterns Dii Surian, Yuan Tian, Davi Lo, Hong Cheng an Ee-Peng Lim Shool of Information

More information

Rotation Invariant Spherical Harmonic Representation of 3D Shape Descriptors

Rotation Invariant Spherical Harmonic Representation of 3D Shape Descriptors Eurographis Symposium on Geometry Proessing (003) L. Kobbelt, P. Shröder, H. Hoppe (Editors) Rotation Invariant Spherial Harmoni Representation of 3D Shape Desriptors Mihael Kazhdan, Thomas Funkhouser,

More information

CA Unified Infrastructure Management 8.x Implementation Proven Professional Exam (CAT-540) Study Guide Version 1.1

CA Unified Infrastructure Management 8.x Implementation Proven Professional Exam (CAT-540) Study Guide Version 1.1 Management 8.x Implementation Proven Professional Exam (CAT-540) Study Guide Version 1.1 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information.

More information

Extracting Partition Statistics from Semistructured Data

Extracting Partition Statistics from Semistructured Data Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk

More information

1. Introduction. 2. The Probable Stope Algorithm

1. Introduction. 2. The Probable Stope Algorithm 1. Introdution Optimization in underground mine design has reeived less attention than that in open pit mines. This is mostly due to the diversity o underground mining methods and omplexity o underground

More information

Dynamic Programming. Lecture #8 of Algorithms, Data structures and Complexity. Joost-Pieter Katoen Formal Methods and Tools Group

Dynamic Programming. Lecture #8 of Algorithms, Data structures and Complexity. Joost-Pieter Katoen Formal Methods and Tools Group Dynami Programming Leture #8 of Algorithms, Data strutures and Complexity Joost-Pieter Katoen Formal Methods and Tools Group E-mail: katoen@s.utwente.nl Otober 29, 2002 JPK #8: Dynami Programming ADC (214020)

More information

Finding the Equation of a Straight Line

Finding the Equation of a Straight Line Finding the Equation of a Straight Line You should have, before now, ome aross the equation of a straight line, perhaps at shool. Engineers use this equation to help determine how one quantity is related

More information

CA Agile Requirements Designer 2.x Implementation Proven Professional Exam (CAT-720) Study Guide Version 1.0

CA Agile Requirements Designer 2.x Implementation Proven Professional Exam (CAT-720) Study Guide Version 1.0 Exam (CAT-720) Study Guide Version 1.0 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized

More information

Smooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints

Smooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints Smooth Trajetory Planning Along Bezier Curve for Mobile Robots with Veloity Constraints Gil Jin Yang and Byoung Wook Choi Department of Eletrial and Information Engineering Seoul National University of

More information

Patch Volumes: Segmentation-based Consistent Mapping with RGB-D Cameras

Patch Volumes: Segmentation-based Consistent Mapping with RGB-D Cameras Path Volumes: Segmentation-base Consistent Mapping with RGB-D Cameras Peter Henry an Dieter Fox University of Washington Computer Siene & Engineering Seattle, Washington peter@s.washington.eu fox@s.washington.eu

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

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

Research Report. IBM Research. SAML Artifact Information Flow Revisited. RZ 3643 (# 99653) 01/03/06 Computer Science 17 pages

Research Report. IBM Research. SAML Artifact Information Flow Revisited. RZ 3643 (# 99653) 01/03/06 Computer Science 17 pages RZ 3643 (# 99653) 01/03/06 Computer Siene 17 pages Researh Report SAML Artifat Information Flow Revisite Thomas Groß an Birgit Pfitzmann IBM Researh GmbH Zurih Researh Laboratory 8803 Rüshlikon Switzerlan

More information

UCSB Math TI-85 Tutorials: Basics

UCSB Math TI-85 Tutorials: Basics 3 UCSB Math TI-85 Tutorials: Basis If your alulator sreen doesn t show anything, try adjusting the ontrast aording to the instrutions on page 3, or page I-3, of the alulator manual You should read the

More information

Simulation of Crystallographic Texture and Anisotropie of Polycrystals during Metal Forming with Respect to Scaling Aspects

Simulation of Crystallographic Texture and Anisotropie of Polycrystals during Metal Forming with Respect to Scaling Aspects Raabe, Roters, Wang Simulation of Crystallographi Texture and Anisotropie of Polyrystals during Metal Forming with Respet to Saling Aspets D. Raabe, F. Roters, Y. Wang Max-Plank-Institut für Eisenforshung,

More information

Self-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization

Self-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization Self-Adaptive Parent to Mean-Centri Reombination for Real-Parameter Optimization Kalyanmoy Deb and Himanshu Jain Department of Mehanial Engineering Indian Institute of Tehnology Kanpur Kanpur, PIN 86 {deb,hjain}@iitk.a.in

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

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and

More information

CS2100 Computer Organisation Tutorial #8: MSI Components Answers to Selected Questions

CS2100 Computer Organisation Tutorial #8: MSI Components Answers to Selected Questions C Computer Organisation Tutorial #8: MI Components Answers to elete Questions. Realize the following funtion with (a) an 8: multiplexer, an (b) a 4: multiplexer using the first input variables as the seletor

More information

A radiometric analysis of projected sinusoidal illumination for opaque surfaces

A radiometric analysis of projected sinusoidal illumination for opaque surfaces University of Virginia tehnial report CS-21-7 aompanying A Coaxial Optial Sanner for Synhronous Aquisition of 3D Geometry and Surfae Refletane A radiometri analysis of projeted sinusoidal illumination

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 Full-Featured, Error Resilient, Scalable Wavelet Video Codec Based on the Set Partitioning in Hierarchical Trees (SPIHT) Algorithm

A Full-Featured, Error Resilient, Scalable Wavelet Video Codec Based on the Set Partitioning in Hierarchical Trees (SPIHT) Algorithm A Full-Feature, Error Resilient, Salable Wavelet Vieo Coe Base on the Set Partitioning in Hierarhial Trees (SPIHT) Algorithm Sungae Cho an William A. Pearlman Center for Next Generation Vieo Researh Rensselaer

More information

MATH STUDENT BOOK. 12th Grade Unit 6

MATH STUDENT BOOK. 12th Grade Unit 6 MATH STUDENT BOOK 12th Grade Unit 6 Unit 6 TRIGONOMETRIC APPLICATIONS MATH 1206 TRIGONOMETRIC APPLICATIONS INTRODUCTION 3 1. TRIGONOMETRY OF OBLIQUE TRIANGLES 5 LAW OF SINES 5 AMBIGUITY AND AREA OF A TRIANGLE

More information

Plot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar

Plot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar Plot-to-trak orrelation in A-SMGCS using the target images from a Surfae Movement Radar G. Golino Radar & ehnology Division AMS, Italy ggolino@amsjv.it Abstrat he main topi of this paper is the formulation

More information

特集 Road Border Recognition Using FIR Images and LIDAR Signal Processing

特集 Road Border Recognition Using FIR Images and LIDAR Signal Processing デンソーテクニカルレビュー Vol. 15 2010 特集 Road Border Reognition Using FIR Images and LIDAR Signal Proessing 高木聖和 バーゼル ファルディ Kiyokazu TAKAGI Basel Fardi ヘンドリック ヴァイゲル Hendrik Weigel ゲルド ヴァニーリック Gerd Wanielik This paper

More information

CUTTING FORCES AND CONSECUTIVE DEFORMATIONS AT MILLING PARTS WITH THIN WALLS

CUTTING FORCES AND CONSECUTIVE DEFORMATIONS AT MILLING PARTS WITH THIN WALLS Proeedings of the International Conferene on Manufaturing Systems ICMaS Vol. 4, 2009, ISSN 1842-3183 University POLITEHNICA of Buharest, Mahine and Manufaturing Systems Department Buharest, Romania CUTTING

More information

Introduction to Seismology Spring 2008

Introduction to Seismology Spring 2008 MIT OpenCourseWare http://ow.mit.edu 1.510 Introdution to Seismology Spring 008 For information about iting these materials or our Terms of Use, visit: http://ow.mit.edu/terms. 1.510 Leture Notes 3.3.007

More information

RANGE DOPPLER ALGORITHM FOR BISTATIC SAR PROCESSING BASED ON THE IMPROVED LOFFELD S BISTATIC FORMULA

RANGE DOPPLER ALGORITHM FOR BISTATIC SAR PROCESSING BASED ON THE IMPROVED LOFFELD S BISTATIC FORMULA Progress In Eletromagnetis Researh Letters, Vol. 27, 161 169, 2011 RANGE DOPPLER ALGORITHM FOR ISTATIC SAR PROCESSING ASED ON THE IMPROVED LOFFELD S ISTATIC FORMULA X. Wang 1, * and D. Y. Zhu 2 1 Nanjing

More information

FUZZY WATERSHED FOR IMAGE SEGMENTATION

FUZZY WATERSHED FOR IMAGE SEGMENTATION FUZZY WATERSHED FOR IMAGE SEGMENTATION Ramón Moreno, Manuel Graña Computational Intelligene Group, Universidad del País Vaso, Spain http://www.ehu.es/winto; {ramon.moreno,manuel.grana}@ehu.es Abstrat The

More information

COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY

COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY Dileep P, Bhondarkor Texas Instruments Inorporated Dallas, Texas ABSTRACT Charge oupled devies (CCD's) hove been mentioned as potential fast auxiliary

More information

Type of document: Usebility Checklist

Type of document: Usebility Checklist Projet: JEGraph Type of doument: Usebility Cheklist Author: Max Bryan Version: 1.30 2011 Envidate GmbH Type of Doumet Developer guidelines User guidelines Dutybook Speifiation Programming and testing Test

More information

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study What are Cyle-Stealing Systems Good For? A Detailed Performane Model Case Study Wayne Kelly and Jiro Sumitomo Queensland University of Tehnology, Australia {w.kelly, j.sumitomo}@qut.edu.au Abstrat The

More information

arxiv: v1 [cs.db] 13 Sep 2017

arxiv: v1 [cs.db] 13 Sep 2017 An effiient lustering algorithm from the measure of loal Gaussian distribution Yuan-Yen Tai (Dated: May 27, 2018) In this paper, I will introdue a fast and novel lustering algorithm based on Gaussian distribution

More information

Make your process world

Make your process world Automation platforms Modion Quantum Safety System Make your proess world a safer plae You are faing omplex hallenges... Safety is at the heart of your proess In order to maintain and inrease your ompetitiveness,

More information

3D Ideal Flow For Non-Lifting Bodies

3D Ideal Flow For Non-Lifting Bodies 3D Ideal Flow For Non-Lifting Bodies 3D Doublet Panel Method 1. Cover body with 3D onstant strength doublet panels of unknown strength (N panels) 2. Plae a ontrol point at the enter of eah panel (N ontrol

More information

ICCGLU. A Fortran IV subroutine to solve large sparse general systems of linear equations. J.J. Dongarra, G.K. Leaf and M. Minkoff.

ICCGLU. A Fortran IV subroutine to solve large sparse general systems of linear equations. J.J. Dongarra, G.K. Leaf and M. Minkoff. http://www.netlib.org/linalg/ig-do 1 of 8 12/7/2009 11:14 AM ICCGLU A Fortran IV subroutine to solve large sparse general systems of linear equations. J.J. Dongarra, G.K. Leaf and M. Minkoff July, 1982

More information

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer

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