Does 3D Really Make Sense for Visual Cluster Analysis? Yes! Bing Wang and Klaus Mueller Visual Analytics and Imaging Lab Computer Science Department Stony.

Slides:



Advertisements
Similar presentations
Matthew C. Fleenor Roanoke College
Advertisements

Outline 3. Data Analysis 4. Follow Up Study 1. Previous Work 2. Experiment.
(1) Scalable WIM by Li, Fu and Hanson Yinggang Li *, Chi-Wing Fu +, Andrew Hanson * Department of Computer Science * Indiana University + Hong Kong University.
Face Recognition Sumitha Balasuriya.
1 SDMIV Data Visualization - A Very Rough Guide Ken Brodlie University of Leeds.
Chapter 19 Design Model for WebApps
Exploration of bump, parallax, relief and displacement mapping
TorusVis ND : Unraveling High- Dimensional Torus Networks for Network Traffic Visualizations Shenghui Cheng, Pradipta De, Shaofeng H.-C. Jiang* and Klaus.
Salvatore giorgi Ece 8110 machine learning 5/12/2014
Structure-Based Distance Metric for High-Dimensional Space Exploration with Multi-Dimensional Scaling Jenny Hyunjung Lee , Kevin T. McDonnell, Alla Zelenyuk.
More on Clustering Hierarchical Clustering to be discussed in Clustering Part2 DBSCAN will be used in programming project.
3D Graphics Rendering and Terrain Modeling
IView: A Feature Clustering Framework for Suggesting Informative Views in Volume Visualization Ziyi Zheng, Nafees Ahmed, Klaus Mueller Visual Analytics.
Computer Vision – Image Representation (Histograms)
Neurocomputing,Neurocomputing, Haojie Li Jinhui Tang Yi Wang Bin Liu School of Software, Dalian University of Technology School of Computer Science,
Non-linear Dimensionality Reduction CMPUT 466/551 Nilanjan Ray Prepared on materials from the book Non-linear dimensionality reduction By Lee and Verleysen,
Mapping Nominal Values to Numbers for Effective Visualization Presented by Matthew O. Ward Geraldine Rosario, Elke Rundensteiner, David Brown, Matthew.
Visual Analytics Research at WPI Dr. Matthew Ward and Dr. Elke Rundensteiner Computer Science Department.
Principal Component Analysis CMPUT 466/551 Nilanjan Ray.
Visualization CSC 485A, CSC 586A, SENG 480A Instructor: Melanie Tory.
Chapter 5: Query Operations Baeza-Yates, 1999 Modern Information Retrieval.
Multivariate Data Visualization Adapted from Slides by: Matthew O. Ward Computer Science Department Worcester Polytechnic Institute This work was supported.
Machine Learning ICS 178 Instructor: Max Welling visualization & k nearest neighbors.
Dimensionality Reduction
Video Trails: Representing and Visualizing Structure in Video Sequences Vikrant Kobla David Doermann Christos Faloutsos.
Dimensionality Reduction. Multimedia DBs Many multimedia applications require efficient indexing in high-dimensions (time-series, images and videos, etc)
The Tutorial of Principal Component Analysis, Hierarchical Clustering, and Multidimensional Scaling Wenshan Wang.
Chapter 2 Dimensionality Reduction. Linear Methods
Autonomous Learning of Object Models on Mobile Robots Xiang Li Ph.D. student supervised by Dr. Mohan Sridharan Stochastic Estimation and Autonomous Robotics.
DATA MINING from data to information Ronald Westra Dep. Mathematics Knowledge Engineering Maastricht University.
Technology and Historical Overview. Introduction to 3d Computer Graphics  3D computer graphics is the science, study, and method of projecting a mathematical.
O AK R IDGE N ATIONAL L ABORATORY U. S. D EPARTMENT OF E NERGY RobustMap: A Fast and Robust Algorithm for Dimension Reduction and Clustering Lionel F.
1 Another Look at Camera Control Karan Singh †, Cindy Grimm, Nisha Sudarsanan Media and Machines Lab Department of Computer Science and Engineering Washington.
Graphite 2004 Statistical Synthesis of Facial Expressions for the Portrayal of Emotion Lisa Gralewski Bristol University United Kingdom
BACKGROUND LEARNING AND LETTER DETECTION USING TEXTURE WITH PRINCIPAL COMPONENT ANALYSIS (PCA) CIS 601 PROJECT SUMIT BASU FALL 2004.
1 Perception, Illusion and VR HNRS 299, Spring 2008 Lecture 8 Seeing Depth.
The Effects of Immersion and Navigation on the Acquisition of Spatial Knowledge of Abstract Data Networks James Henry, M.S. Nicholas F. Polys, Ph.D. Virginia.
DBSCAN Data Mining algorithm Dr Veljko Milutinović Milan Micić
Basic 3D Concepts. Overview 1.Coordinate systems 2.Transformations 3.Projection 4.Rasterization.
Image Segmentation in Color Space By Anisa Chaudhary.
Tony Jebara, Columbia University Advanced Machine Learning & Perception Instructor: Tony Jebara.
Presented by Ho Wai Shing
© Tan,Steinbach, Kumar Introduction to Data Mining 8/05/ Data Mining: Exploring Data Lecture Notes for Chapter 3 Introduction to Data Mining by Tan,
Visualizing and Exploring Data 1. Outline 1.Introduction 2.Summarizing Data: Some Simple Examples 3.Tools for Displaying Single Variable 4.Tools for Displaying.
Principle Component Analysis and its use in MA clustering Lecture 12.
1 Some Guidelines for Good Research Dr Leow Wee Kheng Dept. of Computer Science.
Visual Correlation Analysis of Numerical and Categorical Data on the Correlation Map Zhiyuan Zhang, Kevin T. McDonnell, Erez Zadok, Klaus Mueller.
1Ellen L. Walker 3D Vision Why? The world is 3D Not all useful information is readily available in 2D Why so hard? “Inverse problem”: one image = many.
DATA OUTPUT  maps  tables. DATA OUTPUT output from GIS does not have to be a map many GIS are designed with poor map output capabilities types of output:
Perception and VR MONT 104S, Fall 2008 Lecture 8 Seeing Depth
Irfan Ullah Department of Information and Communication Engineering Myongji university, Yongin, South Korea Copyright © solarlits.com.
Attila Kiss, Tamás Németh, Szabolcs Sergyán, Zoltán Vámossy, László Csink Budapest Tech Recognition of a Moving Object in a Stereo Environment Using a.
Image-Based Rendering Geometry and light interaction may be difficult and expensive to model –Think of how hard radiosity is –Imagine the complexity of.
Parameter Reduction for Density-based Clustering on Large Data Sets Elizabeth Wang.
1 Visualizing Multi-dimensional Clusters, Trends, and Outliers using Star Coordinates Author : Eser Kandogan Reporter : Tze Ho-Lin 2007/5/9 SIGKDD, 2001.
1 2D TO 3D IMAGE AND VIDEO CONVERSION. INTRODUCTION The goal is to take already existing 2D content, and artificially produce the left and right views.
Extension of Star Coordinates into Three Dimensions Nathan Cooprider University of Utah School of Computing Robert Burton Brigham Young.
Processing visual information for Computer Vision
More on Clustering in COSC 4335
CSE 4705 Artificial Intelligence
Xin Zhao and Arie Kaufman
CS201 Lecture 02 Computer Vision: Image Formation and Basic Techniques
3D Graphics Rendering PPT By Ricardo Veguilla.
Principal Component Analysis (PCA)
Local Feature Extraction Using Scale-Space Decomposition
Domain-Modeling Techniques
Visualization CSE 694L Roger Crawfis The Ohio State University.
Scientific Visualization
Strength of relation High Low Number of data Relationship Data
Data exploration and visualization
Presentation transcript:

