Electrical impedance tomography with compensation for electrode positioning variations
|
|
- Caroline Carpenter
- 7 years ago
- Views:
Transcription
1 Phys. Med. Biol. 43 (1998) Printed in the UK PII: S (98) Electrical impedance tomography with compensation for electrode positioning variations B H Blott, G J Daniell and S Meeson Department of Physics and Astronomy, University of Southampton, Southampton SO17 1BJ, UK Received 19 August 1997, in final form 12 January 1998 Abstract. Ideally electrical impedance tomography (EIT) should not be oversensitive to electrode positions, but this conflicts with efforts to produce high-resolution images. Two procedures are presented that balance reducing the sensitivity to electrode position errors with generating practicable EIT images. The first provides a criterion based on electrode sensitivity for regularizing the reconstruction through spectral expansion. The main consequences of this are that smoother images are produced and the number of artefacts and their magnitude are generally reduced. The second modification uses the recorded data to compensate for electrode movements that have occurred after the reference data were measured. Image smoothness is used as the criterion for the readjustment. Computer simulation tests have shown that this modification produces improved image fidelity. 1. Introduction Over the last 15 years electrical impedance tomography (EIT) has been established as a new clinical imaging modality which is economical enough to be allocated to specific patients for long-term monitoring. It poses no known hazards to the patient and it is capable of producing real-time images. However, a series of electrodes must be applied to the patient for data measurement. These electrodes are difficult to position accurately, particularly for patients in intensive care beds. Changes in body position and electrode replacements are also sources of error in long-term in vivo EIT measurements (Lozano et al 1995). This suggests that the electrode spacing will change during data collection, leading to errors in the reconstructed images. Electrode movements during short-term clinical investigations can also introduce image artefacts or contribute to the overall measured change in conductivity. An example of this is chest wall expansion during cardio-pulmonary investigations (Adler et al 1996). Whatever the source of error, either incorrect placement of the electrodes or movement of the electrodes after the reference data set has been recorded, the effect on the images is the introduction of extraneous fine detail and other artefacts. In this paper we present a systematic study of solutions to these problems. Barber and Brown (1988) reported that their approach to reconstructing images of the relative change in resistivity was successful at producing images with a low sensitivity to uneven electrode spacing. Later Adler et al (1996) confirmed that provided the initial reference and the measured data set are recorded with the electrodes in the same positions, only small errors are introduced by non-uniform electrode placement. Ider et al (1992) proposed a modification of the data measurement protocol to avoid electrode position errors, but this requires extra patient manoeuvres and is rather restrictive. Ideally the reconstruction /98/ $19.50 c 1998 IOP Publishing Ltd 1731
2 1732 B H Blott et al process needs to have low sensitivity to the electrode positions, but this must be at the expense of reducing image resolution. Two different procedures are described below. The first reduces the sensitivity of the reconstruction to the electrode positions, and provides a rational criterion for regularizing the reconstruction process. The second procedure aims to compensate for electrode movements that occur during data measurement, by utilizing the data measured in vivo to estimate modifications to the reconstruction process. The effectiveness of these procedures is examined using simulated data sets. 2. A framework for image reconstruction For small changes in conductivity the linear approximation applies. In order to solve the forward problem, the continuous conductivity distribution is divided into a number of finite elements or pixels. The vector of all the voltage measurements v is related to variations in pixel resistivity ρ by the Jacobian matrix J = v i / ρ j : v = J ρ. (1) To obtain an image of the change in resistivity a pseudo-inverse R of the Jacobian matrix J is required so we can write ρ = R v. (2) If R is a good reconstruction matrix leading to a reconstructed resistivity distribution ρ = R v observed then the voltages predicted by the distribution, v predicted = J(R v observed ), should ideally agree with the observed values. So the product JR should equal I, the identity matrix. One method of constructing a pseudo-inverse is by using the singular value decomposition (SVD) of J (Golub and Reinsch 1970). It is possible to write J = UΣV T with U and V orthogonal matrices and Σ diagonal, and possible reconstruction matrices can be written R = VWU T. The resulting image can be regarded as a superposition of basis images, given by the columns of the matrix V weighted with the coefficients WU T v. If JR = I then the elements of W and Σ are related by W i = 1 i. In fact the very small values of i result in unacceptable images unless a filter is introduced to attenuate the contributions of these basis images to the reconstruction. This necessarily means that some misfit to the data must be tolerated. We investigate whether a judicious choice of R within this framework can produce an image that is less sensitive to electrode misplacements. 3. Reconstruction methods with reduced sensitivity to electrode positions 3.1. Theoretical formulation To minimize the sensitivity of the reconstruction to the electrode positions the images reconstructed from the voltages for two slightly different electrode configurations should be as similar as possible. If the voltages measured from the first electrode configuration are v 1 = J 1 ρ and the voltages measured for the second electrode position are v 2 = J 2 ρ then R v 1 and R v 2 should be as similar as possible. Therefore ideally the relationship RδJ = RJ 1 RJ 2 = 0 (3) is desirable for all movements of the electrodes. This is impossible but we can reduce the average value of this difference.
3 EIT with compensation for electrode position variation 1733 Let δj (r) be the change in J when electrode r is moved a small fixed distance, then a convenient measure of the average change in RJ is (RδJ (r) ) 2 ij = trace[(rδj (r) ) T (RδJ (r) )] = trace[r R T ] (4) r ij r where = (δj (r) )(δj (r) ) T. (5) r If the resistivity changes in a particular region of the image are required, for instance the lungs in a cross section of the thorax, it might be useful to weight the different pixels in equation (4). We try to minimize (4) by varying R. Ideally one might hope that there was enough freedom in choosing R so that JR could be exactly equal to I and the resulting resistivity distribution would predict an exact fit to the data. Unfortunately this leads to the reconstruction matrix R = J T [JJ T ] 1 (6) independent of. We conclude that all reconstruction matrices that predict an exact fit to the data are equally sensitive to electrode misplacements, using our definition of sensitivity. We must accept that reducing the sensitivity to the electrode positions can only be achieved at the expense of a misfit to the data. Therefore instead of constraining R so strongly we define a measure of the misfit to the data by (JR I) 2 ij = trace[(jr I)T (JR I)]. (7) ij We can now minimize a linear combination of (4) and (7) λ trace[r R T ] + trace[(jr I) T (JR I)]. (8) The constant λ describes the relative importance we wish to attach to fitting the data and reducing sensitivity to electrode displacement. In terms of the singular value decomposition for J this expression becomes particularly simple: λ Wi 2 δ i + (W i i 1) 2 (9) i i where the δ i are the diagonal elements of U T U. The values of W i can then be found by minimizing expression (9), leading to i W i = i 2. (10) + λδ i When i is much larger than λδ i, which is the case for low-resolution basis images, W i 1 i. For the higher-resolution basis images, which are more sensitive to electrode positions, i is less than λδ i and the values of W i are small. Therefore the addition of λδ i in equation (10) controls the magnitudes of the W i preventing small values of i from dominating the reconstruction Evaluation of coefficients W i All the calculations are done using a finite element model (FEM) of the conductivity distribution, with 208 square pixels (shown later in figure 2), leading to an admittance matrix relating the pixel node currents and the pixel node potentials. Initially the 16 electrodes are placed at known positions (nodes) on the perimeter of the distribution and the Jacobian
4 1734 B H Blott et al J computed. To calculate δj (r), electrode r is moved by one pixel, first clockwise then anticlockwise, from its original position. Let J a and J b be the Jacobian matrices computed for these electrode movements respectively. Then the matrix δj (r) is given by δj (r) = J b J a. (11) 2 The eigenvalues i required to evaluate W i using (10) are known since they are generated by the SVD of the initial Jacobian. The values of δ i are derived using equation (5), U obtained from the SVD of J, and the 16 matrices δj (r) corresponding to moving each of the 16 electrodes used for data acquisition. On a coarse grid a movement of one pixel in electrode position is rather large, therefore the values of δj (r) were also calculated for single-node displacements on a finer pixel grid. The aim was to use these results with the faster reconstruction that uses the coarse grid. Unfortunately the orders of the image space eigenvectors for the fine and coarse grids are different, due to the finer grid more closely resembling a circle. It does not therefore appear possible to use these more accurate values of δj (r) except by doing the whole reconstruction on the finer grid. Figure 1. Coefficients (W i ) to be applied to the basis image expansion, designed to minimize the sensitivity of the reconstruction to the electrode spacing. Figure 1 is a plot of the W i values, derived using a pixel grid and with λ = 1. The basis images are ordered according to the size i, that is, broadly speaking, resolution and the values of W i are plotted against basis image number. The general trend is an increase in W i, from an initially low value, to a maximum before falling again. Against this background trend certain values, representing specific basis images, are significantly higher than their close neighbours. These high W i values indicate which basis images are least sensitive to the electrode positions. Emphasizing these images is exactly the behaviour required to minimize the sensitivity of the reconstruction process to the electrode positions. The shape of the plot in figure 1 suggests that there is no need for a regularization filter, as used in the standard reconstruction (Zadehkoochak et al 1991), since the elements of W are designed to preferentially select those basis images that are least sensitive to
5 EIT with compensation for electrode position variation 1735 electrode positions and the plot shows how the values are already constrained by the δ term in equation (10). This is certainly an advantage of this new technique, because deciding the point where the regularization filter should truncate the spectral expansion has so far been rather arbitrary in most applications of EIT Computer simulation The finite element net shown in figure 2 was used to represent a uniform resistivity distribution with electrodes equally spaced (not as shown) around the perimeter; the spectral expansion of basis images was developed from the sensitivity Jacobian for this arrangement. Data for the comparison were generated after displacing the electrodes by one net node either way along the periphery, in a random manner. Two data sets were produced, one from a uniform resistivity distribution and the other from the simulated blood distribution shown in figure 2. Figure 2. Finite element net showing the electrodes perturbed by random displacements. The position of the simulated blood pool (1.5 m) in the conductivity distribution (1 m) is also shown. To demonstrate the effectiveness of the new procedure set out above the results are compared with the use of the arbitrary cut-off filter given by Zadehkoochak et al (1991), which we call the standard reconstruction. The resulting images are shown in figure 3 for the standard and modified reconstructions. The top row images are taken with the same set of (perturbed) positions for the electrodes, and show that a flatter region is generated around a smaller peak in the modified reconstruction. The image differences introduced by the electrode perturbations are illustrated in the bottom row of figure 3, for the two reconstruction methods. These demonstrate that fewer and smaller artefacts are generated, particularly in the central regions of the image, by the modified reconstruction. The overall effect is to provide a trade-off between image resolution and insensitivity to electrode positioning.
6 1736 B H Blott et al Figure 3. Contour images of the simulated blood pool generated using the standard and modified spectral expansions (left- and right-hand columns respectively). The top row of images show the effects of the perturbed electrode positions. The bottom row shows the differences between images generated before and after perturbation of the electrode configuration. The contour intervals are 0.03 m starting at 0.45 m but excluding the zero level contour. 4. Compensation for electrode movement during measurement Up to this point the electrode positions have been assumed to remain fixed once they have been attached to the patient. In long-term monitoring the measurement electrodes may become displaced after recording the reference data set, and if this occurs Barber and Brown (1988) and Adler et al (1996) have shown that the resulting image artefacts in EIT are a major problem Theoretical formulation We can compensate for small movements in the electrode positions by using a modified Jacobian matrix. To determine this modification a simple regularized reconstruction algorithm that minimizes the mean square value of the change in resistivity ( ρ) with a constraint on the fit to the measured data is used, that is we construct the minimum of λ ρ T ρ + ( v J 0 ρ) T ( v J 0 ρ) (12) where J 0 represents the Jacobian matrix corresponding to uniformly spaced electrodes and λ is a constant. Note that in contrast to section 3.1 a misfit to the observed data is used rather than a general condition requiring that JR I. The minimization gives ρ = J T 0 ( λi + J0 J T ) 1 0 v. (13)
7 EIT with compensation for electrode position variation 1737 By performing the SVD of J this can be seen to be equivalent to the spectral expansion with 1 W i =. (14) λ + i The expression in equation (13) defines a particular value of ρ T ρ. The effect of electrode movements, and hence the wrong matrix J 0, is to add extraneous detail to the image and probably leads to an increased value of ρ T ρ. To determine if it is possible to reduce this value, J 0 is modified to be J = J 0 + ɛ r δj (r). (15) r The δj (r) are the changes in J 0 when electrode r is moved (defined earlier in section 3.1), and the ɛ r are the fraction of δj (r) required to model small electrode displacements. It is convenient in the following to denote the set of ɛ r by the vector ɛ. It turns out in test simulations that ρ T ρ can be reduced considerably but at the expense of very large values for ɛ r. These are greater than could be justified in any linear approximation and it is unlikely that electrode displacements made during clinical investigations will be greater than a small fraction of the interelectrode separation. A limit must be placed on the magnitudes of ɛ r to prevent the electrode corrections to J 0 being too large. To restrict the magnitudes of ɛ r equation (12) is modified to include a constraint on ɛ T ɛ: λ ρ T ρ + ( v J ρ) T ( v J ρ) µɛt ɛ. (16) The constant µ, which determines the dominance of the ɛ term in equation (16), is selected to limit the maximum displacement to a specified fraction of the interelectrode separation. Equation (16) is minimized with respect to ρ, which again gives equation (13), with J replacing J 0, and with respect to ɛ k which gives ρ T δj (k)t ( v J ρ) + ( v J ρ) T ( δj (k) ρ) + µɛ k = 0 (17) remembering that J depends on ɛ through equation (15). Rearranging equation (17) for ɛ leads to [ ρ T (δj (k)t δj (r) + δj (r)t δj (k) ) ρ + µδ kr ]ɛ r r = ρ T δj (k)t v + v T δj (k) ρ ρ T (δj (k)t J 0 J T 0 δj(k) ) ρ (18) where δ kr is the Kronecker delta. An iterative solution must be sought to solve for ɛ in equation (18). Initially J = J 0 and ɛ = 0 are used to evaluate ρ using equation (13). With J = J 0 and the initial ρ known, ɛ can be calculated from equation (18). The improved J and the updated ρ can be calculated using equation (15) and equation (13) respectively. This procedure is repeated until the relative change in ρ T ρ between iterations is less than 1%. This modified Jacobian is specific to the recorded data set v, since v is used to derive ɛ. This is in contrast to the previous method which derived a modified reconstruction process that was applicable to any data set Computer simulation We used the same model of resistivity distribution and electrode perturbations as in section 3.3 above, except that the electrode displacements were made after generating the
8 1738 B H Blott et al reference data set. Preliminary results obtained with the rather coarse net shown in figure 2 confirmed the extreme sensitivity to electrode drift. The small electrode displacements expected in clinical practice were therefore modelled by selecting values of ɛ r in the modified Jacobian of equation (15), and deriving the consequent change in voltage measurements with equation (1). The images obtained after perturbing the electrodes are shown in the top row of figure 4; the left-hand diagram shows the severe distortion produced by equation (12) containing the unmodified Jacobian J 0. The reconstruction with the modified Jacobian, shown in the top right, clearly shows the improvement in image fidelity, and the restoration of the expected symmetry. Figure 4. Contour images generated using the standard (left) and corrected (right) Jacobians, with electrodes displaced after the reference dataset. The contour plots in the bottom row show the differences between the distorted images in the top row and the image obtained with the standard Jacobian and without electrode displacements. The contour intervals are as in figure 3. The bottom row of figure 4 shows the difference between the top row images and one reconstructed with J 0 from data generated with no electrode perturbations. This demonstrates very clearly that the compensation procedure, although rather time-consuming to implement, can provide improved image quality when electrode movements are suspected. 5. Conclusions A modification has been presented that reduces the sensitivity of EIT reconstruction to the electrode positions, and which represents an improvement over the method of Barber and Brown (1988). The main consequences of this change are that smoother images can be produced, and the number and magnitude of artefacts are generally reduced. A major advantage of the modified spectral expansion is that regularization, to control noise in the images, is automatically provided by the preferential selection of those basis images that are least sensitive to electrode positions. This is an important result for most applications
9 EIT with compensation for electrode position variation 1739 of EIT, since a clear rationale is used to constrain the reconstruction in contrast with the general practice of arbitrarily choosing a regularization filter to control noise in the images. The data-specific procedure is a more computationally intensive modification to the Jacobian matrix, used to compensate for electrode movements that occur between data measurements. Computer simulations suggest that such a modification would be beneficial in clinical practice, since image peaks are better defined when the modified Jacobian is used. Therefore if patient movement occurs during monitoring, this procedure is likely to deliver more credible reconstructed images. In summary the spectral expansion method modified to reduce the sensitivity to non-ideal electrode positions will be advantageous in real-time imaging; and long-term monitoring with EIT will benefit from the ability to use data to reduce the impact of patient movement on electrode spacings. References Adler A, Guardo R and Berthiaume Y 1996 Impedance imaging of lung ventilation: do we need to account for chest expansion? IEEE Trans. Biomed. Eng Barber D C and Brown B H 1988 Errors in reconstruction of resistivity images using a linear reconstruction technique Clin. Phys. Physiol. Meas. 9 (suppl A) Golub G H and Reinsch C 1970 Singular value decomposition and least squares solutions Numer. Math Ider Y Z, Nakiboglu B, Kuzuoglu M and Gencer N G 1992 Determination of the boundary of an object inserted into a water-filled cylinder Clin. Phys. Physiol. Meas. 13 (suppl A) Lozano A, Rosell J and Pallas-Areny R 1995 Errors in prolonged electrical impedance measurements due to electrode repositioning and postural change Physiol. Meas Zadehkoochak M, Blott B H, Hames T K and George R F 1991 Spectral expansion analysis in electrical impedance tomography J. Phys. D: Appl. Phys
Nonlinear Iterative Partial Least Squares Method
Numerical Methods for Determining Principal Component Analysis Abstract Factors Béchu, S., Richard-Plouet, M., Fernandez, V., Walton, J., and Fairley, N. (2016) Developments in numerical treatments for
More informationP164 Tomographic Velocity Model Building Using Iterative Eigendecomposition
P164 Tomographic Velocity Model Building Using Iterative Eigendecomposition K. Osypov* (WesternGeco), D. Nichols (WesternGeco), M. Woodward (WesternGeco) & C.E. Yarman (WesternGeco) SUMMARY Tomographic
More information13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.
3 MATH FACTS 0 3 MATH FACTS 3. Vectors 3.. Definition We use the overhead arrow to denote a column vector, i.e., a linear segment with a direction. For example, in three-space, we write a vector in terms
More informationLecture 5: Singular Value Decomposition SVD (1)
EEM3L1: Numerical and Analytical Techniques Lecture 5: Singular Value Decomposition SVD (1) EE3L1, slide 1, Version 4: 25-Sep-02 Motivation for SVD (1) SVD = Singular Value Decomposition Consider the system
More informationComponent Ordering in Independent Component Analysis Based on Data Power
Component Ordering in Independent Component Analysis Based on Data Power Anne Hendrikse Raymond Veldhuis University of Twente University of Twente Fac. EEMCS, Signals and Systems Group Fac. EEMCS, Signals
More informationThe Image Deblurring Problem
page 1 Chapter 1 The Image Deblurring Problem You cannot depend on your eyes when your imagination is out of focus. Mark Twain When we use a camera, we want the recorded image to be a faithful representation
More informationSubspace Analysis and Optimization for AAM Based Face Alignment
Subspace Analysis and Optimization for AAM Based Face Alignment Ming Zhao Chun Chen College of Computer Science Zhejiang University Hangzhou, 310027, P.R.China zhaoming1999@zju.edu.cn Stan Z. Li Microsoft
More informationTime Domain and Frequency Domain Techniques For Multi Shaker Time Waveform Replication
Time Domain and Frequency Domain Techniques For Multi Shaker Time Waveform Replication Thomas Reilly Data Physics Corporation 1741 Technology Drive, Suite 260 San Jose, CA 95110 (408) 216-8440 This paper
More informationA Strategy for Teaching Finite Element Analysis to Undergraduate Students
A Strategy for Teaching Finite Element Analysis to Undergraduate Students Gordon Smyrell, School of Computing and Mathematics, University of Teesside The analytical power and design flexibility offered
More informationIntroduction to Matrix Algebra
Psychology 7291: Multivariate Statistics (Carey) 8/27/98 Matrix Algebra - 1 Introduction to Matrix Algebra Definitions: A matrix is a collection of numbers ordered by rows and columns. It is customary
More informationOrthogonal Diagonalization of Symmetric Matrices
MATH10212 Linear Algebra Brief lecture notes 57 Gram Schmidt Process enables us to find an orthogonal basis of a subspace. Let u 1,..., u k be a basis of a subspace V of R n. We begin the process of finding
More informationDATA ANALYSIS II. Matrix Algorithms
DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where
More informationLecture Topic: Low-Rank Approximations
Lecture Topic: Low-Rank Approximations Low-Rank Approximations We have seen principal component analysis. The extraction of the first principle eigenvalue could be seen as an approximation of the original
More informationElasticity Theory Basics
G22.3033-002: Topics in Computer Graphics: Lecture #7 Geometric Modeling New York University Elasticity Theory Basics Lecture #7: 20 October 2003 Lecturer: Denis Zorin Scribe: Adrian Secord, Yotam Gingold
More informationMATH 551 - APPLIED MATRIX THEORY
MATH 55 - APPLIED MATRIX THEORY FINAL TEST: SAMPLE with SOLUTIONS (25 points NAME: PROBLEM (3 points A web of 5 pages is described by a directed graph whose matrix is given by A Do the following ( points
More informationSolving Mass Balances using Matrix Algebra
Page: 1 Alex Doll, P.Eng, Alex G Doll Consulting Ltd. http://www.agdconsulting.ca Abstract Matrix Algebra, also known as linear algebra, is well suited to solving material balance problems encountered
More informationEpipolar Geometry. Readings: See Sections 10.1 and 15.6 of Forsyth and Ponce. Right Image. Left Image. e(p ) Epipolar Lines. e(q ) q R.
Epipolar Geometry We consider two perspective images of a scene as taken from a stereo pair of cameras (or equivalently, assume the scene is rigid and imaged with a single camera from two different locations).
More informationPOISSON AND LAPLACE EQUATIONS. Charles R. O Neill. School of Mechanical and Aerospace Engineering. Oklahoma State University. Stillwater, OK 74078
21 ELLIPTICAL PARTIAL DIFFERENTIAL EQUATIONS: POISSON AND LAPLACE EQUATIONS Charles R. O Neill School of Mechanical and Aerospace Engineering Oklahoma State University Stillwater, OK 74078 2nd Computer
More informationLeast Squares Estimation
Least Squares Estimation SARA A VAN DE GEER Volume 2, pp 1041 1045 in Encyclopedia of Statistics in Behavioral Science ISBN-13: 978-0-470-86080-9 ISBN-10: 0-470-86080-4 Editors Brian S Everitt & David
More informationSimilarity and Diagonalization. Similar Matrices
MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that
More informationPATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 4: LINEAR MODELS FOR CLASSIFICATION
PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 4: LINEAR MODELS FOR CLASSIFICATION Introduction In the previous chapter, we explored a class of regression models having particularly simple analytical
More informationA Direct Numerical Method for Observability Analysis
IEEE TRANSACTIONS ON POWER SYSTEMS, VOL 15, NO 2, MAY 2000 625 A Direct Numerical Method for Observability Analysis Bei Gou and Ali Abur, Senior Member, IEEE Abstract This paper presents an algebraic method
More informationEnhancing the SNR of the Fiber Optic Rotation Sensor using the LMS Algorithm
1 Enhancing the SNR of the Fiber Optic Rotation Sensor using the LMS Algorithm Hani Mehrpouyan, Student Member, IEEE, Department of Electrical and Computer Engineering Queen s University, Kingston, Ontario,
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationVector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty
More informationSecond Order Linear Nonhomogeneous Differential Equations; Method of Undetermined Coefficients. y + p(t) y + q(t) y = g(t), g(t) 0.
Second Order Linear Nonhomogeneous Differential Equations; Method of Undetermined Coefficients We will now turn our attention to nonhomogeneous second order linear equations, equations with the standard
More informationFactor Analysis. Factor Analysis
Factor Analysis Principal Components Analysis, e.g. of stock price movements, sometimes suggests that several variables may be responding to a small number of underlying forces. In the factor model, we
More informationSolving Simultaneous Equations and Matrices
Solving Simultaneous Equations and Matrices The following represents a systematic investigation for the steps used to solve two simultaneous linear equations in two unknowns. The motivation for considering
More informationMath 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.
Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(
More information3 Orthogonal Vectors and Matrices
3 Orthogonal Vectors and Matrices The linear algebra portion of this course focuses on three matrix factorizations: QR factorization, singular valued decomposition (SVD), and LU factorization The first
More informationAu = = = 3u. Aw = = = 2w. so the action of A on u and w is very easy to picture: it simply amounts to a stretching by 3 and 2, respectively.
Chapter 7 Eigenvalues and Eigenvectors In this last chapter of our exploration of Linear Algebra we will revisit eigenvalues and eigenvectors of matrices, concepts that were already introduced in Geometry
More information7 Gaussian Elimination and LU Factorization
7 Gaussian Elimination and LU Factorization In this final section on matrix factorization methods for solving Ax = b we want to take a closer look at Gaussian elimination (probably the best known method
More informationCHAPTER 8 FACTOR EXTRACTION BY MATRIX FACTORING TECHNIQUES. From Exploratory Factor Analysis Ledyard R Tucker and Robert C.
CHAPTER 8 FACTOR EXTRACTION BY MATRIX FACTORING TECHNIQUES From Exploratory Factor Analysis Ledyard R Tucker and Robert C MacCallum 1997 180 CHAPTER 8 FACTOR EXTRACTION BY MATRIX FACTORING TECHNIQUES In
More information2x + y = 3. Since the second equation is precisely the same as the first equation, it is enough to find x and y satisfying the system
1. Systems of linear equations We are interested in the solutions to systems of linear equations. A linear equation is of the form 3x 5y + 2z + w = 3. The key thing is that we don t multiply the variables
More informationNumerical methods for American options
Lecture 9 Numerical methods for American options Lecture Notes by Andrzej Palczewski Computational Finance p. 1 American options The holder of an American option has the right to exercise it at any moment
More informationLinear Algebra Review. Vectors
Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka kosecka@cs.gmu.edu http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa Cogsci 8F Linear Algebra review UCSD Vectors The length
More informationFourth-Order Compact Schemes of a Heat Conduction Problem with Neumann Boundary Conditions
Fourth-Order Compact Schemes of a Heat Conduction Problem with Neumann Boundary Conditions Jennifer Zhao, 1 Weizhong Dai, Tianchan Niu 1 Department of Mathematics and Statistics, University of Michigan-Dearborn,
More informationPrincipal components analysis
CS229 Lecture notes Andrew Ng Part XI Principal components analysis In our discussion of factor analysis, we gave a way to model data x R n as approximately lying in some k-dimension subspace, where k
More informationMehtap Ergüven Abstract of Ph.D. Dissertation for the degree of PhD of Engineering in Informatics
INTERNATIONAL BLACK SEA UNIVERSITY COMPUTER TECHNOLOGIES AND ENGINEERING FACULTY ELABORATION OF AN ALGORITHM OF DETECTING TESTS DIMENSIONALITY Mehtap Ergüven Abstract of Ph.D. Dissertation for the degree
More information1 2 3 1 1 2 x = + x 2 + x 4 1 0 1
(d) If the vector b is the sum of the four columns of A, write down the complete solution to Ax = b. 1 2 3 1 1 2 x = + x 2 + x 4 1 0 0 1 0 1 2. (11 points) This problem finds the curve y = C + D 2 t which
More informationMATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors. Jordan canonical form (continued).
MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors Jordan canonical form (continued) Jordan canonical form A Jordan block is a square matrix of the form λ 1 0 0 0 0 λ 1 0 0 0 0 λ 0 0 J = 0
More informationManifold Learning Examples PCA, LLE and ISOMAP
Manifold Learning Examples PCA, LLE and ISOMAP Dan Ventura October 14, 28 Abstract We try to give a helpful concrete example that demonstrates how to use PCA, LLE and Isomap, attempts to provide some intuition
More informationFitting Subject-specific Curves to Grouped Longitudinal Data
Fitting Subject-specific Curves to Grouped Longitudinal Data Djeundje, Viani Heriot-Watt University, Department of Actuarial Mathematics & Statistics Edinburgh, EH14 4AS, UK E-mail: vad5@hw.ac.uk Currie,
More informationHow High a Degree is High Enough for High Order Finite Elements?
This space is reserved for the Procedia header, do not use it How High a Degree is High Enough for High Order Finite Elements? William F. National Institute of Standards and Technology, Gaithersburg, Maryland,
More informationJitter Measurements in Serial Data Signals
Jitter Measurements in Serial Data Signals Michael Schnecker, Product Manager LeCroy Corporation Introduction The increasing speed of serial data transmission systems places greater importance on measuring
More informationMeasuring Line Edge Roughness: Fluctuations in Uncertainty
Tutor6.doc: Version 5/6/08 T h e L i t h o g r a p h y E x p e r t (August 008) Measuring Line Edge Roughness: Fluctuations in Uncertainty Line edge roughness () is the deviation of a feature edge (as
More informationLeast-Squares Intersection of Lines
Least-Squares Intersection of Lines Johannes Traa - UIUC 2013 This write-up derives the least-squares solution for the intersection of lines. In the general case, a set of lines will not intersect at a
More informationComputational Optical Imaging - Optique Numerique. -- Deconvolution --
Computational Optical Imaging - Optique Numerique -- Deconvolution -- Winter 2014 Ivo Ihrke Deconvolution Ivo Ihrke Outline Deconvolution Theory example 1D deconvolution Fourier method Algebraic method
More informationDerivative Free Optimization
Department of Mathematics Derivative Free Optimization M.J.D. Powell LiTH-MAT-R--2014/02--SE Department of Mathematics Linköping University S-581 83 Linköping, Sweden. Three lectures 1 on Derivative Free
More informationBackground: State Estimation
State Estimation Cyber Security of the Smart Grid Dr. Deepa Kundur Background: State Estimation University of Toronto Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 1 / 81 Dr.
More informationUniversity of Lille I PC first year list of exercises n 7. Review
University of Lille I PC first year list of exercises n 7 Review Exercise Solve the following systems in 4 different ways (by substitution, by the Gauss method, by inverting the matrix of coefficients
More informationDecentralized Method for Traffic Monitoring
Decentralized Method for Traffic Monitoring Guillaume Sartoretti 1,2, Jean-Luc Falcone 1, Bastien Chopard 1, and Martin Gander 2 1 Computer Science Department 2 Department of Mathematics, University of
More informationNotes on Orthogonal and Symmetric Matrices MENU, Winter 2013
Notes on Orthogonal and Symmetric Matrices MENU, Winter 201 These notes summarize the main properties and uses of orthogonal and symmetric matrices. We covered quite a bit of material regarding these topics,
More informationState of Stress at Point
State of Stress at Point Einstein Notation The basic idea of Einstein notation is that a covector and a vector can form a scalar: This is typically written as an explicit sum: According to this convention,
More informationA quadrilateral 2-D finite element based on mixed interpolation of tensorial
A quadrilateral 2-D finite element based on mixed interpolation of tensorial components Eduardo N. Dvorkin and Sara I. Vassolo* Instituto de Materiales y Estructuras, Facultad de Ingenieria, Universidad
More informationSupport Vector Machines Explained
March 1, 2009 Support Vector Machines Explained Tristan Fletcher www.cs.ucl.ac.uk/staff/t.fletcher/ Introduction This document has been written in an attempt to make the Support Vector Machines (SVM),
More informationMesh Discretization Error and Criteria for Accuracy of Finite Element Solutions
Mesh Discretization Error and Criteria for Accuracy of Finite Element Solutions Chandresh Shah Cummins, Inc. Abstract Any finite element analysis performed by an engineer is subject to several types of
More informationCALCULATIONS & STATISTICS
CALCULATIONS & STATISTICS CALCULATION OF SCORES Conversion of 1-5 scale to 0-100 scores When you look at your report, you will notice that the scores are reported on a 0-100 scale, even though respondents
More informationStatistical Machine Learning
Statistical Machine Learning UoC Stats 37700, Winter quarter Lecture 4: classical linear and quadratic discriminants. 1 / 25 Linear separation For two classes in R d : simple idea: separate the classes
More informationMoving Least Squares Approximation
Chapter 7 Moving Least Squares Approimation An alternative to radial basis function interpolation and approimation is the so-called moving least squares method. As we will see below, in this method the
More informationSTUDY OF DAM-RESERVOIR DYNAMIC INTERACTION USING VIBRATION TESTS ON A PHYSICAL MODEL
STUDY OF DAM-RESERVOIR DYNAMIC INTERACTION USING VIBRATION TESTS ON A PHYSICAL MODEL Paulo Mendes, Instituto Superior de Engenharia de Lisboa, Portugal Sérgio Oliveira, Laboratório Nacional de Engenharia
More informationThe Basics of FEA Procedure
CHAPTER 2 The Basics of FEA Procedure 2.1 Introduction This chapter discusses the spring element, especially for the purpose of introducing various concepts involved in use of the FEA technique. A spring
More information1 Review of Least Squares Solutions to Overdetermined Systems
cs4: introduction to numerical analysis /9/0 Lecture 7: Rectangular Systems and Numerical Integration Instructor: Professor Amos Ron Scribes: Mark Cowlishaw, Nathanael Fillmore Review of Least Squares
More informationLinköping University Electronic Press
Linköping University Electronic Press Report A Preconditioned GMRES Method for Solving a 1D Sideways Heat Equation Zohreh Ranjbar and Lars Eldén LiTH-MAT-R, 348-296, No. 6 Available at: Linköping University
More informationSolving Systems of Linear Equations Using Matrices
Solving Systems of Linear Equations Using Matrices What is a Matrix? A matrix is a compact grid or array of numbers. It can be created from a system of equations and used to solve the system of equations.
More informationBinary Image Reconstruction
A network flow algorithm for reconstructing binary images from discrete X-rays Kees Joost Batenburg Leiden University and CWI, The Netherlands kbatenbu@math.leidenuniv.nl Abstract We present a new algorithm
More informationExample: Credit card default, we may be more interested in predicting the probabilty of a default than classifying individuals as default or not.
Statistical Learning: Chapter 4 Classification 4.1 Introduction Supervised learning with a categorical (Qualitative) response Notation: - Feature vector X, - qualitative response Y, taking values in C
More informationScaling and Biasing Analog Signals
Scaling and Biasing Analog Signals November 2007 Introduction Scaling and biasing the range and offset of analog signals is a useful skill for working with a variety of electronics. Not only can it interface
More informationSpecial Situations in the Simplex Algorithm
Special Situations in the Simplex Algorithm Degeneracy Consider the linear program: Maximize 2x 1 +x 2 Subject to: 4x 1 +3x 2 12 (1) 4x 1 +x 2 8 (2) 4x 1 +2x 2 8 (3) x 1, x 2 0. We will first apply the
More informationKrylov subspace iterative techniques: on the detection of brain activity with electrical impedance tomography
Krylov subspace iterative techniques: on the detection of brain activity with electrical impedance tomography N. Polydorides, W.R.B. Lionheart and H. McCann 2002 MIMS EPrint: 2006.240 Manchester Institute
More information3.1 State Space Models
31 State Space Models In this section we study state space models of continuous-time linear systems The corresponding results for discrete-time systems, obtained via duality with the continuous-time models,
More informationAn introduction to Value-at-Risk Learning Curve September 2003
An introduction to Value-at-Risk Learning Curve September 2003 Value-at-Risk The introduction of Value-at-Risk (VaR) as an accepted methodology for quantifying market risk is part of the evolution of risk
More information[1] Diagonal factorization
8.03 LA.6: Diagonalization and Orthogonal Matrices [ Diagonal factorization [2 Solving systems of first order differential equations [3 Symmetric and Orthonormal Matrices [ Diagonal factorization Recall:
More informationLecture 3: Finding integer solutions to systems of linear equations
Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture
More informationCircuit Analysis using the Node and Mesh Methods
Circuit Analysis using the Node and Mesh Methods We have seen that using Kirchhoff s laws and Ohm s law we can analyze any circuit to determine the operating conditions (the currents and voltages). The
More informationA Primer on Index Notation
A Primer on John Crimaldi August 28, 2006 1. Index versus Index notation (a.k.a. Cartesian notation) is a powerful tool for manipulating multidimensional equations. However, there are times when the more
More informationELECTRIC FIELD LINES AND EQUIPOTENTIAL SURFACES
ELECTRIC FIELD LINES AND EQUIPOTENTIAL SURFACES The purpose of this lab session is to experimentally investigate the relation between electric field lines of force and equipotential surfaces in two dimensions.
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationChapter 7. Lyapunov Exponents. 7.1 Maps
Chapter 7 Lyapunov Exponents Lyapunov exponents tell us the rate of divergence of nearby trajectories a key component of chaotic dynamics. For one dimensional maps the exponent is simply the average
More information3.1. Solving linear equations. Introduction. Prerequisites. Learning Outcomes. Learning Style
Solving linear equations 3.1 Introduction Many problems in engineering reduce to the solution of an equation or a set of equations. An equation is a type of mathematical expression which contains one or
More informationGRADES 7, 8, AND 9 BIG IDEAS
Table 1: Strand A: BIG IDEAS: MATH: NUMBER Introduce perfect squares, square roots, and all applications Introduce rational numbers (positive and negative) Introduce the meaning of negative exponents for
More informationJoint models for classification and comparison of mortality in different countries.
Joint models for classification and comparison of mortality in different countries. Viani D. Biatat 1 and Iain D. Currie 1 1 Department of Actuarial Mathematics and Statistics, and the Maxwell Institute
More informationSophomore Physics Laboratory (PH005/105)
CALIFORNIA INSTITUTE OF TECHNOLOGY PHYSICS MATHEMATICS AND ASTRONOMY DIVISION Sophomore Physics Laboratory (PH5/15) Analog Electronics Active Filters Copyright c Virgínio de Oliveira Sannibale, 23 (Revision
More informationUnderstanding and Applying Kalman Filtering
Understanding and Applying Kalman Filtering Lindsay Kleeman Department of Electrical and Computer Systems Engineering Monash University, Clayton 1 Introduction Objectives: 1. Provide a basic understanding
More informationTo give it a definition, an implicit function of x and y is simply any relationship that takes the form:
2 Implicit function theorems and applications 21 Implicit functions The implicit function theorem is one of the most useful single tools you ll meet this year After a while, it will be second nature to
More informationThe Standard Normal distribution
The Standard Normal distribution 21.2 Introduction Mass-produced items should conform to a specification. Usually, a mean is aimed for but due to random errors in the production process we set a tolerance
More informationLinear Programming. March 14, 2014
Linear Programming March 1, 01 Parts of this introduction to linear programming were adapted from Chapter 9 of Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest and Stein [1]. 1
More informationMAT 242 Test 2 SOLUTIONS, FORM T
MAT 242 Test 2 SOLUTIONS, FORM T 5 3 5 3 3 3 3. Let v =, v 5 2 =, v 3 =, and v 5 4 =. 3 3 7 3 a. [ points] The set { v, v 2, v 3, v 4 } is linearly dependent. Find a nontrivial linear combination of these
More informationConvolution. 1D Formula: 2D Formula: Example on the web: http://www.jhu.edu/~signals/convolve/
Basic Filters (7) Convolution/correlation/Linear filtering Gaussian filters Smoothing and noise reduction First derivatives of Gaussian Second derivative of Gaussian: Laplacian Oriented Gaussian filters
More informationProof of the conservation of momentum and kinetic energy
Experiment 04 Proof of the conservation of momentum and kinetic energy By Christian Redeker 27.10.2007 Contents 1.) Hypothesis...3 2.) Diagram...7 3.) Method...7 3.1) Apparatus...7 3.2) Procedure...7 4.)
More informationDesign of FIR Filters
Design of FIR Filters Elena Punskaya www-sigproc.eng.cam.ac.uk/~op205 Some material adapted from courses by Prof. Simon Godsill, Dr. Arnaud Doucet, Dr. Malcolm Macleod and Prof. Peter Rayner 68 FIR as
More informationThe Effects of Start Prices on the Performance of the Certainty Equivalent Pricing Policy
BMI Paper The Effects of Start Prices on the Performance of the Certainty Equivalent Pricing Policy Faculty of Sciences VU University Amsterdam De Boelelaan 1081 1081 HV Amsterdam Netherlands Author: R.D.R.
More informationReview Jeopardy. Blue vs. Orange. Review Jeopardy
Review Jeopardy Blue vs. Orange Review Jeopardy Jeopardy Round Lectures 0-3 Jeopardy Round $200 How could I measure how far apart (i.e. how different) two observations, y 1 and y 2, are from each other?
More informationConstrained Least Squares
Constrained Least Squares Authors: G.H. Golub and C.F. Van Loan Chapter 12 in Matrix Computations, 3rd Edition, 1996, pp.580-587 CICN may05/1 Background The least squares problem: min Ax b 2 x Sometimes,
More informationName: Section Registered In:
Name: Section Registered In: Math 125 Exam 3 Version 1 April 24, 2006 60 total points possible 1. (5pts) Use Cramer s Rule to solve 3x + 4y = 30 x 2y = 8. Be sure to show enough detail that shows you are
More information8.2. Solution by Inverse Matrix Method. Introduction. Prerequisites. Learning Outcomes
Solution by Inverse Matrix Method 8.2 Introduction The power of matrix algebra is seen in the representation of a system of simultaneous linear equations as a matrix equation. Matrix algebra allows us
More informationConductance, the Normalized Laplacian, and Cheeger s Inequality
Spectral Graph Theory Lecture 6 Conductance, the Normalized Laplacian, and Cheeger s Inequality Daniel A. Spielman September 21, 2015 Disclaimer These notes are not necessarily an accurate representation
More informationA note on companion matrices
Linear Algebra and its Applications 372 (2003) 325 33 www.elsevier.com/locate/laa A note on companion matrices Miroslav Fiedler Academy of Sciences of the Czech Republic Institute of Computer Science Pod
More informationImpact of Remote Control Failure on Power System Restoration Time
Impact of Remote Control Failure on Power System Restoration Time Fredrik Edström School of Electrical Engineering Royal Institute of Technology Stockholm, Sweden Email: fredrik.edstrom@ee.kth.se Lennart
More informationSpatial Statistics Chapter 3 Basics of areal data and areal data modeling
Spatial Statistics Chapter 3 Basics of areal data and areal data modeling Recall areal data also known as lattice data are data Y (s), s D where D is a discrete index set. This usually corresponds to data
More information