Outline 3. Data Analysis 4. Follow Up Study 1. Previous Work 2. Experiment.

Slides:



Advertisements
Similar presentations
© Jim Barritt 2005School of Biological Sciences, Victoria University, Wellington MSc Student Supervisors : Dr Stephen Hartley, Dr Marcus Frean Victoria.
Advertisements

Shape Matching and Object Recognition using Low Distortion Correspondence Alexander C. Berg, Tamara L. Berg, Jitendra Malik U.C. Berkeley.
Rachel T. Johnson Douglas C. Montgomery Bradley Jones
Applications of one-class classification
Dynamic View Selection for Time-Varying Volumes Guangfeng Ji* and Han-Wei Shen The Ohio State University *Now at Vital Images.
Outlier-Preserving Focus+Context Visualization in Parallel Coordinates Matej Novotný Comenius University Bratislava, Slovakia Helwig Hauser VRVis Research.
Multi-variate, Time-varying, and Comparative Visualization with Contextual Cues Jon Woodring and Han-Wei Shen The Ohio State University.
Copyright Jiawei Han, modified by Charles Ling for CS411a
Interactive Evolutionary Computation Review of Applications Praminda Caleb-Solly Intelligent Computer Systems Centre University of the West of England.
The Matching Hypothesis Jeff Schank PSC 120. Mating Mating is an evolutionary imperative Much of life is structured around securing and maintaining long-term.
Natural Visualization Steve Haroz & Kwan-Liu Ma University of California at Davis.
Analysis of High-Throughput Screening Data C371 Fall 2004.
1 CS 391L: Machine Learning: Rule Learning Raymond J. Mooney University of Texas at Austin.
Discrimination amongst k populations. We want to determine if an observation vector comes from one of the k populations For this purpose we need to partition.
Artificial Intelligence
1 Using Bayesian Network for combining classifiers Leonardo Nogueira Matos Departamento de Computação Universidade Federal de Sergipe.
A lesson approach © 2011 The McGraw-Hill Companies, Inc. All rights reserved. a lesson approach Microsoft® PowerPoint 2010 © 2011 The McGraw-Hill Companies,
 2004 Prentice Hall, Inc. All rights reserved. 1 Chapter 30 - Dynamic HTML: Structured Graphics ActiveX Control Outline 30.1Introduction 30.2Shape Primitives.
