R[p ], Rip]. Axiomatic Quantification of Image Resolution. Xiao-ming Ma Center of Environment Science Peking University Beijing , China.
|
|
- Alexina Copeland
- 5 years ago
- Views:
Transcription
1 Axiomatic Quantification of Image Resolution Ming Jiang* School of Mathematics Peking University Beijing 0087, China. Ge Wang Department of Radiology University of Iowa Iowa City, IA 52242, USA ovember, 200 Xiao-ming Ma Center of Environment Science Peking University Beijing 0087, China. Abstract In this paper, we generalize the axiomatic system for quantification of image resolution, prove that any resolution measure consistent with the generalized axiomatic system must be a homogeneous symmetric function of order //2 of the eigenvalues of the covariance matrix of the PSF. If the axiomatic system is augmented with an affine transformation axiom, the resolution measure is proved to be proportional to the squared root of the geometric means of the eigenvalues of the covariance matrix of the PSF. Introduction There are various kinds of imaging systems, such as camera, electronic and optic microscopes, medical and industrial tomographic scanners, and radars. Image resolution of an imaging system refers to the capability of discriminating two neighboring objects, and is the primary factor determining the system performance. Various criteria were introduced for quantification of image resolution, c.f. []. Using an axiomatic approach [2], it was recently proved that the resolution measure of a nonnegative one-dimensional spatially invariant imaging system should be proportional to the square root of the variance of the PSF. The result was later extended to multi-dimensional case in [3] if the axiomatic system is augmented with an orthogonal transformation invariance axiom. The resolution measure is proved to be the squared root of the arithmetic means of the eigenvalues of the covariance matrix of the PSF. However, the axiomatic system in [2, 3] is too restrictive. E.g., the affine transformation axiom (Axiom A in 4) is not consistent with it, though this axiom is in a rather general form. *Currently, Ming Jiang is a visiting professor with Micro-CT Laboratory, Department of Radiology, University of Iowa, Iowa City, IA 52242, USA. His work was supported in part by an KBRSF grant. In 2, a general axiomatic system is constructed by replacing the strong cascade axiom (i.e., the combination axiom in [2, 3]) with a weak cascade axiom. In 4, it is demonstrated that any resolution measure consistent with the generalized axiomatic system must be a homogeneous symmetric function of order /2 of the PSF eigenvalues. In 4, after the generalized axiomatic system is augmented with an affine transformation axiom it is proved that the resolution measure should be proportional to the squared root of the geometric means of the eigenvalues of the covariance matrix of the PSF. 2 General Axiomatic System The imaging system is assumed to be nonnegative spatially invariant: o=p,i () where i is an input, o is an output, and p _> 0 is a PSF with finite first, second order moments, and positive definite covariance matrix. Let Rip] denote an image resolution measure of the system (). The convention is that the smaller Rip] is, the finer details the system can resolve. Let I be the x identity matrix, G ~ the -dimensional Gaussian distribution with zero mean vector and positive definite covariance matrix a: Ga(x ) = e_½zt,.a-~.z (2) (2~)-~ v/det (a) for x E R, where det(a) is the determinant of a. Our general axiomatic system consists of the following seven axioms that are postulated for Rip]. Axiom (onnegativity) Rip] >_ 0, a = RIG I] > 0, where c~ is finite constant. Axiom 2 (Continuity) R is continuous w.r.t the weak topology of measures in the following sense: if fapn'f "~ frp'f, Vf e c0(a ), then R[p ], Rip] X/0/$ IEEE 697
2 Axiom 3 (Translation Invariance) For every x0 E R, let pxo(x) = p(x- xo), Vx E R, then R[~o] = Rip]. Axiom 4 (Rotation Invariance) For every orthonormal matrix T, let pt(z) = p(t. x), Vx E R, then R~T ] -- R~9]. Axiom 5 (Luminance Invariance) For every c > 0, let p[c] = c. p(x), Yx e a, then Rip [c]] = Rip]. Axiom 6 (Homogeneous Scaling) For any finite/~ > 0, let p[/3](x)= p(flx) then then Rip[/3]] = RIp] /3 " Axiom 7 (Weak Cascade) There exists a function J such that for any PSF p, the resolution measure of the imaging system with the PSF q = p, p, which is a composite system consisting of two identical systems p in serial, only depends on the resolution measure of the system p: R[q] = Rip p] = Y(R[p]). (3) Axioms -6 are the same as their counterparts in [2]. Axiom 7 is new, which is less restrictive than the corresponding combination axiom in [2], which states that Axiom S (Combination or Strong Cascade) There exists a function F such that for any two imaging systems with PSFs Pl and P2, respectively, the image resolution measure of the composite system by serial connection of the two systems pl and p2 is R~] = R[p~ ;~.] = FIRe,I, RIP, I]. (4) 3 General Measure First recall that the covariance matrix a of a PSF p is defined by fr~(~j - ~j)(~k - ~k). ;(x) dx ~rj,k = fr p(x) dx (5) where # = (Pl," "", ~) is the mean value vector, with #k -- fan xk " p(x) dx fr p(x) dx (6) Lemma 3.. For any integrable function p(x) with finite first moment, under Axioms 3 and 5, Rip] = R[pl], where pl(x) = fr p(x)dxp(x- #) and # is the mean value vector defined as in (6). Thus, it is sufficient to consider PSFs that are probability density functions with mean zero. We will make such an assumption for all PSFs in the following. Lemma 3.2. If R[.] is a resolution measure satisfying Axioms, 5, 6, then for a Gaussian PSF G ~'I with covariance matrix ~. It ~ > 0, we RIO ~~] = o~. v~, (7) where a is the positive constant in Axiom. Proof. ote G ~'I (x) = c.gi(~x), for some positive c. By Axioms 5 and 6, R[G ~'I] = x/~" R[GI] (7) follows immediately. V] Lemma 3.3. Let J be the function in Axiom 7, if R[.] is a resolution measure satisfying Axioms, 5-7, then J(r) = v~r, for r > 0. (8) Proof. By Axiom, a = R[G I] > 0. For r > 0, let p be the Gaussian PSF defined by p = G(~) 2"I. Then, r by Lemma 3.2, Rip] - a. -~ = r. Because ;,; = G((~):+(~)~) ' =G(@) ~', (9) we Rip, p] = v/-2r. Hence, by Axiom 7, J(r) = J(R[p]) = Rip, p] = x/~r Lemma 3.4. If R[.] is a resolution measure satisfying Axiom 7, there exists a function K such that for any PSF p the resolution measure of the imaging system with a PSF q = p, p,..., p, where n = 2 k k = l... n terms only depends on the resolution measure of the system p and n: J R[q] = R~ p,... p] = K(R[p], n). (0) Y n terms Furthermore, if R[.] is a resolution measure satisfying Axioms, 5-7, then for n = 2 k k =,... K(r,n) = v~r, for r > 0. () Proof. Equation (0) is obtained after recursive use of Axiom 7. In fact, it is easy to get K(~, ~) = J o J...o 4(~). -v- k terms (I ) follows easily from Lemma 3.3. rq [5 698
3 Lemma 3.5. Let R[.] be a resolution measure satisfying Axioms, 5-7. For any PSF p, n= 2 k k= l... let qn(x) = (V~) " p(v/-n x) (2) Corollary 3.7. Under the same assumptions of Theorem 3.6, if R[.] further satisfies Axiom ~, then g(a) a f((7) = R~9] is a homogeneous symmetric function of order -~ of the eigenvalues of (7, and then gn - qn * qn *"" * qn, (3) y J n terms R[gn] = RIP]. (4) g(ta) = v~g(a). (9) Proof. With an orthonormal transformation y = Tx, a PSF p(x) is mapped to p(t try), and the new covariance matrix is D = T(TT tr. By Axiom 4 and Theorem 3.6, Proof. By Axioms 5 and 6, R[qn] = R[p] v~" Lemma 3.4, the conclusion follows immediately. K] Theorem 3.6. If R[.] is a resolution measure satisfying Axioms -3, 5-7, and p is a PSF with finite first and second order moments and positive definite covariance matrix (7, then R[;] = Moreover, the function is homogeneous of order ~, By R[c ] (6) f(t(7) = v/'tf((7), for t > 0. (7) Proof. Let qn and gn be constructed as in Lemma 3.5. By Lemma 3.5, for n = 2 k, k =,..., R[gn] = R~]. Since the covariance matrix of p is positive definite, by Theorem of [4] (p. 22), for any w e R, gn converges to G vaguely in the sense of measure as measure density functions. Since all the gn has the same resolution Rip], by Axiom 2, Rip] = R[G~]. Finally, for any t > 0, by Axiom 6, f (t. (7) -- R[G t~] - R[G7~,] = vqr[a = For a positive definite covariance matrix (7, there exists an orthonormal matrix T such that Fq (7 = Ttr DT, (8) where D is a diagonal matrix with positive diagonal elements being the eigenvalues of (7, A,...,A. Let us define A = (A,..-, A)tr. Rip] = f((7) = R[PT, r ] = f(d). The order of A,...,,~ can be freely altered by an appropriate orthonormal matrix T, hence f((7) is a symmetric function of A,...,A. The property of g can be easily verified. [2] Corollary 3.8. Under the same assumptions of Corollary 3. 7, if =, then Rip] = where (7 is the variance of p. (2o) Proof. By Corollary 3.7, Rip] = f(e). Since f is homogeneous, by (7), f((7) - x/'ef(). By Axiom, f() = a, then the conclusion is obtained, which is the same as the finding by Wang and Li [2]. E] Corollary 3.9. Under the same assumptions of Corollary 3. 7, if all eigenvalues of the covariance matrix of p are the same as ~ > O, then Rip] = o~. V/'~. (2) Proof. This is obtained by Corollary 3.7 and Axiom. E:] If a PSF is radially symmetric, i.e., p(x) = P(lixll), x E R, its covariance matrix must be diagonal with the same diagonal elements By Corollary 3.9, we = - J[x[J2P([JxJ])dx. (22) Corollary 3.0. Under the same assumptions of Corollary 3. 7, for a radially symmetric PSF p, RE.] = (23) 699
4 4 Arithmetic and Geometric Measures In the preceding section, a family of resolution measures has been characterized by our general axiomatic system. In practice, specific resolution measures can be determined among these candidate measures for measurement. In this section, two important measures, arithmetic and geometric measures are identified with the strong cascade axiom and an affine transformation axiom, respectively. The he justification of the arithmetic measure was already finished [3]. The focus of this section is to present the affine transformation axiom and justify the geometric measure. Let us summarize the result of the arithmetic measure in [3]. Theorem 4.. If R[.] is a resolution measure satisfying Axioms -6, and the strong cascade Axiom 8, then for any PSF p with finite first and second order moments and positive definite covariance matrix o, we... iv... E ~J i.e., the squared root of the the arithmetic means of )~,"",A (up to a positive constant), where o, )~I,''',)~ are the eigenvalues of or. A natural question is what the resolution measure of an imaging system could be if affine transformations can be applied in the imaging process. In the following, we present the affine transformation axiom in a very general form, and prove that a new measure can be derived if the general axiomatic system is augmented with the affine transformation axiom. Axiom A (Affine Transformation) There exists a function H such that for any non-singular matrix T and any PSF PT -- p(t x), x E R, w e R[pT] = H(R[p], T). Theorem 4.2. If R[.] is a resolution measure satisfying Axioms -7 and the ajfine transform Axiom A, then for any PSF p with finite first and second order moments and positive definite covariance matrix or, we Rip] = a i.e., the squared root of the the geometric means of ~,"",A (up to a positive constant), where o, ~,"",A are the eigenvalues of o. Proof. By Theorem 3.6 and Corollary 3.7, we )~j Rip] = RIP'I, where D is the diagonal matrix with positive diagonal elements )~,"",A. Let B = V~ be the diagonal matrix with diagonal elements v~l,"", ~X/X. Then, G D = cg I where c is a positive constant. Therefore, Rip] = H(c~,B). For any PSF q and any two non-singular matrices U and V, by Axiom A, H(R[q], U. V)= R[qvv ] = R[(qv)v ) = H(R[qv], U) = H (H(R[q], V), U). Specifically, if U is orthonormal, by Axiom 4, H(R[q], U. V) = H(R[q], V). Similarly, if V is orthonormal, (24) H(R[q], U. V) = H(R[q], U). (25) Hence, pre- or post-multiplication of an affine transformation T by an orthonormal matrix does not change the value of H(R[q], T). Furthermore, if Y is orthonormal, U and W are non-singular, then H(R[q], U. Y. W) = H (H(R[q], WV), U) = H (H(R[q], W), U) = H(R[q], U. W), where the second equality follows by (24). Consequently, if T is a product of non-singular matrices and orthonormal matrices, those orthonormal matrices can be removed from the product without changing the value of H[n[q], T]. Let C(i, j) be the matrix obtained by exchanging the i-th and j-th columns, R(i,j) the matrix by exchanging the i-th and j-th rows of the identity matrix, for < i, j <. For ~ > 0, let S(~) be the diagonal matrix with the first diagonal element being ~ and other diagonal elements being. Then, B can be decomposed into a product of S(v/~l),..-,S(Ax/~), and a finite number of C(i, j)'s and R(i, j)'s. More precisely, we D = S(X~I) H R(,j)s(x/~)C(,J) j-'2 Since each of C(i, j)'s and R(i, j)'s is orthonormal, we ' [... R~] = g(a, H S(X/~J)) = H(a,S(\I H Aj)). ~ 700
5 Therefore, the function g(a,"",)~) in Corollary 3.7 only depends on the product of ~,"",A. Let us define a function ~ for this dependency Since eta( H = = g(t ) = l-[ for t > 0, we Hence, o(t. l] aj) = j-- aj). ~(~,~j) -- Aj ~(). j-- j-- Because ~() = g(,...,) = c~ by Axiom, the conclusion follows immediately. [3 the weak cascade axiom and the affine transformation axiom. Further work is underway to reveal relationship among resolution measures, and generalize the theory into the real and complex domains. Acknowledgments This work was supported in part by the ational Institutes of Health (IDCD R0 DC0058). Ming Jiang's work was supported in part by an KBRSF grant. References [] Tom L. Williams, The Optical Transfer Function of Imaging Systems, Institute of Physics Publishing, Bristol and Philadelphia, 999. [2] G. Wang and Y. Li, "Axiomatic approach for quantification of image resolution," IEEE Signal Procesing Letters, vol. 6, pp , 999. [3] J. A. O'Sullivan, Ming Jiang, Xiao ming Ma, and Ge Wang, "Axiomatic quantification of multidimensional image resolution," IEEE Trans. Information Theory, 999, accepted. [4] L. HSmander, The Analysis of Linear Partial Differential Operators, vol. I, Springer-Verlag, Berlin, second edition, Discussion and Conclusion In [2, 3], it was proved that the function F in Axiom S is F(x, y) = v/x 2 + y2. (26) and that the square of f defined in (6) is linear. Therefore Axiom S restricts the possible resolution measures at the arithmetic aspect, by the arithmetic property of the combination function F. That is one reason why we call it the arithmetic measure. The affine axiom Axiom A is an axiom about the resolution change under affine geometric transformations. This is also one reason why we call it geometric measure. Another reason for adopting those terms is that fortunately they are consistent with their mathematical constructions as the arithmetic and geometric means of its constituent elements. We presented a general axiomatic system for quantification of image resolution and demonstrated that any resolution measure consistent with the general axiomatic system must be a homogeneous symmetric function of order ½ of eigenvalues of a PSF. With additional axioms, resolution measures can be uniquely determined in the family of resolution measures permissible in the general axiomatic system. Specifically, the squared root of the geometric means of PSF covariance matrix eigenvalues been singled out with 70
A general axiomatic system for image resolution quantification
J. Math. Anal. Appl. 315 (2006) 462 473 www.elsevier.com/locate/jmaa A general axiomatic system for image resolution quantification Ming Jiang a,,1,gewang b,2, Xiao-ming Ma c a LMAM, School of Mathematical
More information22m:033 Notes: 1.8 Linear Transformations
22m:033 Notes:.8 Linear Transformations Dennis Roseman University of Iowa Iowa City, IA http://www.math.uiowa.edu/ roseman February 9, 200 Transformation Definition. A function T : R n R m is sometimes
More information. The following is a 3 3 orthogonal matrix: 2/3 1/3 2/3 2/3 2/3 1/3 1/3 2/3 2/3
Lecture Notes: Orthogonal and Symmetric Matrices Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk Orthogonal Matrix Definition. An n n matrix
More informationarxiv: v1 [math.fa] 1 Oct 2015
SOME RESULTS ON SINGULAR VALUE INEQUALITIES OF COMPACT OPERATORS IN HILBERT SPACE arxiv:1510.00114v1 math.fa 1 Oct 2015 A. TAGHAVI, V. DARVISH, H. M. NAZARI, S. S. DRAGOMIR Abstract. We prove several singular
More informationLinear Hyperbolic Systems
Linear Hyperbolic Systems Professor Dr E F Toro Laboratory of Applied Mathematics University of Trento, Italy eleuterio.toro@unitn.it http://www.ing.unitn.it/toro October 8, 2014 1 / 56 We study some basic
More informationAPPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.
APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product
More informationRecall the convention that, for us, all vectors are column vectors.
Some linear algebra Recall the convention that, for us, all vectors are column vectors. 1. Symmetric matrices Let A be a real matrix. Recall that a complex number λ is an eigenvalue of A if there exists
More informationMATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.
MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation
More information1. Background: The SVD and the best basis (questions selected from Ch. 6- Can you fill in the exercises?)
Math 35 Exam Review SOLUTIONS Overview In this third of the course we focused on linear learning algorithms to model data. summarize: To. Background: The SVD and the best basis (questions selected from
More informationCS 143 Linear Algebra Review
CS 143 Linear Algebra Review Stefan Roth September 29, 2003 Introductory Remarks This review does not aim at mathematical rigor very much, but instead at ease of understanding and conciseness. Please see
More informationIr O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )
Section 3.2 Theorem 3.6. Let A be an m n matrix of rank r. Then r m, r n, and, by means of a finite number of elementary row and column operations, A can be transformed into the matrix ( ) Ir O D = 1 O
More informationRounding Transform. and Its Application for Lossless Pyramid Structured Coding ABSTRACT
Rounding Transform and Its Application for Lossless Pyramid Structured Coding ABSTRACT A new transform, called the rounding transform (RT), is introduced in this paper. This transform maps an integer vector
More informationSingular Value Decomposition (SVD)
School of Computing National University of Singapore CS CS524 Theoretical Foundations of Multimedia More Linear Algebra Singular Value Decomposition (SVD) The highpoint of linear algebra Gilbert Strang
More informationSubspace Classifiers. Robert M. Haralick. Computer Science, Graduate Center City University of New York
Subspace Classifiers Robert M. Haralick Computer Science, Graduate Center City University of New York Outline The Gaussian Classifier When Σ 1 = Σ 2 and P(c 1 ) = P(c 2 ), then assign vector x to class
More informationHOMEWORK PROBLEMS FROM STRANG S LINEAR ALGEBRA AND ITS APPLICATIONS (4TH EDITION)
HOMEWORK PROBLEMS FROM STRANG S LINEAR ALGEBRA AND ITS APPLICATIONS (4TH EDITION) PROFESSOR STEVEN MILLER: BROWN UNIVERSITY: SPRING 2007 1. CHAPTER 1: MATRICES AND GAUSSIAN ELIMINATION Page 9, # 3: Describe
More information22m:033 Notes: 7.1 Diagonalization of Symmetric Matrices
m:33 Notes: 7. Diagonalization of Symmetric Matrices Dennis Roseman University of Iowa Iowa City, IA http://www.math.uiowa.edu/ roseman May 3, Symmetric matrices Definition. A symmetric matrix is a matrix
More informationQ1 Q2 Q3 Q4 Tot Letr Xtra
Mathematics 54.1 Final Exam, 12 May 2011 180 minutes, 90 points NAME: ID: GSI: INSTRUCTIONS: You must justify your answers, except when told otherwise. All the work for a question should be on the respective
More informationYORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics MATH M Test #2 Solutions
YORK UNIVERSITY Faculty of Science Department of Mathematics and Statistics MATH 3. M Test # Solutions. (8 pts) For each statement indicate whether it is always TRUE or sometimes FALSE. Note: For this
More informationReview of Linear Algebra
Review of Linear Algebra Dr Gerhard Roth COMP 40A Winter 05 Version Linear algebra Is an important area of mathematics It is the basis of computer vision Is very widely taught, and there are many resources
More informationFinal A. Problem Points Score Total 100. Math115A Nadja Hempel 03/23/2017
Final A Math115A Nadja Hempel 03/23/2017 nadja@math.ucla.edu Name: UID: Problem Points Score 1 10 2 20 3 5 4 5 5 9 6 5 7 7 8 13 9 16 10 10 Total 100 1 2 Exercise 1. (10pt) Let T : V V be a linear transformation.
More informationChapter 6 Inner product spaces
Chapter 6 Inner product spaces 6.1 Inner products and norms Definition 1 Let V be a vector space over F. An inner product on V is a function, : V V F such that the following conditions hold. x+z,y = x,y
More informationQuadrature for the Finite Free Convolution
Spectral Graph Theory Lecture 23 Quadrature for the Finite Free Convolution Daniel A. Spielman November 30, 205 Disclaimer These notes are not necessarily an accurate representation of what happened in
More informationj=1 u 1jv 1j. 1/ 2 Lemma 1. An orthogonal set of vectors must be linearly independent.
Lecture Notes: Orthogonal and Symmetric Matrices Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk Orthogonal Matrix Definition. Let u = [u
More informationInformatics 2B: Learning and Data Lecture 10 Discriminant functions 2. Minimal misclassifications. Decision Boundaries
Overview Gaussians estimated from training data Guido Sanguinetti Informatics B Learning and Data Lecture 1 9 March 1 Today s lecture Posterior probabilities, decision regions and minimising the probability
More informationPractice Exam. 2x 1 + 4x 2 + 2x 3 = 4 x 1 + 2x 2 + 3x 3 = 1 2x 1 + 3x 2 + 4x 3 = 5
Practice Exam. Solve the linear system using an augmented matrix. State whether the solution is unique, there are no solutions or whether there are infinitely many solutions. If the solution is unique,
More informationHW3 - Due 02/06. Each answer must be mathematically justified. Don t forget your name. 1 2, A = 2 2
HW3 - Due 02/06 Each answer must be mathematically justified Don t forget your name Problem 1 Find a 2 2 matrix B such that B 3 = A, where A = 2 2 If A was diagonal, it would be easy: we would just take
More informationMATH 2360 REVIEW PROBLEMS
MATH 2360 REVIEW PROBLEMS Problem 1: In (a) (d) below, either compute the matrix product or indicate why it does not exist: ( )( ) 1 2 2 1 (a) 0 1 1 2 ( ) 0 1 2 (b) 0 3 1 4 3 4 5 2 5 (c) 0 3 ) 1 4 ( 1
More informationLinear Algebra & Geometry why is linear algebra useful in computer vision?
Linear Algebra & Geometry why is linear algebra useful in computer vision? References: -Any book on linear algebra! -[HZ] chapters 2, 4 Some of the slides in this lecture are courtesy to Prof. Octavia
More informationMATH 235. Final ANSWERS May 5, 2015
MATH 235 Final ANSWERS May 5, 25. ( points) Fix positive integers m, n and consider the vector space V of all m n matrices with entries in the real numbers R. (a) Find the dimension of V and prove your
More informationLinear Algebra. Min Yan
Linear Algebra Min Yan January 2, 2018 2 Contents 1 Vector Space 7 1.1 Definition................................. 7 1.1.1 Axioms of Vector Space..................... 7 1.1.2 Consequence of Axiom......................
More informationLecture 13. Principal Component Analysis. Brett Bernstein. April 25, CDS at NYU. Brett Bernstein (CDS at NYU) Lecture 13 April 25, / 26
Principal Component Analysis Brett Bernstein CDS at NYU April 25, 2017 Brett Bernstein (CDS at NYU) Lecture 13 April 25, 2017 1 / 26 Initial Question Intro Question Question Let S R n n be symmetric. 1
More informationSome inequalities for unitarily invariant norms of matrices
Wang et al Journal of Inequalities and Applications 011, 011:10 http://wwwjournalofinequalitiesandapplicationscom/content/011/1/10 RESEARCH Open Access Some inequalities for unitarily invariant norms of
More informationA matrix over a field F is a rectangular array of elements from F. The symbol
Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted
More informationOR MSc Maths Revision Course
OR MSc Maths Revision Course Tom Byrne School of Mathematics University of Edinburgh t.m.byrne@sms.ed.ac.uk 15 September 2017 General Information Today JCMB Lecture Theatre A, 09:30-12:30 Mathematics revision
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationAxiomatic characterization of nonlinear homomorphic means
J. Math. Anal. Appl. 303 (2005) 350 363 www.elsevier.com/locate/jmaa Axiomatic characterization of nonlinear homomorphic means Ge Wang a,,1, Ming Jiang b,2 a CT/Micro-CT Laboratory, Department of Radiology,
More informationDS-GA 1002 Lecture notes 10 November 23, Linear models
DS-GA 2 Lecture notes November 23, 2 Linear functions Linear models A linear model encodes the assumption that two quantities are linearly related. Mathematically, this is characterized using linear functions.
More informationHomogeneous Linear Systems and Their General Solutions
37 Homogeneous Linear Systems and Their General Solutions We are now going to restrict our attention further to the standard first-order systems of differential equations that are linear, with particular
More informationDigital Image Processing
Digital Image Processing 2D SYSTEMS & PRELIMINARIES Hamid R. Rabiee Fall 2015 Outline 2 Two Dimensional Fourier & Z-transform Toeplitz & Circulant Matrices Orthogonal & Unitary Matrices Block Matrices
More informationThe existence of light-like homogeneous geodesics in homogeneous Lorentzian manifolds. Sao Paulo, 2013
The existence of light-like homogeneous geodesics in homogeneous Lorentzian manifolds Zdeněk Dušek Sao Paulo, 2013 Motivation In a previous project, it was proved that any homogeneous affine manifold (and
More informationHomework 1. Yuan Yao. September 18, 2011
Homework 1 Yuan Yao September 18, 2011 1. Singular Value Decomposition: The goal of this exercise is to refresh your memory about the singular value decomposition and matrix norms. A good reference to
More informationStatistical Pattern Recognition
Statistical Pattern Recognition Feature Extraction Hamid R. Rabiee Jafar Muhammadi, Alireza Ghasemi, Payam Siyari Spring 2014 http://ce.sharif.edu/courses/92-93/2/ce725-2/ Agenda Dimensionality Reduction
More information1 Linear Algebra Problems
Linear Algebra Problems. Let A be the conjugate transpose of the complex matrix A; i.e., A = A t : A is said to be Hermitian if A = A; real symmetric if A is real and A t = A; skew-hermitian if A = A and
More informationMATH 220 FINAL EXAMINATION December 13, Name ID # Section #
MATH 22 FINAL EXAMINATION December 3, 2 Name ID # Section # There are??multiple choice questions. Each problem is worth 5 points. Four possible answers are given for each problem, only one of which is
More informationFormal Groups. Niki Myrto Mavraki
Formal Groups Niki Myrto Mavraki Contents 1. Introduction 1 2. Some preliminaries 2 3. Formal Groups (1 dimensional) 2 4. Groups associated to formal groups 9 5. The Invariant Differential 11 6. The Formal
More informationGaussian random variables inr n
Gaussian vectors Lecture 5 Gaussian random variables inr n One-dimensional case One-dimensional Gaussian density with mean and standard deviation (called N, ): fx x exp. Proposition If X N,, then ax b
More information2.3. VECTOR SPACES 25
2.3. VECTOR SPACES 25 2.3 Vector Spaces MATH 294 FALL 982 PRELIM # 3a 2.3. Let C[, ] denote the space of continuous functions defined on the interval [,] (i.e. f(x) is a member of C[, ] if f(x) is continuous
More informationLINEAR ALGEBRA 1, 2012-I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS
LINEAR ALGEBRA, -I PARTIAL EXAM SOLUTIONS TO PRACTICE PROBLEMS Problem (a) For each of the two matrices below, (i) determine whether it is diagonalizable, (ii) determine whether it is orthogonally diagonalizable,
More information1 Inner Product and Orthogonality
CSCI 4/Fall 6/Vora/GWU/Orthogonality and Norms Inner Product and Orthogonality Definition : The inner product of two vectors x and y, x x x =.., y =. x n y y... y n is denoted x, y : Note that n x, y =
More informationMathematische Annalen
Math. Ann. 319, 707 714 (2001) Digital Object Identifier (DOI) 10.1007/s002080100175 Mathematische Annalen A Moebius characterization of Veronese surfaces in S n Haizhong Li Changping Wang Faen Wu Received
More informationApplied Differential Equation. November 30, 2012
Applied Differential Equation November 3, Contents 5 System of First Order Linear Equations 5 Introduction and Review of matrices 5 Systems of Linear Algebraic Equations, Linear Independence, Eigenvalues,
More informationMotivating the Covariance Matrix
Motivating the Covariance Matrix Raúl Rojas Computer Science Department Freie Universität Berlin January 2009 Abstract This note reviews some interesting properties of the covariance matrix and its role
More informationNATIONAL BOARD FOR HIGHER MATHEMATICS. Research Scholarships Screening Test. Saturday, February 2, Time Allowed: Two Hours Maximum Marks: 40
NATIONAL BOARD FOR HIGHER MATHEMATICS Research Scholarships Screening Test Saturday, February 2, 2008 Time Allowed: Two Hours Maximum Marks: 40 Please read, carefully, the instructions on the following
More informationTHE UNIVERSITY OF HONG KONG DEPARTMENT OF MATHEMATICS
THE UNIVERSITY OF HONG KONG DEPARTMENT OF MATHEMATICS MATH853: Linear Algebra, Probability and Statistics May 5, 05 9:30a.m. :30p.m. Only approved calculators as announced by the Examinations Secretary
More informationLecture 1 and 2: Random Spanning Trees
Recent Advances in Approximation Algorithms Spring 2015 Lecture 1 and 2: Random Spanning Trees Lecturer: Shayan Oveis Gharan March 31st Disclaimer: These notes have not been subjected to the usual scrutiny
More informationVector spaces. DS-GA 1013 / MATH-GA 2824 Optimization-based Data Analysis.
Vector spaces DS-GA 1013 / MATH-GA 2824 Optimization-based Data Analysis http://www.cims.nyu.edu/~cfgranda/pages/obda_fall17/index.html Carlos Fernandez-Granda Vector space Consists of: A set V A scalar
More informationSingular Value Decomposition
Singular Value Decomposition Motivatation The diagonalization theorem play a part in many interesting applications. Unfortunately not all matrices can be factored as A = PDP However a factorization A =
More informationA new robust delay-dependent stability criterion for a class of uncertain systems with delay
A new robust delay-dependent stability criterion for a class of uncertain systems with delay Fei Hao Long Wang and Tianguang Chu Abstract A new robust delay-dependent stability criterion for a class of
More informationKernel Method: Data Analysis with Positive Definite Kernels
Kernel Method: Data Analysis with Positive Definite Kernels 2. Positive Definite Kernel and Reproducing Kernel Hilbert Space Kenji Fukumizu The Institute of Statistical Mathematics. Graduate University
More informationSingular Value Inequalities for Real and Imaginary Parts of Matrices
Filomat 3:1 16, 63 69 DOI 1.98/FIL16163C Published by Faculty of Sciences Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Singular Value Inequalities for Real Imaginary
More informationELEMENTS OF PROBABILITY THEORY
ELEMENTS OF PROBABILITY THEORY Elements of Probability Theory A collection of subsets of a set Ω is called a σ algebra if it contains Ω and is closed under the operations of taking complements and countable
More informationReview of similarity transformation and Singular Value Decomposition
Review of similarity transformation and Singular Value Decomposition Nasser M Abbasi Applied Mathematics Department, California State University, Fullerton July 8 7 page compiled on June 9, 5 at 9:5pm
More informationThe multidimensional Ito Integral and the multidimensional Ito Formula. Eric Mu ller June 1, 2015 Seminar on Stochastic Geometry and its applications
The multidimensional Ito Integral and the multidimensional Ito Formula Eric Mu ller June 1, 215 Seminar on Stochastic Geometry and its applications page 2 Seminar on Stochastic Geometry and its applications
More informationSolution to Final, MATH 54, Linear Algebra and Differential Equations, Fall 2014
Solution to Final, MATH 54, Linear Algebra and Differential Equations, Fall 24 Name (Last, First): Student ID: Circle your section: 2 Shin 8am 7 Evans 22 Lim pm 35 Etcheverry 22 Cho 8am 75 Evans 23 Tanzer
More informationSpring, 2012 CIS 515. Fundamentals of Linear Algebra and Optimization Jean Gallier
Spring 0 CIS 55 Fundamentals of Linear Algebra and Optimization Jean Gallier Homework 5 & 6 + Project 3 & 4 Note: Problems B and B6 are for extra credit April 7 0; Due May 7 0 Problem B (0 pts) Let A be
More informationIntroduction to Matrices
POLS 704 Introduction to Matrices Introduction to Matrices. The Cast of Characters A matrix is a rectangular array (i.e., a table) of numbers. For example, 2 3 X 4 5 6 (4 3) 7 8 9 0 0 0 Thismatrix,with4rowsand3columns,isoforder
More informationRadial Basis Functions I
Radial Basis Functions I Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo November 14, 2008 Today Reformulation of natural cubic spline interpolation Scattered
More information1 Last time: least-squares problems
MATH Linear algebra (Fall 07) Lecture Last time: least-squares problems Definition. If A is an m n matrix and b R m, then a least-squares solution to the linear system Ax = b is a vector x R n such that
More informationThe Cartan Dieudonné Theorem
Chapter 7 The Cartan Dieudonné Theorem 7.1 Orthogonal Reflections Orthogonal symmetries are a very important example of isometries. First let us review the definition of a (linear) projection. Given a
More informationOn V-orthogonal projectors associated with a semi-norm
On V-orthogonal projectors associated with a semi-norm Short Title: V-orthogonal projectors Yongge Tian a, Yoshio Takane b a School of Economics, Shanghai University of Finance and Economics, Shanghai
More informationChapter 5. The multivariate normal distribution. Probability Theory. Linear transformations. The mean vector and the covariance matrix
Probability Theory Linear transformations A transformation is said to be linear if every single function in the transformation is a linear combination. Chapter 5 The multivariate normal distribution When
More informationEach copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.
On the Hahn-Banach Extension Property Author(s): Jonathan M. Borwein Source: Proceedings of the American Mathematical Society, Vol. 86, No. 1, (Sep., 1982), pp. 42-46 Published by: American Mathematical
More information1 Systems of Differential Equations
March, 20 7- Systems of Differential Equations Let U e an open suset of R n, I e an open interval in R and : I R n R n e a function from I R n to R n The equation ẋ = ft, x is called a first order ordinary
More informationPRACTICE PROBLEMS FOR THE FINAL
PRACTICE PROBLEMS FOR THE FINAL Here are a slew of practice problems for the final culled from old exams:. Let P be the vector space of polynomials of degree at most. Let B = {, (t ), t + t }. (a) Show
More informationMethods for sparse analysis of high-dimensional data, II
Methods for sparse analysis of high-dimensional data, II Rachel Ward May 26, 2011 High dimensional data with low-dimensional structure 300 by 300 pixel images = 90, 000 dimensions 2 / 55 High dimensional
More informationNewtonian Mechanics. Chapter Classical space-time
Chapter 1 Newtonian Mechanics In these notes classical mechanics will be viewed as a mathematical model for the description of physical systems consisting of a certain (generally finite) number of particles
More informationTutorial on Principal Component Analysis
Tutorial on Principal Component Analysis Copyright c 1997, 2003 Javier R. Movellan. This is an open source document. Permission is granted to copy, distribute and/or modify this document under the terms
More informationGeneralized hyper-bent functions over GF(p)
Discrete Applied Mathematics 55 2007) 066 070 Note Generalized hyper-bent functions over GFp) A.M. Youssef Concordia Institute for Information Systems Engineering, Concordia University, Montreal, QC, H3G
More information6.1 Matrices. Definition: A Matrix A is a rectangular array of the form. A 11 A 12 A 1n A 21. A 2n. A m1 A m2 A mn A 22.
61 Matrices Definition: A Matrix A is a rectangular array of the form A 11 A 12 A 1n A 21 A 22 A 2n A m1 A m2 A mn The size of A is m n, where m is the number of rows and n is the number of columns The
More informationVector Spaces and SubSpaces
Vector Spaces and SubSpaces Linear Algebra MATH 2076 Linear Algebra Vector Spaces & SubSpaces Chapter 4, Section 1b 1 / 10 What is a Vector Space? A vector space is a bunch of objects that we call vectors
More information1 Singular Value Decomposition and Principal Component
Singular Value Decomposition and Principal Component Analysis In these lectures we discuss the SVD and the PCA, two of the most widely used tools in machine learning. Principal Component Analysis (PCA)
More informationMP 472 Quantum Information and Computation
MP 472 Quantum Information and Computation http://www.thphys.may.ie/staff/jvala/mp472.htm Outline Open quantum systems The density operator ensemble of quantum states general properties the reduced density
More informationUniversity of Colorado at Denver Mathematics Department Applied Linear Algebra Preliminary Exam With Solutions 16 January 2009, 10:00 am 2:00 pm
University of Colorado at Denver Mathematics Department Applied Linear Algebra Preliminary Exam With Solutions 16 January 2009, 10:00 am 2:00 pm Name: The proctor will let you read the following conditions
More informationMATRICES. knowledge on matrices Knowledge on matrix operations. Matrix as a tool of solving linear equations with two or three unknowns.
MATRICES After studying this chapter you will acquire the skills in knowledge on matrices Knowledge on matrix operations. Matrix as a tool of solving linear equations with two or three unknowns. List of
More informationLinear Algebra, 4th day, Thursday 7/1/04 REU Info:
Linear Algebra, 4th day, Thursday 7/1/04 REU 004. Info http//people.cs.uchicago.edu/laci/reu04. Instructor Laszlo Babai Scribe Nick Gurski 1 Linear maps We shall study the notion of maps between vector
More informationOptimization problems on the rank and inertia of the Hermitian matrix expression A BX (BX) with applications
Optimization problems on the rank and inertia of the Hermitian matrix expression A BX (BX) with applications Yongge Tian China Economics and Management Academy, Central University of Finance and Economics,
More informationFiedler s Theorems on Nodal Domains
Spectral Graph Theory Lecture 7 Fiedler s Theorems on Nodal Domains Daniel A. Spielman September 19, 2018 7.1 Overview In today s lecture we will justify some of the behavior we observed when using eigenvectors
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,
More informationLesson Rigid Body Dynamics
Lesson 8 Rigid Body Dynamics Lesson 8 Outline Problem definition and motivations Dynamics of rigid bodies The equation of unconstrained motion (ODE) User and time control Demos / tools / libs Rigid Body
More informationParametrization of All Strictly Causal Stabilizing Controllers of Multidimensional Systems single-input single-output case
Parametrization of All Strictly Causal Stabilizing Controllers of Multidimensional Systems single-input single-output case K. Mori Abstract We give a parametrization of all strictly causal stabilizing
More informationControl design using Jordan controllable canonical form
Control design using Jordan controllable canonical form Krishna K Busawon School of Engineering, Ellison Building, University of Northumbria at Newcastle, Newcastle upon Tyne NE1 8ST, UK email: krishnabusawon@unnacuk
More informationLecture 7: Vectors and Matrices II Introduction to Matrices (See Sections, 3.3, 3.6, 3.7 and 3.9 in Boas)
Lecture 7: Vectors and Matrices II Introduction to Matrices (See Sections 3.3 3.6 3.7 and 3.9 in Boas) Here we will continue our discussion of vectors and their transformations. In Lecture 6 we gained
More informationMath Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88
Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant
More informationMATH 3330 INFORMATION SHEET FOR TEST 3 SPRING Test 3 will be in PKH 113 in class time, Tues April 21
MATH INFORMATION SHEET FOR TEST SPRING Test will be in PKH in class time, Tues April See above for date, time and location of Test It will last 7 minutes and is worth % of your course grade The material
More information18.06 Professor Edelman Quiz 3 December 5, 2011
18.06 Professor Edelman Quiz 3 December 5, 2011 Grading 1 Your PRINTED name is: 2 3 4 Please circle your recitation: 1 T 9 2-132 Kestutis Cesnavicius 2-089 2-1195 kestutis 2 T 10 2-132 Niels Moeller 2-588
More informationConsistent Bivariate Distribution
A Characterization of the Normal Conditional Distributions MATSUNO 79 Therefore, the function ( ) = G( : a/(1 b2)) = N(0, a/(1 b2)) is a solu- tion for the integral equation (10). The constant times of
More informationMath 408 Advanced Linear Algebra
Math 408 Advanced Linear Algebra Chi-Kwong Li Chapter 4 Hermitian and symmetric matrices Basic properties Theorem Let A M n. The following are equivalent. Remark (a) A is Hermitian, i.e., A = A. (b) x
More informationFocus was on solving matrix inversion problems Now we look at other properties of matrices Useful when A represents a transformations.
Previously Focus was on solving matrix inversion problems Now we look at other properties of matrices Useful when A represents a transformations y = Ax Or A simply represents data Notion of eigenvectors,
More informationSmall sample size in high dimensional space - minimum distance based classification.
Small sample size in high dimensional space - minimum distance based classification. Ewa Skubalska-Rafaj lowicz Institute of Computer Engineering, Automatics and Robotics, Department of Electronics, Wroc
More informationLinear Algebra & Geometry why is linear algebra useful in computer vision?
Linear Algebra & Geometry why is linear algebra useful in computer vision? References: -Any book on linear algebra! -[HZ] chapters 2, 4 Some of the slides in this lecture are courtesy to Prof. Octavia
More information