Does 3D Really Make Sense for Visual Cluster Analysis? Yes! Bing Wang and Klaus Mueller Visual Analytics and Imaging Lab Computer Science Department Stony Brook University and SUNY Korea

but they’re just illusions….

still just illusions….

Why Do These Work So Well? Because they appeal to learned depth cues:  shading  occlusion  shadows  perspective  depth of field And they are also illusions of known 3D objects  learned in childhood  often in conjunction with touching  no need for stereo  motion parallax is just as good

Indexing the Brain Next time a similar object is seen the 3D shape is retrieved Already recognized by H. von Helmholtz in the 19 th century  see also G. Hatfield “Perception as Unconscious Inference”

What’s Cluster Analysis Goal  tries to find shapes and trends in ND point clouds  a common tool is the Scatterplot matrix

Scatterplot Matrices Don’t Scale Can’t see multivariate relationships  especially not when D is high

What Can 3D Do for Cluster Analysis Cluster analysis research and practice is reluctant to use 3D  but why not take advantage of this collection of learnt 3D shapes A common argument is  what will you do when the data is 4D, 5D, …, ND?  so we tested how many datasets are truly way beyond 3D  here we looked at each cluster separately, as a low-D subspace

Workflow Unclustered data Clustered data DBSCAN Eigenvalues Principal Components PCA Intrinsic Dimensionality Elbow Subspace Similarity Cosine

