Multivariate and High Dimensional Visualizations Robert Herring.

Slides:



Advertisements
Similar presentations
3D Geometry for Computer Graphics
Advertisements

Noise & Data Reduction. Paired Sample t Test Data Transformation - Overview From Covariance Matrix to PCA and Dimension Reduction Fourier Analysis - Spectrum.
Lecture 3: A brief background to multivariate statistics
Isoparametric Elements Element Stiffness Matrices
An Introduction to Multivariate Analysis
電腦視覺 Computer and Robot Vision I
Differential geometry I
Dimension reduction (1)
Extended Gaussian Images
WFM 6202: Remote Sensing and GIS in Water Management © Dr. Akm Saiful IslamDr. Akm Saiful Islam WFM 6202: Remote Sensing and GIS in Water Management Akm.
3D Shape Histograms for Similarity Search and Classification in Spatial Databases. Mihael Ankerst,Gabi Kastenmuller, Hans-Peter-Kriegel,Thomas Seidl Univ.
Visualizing and Exploring Data Summary statistics for data (mean, median, mode, quartile, variance, skewnes) Distribution of values for single variables.
1Ellen L. Walker Edges Humans easily understand “line drawings” as pictures.
CS447/ Realistic Rendering -- Solids Modeling -- Introduction to 2D and 3D Computer Graphics.
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean 5403 T-R 3:00pm – 4:20pm Lecture #20.
TEKS 8.6 (A,B) & 8.7 (A,D) This slide is meant to be a title page for the whole presentation and not an actual slide. 8.6 (A) Generate similar shapes using.
One-Shot Multi-Set Non-rigid Feature-Spatial Matching
Dimensionality Reduction and Embeddings
The 2D Projective Plane Points and Lines.
Computer Graphics Recitation 6. 2 Last week - eigendecomposition A We want to learn how the transformation A works:
Dimensional reduction, PCA
Face Recognition Jeremy Wyatt.
The Terms that You Have to Know! Basis, Linear independent, Orthogonal Column space, Row space, Rank Linear combination Linear transformation Inner product.
Three Algorithms for Nonlinear Dimensionality Reduction Haixuan Yang Group Meeting Jan. 011, 2005.
11/30/06C:\Documents and Settings\Administrator\My Documents\533\gliff.odppage 1 Information Visualization: Glyphs CPSC 533 Topic Presentation Clarence.
Olga Sorkine’s slides Tel Aviv University. 2 Spectra and diagonalization A If A is symmetric, the eigenvectors are orthogonal (and there’s always an eigenbasis).
A Global Geometric Framework for Nonlinear Dimensionality Reduction Joshua B. Tenenbaum, Vin de Silva, John C. Langford Presented by Napat Triroj.
Dimensionality Reduction
Dimensionality Reduction. Multimedia DBs Many multimedia applications require efficient indexing in high-dimensions (time-series, images and videos, etc)
GI Systems and Science January 23, Points to Cover  What is spatial data modeling?  Entity definition  Topology  Spatial data models Raster.
Nonlinear Dimensionality Reduction by Locally Linear Embedding Sam T. Roweis and Lawrence K. Saul Reference: "Nonlinear dimensionality reduction by locally.
1 Finite-Volume Formulation. 2 Review of the Integral Equation The integral equation for the conservation statement is: Equation applies for a control.
CS 485/685 Computer Vision Face Recognition Using Principal Components Analysis (PCA) M. Turk, A. Pentland, "Eigenfaces for Recognition", Journal of Cognitive.
Nonlinear Dimensionality Reduction Approaches. Dimensionality Reduction The goal: The meaningful low-dimensional structures hidden in their high-dimensional.
SVD(Singular Value Decomposition) and Its Applications
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
Manifold learning: Locally Linear Embedding Jieping Ye Department of Computer Science and Engineering Arizona State University
Computer Graphics: Programming, Problem Solving, and Visual Communication Steve Cunningham California State University Stanislaus and Grinnell College.
The Tutorial of Principal Component Analysis, Hierarchical Clustering, and Multidimensional Scaling Wenshan Wang.
Dimensionality Reduction: Principal Components Analysis Optional Reading: Smith, A Tutorial on Principal Components Analysis (linked to class webpage)
Chapter 2 Dimensionality Reduction. Linear Methods
CDS 301 Fall, 2009 Vector Visualization Chap. 6 October 7, 2009 Jie Zhang Copyright ©
Edge Linking & Boundary Detection
Integral University EC-024 Digital Image Processing.
Principal Component Analysis Bamshad Mobasher DePaul University Bamshad Mobasher DePaul University.
Data Reduction. 1.Overview 2.The Curse of Dimensionality 3.Data Sampling 4.Binning and Reduction of Cardinality.
: Chapter 11: Three Dimensional Image Processing 1 Montri Karnjanadecha ac.th/~montri Image.
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
ECE 8443 – Pattern Recognition LECTURE 08: DIMENSIONALITY, PRINCIPAL COMPONENTS ANALYSIS Objectives: Data Considerations Computational Complexity Overfitting.
Tony Jebara, Columbia University Advanced Machine Learning & Perception Instructor: Tony Jebara.
Review on Graphics Basics. Outline Polygon rendering pipeline Affine transformations Projective transformations Lighting and shading From vertices to.
© Tan,Steinbach, Kumar Introduction to Data Mining 8/05/ Data Mining: Exploring Data Lecture Notes for Chapter 3 Introduction to Data Mining by Tan,
12/24/2015 A.Aruna/Assistant professor/IT/SNSCE 1.
Signal & Weight Vector Spaces
Basic Theory (for curve 01). 1.1 Points and Vectors  Real life methods for constructing curves and surfaces often start with points and vectors, which.
Data Visualization Fall The Data as a Quantity Quantities can be classified in two categories: Intrinsically continuous (scientific visualization,
3D Geometry for Computer Graphics Class 3. 2 Last week - eigendecomposition A We want to learn how the transformation A works:
Chapter 13 Discrete Image Transforms
1 Objective To provide background material in support of topics in Digital Image Processing that are based on matrices and/or vectors. Review Matrices.
CORRELATION-REGULATION ANALYSIS Томский политехнический университет.
Unsupervised Learning II Feature Extraction
Graphics Graphics Korea University kucg.korea.ac.kr Mathematics for Computer Graphics 고려대학교 컴퓨터 그래픽스 연구실.
3.1 Clustering Finding a good clustering of the points is a fundamental issue in computing a representative simplicial complex. Mapper does not place any.
Dimensionality Reduction
PERSPECTIVE PROJECTION…...
Spectral Methods Tutorial 6 1 © Maks Ovsjanikov
3.1 Clustering Finding a good clustering of the points is a fundamental issue in computing a representative simplicial complex. Mapper does not place any.
Domain-Modeling Techniques
Data Pre-processing Lecture Notes for Chapter 2
Presentation transcript:

Multivariate and High Dimensional Visualizations Robert Herring

Articles Covered  Visualizing the Behavior of Higher Dimensional Dynamical Systems Rainer Wegenkittl, Helwig Loffelmann, and Eduard Groller  Multivariate Visualization Using Metric Scaling Pak Chung Wong and R. Daniel Bergeron

Problem Addressed  Information gathered often contains multiple variables to be studied  Most visualization techniques focus on discrete statistical characteristics  These techniques are ill suited for visualizing continuous flow in high- dimensional space from dynamical systems  Statistical visualizations typically are not designed to show integral curves within a high-dimensional phase space Visualizing the Behavior of Higher Dimensional Dynamical Systems

Visualizing Multidimensional Data  Multivariate data sets becoming common  Data is either discrete of continuous  Data can be spatially coherent or spatially incoherent  Data sets may consist of a collection of sampled data Each sample is an n-dimensional data item Can be sampled from m-dimensional space L m n data set Visualizing the Behavior of Higher Dimensional Dynamical Systems

Visualizing Multidimensional Data  Two important goals Identification of individual parameters Detection of regions and correlation of variables  Methods for visualizing high-dimensional data Attribute Mapping Geometric Coding Sonification Reduction of Dimension Parallel Coordinates Visualizing the Behavior of Higher Dimensional Dynamical Systems

Attribute Mapping  Use geometric primitives, planes, etc.  Most commonly used attribute used in attribute mapping is color  Most common color models RGB and HLS  Advantages Easy calculation/interpretation, many people familiar with color mapping  Disadvantages No unique order, requires legend Can only encode 3 variables 8% of population has some form of color blindness Visualizing the Behavior of Higher Dimensional Dynamical Systems

Geometric Coding  Use distinct geometric objects and map high-dimensional data to geometric features or attributes of these objects  Glyphs  Icons  Chernoff Faces  Data Jacks  m-Arm Glyph Visualizing the Behavior of Higher Dimensional Dynamical Systems

Geometric Coding  Glyphs Utilized for interactive exploration of data sets Generic term for graphical entity whose shape/appearance is modified by mapping data values to graphical attributes (length, shape, angle, color, transparency, et.)  Icons Use icons as basic primitives Attributes mapped to icon shape, color, and texture to map multiple variables Visualizing the Behavior of Higher Dimensional Dynamical Systems

Geometric Coding  Chernoff Faces Uses stylized faces where variables influence appearance features like overall shape, mouth, eyes, nose, eyebrows, etc  Data Jacks Three-dimensional shapes with four different limbs (length, color, etc modified)  m-Arm Glyph Two-dimensional structure with m arms attached (thickness, angle from main axis, etc modified) Visualizing the Behavior of Higher Dimensional Dynamical Systems

Sonification  The use of sound to add a layer of dimensional that does not overload visual system  Sounds can vary over Pitch Volume Pulse Visualizing the Behavior of Higher Dimensional Dynamical Systems

Reduction of Dimension  Focusing Selecting subsets, reduction of dimension through projection Examples are panning, zooming, and slicing High dimensional data can be mapped to lower dimensions with other dimensions being represented via attributes  Linking Showing multiple varying visualizations of data Visualizing the Behavior of Higher Dimensional Dynamical Systems

Parallel Coordinates  Represent dimensions as parallel axes orthogonal to a horizontal line uniformly spaced on display  Each data set corresponds to a polyline that traverses/intersects these parallel axes Visualizing the Behavior of Higher Dimensional Dynamical Systems

High Dimensional Dynamical Systems and Visualization  Many natural phenomenona can be described by differential equations  Each differential equation describes the change of one state variable n differential equations define behavior of n state variables describing a n-dimensional dynamical system n-dimensional vector from each sampled set of state variables The discretized flow described by n differential equations forms a vector field of dimension n, where each vector itself is of dimension n L n n data set Visualizing the Behavior of Higher Dimensional Dynamical Systems

High Dimensional Dynamical Systems and Visualization  Dynamical system typically describes a complex but smooth flow  Behavior of flow determined by topology  To interpret behavior of system each point within n-space cannot be investigated by itself but seen in respect to its neighborhood Derived from continuous flow field  Two basic approaches Visualizing the Behavior of Higher Dimensional Dynamical Systems

High Dimensional Dynamical Systems and Visualization  Neighboring information can be calculated from vector field (interpreting Jacobian matrix) and the derived data displayed in n-space  Directional information at each point in n- space may be projected to an m- dimensional data object describing some local feature Visualizing the Behavior of Higher Dimensional Dynamical Systems

High Dimensional Dynamical Systems and Visualization  Direct global flow visualization can be done by starting short integral curves (trajectories), which follow the flow, at the nodes of an n-dimensional regular grid  Features like separatrices can be detected visually by interpreting the flow directions of the trajectories. Visualizing the Behavior of Higher Dimensional Dynamical Systems

Extruded Parallel Coordinates  Instead of using same coordinate system for each sample, move parallel coordinate system along third spatial axis  Polylines viewed as cross sections of a moving plane with a complex surface that defines the trajectory Visualizing the Behavior of Higher Dimensional Dynamical Systems

Extruded Parallel Coordinates Visualizing the Behavior of Higher Dimensional Dynamical Systems

Extruded Parallel Coordinates  Geometry of surface can be generated and modified quickly  Clustering and correlation visually detectable  Convergence and divergence pbserved by varying the starting coordinates of the trajectory slightly Visualizing the Behavior of Higher Dimensional Dynamical Systems

Linking with Wings  Two dimensions of high-dimensional system selected and displayed as a two- dimensional trajectory within a base plane  Third dimension of display can now be use to display third variable over base trajectory  If resulting three-dimensional trajectory is connected with base trajectory, thought of as a wing on the base trajectory Wing can be tilted at each point within a plane normal to base trajectory Visualizing the Behavior of Higher Dimensional Dynamical Systems

Linking with Wings Visualizing the Behavior of Higher Dimensional Dynamical Systems

Linking with Wings  Any number of wings can be added to display high-dimensional trajectories (occlusion problem)  Wings can be textured with a grid texture allowing exact measurement of wing dimensions  Self intersection can be a problem Wing size chosen to be small with respect to size of base trajectories Angles of wings kept must not be too big Visualizing the Behavior of Higher Dimensional Dynamical Systems

Three-dimensional Parallel Coordinates  Based on parallel coordinate method  One-dimensional spaces put together within two-dimensional space (planes) and linked with polylines  Positioning of planes is more flexible Can be moved, rotated within three-dimensional space Visualizing the Behavior of Higher Dimensional Dynamical Systems

Three-dimensional Parallel Coordinates Visualizing the Behavior of Higher Dimensional Dynamical Systems

Three-dimensional Parallel Coordinates Visualizing the Behavior of Higher Dimensional Dynamical Systems

Results Visualizing the Behavior of Higher Dimensional Dynamical Systems

Results Visualizing the Behavior of Higher Dimensional Dynamical Systems

Results Visualizing the Behavior of Higher Dimensional Dynamical Systems

Results Visualizing the Behavior of Higher Dimensional Dynamical Systems

Results Visualizing the Behavior of Higher Dimensional Dynamical Systems

Problem Addressed  Large multivariate can be difficult to navigate  Need a low dimensional representation to easy navigation  Metric scaling used as basis for creating low-dimensional overview Multivariate Visualization Using Metric Scaling

Metric Scaling  Start with set of n records with v variables and dissimilarities * rs measured between all pairs of records in n dimensional space  Configure graph of n vertices in d dimensional space Each vertex represents one record Distances d rs measured all pairs of vertices in display space match * rs in variate space as closely as possible Goal is to determine the dissimilarities between all pairs in v space and map them to coordinates in d dimensional display space Multivariate Visualization Using Metric Scaling

Metric Scaling Multivariate Visualization Using Metric Scaling

Data Dissimilarity Measurement  Compute dissimilarity between all pairs of input records  Euclidean distance in v space most common metric  Dissimilarity * rs between records r and s Multivariate Visualization Using Metric Scaling

Data Dissimilarity Measurement  Dataset with n records generates n x n real symmetric dissimilarity matrix Multivariate Visualization Using Metric Scaling

Recovery of Coordinates  Represent data as points in new p dimensional space where p <= n  Create inner product matrix from * rs in variate space, find its non-negative eigenvalues and the corresponding eigenvectors Yield the Euclidean coordinates of n vertices in p dimensional space Multivariate Visualization Using Metric Scaling

Principal Coordinates  Let Euclidean coordinates of n vertices in n dimensional Euclidean space be a matrix X = [x 1, x 2, …, x n ] such that x r = [x r1, …, x rn ] T where r = 1, 2, …, n  Euclidean distance between vertices r and s Multivariate Visualization Using Metric Scaling (1) (2)

Principal Coordinates  Standardize data to have zero mean and unit variance, center of mass of the vertices is the origin Multivariate Visualization Using Metric Scaling

Principal Coordinates Multivariate Visualization Using Metric Scaling since Equation (2) becomes (3)

Principal Coordinates Similarly (4) Multivariate Visualization Using Metric Scaling

Principal Coordinates Multivariate Visualization Using Metric Scaling Furthermore from (4) (5)

Principal Coordinates Multivariate Visualization Using Metric Scaling Defining inner product matrix B such that

Principal Coordinates Multivariate Visualization Using Metric Scaling Substituting (3), (4), and (5) into (1) gives the inner product Matrix B in terms of d rs

Principal Coordinates  Use principle components to recover Euclidean coordinates of the n dimensional space denoted by the matrix X from B = XX T  Since B is symmetric and positive semi- definite it has p positive eigenvalues  Let 7 be the eigenvalue matrix where the diagonals are the sorted eigenvalues Multivariate Visualization Using Metric Scaling (6)

Principal Coordinates  Let the corresponding normalized eigenvector of 7 be V By definition of eigenvectors matrix B can be described as B = V 7 V T  Since there are only p positive eigenvalues B can be expressed as B = V V 1 T = V / /2 V 1 T Where 7 1 is the eigenvalue matrix with the diagonal with 1 – p eigenvalues and V 1 is the corresponding eigenvalue of 7 1 Multivariate Visualization Using Metric Scaling (7)

Principal Coordinates  From (6) and (7) X = V /2 Multivariate Visualization Using Metric Scaling

Recovery of Coordinates  If eigenvalues are sorted in desending order the first principal component associated with the first eigenvalue is more important than the second  The distance between vertices r and s is Where x r and x s are the distance vectors associated with points r and s respectively Multivariate Visualization Using Metric Scaling

Recovery of Coordinates  A smaller eigenvalue contributes much less weight to the distance drs Smaller eigenvalues can be truncated with less error  Suppose d is selected as most significant eigenvalue to display data overview, the degree of accuracy of the approximation can be measured by Multivariate Visualization Using Metric Scaling

Strengths and Weaknesses  Data clustering Multivariate Visualization Using Metric Scaling

Strengths and Weaknesses  Display Density Multivariate Visualization Using Metric Scaling

Strengths and Weaknesses  Outlier Detections Multivariate Visualization Using Metric Scaling

Strengths and Weaknesses  Multiresolution Visualization Prograssive refinement to visualize datasets with many variates Multivariate Visualization Using Metric Scaling

Strengths and Weaknesses  Multiresolution Visualization Multivariate Visualization Using Metric Scaling

Strengths and Weaknesses  Multiresolution Visualization Multivariate Visualization Using Metric Scaling

Strengths and Weaknesses  Multiresolution Visualization Multivariate Visualization Using Metric Scaling

Strengths and Weaknesses  Individual variate values are lost Multivariate Visualization Using Metric Scaling

Integration of Techniques  Linking Multivariate Visualization Using Metric Scaling

Integration of Techniques  Merging Merge Euclidean coordinates of data overview and the data into one visualization display Brings new perspective to the conventional icon/glyph visualizations Multivariate Visualization Using Metric Scaling

Integration of Techniques

Questions?