Rapid, accurate particle tracking by calculation of radial symmetry centers
|
|
- Melina Marsh
- 6 years ago
- Views:
Transcription
1 Rapid, aurate partile traing by alulation of radial symmetry enters Raghuveer Parthasarathy Supplementary Text and Figures Supplementary Figures Supplementary Figure 1 Supplementary Figure Supplementary Figure 3 Supplementary Figure 4 Supplementary Figure 5 Supplementary Figure 6 Supplementary Figure 7 Supplementary Note Supplementary Results Referenes Traing auray for various partile loalization algorithms applied to simulated partile images with a signal-to-noise ratio of 0. Loalization auray over a range of SNr for radial-symmetry-based traing and other methods Loalization auray over a range of SNr, with true partile enters distributed over ±.0 pixels in x and y. Loalization auray in the presene of a seond partile. Loalization auray for simulated images of onentri rings. More experimental tests of radial-symmetry-based partile loalization. The relationship between total number of photons deteted and signal-tonoise ratio (SNr). Partile Loalization Algorithm Additional haraterizations of partile loalization auray Referenes for Supplementary Notes and Results 1
2 Supplementary Figure 1. Traing auray for various partile loalization algorithms applied to simulated partile images with a signal-to-noise ratio of 0. Radial Sym. indiates the radial-symmetry-based approah introdued here; Centroid indiates entroid finding; Gaussian NLLS and Gaussian MLE refer to Gaussian fitting performed using nonlinear least squares minimization and maximum lielihood estimation, respetively. (a,b) The total error, defined as the differene between the fit-determined and true partile enters, plotted as a funtion of the true enter loation. The true partile enters are randomly distributed over ± 0.5 pixels in x and y. The error in the x and y dimensions are plotted separately. The lower panels show the same points as the upper panels but with the entroid-fit values omitted. () The total error in x for true partile enters spanning ±.0 pixels. The mean errors for the radial symmetry, Gaussian NLLS, and Gaussian MLE methods are very similar to their values over the smaller range (noted in the main text): 0.045, 0.04, and px, respetively. (d) The total error in x from radial symmetry based traing as alulated with and without loal smoothing of slopes.
3 Supplementary Figure. Loalization auray. (a) Total error, (b) preision, () bias, and (d) omputation time from traing simulated partile images over a range of SNr using radial-symmetry-based traing, Gaussian NLLS and MLE fitting, entroid determination, and linearized weighted Gaussian fitting. (See Online Methods for preise definitions of terms.) The examined range of signal-to-noise ratios orresponds to a total number of deteted photons from 100 to 300,000 (see Supplementary Results Figure ). Eah point denotes the average of 1,000 tests at eah SNr. The true partile enters are randomly distributed over ± 0.5 pixels in x and y. The solid lines in (a) and (b) indiate the Cramér- Rao bound on loalization preision. Panel (a) is the same as Figure b; the larger size failitates disrimination between the various symbols. Panel () magnifies Panel (1). 3
4 Supplementary Figure 3. Loalization auray. (a) Total error, (b) preision, () bias, and (d) omputation time as in Supplementary Fig., but with true partile enters distributed over ±.0 pixels in x and y rather than 0.5 pixels. The solid line in (a) indiates the Cramér- Rao bound on loalization preision. 4
5 Supplementary Figure 4. Loalization auray in the presene of a seond partile. Model images were onstruted at SNr=0, onsisting of two partiles at a given enter-toenter separation and a random angular orientation. Eah point denotes the average, over 400 images, of error in the position determined for the entral partile. Inset: A model image with two partiles separated by 4 px and oriented at -45 degrees with respet to the x-axis. The yellow box indiates the 7x7 pixel region analyzed to loalize the entral partile. Supplementary Figure 5. The auray of enter determination for simulated images of onentri rings over a range of signal-to-noise ratios. Eah point denotes the average of 00 simulated images for SNr<0 and 50 images for SNr>0. Inset: A simulated image with SNr=0. 5
6 Supplementary Figure 6. More experimental tests of radial-symmetry-based partile loalization. (a) Confoal mirograph of fluoresent. µm diameter PMMA mirospheres; (b) the D pair orrelation funtion g(r). () Confoal mirograph of fluoresent 1.1 µm diameter PMMA mirospheres; (d) the orresponding g(r). (e) Fluoresene image of quantum dot labeled aetylholine reeptors in a HEK 93 ell. Bar = 5 mirons. (f) Meansquare-displaement for a single quantum dot trajetory. The traes derived from radialsymmetry-based and Gaussian traing are visually indistinguishable; their differene is shown in (g). (h) Histograms of step sizes derived from images of quantum-dot labeled inesins traed with radial-symmetry-based (upper) and Gaussian fitting (lower) methods. Solid lines: two-gaussian fits to the histograms. Supplementary Figure 7. The total number of photons deteted in the CCD plane as a funtion of the pea SNr for the simulated images used in this paper. The number of photons deteted at the brightest pixel is SNr ; the plotted total sums over all pixels. 6
7 Supplementary Note: Partile Loalization Algorithm My approah to partile loalization is to determine the enter of radial symmetry of an intensity distribution sampled at disrete points, { I ( x, y )}, where I denotes the intensity and the subsripts label ij ij ij rows and olumns on a two-dimensional lattie with oordinates x and y. Typially, these oordinates will be those of pixels in a CCD array, and the set of intensities will orrespond to a single partile imaged by a noisy optial devie. Radial symmetry is not in itself a number whose value an be omputed and optimized, and so we need a measure of symmetry that is alulable for a disretely sampled funtion. Many possibilities exist; a fruitful approah is to note that the gradient of a funtion that has perfet radially symmetry about the oordinate origin will, at any point, point toward the origin. A line through any point with orientation parallel to the loal gradient will interset the origin. (This basi fat has been observed before, e.g. in Ref. 1 in the ontext of onentri rings.) It is fruitful to thin of the origin as the point that minimizes the distane between itself and all suh lines, that distane being zero. This perspetive, I propose, an be extended to noisy, imperfetly symmetri funtions. We an identify the point of minimal distane to gradient-oriented lines as an estimate of the true partile enter, and test the auray of this proposition by proessing simulated images with nown enter positions. Given the intensities at eah pixel position, { I ( x, y )}, we alulate the intensity gradient on a ij ij ij grid displaed half a pixel in eah dimension using a Roberts ross operator S1 (Fig. S1). For any set of four pixels of indies {(i, j), (i+1, j), (i, j+1), (i+1, j+1)} (Figure a), the gradient at the midpoint ( x, y ) is I = I I u ˆ + I I vˆ, where the uv-axes are rotated 45º from xy (Figures 1, a). The ( + 1, + 1, ) (, , ) i j i j i j i j Roberts ross allows assignment of both omponents of the gradient at the same point, in ontrast, for example, to alulating x-omponents from differenes along olumns ( Ii+ 1, j Ii, j ) and y-omponents along rows ( Ii, j+ 1 Ii, j ). The slope of the gradient at the midpoint in the xy oordinate system, rotated 45 degrees with respet to uv, is given by m ( I + 1, + 1 I, ) + ( I, + 1 I + 1, ) ( Ii+ 1, j+ 1 Ii, j) ( Ii, j+ 1 Ii+ 1, j) = i j i j i j i j the terms in parentheses are the u and v omponents of loated at ( x, y ), we an now write the equation of a line of slope ( x x ) y= y + m. Suh a line is illustrated in Fig. S1b. ; I noted above. For any of our grid midpoints, m passing through ( x, y ) : 7
8 Figure S1. Pixel and gradient geometry. (a) The gradient of the image intensity is determined on a grid (one site of whih is indiated in dar gray) displaed half a pixel in x and y from the grid of pixel enters (light gray). (b) At eah point at whih the gradient is alulated (e.g. ( x, y ), we an onsider a line parallel to gradient, passing through that point. We wish to loate the point ( x, y ) that minimizes the weighted sum of the squared distanes of losest approah, d, to all suh lines. We next onsider some arbitrary point ( x, y ). It is a straightforward exerise in geometry to show that the distane, d, between (, ) x y and the line y y + m ( x x ) d = = is given by ( y y ) m ( x x ) m + 1 Considering all lattie midpoints, labeled, we wish to determine the best fit point ( x, y ) that minimizes d w χ, where w is some weighting of point, disussed below. Setting the derivative of respet to x equal to zero; after some algebra one obtains: Similarly, for y : This yields expressions for x and (1.1) (1.) where x y = = x + y = m + m + m x. ( m x ) m w mw mw y m + m ( x ) mw w w y m + y = m y that are simple ombinations of the above sums: ( ) w mw ( y ) 1 mw y mx mx w m + 1 m + 1 m + 1 m ( ) mw m w ( y ) mw y mx m x w m + 1 m + 1 m + 1 m + 1 χ with 8
9 (1.3) mw mw w m m m = Weighting It is reasonable to apply different weightings to the distanes alulated from different grid points. The intensity gradient is more aurately determined in areas of high intensity, as the image signal is larger ompared to the noise. The distane to ( x, y ) is more aurately determined for points that are lose to ( x, y ), as errors in the slope m lead to errors in d that grow with the distane d, between the point ( x, y) and the enter. A simple hoie of weighting that inorporates both of these ideas is I (1.4) w = d Use of the intensity gradient rather than the intensity avoids the influene of onstant baground intensities on the weighting. The distane d, is of ourse unnown prior to alulation of ( x, y ). It an, however, be approximated by the distane, d between ( x, y ) and the entroid of I ; this approah is used throughout this paper. There are many possible weighting funtions, some of whih may onfer greater auray than the form written above. The results are not liely to be strongly dependent on the hoie of denominator in the weighting funtion, however. For example, even the very naive approah of using the distane to the brightest pixel, rather than d, yields a roughly 1% hange in mean auray, orresponding to less than pixels at a signal-to-noise ratio of 0. Weighting by the square of the gradient magnitude and the inverse distane to a entroid has the virtue of oneptual simpliity and, as shown in the main text and in the Supplemental Results, it allows aurate determination of ( x, y ). One ould alulate ( x, y ) and realulate the weights to input into a revised determination of the enter position; this method yields a negligible improvement in auray (not shown) at the expense of one omputational repetition. Smoothing A small but signifiant improvement in auray results from smoothing the array of slopes, { m }. Again, many approahes to smoothing are available; a simple one is to replae eah m with the average slope of the 3x3 pixel neighborhood entered on site. I illustrate the auray of image enter determination with and without this averaging below (Setion.1). Software Computer ode implementing the above algorithm for partile enter loalization, written in MATLAB, is provided as Supplementary Software, together with additional ode. Summary Equations provide analytially alulable expressions for the loation of the enter of an imaged radially symmetri partile. 9
10 10
11 Supplementary Results: Additional haraterizations of partile loalization auray Contents 1 Total error, bias, and preision The FluoroBanroft algorithm 3 Loalization auray for asymmetri images 4 Tests using experimental data 1 Total error, bias, and preision I ontinue here the disussion of auray illustrated by loalization tests on images with SNr=0, as in Fig. a. The total errors plotted in Fig. a have ontributions from the methods bias, i.e. the slope of the error graphs shown, and their preision, i.e. the satter about this slope (see Online Methods for formal definitions of these properties). Centroid finding shows high preision together with a large, well-nown bias that reports alulated enter positions as being loser to the image enter than the true partile enter loation (Supplementary Fig. 1a,b). Gaussian fitting and radial-symmetry-based traing show small biases. Smoothing As desribed in the Supplementary Note, I apply a smoothing of the gradient slope prior to the determination of the symmetry enter. Without smoothing of the loal slopes, the total error of the radial symmetry method is slightly larger, e.g px ompared to 0.07 px for the data at SNr=0 (Supplementary Fig. 1d), and the exeution time is about 0% shorter. This faster performane is inonsequential given the intrinsially very high speed of radial symmetry based traing, so all tests and implementation in this paper (exept that reported in Supplementary Fig. 1d) employ the smoothing of m over a 3px x 3px neighborhood. It is reasonable that this loal averaging of gradient slopes mitigates the effet of noise in the determination of the best-fit enter loation; I annot, however, provide a mathematially rigorous justifiation of the effet of smoothing on the algorithm s performane. Coordinate axis bias As noted in the main text, the errors plotted in Fig. a and Supplementary Fig. 1a,b, and d are derived from simulated images with true enters spanning x 0, y 0 [-0.5, 0.5] px, distributed throughout this two-dimensional spae. To examine any potential bias towards partiular oordinate axes, I plot in Fig. Sa the total error for x 0=y 0, i.e. true enters distributed along a line 45 degrees tilted from the x or y axes. The mean total errors are 0.08 px, px, and 0.06 px for radial symmetry traing, Gaussian NLLS fitting, and Gaussian MLE fitting, respetively, whih are nearly idential to those determined for x 0, y 0 distributed independently throughout [-0.5, 0.5] px. In addition, I plot in Fig. Sb the error in y versus the error in x, whih does not show any appreiable asymmetry. The two eigenvalues of the ovariane matrix of the x and y errors are similar to eah other for eah of the various traing methods: and for the radial symmetry method, and for Gaussian NLLS, and and for Gaussian MLE. The Pearson orrelation oeffiients for the x and y errors are , 0.014, and for radial symmetry traing, Gaussian NLLS fitting, and Gaussian MLE fitting, respetively. There appears to be no disernible bias with respet to oordinate axes. 11
12 Figure S. Traing auray for various partile loalization algorithms applied to simulated partile images with a signal-to-noise ratio of 0, in whih the true enters are distributed along the line x 0=y 0. (a) Traing auraies. The symbol r indiates the vetor between the alulated or true partile loation and the origin. (b) The error in the y oordinate of the partile enter versus the error in the x oordinate; there is no appreiable asymmetry. Correlations between methods The errors resulting from radial symmetry traing and Gaussian fitting of the same simulated image are strongly orrelated (Fig. S3), suggesting that both reflet the inherent auray with whih noisy images an be assessed. Figure S3. The total error for radial-symmetry-based traing and Gaussian fitting of the same simulated partiles, with Gaussian fitting performed using (a) nonlinear least squares minimization and (b) maximum lielihood estimation. For the same partile, the error obtained with eah of these loalization methods are highly orrelated. The FluoroBanroft algorithm I briefly omment on another analytially exat partile traing algorithm that has been reently proposed to be fast and aurate, the FluoroBanroft algorithm 14. The method requires as a parameter the standard deviation of the presumed Gaussian intensity distribution, given theoretially as: 1
13 0.6λ σ FB =, NA where the symbols are as defined in Setion 1. We an onsider different widths, parameterized as σ = fσ, with f = 1 giving the theoretial value. I plot in Fig. S4 the traing error and bias over a range FB of SNr for the FluoroBanroft algorithm with various f and for radial-symmetry-based traing. The FluoroBanroft algorithm gives very large error, arising from a large bias it is more aurate for partiles loated near the enter of a pixel, and less aurate for partiles farther away from the enter. This bias was not noted in Refs. 14 and 16, but has been desribed in more reent wor S. Also, we note that the traing error is strongly dependent on the value of σ hosen, with the lowest error arising from f = 1.5. Sine partile image widths are rarely exatly equal to theoretial values, and may vary from setup to setup, the strong dependene of traing error on the input width parameter is a signifiant onern. Both the FluoroBanroft and weighted linearized Gaussian methods 13 use the logarithm of intensity values to dedue properties of a Gaussian intensity funtion. Logarithmi saling reates nontrivial transformations of noise and baground values, however, easily overweighting noisy or baground pixels. In fat, the traing errors for the FluoroBanroft fits shown below assume zero baground; inorporating the atual baground level used in reating the simulated images results in greater error. Figure S4. The auray of traing simulated partiles using radial-symmetry-based traing and the FluoroBanroft algorithm for various values of f, inluding the theoretial value f=1. Eah point denotes the average error over 1,000 images. 3 Loalization auray for asymmetri images One an as how this radial-symmetry-based traing and symmetri Gaussian fitting deal in pratie with objets whose appearane is unintentionally asymmetri, for example due to optial aberrations. (Of ourse, for objets that have some nown, intrinsi asymmetry, one should fit partile images to an asymmetri model.) There are an infinite number of possible asymmetries, the ataloging of whih is beyond the sope of this paper, so as a simple illustration I examine simulated images for whih the point spread funtion is asymmetri, being expanded and ontrated by a fator of 1.5 in y and x, respetively. The auray of loalization of these images is examined over a range of SNr (Fig. S5). The radial-symmetrybased traing and Gaussian fitting methods are similar in their performane with respet to these images, and the overall auray is not dramatially worse than for symmetri images. 13
14 Figure S5. The auray of enter determination for simulated images of asymmetri spots. Eah point denotes the average of 100 simulated images, onstruted using an asymmetri point spread funtion saled by (1/1.5) and 1.5 in the x and y diretions, respetively. Inset: A simulated image with SNr=0. 4 Tests Using Experimental Data This setion ontinues the disussion of tests of partile loalization using experimental data begun in the main text. Soures of experimental data are desribed in Online Methods. Imaging the struture and dynamis of olloidal assemblies provides important insights into the material properties of self-assembled strutures. Confoal mirosopy of fluoresent miropartiles has enabled, for example, detailed haraterizations of rystalline growth S3 and non-equilibrium states S4. Supplementary Figs. 6a, show onfoal mirosopy slies of three-dimensional olloidal assemblies omposed of. and 1.1 µm diameter poly(methyl metharylate) (PMMA) and mirospheres, respetively (see Online Methods). The two-dimensional pair orrelation funtion g(r) averaged over eah slie of the data sets provides a simple derived quantity with whih to examine the traing output. These g(r) are plotted in Supplementary Figs. 6b,d, and are nearly idential for Gaussian fitting and radial-symmetry-based traing. The radial-symmetry-based results may show fewer artifatual signatures of partiles separated from other partiles by less than one partile diameter (Supplementary Fig. 6d). Traing the motions of fluorophore-onjugated proteins reveals mehanisms underlying a variety of ellular ativities. Supplementary Fig. 6e shows a fluoresene image of quantum dot labeled aetylholine reeptors in HEK 93 ells (see Online Methods), together with one example of the mean square displaement of a partile as a funtion of time (Supplementary Fig. 6f,g). Extrating the protein diffusion oeffiient from the trajetories of approximately 60 reeptors gives a mean value of 0.48 px /frame for the radial-symmetry-based traing and, nearly identially, 0.49 px /frame for the Gaussian-fit traing; the standard deviation aross all trajetories is ± 0.34 px /frame for both methods. The median differene between objet positions for the two methods is 0.09 px. 14
15 Supplementary Fig. 6h shows results derived from fluoresene images of five quantum dot labeled inesins traveling along mirotubules. Prior studies of these motor proteins have revealed disrete 8 nm stepping motions 1. Assessment of partile displaements using a student s t-test S5 gives the probability distribution of step sizes shown in Supplementary Fig. 6h, the first pea of whih is entered at 8.7 nm and 8.3 nm for the radial-symmetry-based and Gaussian-fit partile data, respetively. Referenes for Supplementary Notes and Results S1. Solomon, C. & Breon, T. Fundamentals of Digital Image Proessing: A Pratial Approah with Examples in Matlab. (John Wiley and Sons: 011). S. Shen, Z. & Andersson, S. B. Bias and Preision of the fluorobanroft Algorithm for Single Partile Loalization in Fluoresene Mirosopy. IEEE Transations on Signal Proessing 59, (011). S3. Ganapathy, R., Buley, M. R., Gerbode, S. J. & Cohen, I. Diret measurements of island growth and stepedge barriers in olloidal epitaxy. Siene 37, (010). S4. Wees, E. R., Croer, J. C., Levitt, A. C., Shofield, A. & Weitz, D. A. Three-dimensional diret imaging of strutural relaxation near the olloidal glass transition. Siene 87, (000). S5. Yardimi, H., van Duffelen, M., Mao, Y., Rosenfeld, S. S. & Selvin, P. R. The mitoti inesin CENP-E is a proessive transport motor. Pro. Natl. Aad. Si. U.S.A. 105, (008). 15
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 informationPlot-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 informationwith respect to the normal in each medium, respectively. The question is: How are θ
Prof. Raghuveer Parthasarathy University of Oregon Physis 35 Winter 8 3 R EFRACTION When light travels from one medium to another, it may hange diretion. This phenomenon familiar whenever we see the bent
More informationAbstract. 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 informationAnd, 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 informationNONLINEAR 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 informationLearning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract
CS 9 Projet Final Report: Learning Convention Propagation in BeerAdvoate Reviews from a etwork Perspetive Abstrat We look at the way onventions propagate between reviews on the BeerAdvoate dataset, and
More informationA {k, n}-secret Sharing Scheme for Color Images
A {k, n}-seret Sharing Sheme for Color Images Rastislav Luka, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos The Edward S. Rogers Sr. Dept. of Eletrial and Computer Engineering, University
More informationSupplementary Material: Geometric Calibration of Micro-Lens-Based Light-Field Cameras using Line Features
Supplementary Material: Geometri Calibration of Miro-Lens-Based Light-Field Cameras using Line Features Yunsu Bok, Hae-Gon Jeon and In So Kweon KAIST, Korea As the supplementary material, we provide detailed
More informationCalculation 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 informationA 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 informationSmooth 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 informationPipelined 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 informationFinding 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 informationThe Mathematics of Simple Ultrasonic 2-Dimensional Sensing
The Mathematis of Simple Ultrasoni -Dimensional Sensing President, Bitstream Tehnology The Mathematis of Simple Ultrasoni -Dimensional Sensing Introdution Our ompany, Bitstream Tehnology, has been developing
More informationWe P9 16 Eigenray Tracing in 3D Heterogeneous Media
We P9 Eigenray Traing in 3D Heterogeneous Media Z. Koren* (Emerson), I. Ravve (Emerson) Summary Conventional two-point ray traing in a general 3D heterogeneous medium is normally performed by a shooting
More informationRotation 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 informationDrawing 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 informationA 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 informationReading Object Code. A Visible/Z Lesson
Reading Objet Code A Visible/Z Lesson The Idea: When programming in a high-level language, we rarely have to think about the speifi ode that is generated for eah instrution by a ompiler. But as an assembly
More informationGraph-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 informationVideo 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 informationChromaticity-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 informationReading Object Code. A Visible/Z Lesson
Reading Objet Code A Visible/Z Lesson The Idea: When programming in a high-level language, we rarely have to think about the speifi ode that is generated for eah instrution by a ompiler. But as an assembly
More informationChemical, Biological and Radiological Hazard Assessment: A New Model of a Plume in a Complex Urban Environment
hemial, Biologial and Radiologial Haard Assessment: A New Model of a Plume in a omplex Urban Environment Skvortsov, A.T., P.D. Dawson, M.D. Roberts and R.M. Gailis HPP Division, Defene Siene and Tehnology
More informationPARAMETRIC SAR IMAGE FORMATION - A PROMISING APPROACH TO RESOLUTION-UNLIMITED IMAGING. Yesheng Gao, Kaizhi Wang, Xingzhao Liu
20th European Signal Proessing Conferene EUSIPCO 2012) Buharest, Romania, August 27-31, 2012 PARAMETRIC SAR IMAGE FORMATION - A PROMISING APPROACH TO RESOLUTION-UNLIMITED IMAGING Yesheng Gao, Kaizhi Wang,
More informationtimestamp, if silhouette(x, y) 0 0 if silhouette(x, y) = 0, mhi(x, y) = and mhi(x, y) < timestamp - duration mhi(x, y), else
3rd International Conferene on Multimedia Tehnolog(ICMT 013) An Effiient Moving Target Traking Strateg Based on OpenCV and CAMShift Theor Dongu Li 1 Abstrat Image movement involved bakground movement and
More informationSemi-Supervised Affinity Propagation with Instance-Level Constraints
Semi-Supervised Affinity Propagation with Instane-Level Constraints Inmar E. Givoni, Brendan J. Frey Probabilisti and Statistial Inferene Group University of Toronto 10 King s College Road, Toronto, Ontario,
More informationDirected Rectangle-Visibility Graphs have. Abstract. Visibility representations of graphs map vertices to sets in Euclidean space and
Direted Retangle-Visibility Graphs have Unbounded Dimension Kathleen Romanik DIMACS Center for Disrete Mathematis and Theoretial Computer Siene Rutgers, The State University of New Jersey P.O. Box 1179,
More informationFOREGROUND OBJECT EXTRACTION USING FUZZY C MEANS WITH BIT-PLANE SLICING AND OPTICAL FLOW
FOREGROUND OBJECT EXTRACTION USING FUZZY C EANS WITH BIT-PLANE SLICING AND OPTICAL FLOW SIVAGAI., REVATHI.T, JEGANATHAN.L 3 APSG, SCSE, VIT University, Chennai, India JRF, DST, Dehi, India. 3 Professor,
More informationGray Codes for Reflectable Languages
Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings
More informationChapter 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 informationMATH 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 informationDetection 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 informationIntroduction 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 informationCluster-Based Cumulative Ensembles
Cluster-Based Cumulative Ensembles Hanan G. Ayad and Mohamed S. Kamel Pattern Analysis and Mahine Intelligene Lab, Eletrial and Computer Engineering, University of Waterloo, Waterloo, Ontario N2L 3G1,
More informationMeasurement 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 informationRelevance for Computer Vision
The Geometry of ROC Spae: Understanding Mahine Learning Metris through ROC Isometris, by Peter A. Flah International Conferene on Mahine Learning (ICML-23) http://www.s.bris.a.uk/publiations/papers/74.pdf
More informationSelf-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 informationOrientation of the coordinate system
Orientation of the oordinate system Right-handed oordinate system: -axis by a positive, around the -axis. The -axis is mapped to the i.e., antilokwise, rotation of The -axis is mapped to the -axis by a
More information特集 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 informationUsing Augmented Measurements to Improve the Convergence of ICP
Using Augmented Measurements to Improve the onvergene of IP Jaopo Serafin, Giorgio Grisetti Dept. of omputer, ontrol and Management Engineering, Sapienza University of Rome, Via Ariosto 25, I-0085, Rome,
More informationOn - 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 informationNaïve Bayesian Rough Sets Under Fuzziness
IJMSA: Vol. 6, No. 1-2, January-June 2012, pp. 19 25 Serials Publiations ISSN: 0973-6786 Naïve ayesian Rough Sets Under Fuzziness G. GANSAN 1,. KRISHNAVNI 2 T. HYMAVATHI 3 1,2,3 Department of Mathematis,
More informationKERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION
KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION Cuiui Kang 1, Shengai Liao, Shiming Xiang 1, Chunhong Pan 1 1 National Laboratory of Pattern Reognition, Institute of Automation, Chinese
More informationAccurate Partial Volume Estimation of MR Brain Tissues
Aurate Partial Volume Estimation of MR Brain Tissues Author Liew, Alan Wee-Chung, Yan, Hong Published 005 Conferene Title Proeedings of the Asia-Paifi Worshop on Visual Image Proessing Copyright Statement
More informationASSESSMENT OF TWO CHEAP CLOSE-RANGE FEATURE EXTRACTION SYSTEMS
ASSESSMENT OF TWO CHEAP CLOSE-RANGE FEATURE EXTRACTION SYSTEMS Ahmed Elaksher a, Mohammed Elghazali b, Ashraf Sayed b, and Yasser Elmanadilli b a Shool of Civil Engineering, Purdue University, West Lafayette,
More informationExtracting 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 informationthe data. Structured Principal Component Analysis (SPCA)
Strutured Prinipal Component Analysis Kristin M. Branson and Sameer Agarwal Department of Computer Siene and Engineering University of California, San Diego La Jolla, CA 9193-114 Abstrat Many tasks involving
More informationModeling of Wire Electrochemical Machining
A publiation of 91 CHEMICAL ENGINEERING TRANSACTIONS VOL. 41, 214 Guest Editors: Simonetta Palmas, Mihele Masia, Annalisa Vaa Copyright 214, AIDIC Servizi S.r.l., ISBN 978-88-9568-32-7; ISSN 2283-9216
More informationFigure 1. LBP in the field of texture analysis operators.
L MEHODOLOGY he loal inary pattern (L) texture analysis operator is defined as a gray-sale invariant texture measure, derived from a general definition of texture in a loal neighorhood. he urrent form
More informationAutomatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)
Automati Physial Design Tuning: Workload as a Sequene Sanjay Agrawal Mirosoft Researh One Mirosoft Way Redmond, WA, USA +1-(425) 75-357 sagrawal@mirosoft.om Eri Chu * Computer Sienes Department University
More informationTrajectory Tracking Control for A Wheeled Mobile Robot Using Fuzzy Logic Controller
Trajetory Traking Control for A Wheeled Mobile Robot Using Fuzzy Logi Controller K N FARESS 1 M T EL HAGRY 1 A A EL KOSY 2 1 Eletronis researh institute, Cairo, Egypt 2 Faulty of Engineering, Cairo University,
More informationParticle Swarm Optimization for the Design of High Diffraction Efficient Holographic Grating
Original Artile Partile Swarm Optimization for the Design of High Diffration Effiient Holographi Grating A.K. Tripathy 1, S.K. Das, M. Sundaray 3 and S.K. Tripathy* 4 1, Department of Computer Siene, Berhampur
More informationA Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks
A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks Abouberine Ould Cheikhna Department of Computer Siene University of Piardie Jules Verne 80039 Amiens Frane Ould.heikhna.abouberine @u-piardie.fr
More informationFUZZY 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 informationComparing Images Under Variable Illumination
( This paper appeared in CVPR 8. IEEE ) Comparing Images Under Variable Illumination David W. Jaobs Peter N. Belhumeur Ronen Basri NEC Researh Institute Center for Computational Vision and Control The
More informationTransition Detection Using Hilbert Transform and Texture Features
Amerian Journal of Signal Proessing 1, (): 35-4 DOI: 1.593/.asp.1.6 Transition Detetion Using Hilbert Transform and Texture Features G. G. Lashmi Priya *, S. Domni Department of Computer Appliations, National
More informationSimulation 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 informationImproving the Perceptual Uniformity of a Gloss Space
Improving the Pereptual Uniformity of a Gloss Spae Adria Fores, 1 Mark D. Fairhild, 1 Ingeborg Tastl 2 1 Munsell Color Siene Laboratory, Rohester Institute of Tehnology 2 Hewlett-Pakard Laboratories Abstrat
More informationImproved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules
Improved Vehile Classifiation in Long Traffi Video by Cooperating Traker and Classifier Modules Brendan Morris and Mohan Trivedi University of California, San Diego San Diego, CA 92093 {b1morris, trivedi}@usd.edu
More informationColouring contact graphs of squares and rectilinear polygons de Berg, M.T.; Markovic, A.; Woeginger, G.
Colouring ontat graphs of squares and retilinear polygons de Berg, M.T.; Markovi, A.; Woeginger, G. Published in: nd European Workshop on Computational Geometry (EuroCG 06), 0 Marh - April, Lugano, Switzerland
More informationrepresent = as a finite deimal" either in base 0 or in base. We an imagine that the omputer first omputes the mathematial = then rounds the result to
Sientifi Computing Chapter I Computer Arithmeti Jonathan Goodman Courant Institute of Mathemaial Sienes Last revised January, 00 Introdution One of the many soures of error in sientifi omputing is inexat
More informationLight Scattering by Individual and Groups of Spheroidal Particles
Light Sattering by Individual and Groups of Spheroidal Partiles Diploma paper by Peter Alsholm Lund Reports on Atomi Physis, LRAP-200 Lund, August 1996 Abstrat In order to simulate the light propagation
More informationHello neighbor: accurate object retrieval with k-reciprocal nearest neighbors
Hello neighbor: aurate objet retrieval with -reiproal nearest neighbors Danfeng Qin Stephan Gammeter Luas Bossard Till Qua,2 Lu van Gool,3 ETH Zürih 2 Kooaba AG 3 K.U. Leuven {ind,gammeter,bossard,tua,vangool}@vision.ee.ethz.h
More informationDetecting Moving Targets in Clutter in Airborne SAR via Keystoning and Multiple Phase Center Interferometry
Deteting Moving Targets in Clutter in Airborne SAR via Keystoning and Multiple Phase Center Interferometry D. M. Zasada, P. K. Sanyal The MITRE Corp., 6 Eletroni Parkway, Rome, NY 134 (dmzasada, psanyal)@mitre.org
More informationThe 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 informationTime delay estimation of reverberant meeting speech: on the use of multichannel linear prediction
University of Wollongong Researh Online Faulty of Informatis - apers (Arhive) Faulty of Engineering and Information Sienes 7 Time delay estimation of reverberant meeting speeh: on the use of multihannel
More informationCOMBINATION OF INTERSECTION- AND SWEPT-BASED METHODS FOR SINGLE-MATERIAL REMAP
Combination of intersetion- and swept-based methods for single-material remap 11th World Congress on Computational Mehanis WCCM XI) 5th European Conferene on Computational Mehanis ECCM V) 6th European
More informationAn Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index
IJCSES International Journal of Computer Sienes and Engineering Systems, ol., No.4, Otober 2007 CSES International 2007 ISSN 0973-4406 253 An Optimized Approah on Applying Geneti Algorithm to Adaptive
More informationICCGLU. 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 informationAccommodations of QoS DiffServ Over IP and MPLS Networks
Aommodations of QoS DiffServ Over IP and MPLS Networks Abdullah AlWehaibi, Anjali Agarwal, Mihael Kadoh and Ahmed ElHakeem Department of Eletrial and Computer Department de Genie Eletrique Engineering
More informationCluster Centric Fuzzy Modeling
10.1109/TFUZZ.014.300134, IEEE Transations on Fuzzy Systems TFS-013-0379.R1 1 Cluster Centri Fuzzy Modeling Witold Pedryz, Fellow, IEEE, and Hesam Izakian, Student Member, IEEE Abstrat In this study, we
More informationDr.Hazeem Al-Khafaji Dept. of Computer Science, Thi-Qar University, College of Science, Iraq
Volume 4 Issue 6 June 014 ISSN: 77 18X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om Medial Image Compression using
More informationA 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 information1. 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 informationQuery Evaluation Overview. Query Optimization: Chap. 15. Evaluation Example. Cost Estimation. Query Blocks. Query Blocks
Query Evaluation Overview Query Optimization: Chap. 15 CS634 Leture 12 SQL query first translated to relational algebra (RA) Atually, some additional operators needed for SQL Tree of RA operators, with
More informationDiscrete sequential models and CRFs. 1 Case Study: Supervised Part-of-Speech Tagging
0-708: Probabilisti Graphial Models 0-708, Spring 204 Disrete sequential models and CRFs Leturer: Eri P. Xing Sribes: Pankesh Bamotra, Xuanhong Li Case Study: Supervised Part-of-Speeh Tagging The supervised
More informationDetecting Outliers in High-Dimensional Datasets with Mixed Attributes
Deteting Outliers in High-Dimensional Datasets with Mixed Attributes A. Koufakou, M. Georgiopoulos, and G.C. Anagnostopoulos 2 Shool of EECS, University of Central Florida, Orlando, FL, USA 2 Dept. of
More informationColor Image Fusion for Concealed Weapon Detection
In: E.M. Carapezza (Ed.), Sensors, and ommand, ontrol, ommuniations, and intelligene (C3I) tehnologies for homeland defense and law enforement II, SPIE-571 (pp. 372-379). Bellingham, WA., USA: The International
More informationNew Fuzzy Object Segmentation Algorithm for Video Sequences *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 521-537 (2008) New Fuzzy Obet Segmentation Algorithm for Video Sequenes * KUO-LIANG CHUNG, SHIH-WEI YU, HSUEH-JU YEH, YONG-HUAI HUANG AND TA-JEN YAO Department
More informationCoupling of MASH-MORSE Adjoint Leakages with Spaceand Time-Dependent Plume Radiation Sources
ORNL/TM-2000/335 oupling of MASH-MORSE Adjoint Leakages with Spaeand Time-Dependent Plume Radiation Soures. O. Slater J. M. Barnes J. O. Johnson J. P. Renier R. T. Santoro DOUMENT AVAILABILITY Reports
More informationDetection of RF interference to GPS using day-to-day C/No differences
1 International Symposium on GPS/GSS Otober 6-8, 1. Detetion of RF interferene to GPS using day-to-day /o differenes Ryan J. R. Thompson 1#, Jinghui Wu #, Asghar Tabatabaei Balaei 3^, and Andrew G. Dempster
More informationarxiv: v1 [cs.gr] 10 Apr 2015
REAL-TIME TOOL FOR AFFINE TRANSFORMATIONS OF TWO DIMENSIONAL IFS FRACTALS ELENA HADZIEVA AND MARIJA SHUMINOSKA arxiv:1504.02744v1 s.gr 10 Apr 2015 Abstrat. This work introdues a novel tool for interative,
More informationSuperpixel Tracking. School of Information and Communication Engineering, Dalian University of Technology, China 2
Superpixel Traking Shu Wang1, Huhuan Lu1, Fan Yang1, and Ming-Hsuan Yang2 1 Shool of Information and Communiation Engineering, Dalian University of Tehnology, China 2 Eletrial Engineering and Computer
More informationTotal 100
CS331 SOLUTION Problem # Points 1 10 2 15 3 25 4 20 5 15 6 15 Total 100 1. ssume you are dealing with a ompiler for a Java-like language. For eah of the following errors, irle whih phase would normally
More informationINTERPOLATED AND WARPED 2-D DIGITAL WAVEGUIDE MESH ALGORITHMS
Proeedings of the COST G-6 Conferene on Digital Audio Effets (DAFX-), Verona, Italy, Deember 7-9, INTERPOLATED AND WARPED -D DIGITAL WAVEGUIDE MESH ALGORITHMS Vesa Välimäki Lab. of Aoustis and Audio Signal
More informationUnsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks
Unsupervised Stereosopi Video Objet Segmentation Based on Ative Contours and Retrainable Neural Networks KLIMIS NTALIANIS, ANASTASIOS DOULAMIS, and NIKOLAOS DOULAMIS National Tehnial University of Athens
More informationA Novel Bit Level Time Series Representation with Implication of Similarity Search and Clustering
A Novel Bit Level Time Series Representation with Impliation of Similarity Searh and lustering hotirat Ratanamahatana, Eamonn Keogh, Anthony J. Bagnall 2, and Stefano Lonardi Dept. of omputer Siene & Engineering,
More informationC 2 C 3 C 1 M S. f e. e f (3,0) (0,1) (2,0) (-1,1) (1,0) (-1,0) (1,-1) (0,-1) (-2,0) (-3,0) (0,-2)
SPECIAL ISSUE OF IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION: MULTI-ROBOT SSTEMS, 00 Distributed reonfiguration of hexagonal metamorphi robots Jennifer E. Walter, Jennifer L. Welh, and Nany M. Amato Abstrat
More informationSEGMENTATION OF IMAGERY USING NETWORK SNAKES
SEGMENTATION OF IMAGERY USING NETWORK SNAKES Matthias Butenuth Institute of Photogrammetry and GeoInformation, Leibniz Universität Hannover Nienburger Str. 1, 30167 Hannover, Germany butenuth@ipi.uni-hannover.de
More informationALPHA-TRIMMED MEAN RADIAL BASIS FUNCTIONS AND THEIR APPLICATION IN OBJECT MODELING
ALPHA-TRIMMED MEAN RADIAL BASIS FUNCTIONS AND THEIR APPLICATION IN OBJECT MODELING Adrian G. Boq Ioannis Pitas Department University Thessaloniki of Informatis of Thessaloniki 54006, Greee ABSTRACT In
More informationYear 11 GCSE Revision - Re-visit work
Week beginning 6 th 13 th 20 th HALF TERM 27th Topis for revision Fators, multiples and primes Indies Frations, Perentages, Deimals Rounding 6 th Marh Ratio Year 11 GCSE Revision - Re-visit work Understand
More informationHEXA: Compact Data Structures for Faster Packet Processing
Washington University in St. Louis Washington University Open Sholarship All Computer Siene and Engineering Researh Computer Siene and Engineering Report Number: 27-26 27 HEXA: Compat Data Strutures for
More informationCleanUp: 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 informationAn Automatic Laser Scanning System for Accurate 3D Reconstruction of Indoor Scenes
An Automati Laser Sanning System for Aurate 3D Reonstrution of Indoor Senes Danrong Li, Honglong Zhang, and Zhan Song Shenzhen Institutes of Advaned Tehnology Chinese Aademy of Sienes Shenzhen, Guangdong
More informationFlow Demands Oriented Node Placement in Multi-Hop Wireless Networks
Flow Demands Oriented Node Plaement in Multi-Hop Wireless Networks Zimu Yuan Institute of Computing Tehnology, CAS, China {zimu.yuan}@gmail.om arxiv:153.8396v1 [s.ni] 29 Mar 215 Abstrat In multi-hop wireless
More informationBSPLND, A B-Spline N-Dimensional Package for Scattered Data Interpolation
BSPLND, A B-Spline N-Dimensional Pakage for Sattered Data Interpolation Mihael P. Weis Traker Business Systems 85 Terminal Drive, Suite Rihland, WA 995-59-946-544 mike@vidian.net Robert R. Lewis Washington
More informationHIGHER ORDER full-wave three-dimensional (3-D) large-domain techniques in
FACTA UNIVERSITATIS (NIŠ) SER.: ELEC. ENERG. vol. 21, no. 2, August 2008, 209-220 Comparison of Higher Order FEM and MoM/SIE Approahes in Analyses of Closed- and Open-Region Eletromagneti Problems Milan
More informationBENDING STIFFNESS AND DYNAMIC CHARACTERISTICS OF A ROTOR WITH SPLINE JOINTS
Proeedings of ASME 0 International Mehanial Engineering Congress & Exposition IMECE0 November 5-, 0, San Diego, CA IMECE0-6657 BENDING STIFFNESS AND DYNAMIC CHARACTERISTICS OF A ROTOR WITH SPLINE JOINTS
More information