Image Registration via Particle Movement
|
|
- Beryl Bates
- 5 years ago
- Views:
Transcription
1 Image Registration via Particle Movement Zao Yi and Justin Wan Abstract Toug fluid model offers a good approac to nonrigid registration wit large deformations, it suffers from te blurring artifacts introduced by te viscosity term. To overcome tis drawback, we present an inviscid model expressed in a particle framework. Our idea is to simulate te template image as a set of particles moving towards te target positions. Te proposed model can accommodate bot small and large deformations wit sarp edges and reasonable displacement maps acieved. Because of its simplicity, te computational cost is muc smaller tan oter nonrigid registration approaces. 1 INTRODUCTION Image registration requires aligning an image pair wit an optimal transformation. It as many potential applications for diagnosing in te clinic, and is an often encountered problem in various fields especially in medical surgery. It is well known tat biological structures suc as uman brains, altoug may contain te same global structures, differ in sape, orientation, and fine structures across individuals and at different times. To represent suc variabilities, nonrigid transformation as more applications [10]. Numerous algoritms ave been explored in tis area, owever, more accurate and efficient metods are still needed. Broit [3] was te first to study nonrigid registration problems using pysically based models. In is approac te transformation process was modeled by deformations of an elastic solid. Tis approac was extended by Bajcsy et al. [1] and various variational forms [4, 8] were proposed later. Since te deformation energy caused by stress increases proportionally wit te strengt of te deformation, elastic models can only accommodate locally small deformations. To overcome tis drawback, Cristensen et al. [6] proposed anoter approac wic modeled te transformation process by a viscous fluid flow. Fluid models can allow relatively larger local deformations; owever, te inerent viscosity introduces an unnegligible blurring effect to te transformed image. Also, te reported [2, 12] computational time is very large. Te models discussed above are all pysically based models, wic try to simulate te deformation as a pysical process. Since te viscosity term in te fluid equation causes blurring as well as complicating computation, we propose to use an inviscid model. Instead of regarding te template image as a fluid continuum wit viscous interaction, we 1
2 simulate te transformation process as a set of particles moving towards target positions. It is similar to te framework of gas dynamics [9] were distances between gas molecules are big enoug tat internal friction can be neglected and eac molecule can be viewed as a separate particle. Particles are by far te easiest objects to simulate. Despite teir simplicity, particles can be made to exibit a wide range of interesting beaviors. For example, in grapics [7] a variety of nonrigid structures can be built by connecting particles wit simple damped springs. However, te particle approac as never been used in image registration area. Based on te pysical beavior of particles, we present a novel registration tecnique expressed in a particle framework. Te basic idea is to simulate te template image as particles moving towards te target image under external forces. Lagrangian reference frame is often used to observe te movement of particles. However, it needs to track individual particle and is arder to apply. As time varies, initially equally-sized particles may become unevenly distributed wic can cause problems of stability and accuracy. Assuming tere are enoug particles moving around, we can fit Eulerian reference frame to te particle registration framework. Te resulting partial differential equations are nonlinear yperbolic equations of vector form wose solution describes te coordinate transformation between te template and te target images. Tey can be numerically solved using finite difference metod. Te proposed particle registration tecnique is quite simple and efficient. Since it can be viewed as an inviscid gas model wit constant pressure, te blurring artifacts caused by fluid viscosity are overcome and large deformation can be accommodated. Also, because of its simplicity in simulation, total computational cost is decreased. Tus, te particle registration tecnique can acieve a small/large transformed image wit sarp edges and reasonable displacement map in less time. We ave successfully applied te particle model to medical image datasets yielding fast and accurate registrations. A relevant approac was te level-set registration tecnique proposed by Vemuri el al. [11]. As an inviscid model, teir approac was derived from curve evolution teory wic ad different settings and governing equations, and tus could not be regarded as a particle framework. Te rest of te paper is organized as follows. Section 2 contains an overview of te particle model, followed by te proposed formulation of te image registration problem. Section 3 presents some modifications of te model regarding robustness and stability, and gives te wole numerical algoritm for solving te consequent equations. Section 4 sows experimental results of tis approac on 2D sytetic/real images. Finally, conclusions are drawn in Section 5. 2 METHODOLOGY We define te template image as I 1 (x) and te target image as I 2 (x), were 0 I 1 (x), I 2 (x) 1, and x Ω is te image region. Te purpose of image registration is to determine a coordinate transformation r(x) of I 1 (x) onto I 2 (x) 2
3 suc tat te difference between te transformed template image I 1 (x r(x)) and te target image I 2 (x) will be small in some measure M. Terefore te registration can also be stated as a minimization problem min M(I 1(x), I 2 (x), r(x)). (1) r(x) Here we use a Gaussian sensor model [5] to induce te matcing criteria: M(I 1 (x), I 2 (x), r(x, t)) = α I 1 (x r(x, t)) I 2 (x) 2 dx, (2) 2 Ω were α is a parameter. We consider te template image as a set of particles, eac wit mass m, position x, velocity u, displacement r, and responding to force. Te image deformation process is simulated as te particles moving towards te target positions. Te total number of particles is assumed to be big enoug suc tat at anytime tere is a particle passing troug eac observation point. Tus, we can use Eulerian reference frame for simulation. Te image region Ω is discretized into a fixed grid and motion of particles is controlled in eac cell. Te velocity field u(x) and te displacement field r(x) are bot defined based on current positions of particles. A particle at position x at time t originated at position x r(x, t). Te movement of a particle is governed by Newton s Law of Motion. If we assume tat tere is no internal interaction between particles, te conservation of momentum equation can be written as m du dt = f, (3) were f is te external force applied to tat particle and will be defined later by information from te template and te target images, m is te mass of eac particle wic is assumed to be a constant ere, u is te consequent velocity wic describes te speed of image deformation, and t is te time. In an Eulerian framework, we ave te following relationsip between total derivative and partial derivative of velocity wit respect to time du dt = u + (u )u, (4) t were is te gradient operator. Tus, equation (3) can be rewritten as m u t + m(u )u = f. (5) Te left side represents te force of inertia, i.e., te mass times te acceleration of a particle. Equation (5) neglects internal friction and terefore is an inviscid model. It is similar to te Euler equation commonly used in gas dynamics (te study of compressible but inviscid fluids) ρ u t + ρ(u )u + p = f, (6) 3
4 were ρ is te density or unit mass, and p is te pressure. For isotermal gas wit constant density, p is neglected and equation (6) becomes equation (5). Since velocity is te total derivative of displacement wit respect to time, te velocity field and te displacement field are related by u(x, t) = dr(x, t) dt = r(x, t) t + r(x, t)u(x, t). (7) Te force field f(x, r(x)) is used to drive te particles from image I 1 (x) to image I 2 (x). It is defined as te derivative of te matcing criteria M on te image pair. Taking te variation of equation (2) wit respect to displacement, r(x, t), gives te force field f(x, r(x, t)) = α (I 1 (x r(x, t)) I 2 (x)) I 1 (x r(x, t)). (8) Since te movement of particles sould only slow down wen te difference term I 1 (x r(x, t)) I 2 (x) becomes smaller, we need to normalize te gradient term in te force field. Terefore we coose α = α I 1 suc tat equation (8) becomes f(x, r(x, t)) = α(i 1 (x r(x, t)) I 2 (x)) I 1(x r(x, t)) I 1 (x r(x, t)). (9) 3 IMPLEMENTATION Solution of te particle registration problem requires solving te following PDEs u(x, t) f(x, r(x, t)) = (u )u(x, t), t m r(x, t) = u(x, t) r(x, t)u(x, t), t f(x, t) = α(i 1 (x r(x, t)) I 2 (x)) I 1(x r(x, t)) I 1 (x r(x, t)), wic include nonlinearity introduced by te external force and te kinematic derivatives. Two issues arise in calculating te external force field. Te first is te undetermination of external force wen I 1 (x r(x, t)) equals to zero. To make our model more robust, we apply an additive external force definition in tat case: f(x, r(x, t)) = 0. (10) Te second is te computation of gradient I 1 (x r(x, t)). Since te gradient operator is sensitive to te noise in te image, we convolve I 1 (x r(x, t)) wit a Gaussian kernel prior to te gradient computation. Tus (9) and (10) become { 0, if (Gσ I(x, t)) = 0; f(x, r(x, t)) = α(i(x, t) I 2 (x)) (Gσ I(x,t)) (G σ I(x,t)), oterwise; (11) 4
5 were I(x, t) = I 1 (x r(x, t)) denotes te deformed template image at time t, G σ denotes te Gaussian kernel wit standard deviation of σ, and is te convolution operator. To update movement of particles troug time, we discretize time domain [0, + ] into small intervals 0 = t 0 < t 1 <... < t n < t n+1 <... and apply Euler explicit integration over time. Te discretized time formula is given by were u n+1 (x) = u n (x) + t m f n (x), r n+1 (x) = r n (x) + t(i r n (x))u n (x), (12) u n+1 (x) u(x, t n+1 ) is te approximation of velocity field at time t n+1, r n+1 (x) r(x, t n+1 ) is te approximation of displacement field at time t n+1, t = t n+1 t n is te time interval. We require te Jacobian J = I r n [6] greater tan zero in order to obtain a regular transformation. Te complete algoritm for solving te particle registration problem consequently becomes 1. Initialize u 0 (x) = 0 and r 0 (x) = Calculate te external force f n (x) at time t n using equation (11). 3. If f n (x) is below a stopping criteria for all x or te maximum number of iterations is reaced, STOP. 4. Perform Euler explicit integration using equation (12) at time t n. 5. If te Jacobian J = I r n (x) is less tan 0.1, regrid te template. 6. n = n + 1, GOTO step 2. Te remaining question is ow to perform steps 2, 4, and 5 in discretized space domain. Note tat tey all ave gradient computation included. We coose minmod finite difference sceme since it is known to preserve local max/min and yield acceptable accuracy. Te minmod function [11] is defined as { sign(x) min( x, y ), if xy > 0; minmod(x, y) = (13) 0, if xy 0; and consequently te gradient is computed by [ minmod(d F (x, y) = x F, D x + F ) minmod(dy F, D y + F ) ], (14) were F (x, y) is any 2D function, D x +, Dx, and D y +, Dy are standard forward and backward difference operators in te x and y directions, respectively. 5
6 To update movement of particles troug space, we discretize space domain Ω into small cells/pixels. Eac particle is initially located at te center of te cell/pixel wit position x ij = (x i, y j ) and grid spacing. Applying minmod finite difference over space, we obtain te discretized time discretized space formula fij n = α(in ij I 2,ij) minmod( I n ij In i 1,j minmod( In ij In i 1,j gij n = α(in ij I 2,ij) minmod( I ij I i,j 1 u n+1 v n+1 ij = u n ij + tf ij n, ij = vij n + tgn ij, r n+1 ij s n+1 ij were minmod( In ij In i,j 1 = r n ij + t((1 minmod( rn ij rn i 1,j = s n ij + t((1 minmod( sn ij sn i,j 1, In i+1,j In ij ), In i+1,j In ij ), I i,j+1 I ij ), In i,j+1 In ij ),,, rn i+1,j rn ij, sn i,j+1 sn ij ))u n ij minmod( rn ij rn i,j 1, rn i,j+1 rn ij ))v n ij minmod( sn ij sn i 1,j )vij n ),, sn i+1,j sn ij )u n ij ), (fij n, gn ij ) f(x ij, r(x ij, t n )) is te approximation of force at position x ij time t n, (u n+1 ij, v n+1 ij ) u(x ij, t n+1 ) is te approximation of velocity at position x ij time t n+1, (r n+1 ij, s n+1 ij ) r(x ij, t n+1 ) is te approximation of displacement at position x ij time t n+1, t = t n+1 t n is te time interval, Iij n = G σ I 1,xi rij n,y j s n is te smooted deformed template. ij Te discretization is easily extendable to 3D. 4 RESULTS Te proposed approac is implemented in C and executed at a desktop PC of P4 2.8GHZ wit 1GB memory. Te parameters are set to m = 1, α = 100, and te stopping criteria is set to We ave applied te proposed algoritm to tree experiments. Four sets of images are presented for eac registration: 1. template image; 2. target image; 3. transformed image after registration; 4. difference image between transformed image and target image. Te computational cost for eac experiment is summarized in Table 1. Te first experiment is designed to demonstrate tat our model can accommodate large deformation like fluid algoritm as well as acieving a reasonable displacement map. Te test data is a syntetic image wit size pixels wic is similar to te image used by [6]. Te results are sown in Figure 1 wit comparison to fluid model. It is wat we desire tat te transformed image Time(s) experiment 1 experiment 2 experiment 3 Fluid Proposed Table 1: computational cost for eac experiment 6
7 Figure 1: qualitative results of experiment 1. From left to rigt, top to bottom: (a)template image; (b)target image; (c)transformed image obtained by fluid model; (d)difference image between (b) and (c); (e)transformed image obtained by proposed model; (f)difference image between (b) and (f); (g)displacement map obtained by fluid model; ()displacement map obtained by proposed model. obtain by proposed model is almost te same as te target, and te difference image is better tan tat obtained by fluid model. Besides te four sets of images mentioned above, we include displacement map as well. For proposed model, it is largely curved from a small patc of letter C to te wole letter C, and anywere else is zero. Tis contrasts wit te displacement map obtained by fluid model were background field also as nonzero displacements. Te second experiment is designed to demonstrate tat our model can overcome te blurring drawback of fluid approac. Te test data is a syntetic image wit size pixels wic is similar to te image used by [12]. Te results are sown in Figure 2 wit comparison to fluid model. Again we include displacement map in addition to te four sets of images mentioned above. From comparison we can see clearly tat te difference image obtained by fluid model is more blurry tan tat obtained by te proposed model. Tus, we demonstrate tat our model acieves a transformed image wit clearer texture tan te fluid approac. 7
8 Figure 2: qualitative results of experiment 2. From left to rigt, top to bottom: (a)template image; (b)target image; (c)transformed image obtained by fluid model; (d)difference image between (b) and (c); (e)transformed image obtained by proposed model; (f)difference image between (b) and (f); (g)displacement map obtained by fluid model; ()displacement map obtained by proposed model. 8
9 Figure 3: qualitative results of experiment 3. From left to rigt, top to bottom: (a)template image; (b)target image; (c)transformed image obtained by fluid model; (d)difference image between (b) and (c); (e)transformed image obtained by proposed model; (f)difference image between (b) and (f). Te tird experiment is designed to demonstrate tat our model can capture complex deformations in medical images. Te test data is an MRI image of uman brain wit size pixels. Te results are sown in Figure 3. Te registration as successfully transformed te template image towards te target image, and te transformed image persists sarp edges. To furter assess te quality of te registration in te above experiments, mean and variance of te squared sum of intensity difference (SSD), and correlation coefficient (CC) ave been calculated and are listed in tables 2. 5 CONCLUSIONS In tis paper we present a novel registration tecnique expressed in a particle framework. It is an inviscid model designed for nonrigid registration problems. Te key features of our model are (a) it can accommodate bot small and large deformations, (b) it overcomes te blurring drawback of fluid models and acieves transformed images wit clear textures and sarp edges, (c) it is very simple and fast. We ave demonstrated te performance of our approac on a variety of images including syntetic and real data. Te results of experiments are desiring and satisfying. Future efforts will be made to explore more complicated simulation frameworks were internal interaction is added to particle systems. 9
10 References Experiment 1 Mean(SSD) Var(SSD) CC No registration Fluid Proposed Experiment 2 Mean(SSD) Var(SSD) CC No registration Fluid Proposed Experiment 3 Mean(SSD) Var(SSD) CC No registration Fluid Proposed Table 2: qualitative measure for 3 experiments [1] R. Bajcsy and S. Kovacic. Multiresolution elastic matcing. Computer Vision, Grapics, and Image Processing, 46:1 21, [2] M. Bro-Nielsen and C. Gramkow. Fast fluid registration of medical images. In Proc. Visualization in Biomedical Computing, pages , [3] C. Broit. Optimal registration of deformed images. PD tesis, University of Pennsylvania, [4] G.E. Cristensen, S.C. Josi, and M.I. Miller. Volumetric transformation of brain anatomy. IEEE Trans. Medical Imaging, 16: , [5] G.E. Cristensen, R.D. Rabbitt, and M.I. Miller. A deformable neuroanatomy textbook based on viscous fluid mecanics. In Proc. Information Science and Systems, pages , [6] G.E. Cristensen, R.D. Rabbitt, and M.I. Miller. Deformable templates using large deformation kinematics. IEEE Trans. Image Processing, 5: , [7] S. Clavet, P. Beaudoin, and P. Poulin. Particle-based viscoelastic fluid simulation. Eurograpics/ACM SIGGRAPH Symp. Computer Animation, To appear. [8] C. Davatzikos. Spatial transformation and registration of brain images using elastically deformable models. Computer Vision and Image Understanding, 66: , [9] L.D. Landau and E.M. Lifsitz. Fluid Mecanics. Pergamon,
11 [10] D. Ruecert. Nonrigid registration: tecniques and applications. Medical Image Registration, 13: , [11] B.C. Vemuri, J. Ye, Y. Cen, and C.M. Leonard. Image registration via level-set motion: applications to atlas-based segmentation. IEEE Trans. Medical Image Analysis, 7:1 20, [12] G. Wollny and F. Kruggel. Computational cost of nonrigid registration algoritms based on fluid dynamics. IEEE Trans. Medical Imaging, 21: ,
Viscoelastic Registration of Medical Images
Viscoelastic Registration of Medical Images Zhao Yi Justin Wan Abstract Since the physical behavior of many tissues is shown to be viscoelastic, we propose a novel registration technique for medical images
More informationNumerical Derivatives
Lab 15 Numerical Derivatives Lab Objective: Understand and implement finite difference approximations of te derivative in single and multiple dimensions. Evaluate te accuracy of tese approximations. Ten
More information2.8 The derivative as a function
CHAPTER 2. LIMITS 56 2.8 Te derivative as a function Definition. Te derivative of f(x) istefunction f (x) defined as follows f f(x + ) f(x) (x). 0 Note: tis differs from te definition in section 2.7 in
More informationBounding Tree Cover Number and Positive Semidefinite Zero Forcing Number
Bounding Tree Cover Number and Positive Semidefinite Zero Forcing Number Sofia Burille Mentor: Micael Natanson September 15, 2014 Abstract Given a grap, G, wit a set of vertices, v, and edges, various
More informationSection 2.3: Calculating Limits using the Limit Laws
Section 2.3: Calculating Limits using te Limit Laws In previous sections, we used graps and numerics to approimate te value of a it if it eists. Te problem wit tis owever is tat it does not always give
More information2 The Derivative. 2.0 Introduction to Derivatives. Slopes of Tangent Lines: Graphically
2 Te Derivative Te two previous capters ave laid te foundation for te study of calculus. Tey provided a review of some material you will need and started to empasize te various ways we will view and use
More informationLinear Interpolating Splines
Jim Lambers MAT 772 Fall Semester 2010-11 Lecture 17 Notes Tese notes correspond to Sections 112, 11, and 114 in te text Linear Interpolating Splines We ave seen tat ig-degree polynomial interpolation
More information4.1 Tangent Lines. y 2 y 1 = y 2 y 1
41 Tangent Lines Introduction Recall tat te slope of a line tells us ow fast te line rises or falls Given distinct points (x 1, y 1 ) and (x 2, y 2 ), te slope of te line troug tese two points is cange
More informationMATH 5a Spring 2018 READING ASSIGNMENTS FOR CHAPTER 2
MATH 5a Spring 2018 READING ASSIGNMENTS FOR CHAPTER 2 Note: Tere will be a very sort online reading quiz (WebWork) on eac reading assignment due one our before class on its due date. Due dates can be found
More informationDensity Estimation Over Data Stream
Density Estimation Over Data Stream Aoying Zou Dept. of Computer Science, Fudan University 22 Handan Rd. Sangai, 2433, P.R. Cina ayzou@fudan.edu.cn Ziyuan Cai Dept. of Computer Science, Fudan University
More informationCubic smoothing spline
Cubic smooting spline Menu: QCExpert Regression Cubic spline e module Cubic Spline is used to fit any functional regression curve troug data wit one independent variable x and one dependent random variable
More informationMAPI Computer Vision
MAPI Computer Vision Multiple View Geometry In tis module we intend to present several tecniques in te domain of te 3D vision Manuel Joao University of Mino Dep Industrial Electronics - Applications -
More informationA Finite Element Scheme for Calculating Inverse Dynamics of Link Mechanisms
WCCM V Fift World Congress on Computational Mecanics July -1,, Vienna, Austria Eds.: H.A. Mang, F.G. Rammerstorfer, J. Eberardsteiner A Finite Element Sceme for Calculating Inverse Dynamics of Link Mecanisms
More informationGrid Adaptation for Functional Outputs: Application to Two-Dimensional Inviscid Flows
Journal of Computational Pysics 176, 40 69 (2002) doi:10.1006/jcp.2001.6967, available online at ttp://www.idealibrary.com on Grid Adaptation for Functional Outputs: Application to Two-Dimensional Inviscid
More informationFast Calculation of Thermodynamic Properties of Water and Steam in Process Modelling using Spline Interpolation
P R E P R N T CPWS XV Berlin, September 8, 008 Fast Calculation of Termodynamic Properties of Water and Steam in Process Modelling using Spline nterpolation Mattias Kunick a, Hans-Joacim Kretzscmar a,
More informationMean Shifting Gradient Vector Flow: An Improved External Force Field for Active Surfaces in Widefield Microscopy.
Mean Sifting Gradient Vector Flow: An Improved External Force Field for Active Surfaces in Widefield Microscopy. Margret Keuper Cair of Pattern Recognition and Image Processing Computer Science Department
More information4.2 The Derivative. f(x + h) f(x) lim
4.2 Te Derivative Introduction In te previous section, it was sown tat if a function f as a nonvertical tangent line at a point (x, f(x)), ten its slope is given by te it f(x + ) f(x). (*) Tis is potentially
More information2.7 Cloth Animation. Jacobs University Visualization and Computer Graphics Lab : Advanced Graphics - Chapter 2 123
2.7 Cloth Animation 320491: Advanced Graphics - Chapter 2 123 Example: Cloth draping Image Michael Kass 320491: Advanced Graphics - Chapter 2 124 Cloth using mass-spring model Network of masses and springs
More informationCESILA: Communication Circle External Square Intersection-Based WSN Localization Algorithm
Sensors & Transducers 2013 by IFSA ttp://www.sensorsportal.com CESILA: Communication Circle External Square Intersection-Based WSN Localization Algoritm Sun Hongyu, Fang Ziyi, Qu Guannan College of Computer
More informationOur Calibrated Model has No Predictive Value: An Example from the Petroleum Industry
Our Calibrated Model as No Predictive Value: An Example from te Petroleum Industry J.N. Carter a, P.J. Ballester a, Z. Tavassoli a and P.R. King a a Department of Eart Sciences and Engineering, Imperial
More informationPYRAMID FILTERS BASED ON BILINEAR INTERPOLATION
PYRAMID FILTERS BASED ON BILINEAR INTERPOLATION Martin Kraus Computer Grapics and Visualization Group, Tecnisce Universität Müncen, Germany krausma@in.tum.de Magnus Strengert Visualization and Interactive
More informationHaar Transform CS 430 Denbigh Starkey
Haar Transform CS Denbig Starkey. Background. Computing te transform. Restoring te original image from te transform 7. Producing te transform matrix 8 5. Using Haar for lossless compression 6. Using Haar
More informationTwo Modifications of Weight Calculation of the Non-Local Means Denoising Method
Engineering, 2013, 5, 522-526 ttp://dx.doi.org/10.4236/eng.2013.510b107 Publised Online October 2013 (ttp://www.scirp.org/journal/eng) Two Modifications of Weigt Calculation of te Non-Local Means Denoising
More information3.6 Directional Derivatives and the Gradient Vector
288 CHAPTER 3. FUNCTIONS OF SEVERAL VARIABLES 3.6 Directional Derivatives and te Gradient Vector 3.6.1 Functions of two Variables Directional Derivatives Let us first quickly review, one more time, te
More informationAlternating Direction Implicit Methods for FDTD Using the Dey-Mittra Embedded Boundary Method
Te Open Plasma Pysics Journal, 2010, 3, 29-35 29 Open Access Alternating Direction Implicit Metods for FDTD Using te Dey-Mittra Embedded Boundary Metod T.M. Austin *, J.R. Cary, D.N. Smite C. Nieter Tec-X
More informationNotes: Dimensional Analysis / Conversions
Wat is a unit system? A unit system is a metod of taking a measurement. Simple as tat. We ave units for distance, time, temperature, pressure, energy, mass, and many more. Wy is it important to ave a standard?
More informationThe Euler and trapezoidal stencils to solve d d x y x = f x, y x
restart; Te Euler and trapezoidal stencils to solve d d x y x = y x Te purpose of tis workseet is to derive te tree simplest numerical stencils to solve te first order d equation y x d x = y x, and study
More informationDesign of PSO-based Fuzzy Classification Systems
Tamkang Journal of Science and Engineering, Vol. 9, No 1, pp. 6370 (006) 63 Design of PSO-based Fuzzy Classification Systems Cia-Cong Cen Department of Electronics Engineering, Wufeng Institute of Tecnology,
More informationInvestigating an automated method for the sensitivity analysis of functions
Investigating an automated metod for te sensitivity analysis of functions Sibel EKER s.eker@student.tudelft.nl Jill SLINGER j..slinger@tudelft.nl Delft University of Tecnology 2628 BX, Delft, te Neterlands
More informationMore on Functions and Their Graphs
More on Functions and Teir Graps Difference Quotient ( + ) ( ) f a f a is known as te difference quotient and is used exclusively wit functions. Te objective to keep in mind is to factor te appearing in
More informationInterference and Diffraction of Light
Interference and Diffraction of Ligt References: [1] A.P. Frenc: Vibrations and Waves, Norton Publ. 1971, Capter 8, p. 280-297 [2] PASCO Interference and Diffraction EX-9918 guide (written by Ann Hanks)
More information12.2 TECHNIQUES FOR EVALUATING LIMITS
Section Tecniques for Evaluating Limits 86 TECHNIQUES FOR EVALUATING LIMITS Wat ou sould learn Use te dividing out tecnique to evaluate its of functions Use te rationalizing tecnique to evaluate its of
More informationNon-Rigid Image Registration III
Non-Rigid Image Registration III CS6240 Multimedia Analysis Leow Wee Kheng Department of Computer Science School of Computing National University of Singapore Leow Wee Kheng (CS6240) Non-Rigid Image Registration
More informationAn Interactive X-Ray Image Segmentation Technique for Bone Extraction
An Interactive X-Ray Image Segmentation Tecnique for Bone Extraction Cristina Stolojescu-Crisan and Stefan Holban Politenica University of Timisoara V. Parvan 2, 300223 Timisoara, Romania {cristina.stolojescu@etc.upt.ro
More informationPiecewise Polynomial Interpolation, cont d
Jim Lambers MAT 460/560 Fall Semester 2009-0 Lecture 2 Notes Tese notes correspond to Section 4 in te text Piecewise Polynomial Interpolation, cont d Constructing Cubic Splines, cont d Having determined
More informationNumerical Simulation of Two-Phase Free Surface Flows
Arc. Comput. Met. Engng. Vol. 12, 2, 165-224 (2005) Arcives of Computational Metods in Engineering State of te art reviews Numerical Simulation of Two-Pase Free Surface Flows Alexandre Caboussat Department
More informationVector Processing Contours
Vector Processing Contours Andrey Kirsanov Department of Automation and Control Processes MAMI Moscow State Tecnical University Moscow, Russia AndKirsanov@yandex.ru A.Vavilin and K-H. Jo Department of
More informationOptimal In-Network Packet Aggregation Policy for Maximum Information Freshness
1 Optimal In-etwork Packet Aggregation Policy for Maimum Information Fresness Alper Sinan Akyurek, Tajana Simunic Rosing Electrical and Computer Engineering, University of California, San Diego aakyurek@ucsd.edu,
More informationCRASHWORTHINESS ASSESSMENT IN AIRCRAFT DITCHING INCIDENTS
27 TH INTERNATIONAL CONGRESS OF THE AERONAUTICAL SCIENCES CRASHWORTHINESS ASSESSMENT IN AIRCRAFT DITCHING INCIDENTS C. Candra*, T. Y. Wong* and J. Bayandor** * Te Sir Lawrence Wackett Aerospace Centre
More information13.5 DIRECTIONAL DERIVATIVES and the GRADIENT VECTOR
13.5 Directional Derivatives and te Gradient Vector Contemporary Calculus 1 13.5 DIRECTIONAL DERIVATIVES and te GRADIENT VECTOR Directional Derivatives In Section 13.3 te partial derivatives f x and f
More informationA Statistical Approach for Target Counting in Sensor-Based Surveillance Systems
Proceedings IEEE INFOCOM A Statistical Approac for Target Counting in Sensor-Based Surveillance Systems Dengyuan Wu, Decang Cen,aiXing, Xiuzen Ceng Department of Computer Science, Te George Wasington University,
More information1.4 RATIONAL EXPRESSIONS
6 CHAPTER Fundamentals.4 RATIONAL EXPRESSIONS Te Domain of an Algebraic Epression Simplifying Rational Epressions Multiplying and Dividing Rational Epressions Adding and Subtracting Rational Epressions
More informationTruncated Newton-based multigrid algorithm for centroidal Voronoi diagram calculation
NUMERICAL MATHEMATICS: Teory, Metods and Applications Numer. Mat. Teor. Met. Appl., Vol. xx, No. x, pp. 1-18 (200x) Truncated Newton-based multigrid algoritm for centroidal Voronoi diagram calculation
More informationSome Handwritten Signature Parameters in Biometric Recognition Process
Some Handwritten Signature Parameters in Biometric Recognition Process Piotr Porwik Institute of Informatics, Silesian Uniersity, Bdziska 39, 41- Sosnowiec, Poland porwik@us.edu.pl Tomasz Para Institute
More informationθ R = θ 0 (1) -The refraction law says that: the direction of refracted ray (angle θ 1 from vertical) is (2)
LIGHT (Basic information) - Considering te ligt of a projector in a smoky room, one gets to geometrical optics model of ligt as a set of tiny particles tat travel along straigt lines called "optical rays.
More informationIntra- and Inter-Session Network Coding in Wireless Networks
Intra- and Inter-Session Network Coding in Wireless Networks Hulya Seferoglu, Member, IEEE, Atina Markopoulou, Member, IEEE, K K Ramakrisnan, Fellow, IEEE arxiv:857v [csni] 3 Feb Abstract In tis paper,
More informationUnsupervised Learning for Hierarchical Clustering Using Statistical Information
Unsupervised Learning for Hierarcical Clustering Using Statistical Information Masaru Okamoto, Nan Bu, and Tosio Tsuji Department of Artificial Complex System Engineering Hirosima University Kagamiyama
More informationUUV DEPTH MEASUREMENT USING CAMERA IMAGES
ABCM Symposium Series in Mecatronics - Vol. 3 - pp.292-299 Copyrigt c 2008 by ABCM UUV DEPTH MEASUREMENT USING CAMERA IMAGES Rogerio Yugo Takimoto Graduate Scool of Engineering Yokoama National University
More informationA Cost Model for Distributed Shared Memory. Using Competitive Update. Jai-Hoon Kim Nitin H. Vaidya. Department of Computer Science
A Cost Model for Distributed Sared Memory Using Competitive Update Jai-Hoon Kim Nitin H. Vaidya Department of Computer Science Texas A&M University College Station, Texas, 77843-3112, USA E-mail: fjkim,vaidyag@cs.tamu.edu
More informationExcel based finite difference modeling of ground water flow
Journal of Himalaan Eart Sciences 39(006) 49-53 Ecel based finite difference modeling of ground water flow M. Gulraiz Akter 1, Zulfiqar Amad 1 and Kalid Amin Kan 1 Department of Eart Sciences, Quaid-i-Azam
More informationUNSUPERVISED HIERARCHICAL IMAGE SEGMENTATION BASED ON THE TS-MRF MODEL AND FAST MEAN-SHIFT CLUSTERING
UNSUPERVISED HIERARCHICAL IMAGE SEGMENTATION BASED ON THE TS-MRF MODEL AND FAST MEAN-SHIFT CLUSTERING Raffaele Gaetano, Giuseppe Scarpa, Giovanni Poggi, and Josiane Zerubia Dip. Ing. Elettronica e Telecomunicazioni,
More information16th European Signal Processing Conference (EUSIPCO 2008), Lausanne, Switzerland, August 25-29, 2008, copyright by EURASIP
16t European Signal Processing Conference (EUSIPCO 008), Lausanne, Switzerland, August 5-9, 008, copyrigt by EURASIP ADAPTIVE WINDOW FOR LOCAL POLYNOMIAL REGRESSION FROM NOISY NONUNIFORM SAMPLES A. Sreenivasa
More informationSolutions Manual for Fundamentals of Fluid Mechanics 7th edition by Munson Rothmayer Okiishi and Huebsch
Solutions Manual for Fundamentals of Fluid Mecanics 7t edition by Munson Rotmayer Okiisi and Huebsc Link full download : ttps://digitalcontentmarket.org/download/solutions-manual-forfundamentals-of-fluid-mecanics-7t-edition-by-munson-rotmayer-okiisi-and-uebsc/
More informationComputing geodesic paths on manifolds
Proc. Natl. Acad. Sci. USA Vol. 95, pp. 8431 8435, July 1998 Applied Matematics Computing geodesic pats on manifolds R. Kimmel* and J. A. Setian Department of Matematics and Lawrence Berkeley National
More informationRedundancy Awareness in SQL Queries
Redundancy Awareness in QL Queries Bin ao and Antonio Badia omputer Engineering and omputer cience Department University of Louisville bin.cao,abadia @louisville.edu Abstract In tis paper, we study QL
More informationAnimating Lava Flows
Animating Lava Flows Dan Stora Pierre-Olivier Agliati Marie-Paule Cani Fabrice Neyret Jean-Dominique Gascuel imagis y -GRAVIR / IMAG BP 53, F-38041 Grenoble cedex 09, France Marie-Paule.Cani@imag.fr Abstract
More informationASSESSMENT OF IMAGE REGISTRATION INTERPOLATION METHODS FOR PRESSURE- SENSITIVE PAINT MEASUREMENTS
TH NTERNATONAL SYMPOSUM ON FLOW VSUALZATON August 9-4 University of Notre Dame Notre Dame ndiana USA ASSESSMENT OF MAGE REGSTRATON NTERPOLATON METHODS FOR PRESSURE- SENSTVE PANT MEASUREMENTS Sang-Hyun
More informationOvercomplete Steerable Pyramid Filters and Rotation Invariance
vercomplete Steerable Pyramid Filters and Rotation Invariance H. Greenspan, S. Belongie R. Goodman and P. Perona S. Raksit and C. H. Anderson Department of Electrical Engineering Department of Anatomy
More informationHaptic Rendering of Topological Constraints to Users Manipulating Serial Virtual Linkages
Haptic Rendering of Topological Constraints to Users Manipulating Serial Virtual Linkages Daniela Constantinescu and Septimiu E Salcudean Electrical & Computer Engineering Department University of Britis
More informationLaser Radar based Vehicle Localization in GPS Signal Blocked Areas
International Journal of Computational Intelligence Systems, Vol. 4, No. 6 (December, 20), 00-09 Laser Radar based Veicle Localization in GPS Signal Bloced Areas Ming Yang Department of Automation, Sangai
More information8/6/2010 Assignment Previewer
Week 4 Friday Homework (1321979) Question 1234567891011121314151617181920 1. Question DetailsSCalcET6 2.7.003. [1287988] Consider te parabola y 7x - x 2. (a) Find te slope of te tangent line to te parabola
More informationH-Adaptive Multiscale Schemes for the Compressible Navier-Stokes Equations Polyhedral Discretization, Data Compression and Mesh Generation
H-Adaptive Multiscale Scemes for te Compressible Navier-Stokes Equations Polyedral Discretization, Data Compression and Mes Generation F. Bramkamp 1, B. Gottsclic-Müller 2, M. Hesse 1, P. Lamby 2, S. Müller
More informationDeveloping an Efficient Algorithm for Image Fusion Using Dual Tree- Complex Wavelet Transform
ISSN(Online): 30-980 ISSN (Print): 30-9798 (An ISO 397: 007 Certified Organization) Vol. 3, Issue 4, April 05 Developing an Efficient Algoritm for Image Fusion Using Dual Tree- Complex Wavelet Transform
More informationVerification of a Compressible CFD Code using the Method of Manufactured Solutions
Verification of a Compressible CFD Code using te Metod of Manufactured Solutions Cristoper J. Roy, Tomas M. Smit, and Curtis C. Ober Sandia National Laboratories* P. O. Box 58 Albuquerque,NM 8785 AIAA
More informationImplementation of Integral based Digital Curvature Estimators in DGtal
Implementation of Integral based Digital Curvature Estimators in DGtal David Coeurjolly 1, Jacques-Olivier Lacaud 2, Jérémy Levallois 1,2 1 Université de Lyon, CNRS INSA-Lyon, LIRIS, UMR5205, F-69621,
More informationOn the Use of Radio Resource Tests in Wireless ad hoc Networks
Tecnical Report RT/29/2009 On te Use of Radio Resource Tests in Wireless ad oc Networks Diogo Mónica diogo.monica@gsd.inesc-id.pt João Leitão jleitao@gsd.inesc-id.pt Luis Rodrigues ler@ist.utl.pt Carlos
More informationLocal features and image matching May 8 th, 2018
Local features and image matcing May 8 t, 2018 Yong Jae Lee UC Davis Last time RANSAC for robust fitting Lines, translation Image mosaics Fitting a 2D transformation Homograpy 2 Today Mosaics recap: How
More informationChapter K. Geometric Optics. Blinn College - Physics Terry Honan
Capter K Geometric Optics Blinn College - Pysics 2426 - Terry Honan K. - Properties of Ligt Te Speed of Ligt Te speed of ligt in a vacuum is approximately c > 3.0µ0 8 mês. Because of its most fundamental
More informationA UPnP-based Decentralized Service Discovery Improved Algorithm
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Vol.1, No.1, Marc 2013, pp. 21~26 ISSN: 2089-3272 21 A UPnP-based Decentralized Service Discovery Improved Algoritm Yu Si-cai*, Wu Yan-zi,
More informationTuning MAX MIN Ant System with off-line and on-line methods
Université Libre de Bruxelles Institut de Recerces Interdisciplinaires et de Développements en Intelligence Artificielle Tuning MAX MIN Ant System wit off-line and on-line metods Paola Pellegrini, Tomas
More informationTHE POSSIBILITY OF ESTIMATING THE VOLUME OF A SQUARE FRUSTRUM USING THE KNOWN VOLUME OF A CONICAL FRUSTRUM
THE POSSIBILITY OF ESTIMATING THE VOLUME OF A SQUARE FRUSTRUM USING THE KNOWN VOLUME OF A CONICAL FRUSTRUM SAMUEL OLU OLAGUNJU Adeyemi College of Education NIGERIA Email: lagsam04@aceondo.edu.ng ABSTRACT
More informationMAP MOSAICKING WITH DISSIMILAR PROJECTIONS, SPATIAL RESOLUTIONS, DATA TYPES AND NUMBER OF BANDS 1. INTRODUCTION
MP MOSICKING WITH DISSIMILR PROJECTIONS, SPTIL RESOLUTIONS, DT TYPES ND NUMBER OF BNDS Tyler J. lumbaug and Peter Bajcsy National Center for Supercomputing pplications 605 East Springfield venue, Campaign,
More information12.2 Techniques for Evaluating Limits
335_qd /4/5 :5 PM Page 863 Section Tecniques for Evaluating Limits 863 Tecniques for Evaluating Limits Wat ou sould learn Use te dividing out tecnique to evaluate its of functions Use te rationalizing
More informationFourth-order NMO velocity for P-waves in layered orthorhombic media vs. offset-azimuth
Fourt-order NMO velocity for P-waves in layered orrombic media vs. set-azimut Zvi Koren* and Igor Ravve Paradigm Geopysical Summary We derive te fourt-order NMO velocity of compressional waves for a multi-layer
More informationSymmetric Tree Replication Protocol for Efficient Distributed Storage System*
ymmetric Tree Replication Protocol for Efficient Distributed torage ystem* ung Cune Coi 1, Hee Yong Youn 1, and Joong up Coi 2 1 cool of Information and Communications Engineering ungkyunkwan University
More informationFeature-Based Steganalysis for JPEG Images and its Implications for Future Design of Steganographic Schemes
Feature-Based Steganalysis for JPEG Images and its Implications for Future Design of Steganograpic Scemes Jessica Fridric Dept. of Electrical Engineering, SUNY Bingamton, Bingamton, NY 3902-6000, USA fridric@bingamton.edu
More informationZernike vs. Zonal Matrix Iterative Wavefront Reconstructor. Sophia I. Panagopoulou, PhD. University of Crete Medical School Dept.
Zernie vs. Zonal Matrix terative Wavefront Reconstructor opia. Panagopoulou PD University of Crete Medical cool Dept. of Optalmology Daniel R. Neal PD Wavefront ciences nc. 480 Central.E. Albuquerque NM
More informationObstacle Avoiding Real-Time Trajectory Generation and Control of Omnidirectional Vehicles
2009 American Control Conference Hyatt Regency Riverfront, St. Louis, MO, USA June 10-12, 2009 FrC10.6 Obstacle Avoiding Real-Time Trajectory Generation and Control of Omnidirectional Veicles Ji-wung Coi,
More informationTraffic Sign Classification Using Ring Partitioned Method
Traffic Sign Classification Using Ring Partitioned Metod Aryuanto Soetedjo and Koici Yamada Laboratory for Management and Information Systems Science, Nagaoa University of Tecnology 603- Kamitomioamaci,
More informationANTENNA SPHERICAL COORDINATE SYSTEMS AND THEIR APPLICATION IN COMBINING RESULTS FROM DIFFERENT ANTENNA ORIENTATIONS
NTNN SPHRICL COORDINT SSTMS ND THIR PPLICTION IN COMBINING RSULTS FROM DIFFRNT NTNN ORINTTIONS llen C. Newell, Greg Hindman Nearfield Systems Incorporated 133. 223 rd St. Bldg. 524 Carson, C 9745 US BSTRCT
More informationPedestrian Detection Algorithm for On-board Cameras of Multi View Angles
Pedestrian Detection Algoritm for On-board Cameras of Multi View Angles S. Kamijo IEEE, K. Fujimura, and Y. Sibayama Abstract In tis paper, a general algoritm for pedestrian detection by on-board monocular
More informationComputer Physics Communications. Multi-GPU acceleration of direct pore-scale modeling of fluid flow in natural porous media
Computer Pysics Communications 183 (2012) 1890 1898 Contents lists available at SciVerse ScienceDirect Computer Pysics Communications ournal omepage: www.elsevier.com/locate/cpc Multi-GPU acceleration
More informationA Bidirectional Subsethood Based Similarity Measure for Fuzzy Sets
A Bidirectional Subsetood Based Similarity Measure for Fuzzy Sets Saily Kabir Cristian Wagner Timoty C. Havens and Derek T. Anderson Intelligent Modelling and Analysis (IMA) Group and Lab for Uncertainty
More informationAn Analytical Approach to Real-Time Misbehavior Detection in IEEE Based Wireless Networks
Tis paper was presented as part of te main tecnical program at IEEE INFOCOM 20 An Analytical Approac to Real-Time Misbeavior Detection in IEEE 802. Based Wireless Networks Jin Tang, Yu Ceng Electrical
More informationNetwork Coding-Aware Queue Management for Unicast Flows over Coded Wireless Networks
Network Coding-Aware Queue Management for Unicast Flows over Coded Wireless Networks Hulya Seferoglu, Atina Markopoulou EECS Dept, University of California, Irvine {seferog, atina}@uci.edu Abstract We
More informationIntroduction to Computer Graphics 5. Clipping
Introduction to Computer Grapics 5. Clipping I-Cen Lin, Assistant Professor National Ciao Tung Univ., Taiwan Textbook: E.Angel, Interactive Computer Grapics, 5 t Ed., Addison Wesley Ref:Hearn and Baker,
More informationMulti-Stack Boundary Labeling Problems
Multi-Stack Boundary Labeling Problems Micael A. Bekos 1, Micael Kaufmann 2, Katerina Potika 1 Antonios Symvonis 1 1 National Tecnical University of Atens, Scool of Applied Matematical & Pysical Sciences,
More informationFault Localization Using Tarantula
Class 20 Fault localization (cont d) Test-data generation Exam review: Nov 3, after class to :30 Responsible for all material up troug Nov 3 (troug test-data generation) Send questions beforeand so all
More informationSection 1.2 The Slope of a Tangent
Section 1.2 Te Slope of a Tangent You are familiar wit te concept of a tangent to a curve. Wat geometric interpretation can be given to a tangent to te grap of a function at a point? A tangent is te straigt
More informationCloth Simulation. COMP 768 Presentation Zhen Wei
Cloth Simulation COMP 768 Presentation Zhen Wei Outline Motivation and Application Cloth Simulation Methods Physically-based Cloth Simulation Overview Development References 2 Motivation Movies Games VR
More informationComparison of the Efficiency of the Various Algorithms in Stratified Sampling when the Initial Solutions are Determined with Geometric Method
International Journal of Statistics and Applications 0, (): -0 DOI: 0.9/j.statistics.000.0 Comparison of te Efficiency of te Various Algoritms in Stratified Sampling wen te Initial Solutions are Determined
More informationIntegrated Approaches to Non-Rigid Registration in Medical Images
Work. on Appl. of Comp. Vision, pg 102-108. 1 Integrated Approaches to Non-Rigid Registration in Medical Images Yongmei Wang and Lawrence H. Staib + Departments of Electrical Engineering and Diagnostic
More informationNOTES: A quick overview of 2-D geometry
NOTES: A quick overview of 2-D geometry Wat is 2-D geometry? Also called plane geometry, it s te geometry tat deals wit two dimensional sapes flat tings tat ave lengt and widt, suc as a piece of paper.
More informationMulti-Objective Particle Swarm Optimizers: A Survey of the State-of-the-Art
Multi-Objective Particle Swarm Optimizers: A Survey of te State-of-te-Art Margarita Reyes-Sierra and Carlos A. Coello Coello CINVESTAV-IPN (Evolutionary Computation Group) Electrical Engineering Department,
More informationMaterials: Whiteboard, TI-Nspire classroom set, quadratic tangents program, and a computer projector.
Adam Clinc Lesson: Deriving te Derivative Grade Level: 12 t grade, Calculus I class Materials: Witeboard, TI-Nspire classroom set, quadratic tangents program, and a computer projector. Goals/Objectives:
More informationEfficient Content-Based Indexing of Large Image Databases
Efficient Content-Based Indexing of Large Image Databases ESSAM A. EL-KWAE University of Nort Carolina at Carlotte and MANSUR R. KABUKA University of Miami Large image databases ave emerged in various
More informationMinimizing Memory Access By Improving Register Usage Through High-level Transformations
Minimizing Memory Access By Improving Register Usage Troug Hig-level Transformations San Li Scool of Computer Engineering anyang Tecnological University anyang Avenue, SIGAPORE 639798 Email: p144102711@ntu.edu.sg
More informationMAC-CPTM Situations Project
raft o not use witout permission -P ituations Project ituation 20: rea of Plane Figures Prompt teacer in a geometry class introduces formulas for te areas of parallelograms, trapezoids, and romi. e removes
More information2.5 Evaluating Limits Algebraically
SECTION.5 Evaluating Limits Algebraically 3.5 Evaluating Limits Algebraically Preinary Questions. Wic of te following is indeterminate at x? x C x ; x x C ; x x C 3 ; x C x C 3 At x, x isofteform 0 xc3
More informationCommunicator for Mac Quick Start Guide
Communicator for Mac Quick Start Guide 503-968-8908 sterling.net training@sterling.net Pone Support 503.968.8908, option 2 pone-support@sterling.net For te most effective support, please provide your main
More information