What’s DBSCAN Can find arbitrary shaped clusters based on density  DBSCAN = Density-Based Spatial Clustering of Applications with Noise  recruits points to a cluster based on reachability  two parameters -neighborhood radius ε -the minimum number of points minPtn a cluster needs to have -difficult to find good settings

DBSCAN – Example

Visual Interface for DBSCAN Parameters Distance histogram  shows all pairwise distances  helps to choose  Neighborhood heat map  shows for each point the number of points within a certain   helps to choose minPtn number of neighbors   0 20

Intrinsic Dimensionality We used the elbow method on the scree plot  but typically there are long tails due to noise  might be better to use the percentage, say 5% (0.05) ordered normalized Eigenvalue % PCA Eigenvalue

Cosine Similarity We computed the cosine similarity of the PCA vectors  did this for every ordered pair of PCA vectors and subspace  determines the similarity of the subspaces  helps to plan transitioning in the visualization

Results We studied a (so far) small set of public domain datasets  from the UCI machine learning repository  Boston Housing (n=506, d=14)  Image Segmentation (n=1,200, d=18) We also studied datasets from our own collection  atmospheric dataset ISDAC (n=221, d=33)

Boston Housing Analysis  there are 3 representative clusters  according to screeplot 3D seems to be OK  subspace 3 quite different from subspace 1 and 2 which are similar

Image Segmentation Analysis  elbow at d=3 and 5% mark is at d=4 or 5  for all clusters d=3 has 15% or lower  PCA similarity analysis showed that all but one subspace pair were quite different

ISDAC Analysis  3D with perhaps some transitioning seems to be OK  PCA similarity analysis indicated that subspaces are different

Visualization System Overview 2D scatterplot shaded 3D display SPLOM

Our System 3D exploration interface with subspace hopping capability  trackball interface for continuous rotation in 3D space  interactions to fluidly transition from one 3D subspace to another local subspace explore (LSE) global subspace explorer (GSE)

Interactions Mouse buttons control subspace navigation  left mouse press rotates the trackball within the 3D subspace  right mouse press tilts the trackball into a new subspace  middle press changes the z-axis and goes “deeper” into ND space Cluster chasing

Subspace Trail Map Gives an overview about subspaces visited  layout with generalized barycentric coordinates  user can click anywhere to visit the corresponding subspace

Switch to 3D Views

Demo Video play video

Future Work Study more datasets Refine 3D shape display  expand current convex hull to concave topologies  use volume rendering and iso-surface visualization techniques  better visualization of appearances (skew, density fields,…)  better way to visualize outliers  capabilities to intersect solids  multi-resolution, hierarchical representations

Questions? Funding provided by:  NSF grants , , and  US Department of Energy (DOE) Office of Basic Energy Sciences, Division of Chemical Sciences, Geosciences, and Biosciences  The IT Consilience Creative Project through the Ministry of Knowledge Economy, Republic of Korea