Visualizing the Microscopic Structure of Bilinear Data: Two components chemical systems.

Slides:



Advertisements
Similar presentations
3D Geometry for Computer Graphics
Advertisements

Lecture 3: A brief background to multivariate statistics
Euclidean m-Space & Linear Equations Euclidean m-space.
Projective Geometry- 3D
Lecture 8 – Nonlinear Programming Models Topics General formulations Local vs. global solutions Solution characteristics Convexity and convex programming.
Maths for Computer Graphics
A B C k1k1 k2k2 Consecutive Reaction d[A] dt = -k 1 [A] d[B] dt = k 1 [A] - k 2 [B] d[C] dt = k 2 [B] [A] = [A] 0 exp (-k 1 t) [B] = [A] 0 (k 1 /(k 2 -k.
Computer Graphics Recitation 5.
HPLC-DAD. HPLC-DAD data t w t 2 Cw 2 S = Suppose in a chromatogram obtained with a HPLC-DAD there is a peak which an impurity is co-eluted with analyte.
The rank of a product of two matrices X and Y is equal to the smallest of the rank of X and Y: Rank (X Y) =min (rank (X), rank (Y)) A = C S.
Dual Problem of Linear Program subject to Primal LP Dual LP subject to ※ All duality theorems hold and work perfectly!
Epipolar Geometry and the Fundamental Matrix F
Chapter 3 Determinants and Matrices
Chapter 2 Matrices Definition of a matrix.
Visual Recognition Tutorial1 Random variables, distributions, and probability density functions Discrete Random Variables Continuous Random Variables.
PATTERN RECOGNITION : PRINCIPAL COMPONENTS ANALYSIS Prof.Dr.Cevdet Demir
Tutorial 10 Iterative Methods and Matrix Norms. 2 In an iterative process, the k+1 step is defined via: Iterative processes Eigenvector decomposition.
An Introduction to Model-Free Chemical Analysis Hamid Abdollahi IASBS, Zanjan Lecture 2.
Linear Equations in Linear Algebra
Arithmetic Operations on Matrices. 1. Definition of Matrix 2. Column, Row and Square Matrix 3. Addition and Subtraction of Matrices 4. Multiplying Row.
Separate multivariate observations
Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka Virginia de Sa (UCSD) Cogsci 108F Linear.
Basics of Linear Algebra A review?. Matrix  Mathematical term essentially corresponding to an array  An arrangement of numbers into rows and columns.
Prelude A pattern of activation in a NN is a vector A set of connection weights between units is a matrix Vectors and matrices have well-understood mathematical.
BINF6201/8201 Principle components analysis (PCA) -- Visualization of amino acids using their physico-chemical properties
Compiled By Raj G. Tiwari
Summarized by Soo-Jin Kim
1 February 24 Matrices 3.2 Matrices; Row reduction Standard form of a set of linear equations: Chapter 3 Linear Algebra Matrix of coefficients: Augmented.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Review for Chapter 4 Important Terms, Symbols, Concepts 4.1. Systems of Linear Equations in Two Variables.
Slide Chapter 7 Systems and Matrices 7.1 Solving Systems of Two Equations.
Projective cameras Motivation Elements of Projective Geometry Projective structure from motion Planches : –
Multivariate Statistics Matrix Algebra II W. M. van der Veld University of Amsterdam.
Chapter 3 Euclidean Vector Spaces Vectors in n-space Norm, Dot Product, and Distance in n-space Orthogonality
1 1.3 © 2012 Pearson Education, Inc. Linear Equations in Linear Algebra VECTOR EQUATIONS.
Chapter 3 Vectors in n-space Norm, Dot Product, and Distance in n-space Orthogonality.
1 Sample Geometry and Random Sampling Shyh-Kang Jeng Department of Electrical Engineering/ Graduate Institute of Communication/ Graduate Institute of Networking.
Chapter 6 Systems of Linear Equations and Matrices Sections 6.3 – 6.5.
Eigenvalues The eigenvalue problem is to determine the nontrivial solutions of the equation Ax= x where A is an n-by-n matrix, x is a length n column.
Introduction to Linear Algebra Mark Goldman Emily Mackevicius.
Chapter 4 Euclidean n-Space Linear Transformations from to Properties of Linear Transformations to Linear Transformations and Polynomials.
Review of Matrix Operations Vector: a sequence of elements (the order is important) e.g., x = (2, 1) denotes a vector length = sqrt(2*2+1*1) orientation.
PATTERN RECOGNITION : PRINCIPAL COMPONENTS ANALYSIS Richard Brereton
Rotational Ambiguity in Soft- Modeling Methods. D = USV = u 1 s 11 v 1 + … + u r s rr v r Singular Value Decomposition Row vectors: d 1,: d 2,: d p,:
Chapter 13 Discrete Image Transforms
Chapter 61 Chapter 7 Review of Matrix Methods Including: Eigen Vectors, Eigen Values, Principle Components, Singular Value Decomposition.
Computer Graphics Mathematical Fundamentals Lecture 10 Taqdees A. Siddiqi
Boot Camp in Linear Algebra TIM 209 Prof. Ram Akella.
Chapter 4 Vector Spaces Linear Algebra. Ch04_2 Definition 1. Let be a sequence of n real numbers. The set of all such sequences is called n-space (or.
Graphics Graphics Korea University kucg.korea.ac.kr Mathematics for Computer Graphics 고려대학교 컴퓨터 그래픽스 연구실.
Self-Modeling Curve Resolution and Constraints Hamid Abdollahi Department of Chemistry, Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan,
Lecture 1 Linear algebra Vectors, matrices. Linear algebra Encyclopedia Britannica:“a branch of mathematics that is concerned with mathematical structures.
An Introduction to Model-Free Chemical Analysis Hamid Abdollahi IASBS, Zanjan Lecture 3.
REVIEW Linear Combinations Given vectors and given scalars
Lecture 16: Image alignment
CS479/679 Pattern Recognition Dr. George Bebis
Review of Matrix Operations
Matrices and vector spaces
Lecture 8:Eigenfaces and Shared Features
EMGT 6412/MATH 6665 Mathematical Programming Spring 2016
Rotational Ambiguity in Hard-Soft Modeling Method
Epipolar geometry.
SVD: Physical Interpretation and Applications
Linear Equations in Linear Algebra
1.3 Vector Equations.
Chapter 3 Linear Algebra
Basics of Linear Algebra
Linear Algebra Lecture 28.
Outline Numerical Stability Singular Value Decomposition
Presentation transcript:

Visualizing the Microscopic Structure of Bilinear Data: Two components chemical systems

A matrix can be decomposed into the product of two significantly smaller matrices. Factorization: In many chemical studies, the measured or calculated properties of the system can be considered to be the linear sum of the term representing the fundamental effects in that system times appropriate weighing factors. D = X Y + R DX Y = + R

A simple one component system

Observing the rows of data in wavelength space

Observing the columns of data in time space

D = USV = u 1 s 11 v 1 + … + u r s rr v r Singular Value Decomposition =D U SV d 1,: d 2,: d p,: … = u 11 u 21 u p1 … s 11 v1v1 d 1,: = u 11 s 11 v 1 d 2,: = u 21 s 11 v 1 …… d p,: = u p1 s 11 v 1 For r=1 Row vectors: D = u 1 s 11 v 1

D = USV = u 1 s 11 v 1 + … + u r s rr v r Singular Value Decomposition [ d :,1 d :,2 … d :,q ] = u 1 s 11 [v 11 v 12 … v 1q ] d :,1 = u 1 s 11 v 11 …… d :,2 = u 1 s 11 v 12 d :,q = u 1 s 11 v 1q Column vectors: =D U SV For r=1 D = u 1 s 11 v 1

Rows of measured data matrix in row space: v1v1 u 11 s 11 v 1 u p1 s 11 v 1 u 11 s 11 u 21 s 11 … u p1 s 11 p points (rows of data matrix) in rows space have the following coordinates:

Columns of measured data matrix in column space: v 11 s 11 v 12 s 11 … v 1q s 11 q points (columns of data matrix) in columnss space have the following coordinates: u1u1 v 11 s 11 u 1 v 1q s 11 u 1

Visualizing the rows and columns of data matrix

Solutions Pure spectrum v 1j s 11 Pure conc. profile u i1 s 11

Two component systems

Visualizing data in three selected wavelengths

Visualizing data in three selected Times

Measured Data Matrix

D = USV = u 1 s 11 v 1 + … + u r s rr v r Singular Value Decomposition Row vectors: d 1,: d 2,: d p,: … = u 11 u 21 u p1 … s 11 v1v1 u 12 u 22 u p2 … s 22 v2v2 + d 1,: = u 11 s 11 v 1 + u 12 s 22 v 2 d 2,: = …… d p,: = u 21 s 11 v 1 + u 22 s 22 v 2 u p1 s 11 v 1 + u p2 s 22 v 2 … For r=2 D = u 1 s 11 v 1 + u 2 s 22 v 2

D = USV = u 1 s 11 v 1 + … + u r s rr v r Singular Value Decomposition [ d :,1 d :,2 … d :,q ] = u 1 s 11 [v 11 v 12 … v 1q ] + u 2 s 22 [v 21 v 22 … v 2q ] d :,1 = s 11 v 11 u 1 + s 22 v 21 u 2 …… d :,2 = d :,q = s 11 v 12 u 1 + s 22 v 22 u 2 s 11 v 1q u 1 + s 22 v 2q u 2 For r=2 D = u 1 s 11 v 1 + u 2 s 22 v 2 Column vectors:

Rows of measured data matrix in row space: u 11 s 11 d 1,: v1v1 v2v2 u 12 s 22 d 2,: d p,: u 21 s 11 u 22 s 22 u p2 s 22 u p1 s 11 … u 11 s 11 u 12 s 22 … u 21 s 11 u 22 s 22 u p1 s 11 u p2 s 22 … Coordinates of rows

Columns of measured data matrix in column space: u1u1 u2u2 d :, 2 d :, 1 d :, q … v 2q s 22 v 1q s 11 v 12 s 11 v 22 s 22 v 21 s 22 v 11 s 11 v 11 s 11 v 12 s v 1q s 11 Coordinates of columns v 21 s 11 v 22 s v 2q s 11

Two component chromatographic system

Two component Kinetic system

Two component multivariate calibration

Position of a known profile in corresponding space: dxdx T v1 T v2 v1v1 v2v2 T v1 is the length of projection of d x on v 1 vector T v1 = d x. v 1 T v2 is the length of projection of d x on v 1 vector T v2 = d x. v 2 T v1 T v2 Coordinates of d x point:

Position of real profiles in V and U spaces

Duality in Measured Data Matrix

p n xiTxiT xjxj x ij PpPp SnSn vnvn v1v1 vivi PnPn SpSp upup u1u1 ujuj xixi xjxj Geometrical interpretation of an n x p matrix X

R= C S T = U D V T = X V T R T = S C T = VD U T = Y U T X = U D = RV = U Y T V Y= V D = R T U = V X T U X YTYT U V Duality based relation between column and row spaces =

Non-negativity constraint and the system of inequalities: U z ≥ 0 V z ≥ 0 X = U DU= X D -1 Y = V DV= Y D -1 U z = X D -1 z ≥ 0 Hyperplanes V z = Y D -1 z ≥ 0 Hyperplanes U-space Y Points V-space X Points

Duality based relation between column and row spaces x i = [x i,1 x i,2 ] U i,1 z i,1 + U i,2 z i,2 … U i,N z i,N ≥ 0 The coordinates of each point in one space defines the coefficient of related hyper plane in dual space Point x in V-spaceHyper plane (D -1 x) z in U-space For two-component systems: The ith point in V-space: x i x i D -1 = [U i,1 U i,2 … U i,N ] The ith hyperplane in U-space: A point in V-space: U i,1 z 1 + U i,2 z 2 ≥ 0 A half-plane in V-space:

Half-plane calculation in two-component systems: General half-plane General border line can be defined for all points that the ith element of the profile is equal to zero z1z1 z2z2 0 ith half-plane ith border line General border line U i,1 z 1 + U i,2 z 2 ≥ 0 z 2 ≥ (-U i,2 /U i,1 )z 1 z 2 = (-U i,2 /U i,1 )z 1

Chromatographic data

Kinetics data

Calibration data

Intensity ambiguity in V space v1v1 v2v2 a k1ak1a k2ak2a T 11 T 12 k 1 T 11 k 1 T 12 k 2 T 11 k 2 T 12

Normalization to unit length v1v1 v2v2 a k1ak1a k2ak2a T 11 T 12 k 1 T 11 k 1 T 12 k 2 T 11 k 2 T 12 anan a n = (1/||a||) a

Normalization to first eigenvector v1v1 v2v2 a k1ak1a k2ak2a T 11 T 12 k 1 T 11 k 1 T 12 k 2 T 11 k 2 T 12 1 a n = (1/(v.a))a anan

v1v1 v2v ’2’3’ 4’ 5’ Normalization to unit length

v1v1 v2v a = T 1 v 1 + T 2 v 2 a’ = v 1 + T v 2 1’2’3’ 4’ 5’ Normalization to first eigenvector

Chromatographic data- Normalized to unit length

Chromatographic data- Normalized to 1th eigenvector

Kinetics data- Normalized to unit length

Kinetics data- Normalized to 1th eigenvector

Multivariate calibration data- Normalized to unit length

Multivariate calibration data- Normalized to 1th eigenvector

The normalized abstract space of two component systems is one dimensional Data points region One dimensional normalized space There are 4 critical points in normalized abstract space of two-component systems: 1212 First inner point Second inner point First outer point Second outer point The 4 critical points can be calculated very easily and so the complete resolving of two component systems is very simple First feasible region Second feasible region Lawton-Sylvester Plot

Microscopic Observation of Two Component systems using Lawton- Sylvester Plot

First feasible solutions Second feasible solutions General Microscopic Structures of Two-Component Systems Second feasible solutions Case I) Case II) Case III)

Lawton-Sylvester Plot- Multivariate calibration

Feasible Bands- Multivariate calibration

Feasible Bands- Chromatographic Data

Feasible Bands- Kinetics Data

Kinetics Data (I)

LS plot as a microscope for kinetics data (I)

Feasible bands for kinetics data (I)

Kinetics Data (II)

LS plot as a microscope for kinetics data (II)

Feasible bands for kinetics data (II)