Tutorial 1: Sensitivity analysis of an analytical function
Does one size really fit all? Evaluating classifiers in Bag-of-Visual-Words classification Christian Hentschel, Harald Sack Hasso Plattner Institute.
Classification Classification Examples
Design Rule Generation for Interconnect Matching Andrew B. Kahng and Rasit Onur Topaloglu {abk | rtopalog University of California, San Diego.
Native-Conflict-Aware Wire Perturbation for Double Patterning Technology Szu-Yu Chen, Yao-Wen Chang ICCAD 2010.
Week 7 - Monday.  What did we talk about last time?  Specular shading  Aliasing and antialiasing.
Designing Facial Animation For Speaking Persian Language Hadi Rahimzadeh June 2005.
Ghunhui Gu, Joseph J. Lim, Pablo Arbeláez, Jitendra Malik University of California at Berkeley Berkeley, CA
CPSC 335 Computer Science University of Calgary Canada.
Recognition using Regions CVPR Outline Introduction Overview of the Approach Experimental Results Conclusion.
Face Recognition Based on 3D Shape Estimation
Feature Subset Selection using Minimum Cost Spanning Trees Mike Farah Supervisor: Dr. Sid Ray.
A Novel 2D To 3D Image Technique Based On Object- Oriented Conversion.
HP - PURDUE CONFIDENTIAL Slide No. Fundamentals 1.
Info Vis: Multi-Dimensional Data Chris North cs3724: HCI.
Data Mining Techniques
AdvisorStudent Dr. Jia Li Shaojun Liu Dept. of Computer Science and Engineering, Oakland University 3D Shape Classification Using Conformal Mapping In.
Introduction Belief propagation: known to produce accurate results for stereo processing/ motion estimation High storage requirements limit the use of.
Studying Visual Attention with the Visual Search Paradigm Marc Pomplun Department of Computer Science University of Massachusetts at Boston
July 11, 2001Daniel Whiteson Support Vector Machines: Get more Higgs out of your data Daniel Whiteson UC Berkeley.
Efficient Model Selection for Support Vector Machines
Lecture 12 Stereo Reconstruction II Lecture 12 Stereo Reconstruction II Mata kuliah: T Computer Vision Tahun: 2010.
Segmental Hidden Markov Models with Random Effects for Waveform Modeling Author: Seyoung Kim & Padhraic Smyth Presentor: Lu Ren.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology Adaptive nonlinear manifolds and their applications to pattern.
Zhejiang University Wavelet-based 3D mesh model watermarking Shi Jiao-Ying State Key Laboratory of CAD&CG, Zhejiang University, Hangzhou
Texture. Texture is an innate property of all surfaces (clouds, trees, bricks, hair etc…). It refers to visual patterns of homogeneity and does not result.
SIGNAL DETECTION IN FIXED PATTERN CHROMATIC NOISE 1 A. J. Ahumada, Jr., 2 W. K. Krebs 1 NASA Ames Research Center; 2 Naval Postgraduate School, Monterey,
Geographic Information Science
CS-378: Game Technology Lecture #4: Texture and Other Maps Prof. Okan Arikan University of Texas, Austin V Lecture #4: Texture and Other Maps.
Chapter 11 Statistical Techniques. Data Warehouse and Data Mining Chapter 11 2 Chapter Objectives  Understand when linear regression is an appropriate.
Data Mining BY JEMINI ISLAM. Data Mining Outline: What is data mining? Why use data mining? How does data mining work The process of data mining Tools.
CVPR2013 Poster Detecting and Naming Actors in Movies using Generative Appearance Models.
Final Exam Review CS479/679 Pattern Recognition Dr. George Bebis 1.
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:
What is GIS? “A powerful set of tools for collecting, storing, retrieving, transforming and displaying spatial data”
Effects of Grayscale Window/Level on Breast Lesion Detectability Jeffrey Johnson, PhD a John Nafziger, PhD a Elizabeth Krupinski, PhD b Hans Roehrig, PhD.
1 Per-Pixel Opacity Modulation for Feature Enhancement in Volume Rendering Speaker: 吳昱慧 Date:2010/11/16 IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER.
Present by: Fang-Hui Chu Large Margin Gaussian Mixture Modeling for Phonetic Classification and Recognition Fei Sha*, Lawrence K. Saul University of Pennsylvania.
1 Kernel Machines A relatively new learning methodology (1992) derived from statistical learning theory. Became famous when it gave accuracy comparable.
Applied Cartography and Introduction to GIS GEOG 2017 EL Lecture-5 Chapters 9 and 10.
IMAGE PROCESSING is the use of computer algorithms to perform image process on digital images   It is used for filtering the image and editing the digital.
Results for all features Results for the reduced set of features
Basic machine learning background with Python scikit-learn
Evaluating classifiers for disease gene discovery
R-CNN region By Ilia Iofedov 11/11/2018 BGU, DNN course 2016.
Machine Learning Feature Creation and Selection
Pattern Recognition CS479/679 Pattern Recognition Dr. George Bebis
Virtual Screening.
Volume 45, Issue 4, Pages (February 2005)
Origin and Function of Tuning Diversity in Macaque Visual Cortex
Representation of Color Stimuli in Awake Macaque Primary Visual Cortex
Evaluating Classifiers for Disease Gene Discovery
Presentation transcript:

Outline 3. Data Analysis 4. Follow Up Study 1. Previous Work 2. Experiment

Introduction Problem: –Display layered surfaces. Goal: –Maximize shape perception. Texture has been shown to aid shape perception on a single surface. But textures interact across 2 surfaces.

Introduction

Previous Work Human-in-the-loop Method: House, Bair, Ware. On the Optimization of Visualizations of Complex Phenomena, VIS 2005.

Previous Work Human-in-the-loop Method: House, Bair, Ware. On the Optimization of Visualizations of Complex Phenomena, VIS 2005.

Previous Work Human-in-the-loop Method: House, Bair, Ware. On the Optimization of Visualizations of Complex Phenomena, VIS 2005.

Previous Work Human-in-the-loop Method: House, Bair, Ware. On the Optimization of Visualizations of Complex Phenomena, VIS 2005.

Previous Work Human-in-the-loop Method: House, Bair, Ware. On the Optimization of Visualizations of Complex Phenomena, VIS 2005.

Previous Work Human-in-the-loop Method: House, Bair, Ware. On the Optimization of Visualizations of Complex Phenomena, VIS 2005.

Previous Work Human-in-the-loop Method: House, Bair, Ware. On the Optimization of Visualizations of Complex Phenomena, VIS 2005.

Issues with 2005 Experiment Complicated textures Fixed large-scale surface features Subjective rating Slow convergence Resolution lower than human eye Stereo glasses

Reduced parameters from 122 to 26 –Grid layout –Size –Aspect ratio –Randomness –Color –Brightness –Roundness –Blur –Orientation –Opacity Texture Parameterization

Reduced parameters from 122 to 26 –Grid layout –Size –Aspect ratio –Randomness –Color –Brightness –Roundness –Blur –Orientation –Opacity Texture Parameterization

Reduced parameters from 122 to 26 –Grid layout –Size –Aspect ratio –Randomness –Color –Brightness –Roundness –Blur –Orientation –Opacity Texture Parameterization

Reduced parameters from 122 to 26 –Grid layout –Size –Aspect ratio –Randomness –Color –Brightness –Roundness –Blur –Orientation –Opacity Texture Parameterization

Reduced parameters from 122 to 26 –Grid layout –Size –Aspect ratio –Randomness –Color –Brightness –Roundness –Blur –Orientation –Opacity Texture Parameterization

Reduced parameters from 122 to 26 –Grid layout –Size –Aspect ratio –Randomness –Color –Brightness –Roundness –Blur –Orientation –Opacity Texture Parameterization

Reduced parameters from 122 to 26 –Grid layout –Size –Aspect ratio –Randomness –Color –Brightness –Roundness –Blur –Orientation –Opacity Texture Parameterization

Reduced parameters from 122 to 26 –Grid layout –Size –Aspect ratio –Randomness –Color –Brightness –Roundness –Blur –Orientation –Opacity Texture Parameterization

Reduced parameters from 122 to 26 –Grid layout –Size –Aspect ratio –Randomness –Color –Brightness –Roundness –Blur –Orientation –Opacity Texture Parameterization

Reduced parameters from 122 to 26 –Grid layout –Size –Aspect ratio –Randomness –Color –Brightness –Roundness –Blur –Orientation –Opacity Texture Parameterization

Surface Generation Surfaces have randomized, multi-scale features –Fractal-like cosine height fields period varied from 50% to 1% of screen width. –7 Gaussian bumps bumps varied from 8% to 2% of screen width.

Rating Method Rating objectivity improved. –Subjects gave 2 ratings of 0-9, one for each surface. –The rating was based on how well the subject could see all 7 bumps. –A combined rating was the product of the top and bottom surface ratings.

Speeding Human-in-the-Loop Evaluation Genetic algorithm was modified using islanding –Subjects chose an excellent texture pair –A generation of highly-similar textures was produced around the subjects choice. –Time for a trial was reduced from 3 hours to 1 hour.

Wheatstone Stereoscope

Stereoscope Resolution Screens had a resolution of 3840 x 2400

Data Analysis Approach 6 subjects rated 4560 visualizations We derived guidelines from various data-mining techniques. For this experiment, we used: –ANOVA –LDA –Decision Trees –Parallel Coordinates

ANOVA Shows the significance of an individual parameters effect on the rating. median 1 quartile 1.5 quartile outlier +

Linear Discriminant Analysis Determines parameter vectors that best separate good from bad visualizations.

Decision Tree Analysis Determines the best parameter settings to classify visualizations by ratings.

Parallel Coordinate Analysis Used to visually identify parameter trends Lines colored by top opacity

Guidelines for Texture Design Bright top, and brighter bottom surfaces Long, thin lines on top Medium to high randomness Prominent (large, bright, opaque) marks on top Subtle (small, low opacity) marks on bottom Either: –Medium top background opacity with medium-sized top marks or –Low top background opacity with large top marks Little blur on top, more blur on bottom Chroma can be freely chosen

Evaluating Guidelines Experiment Used: –Decision tree rules to generate 29 visualizations: (bad) 4 with rating 1.15 (poor) 5 with rating 4.57 (fair) 10 with rating 5.47 (good) 10 with rating 8.06 –Parallel coordinate trends to generate 31 more: (enhanced A) 20 (good + lines and background) (enhanced B) 11 (good + large lines) 6 Subjects Rated All 60 Visualizations.

Experimental Results Subject Agreement –Correlations between subjects were greater than 0.57 for all subject pairings. –This has a p-value less than

Experimental Results Agreement with predicted ratings. –Box plots show the distribution of ratings.

Losers! Rating 1.05Rating 2.6

Winners! Rating 8.14Rating 7.87

Conclusions

Future Work Surface conforming textures Exhaustive experiments in a constrained space Printed media

Acknowledgments National Science Foundation Center for Coastal and Ocean Mapping, University of New Hampshire Visualization Laboratory, Texas A&M University

Bright top, and brighter bottom surfaces Long, thin lines on top Medium to high randomness Prominent marks on top Subtle marks on bottom Either: –Medium top opacity with medium-sized marks or –Low top opacity with large marks Little blur on top, more blur on bottom Color can be freely chosen Recap of Guidelines:

Search Results 6 subjects 4560 different rated visualizations Random Final Database

Genetic Algorithm