AMCIS 2006 Weight-proportional Information Space Partitioning Using Adaptive Multiplicatively-Weighted Voronoi Diagrams René Reitsma & Stanislav Trubin.

Slides:



Advertisements
Similar presentations
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Advertisements

Image classification Given the bag-of-features representations of images from different classes, how do we learn a model for distinguishing them?
2806 Neural Computation Self-Organizing Maps Lecture Ari Visa.
Computational Geometry II Brian Chen Rice University Computer Science.
1. A given pattern p is sought in an image. The pattern may appear at any location in the image. The image may be subject to some tone changes. 2 pattern.
Galaxy and Mass Power Spectra Shaun Cole ICC, University of Durham Main Contributors: Ariel Sanchez (Cordoba) Steve Wilkins (Cambridge) Imperial College.
Discriminative and generative methods for bags of features
Mutual Information Mathematical Biology Seminar
SocalBSI 2008: Clustering Microarray Datasets Sagar Damle, Ph.D. Candidate, Caltech  Distance Metrics: Measuring similarity using the Euclidean and Correlation.
Multiple Human Objects Tracking in Crowded Scenes Yao-Te Tsai, Huang-Chia Shih, and Chung-Lin Huang Dept. of EE, NTHU International Conference on Pattern.
Analyses of K-Group Designs : Analytic Comparisons & Trend Analyses Analytic Comparisons –Simple comparisons –Complex comparisons –Trend Analyses Errors.
Intro to Statistics for the Behavioral Sciences PSYC 1900
Recovering Articulated Object Models from 3D Range Data Dragomir Anguelov Daphne Koller Hoi-Cheung Pang Praveen Srinivasan Sebastian Thrun Computer Science.
1 Convolution and Its Applications to Sequence Analysis Student: Bo-Hung Wu Advisor: Professor Herng-Yow Chen & R. C. T. Lee Department of Computer Science.
Topics: Regression Simple Linear Regression: one dependent variable and one independent variable Multiple Regression: one dependent variable and two or.
1 University of Denver Department of Mathematics Department of Computer Science.
1 Street Generation for City Modeling Xavier Décoret, François Sillion iMAGIS GRAVIR/IMAG - INRIA.
Anisotropic Voronoi Diagrams and Guaranteed-Quality Anisotropic Mesh Generation François Labelle Jonathan Richard Shewchuk Computer Science Division University.
1 Chapter 17: Introduction to Regression. 2 Introduction to Linear Regression The Pearson correlation measures the degree to which a set of data points.
Chapter 9: Introduction to the t statistic
SW388R7 Data Analysis & Computers II Slide 1 Multiple Regression – Basic Relationships Purpose of multiple regression Different types of multiple regression.
Chapter 2 Measurement. Ch Measurement A. Measurement is a way to describe the world with numbers 1. Answers questions such as how much, how long,
3-dimensional shape cross section. 3-dimensional space.
Physics 114: Lecture 15 Probability Tests & Linear Fitting Dale E. Gary NJIT Physics Department.
Geo479/579: Geostatistics Ch13. Block Kriging. Block Estimate  Requirements An estimate of the average value of a variable within a prescribed local.
1 STATISTICAL HYPOTHESES AND THEIR VERIFICATION Kazimieras Pukėnas.
Advanced Computer Graphics Spring 2014 K. H. Ko School of Mechatronics Gwangju Institute of Science and Technology.
Exposure In Wireless Ad-Hoc Sensor Networks Seapahn Meguerdichian Computer Science Department University of California, Los Angeles Farinaz Koushanfar.
DATA MINING CLUSTERING K-Means.
Non Negative Matrix Factorization
Systems Engineering for the Transportation Critical Infrastructure The Development of a Methodology and Mathematical Model for Assessing the Impacts of.
The Collocation of Measurement Points in Large Open Indoor Environment Kaikai Sheng, Zhicheng Gu, Xueyu Mao Xiaohua Tian, Weijie Wu, Xiaoying Gan Department.
GEOG 268: Cartography Map Projections. Distortions resulting from map transformations  Transformation of:  angles (shapes)  areas  distances  direction.
Highway Risk Mitigation through Systems Engineering.
Big Ideas Differentiation Frames with Icons. 1. Number Uses, Classification, and Representation- Numbers can be used for different purposes, and numbers.
Chapter 14 – 1 Chapter 14: Analysis of Variance Understanding Analysis of Variance The Structure of Hypothesis Testing with ANOVA Decomposition of SST.
 The number of x-values is the same as the number of strips. SUMMARY where n is the number of strips.  The width, h, of each strip is given by ( but.
Estimating Component Availability by Dempster-Shafer Belief Networks Estimating Component Availability by Dempster-Shafer Belief Networks Lan Guo Lane.
ECE 8443 – Pattern Recognition LECTURE 08: DIMENSIONALITY, PRINCIPAL COMPONENTS ANALYSIS Objectives: Data Considerations Computational Complexity Overfitting.
VI. Regression Analysis A. Simple Linear Regression 1. Scatter Plots Regression analysis is best taught via an example. Pencil lead is a ceramic material.
Blind Information Processing: Microarray Data Hyejin Kim, Dukhee KimSeungjin Choi Department of Computer Science and Engineering, Department of Chemical.
Raquel A. Romano 1 Scientific Computing Seminar May 12, 2004 Projective Geometry for Computer Vision Projective Geometry for Computer Vision Raquel A.
Regionalization of Information Space with Adaptive Voronoi Diagrams René F. Reitsma Dept. of Accounting, Finance & Inf. Mgt. Oregon State University Stanislaw.
Lecture 16: Stereo CS4670 / 5670: Computer Vision Noah Snavely Single image stereogram, by Niklas EenNiklas Een.
Cluster Analysis.
Hough Transform Procedure to find a shape in an image Shape can be described in parametric form Shapes in image correspond to a family of parametric solutions.
Jump to first page. The Generalised Mapping Regressor (GMR) neural network for inverse discontinuous problems Student : Chuan LU Promotor : Prof. Sabine.
E.g. Use 4 strips with the mid-ordinate rule to estimate the value of Give the answer to 4 d.p. Solution: We need 4 corresponding y -values for x 1, x.
Modeling Electromagnetic Fields in Strongly Inhomogeneous Media
Monte Carlo Linear Algebra Techniques and Their Parallelization Ashok Srinivasan Computer Science Florida State University
A Kernel Approach for Learning From Almost Orthogonal Pattern * CIS 525 Class Presentation Professor: Slobodan Vucetic Presenter: Yilian Qin * B. Scholkopf.
Station 1 - Proportions Solve each proportion for x
Highway Risk Mitigation through Systems Engineering.
Evolutionary Computing Chapter 12. / 26 Chapter 12: Multiobjective Evolutionary Algorithms Multiobjective optimisation problems (MOP) -Pareto optimality.
René Reitsma1, Stanislav Trubin2 1OSU College of Business
THREE DIMENSIONAL-PALLET LOADING PROBLEM BY ABDULRHMAN AL-OTAIBI.
Interpolation Local Interpolation Methods –IDW – Inverse Distance Weighting –Natural Neighbor –Spline – Radial Basis Functions –Kriging – Geostatistical.
Chapter 11 Linear Regression and Correlation. Explanatory and Response Variables are Numeric Relationship between the mean of the response variable and.
Stereo CS4670 / 5670: Computer Vision Noah Snavely Single image stereogram, by Niklas EenNiklas Een.
Introduction to Statistics for the Social Sciences SBS200 - Lecture Section 001, Spring 2017 Room 150 Harvill Building 9:00 - 9:50 Mondays, Wednesdays.
NEW SOLUTION FOR CONSTRUCTION OF RECTILINEAR AREA CARTOGRAM
Zeyu You, Raviv Raich, Yonghong Huang (presenter)
Tutorial 3 – Computational Geometry
Overview Of Clustering Techniques
Introduction.
Fast Pattern Simulation Using Multi‐Scale Search
I. Statistical Tests: Why do we use them? What do they involve?
Introduction to Regression
Facilities Planning and Design Course code:
Presentation transcript:

AMCIS 2006 Weight-proportional Information Space Partitioning Using Adaptive Multiplicatively-Weighted Voronoi Diagrams René Reitsma & Stanislav Trubin Accounting, Finance & Information Management Electrical Engineering & Computer Science Oregon State University

AMCIS 2006 Weight-proportional Voronoi Information Spaces Information space partitioning: problem, geometry & examples –Squarified treemap, a SOM, and a Voronoi space. Weight-area proportionality problem. Adaptive Voronoi partitioning: method & case testing. Human subjects experiment.

AMCIS 2006 Information Space – Problem Problem: Maps of Information Space: –Good correspondence. –Usability. Geometry: –Metric / distance. –Placement. –Partitioning.

AMCIS 2006 Information Space – Examples (squarified) treemap. Two-dimensional, Euclidian. Partitioning is area-weight proportional: A i /A j = W i /W j However: placement is 100% function of partitioning.

AMCIS 2006 Information Space – Examples Chen et al. (1998): ET-map. SOM. Placement ≈ similarity. Area ≈ magnitude. However: approximation only. Poor resolution.

AMCIS 2006 Information Space – Examples Andrews et al. (2002): InfoSky. (Power) Voronoi diagram. Two-dimensional, Euclidian. W i > W j  A i > A j However: A i /A j ≠ W i /W j Δg i ≠ 0

AMCIS 2006 Information Space – Definitions Objective function: –E Chen et al. =.825 Constraints: –inclusiveness: g i є r i –exclusiveness: ∑A i = S –locality: Δg i = 0

AMCIS 2006 Voronoi Information Space – Standard Model V i = { x | |x-x i | ≤ |x-x j | } Borders are straight and orthogonally bisect Delaunay triangulations. Regions are contiguous. All space is allocated. However: Area = f(location).

AMCIS 2006 Voronoi Information Space – Multipl. Weighted Model V i = { x | |x-x i |/w i ≤ |x-x j |/w j } Borders are arcs of Appolonius circles. Regions can surround other regions. All space is allocated. Area = f(location, weights).  Solve for w i, minimizing Regions may be noncontiguous.

AMCIS 2006 Adaptive Multiplicatively Weighted Voronoi Diagram w i+1,j = w i,j + k(A j – a i,j ) k i = k i-1 ×.95 Resolution effect.

AMCIS 2006 Adaptive Multiplicatively Weighted Voronoi Diagram

AMCIS 2006 Adaptive Multiplicatively Weighted Voronoi Diagram

AMCIS 2006 E Chen et al.(20×10) =.825 E AMWVD(1200×1200) = Adaptive Multiplicatively Weighted Voronoi Diagram

AMCIS 2006 AMWVD – Human Subjects Testing Can people correctly resolve the area information from AMWVDs? Cartography studies: –Chang (1977), Cox (1976), Crawford (1971, 1973), Flannery (1971), Groop and Cole (1978), Williams (1956). ‘Unusual’ shapes. Discontinuities. Gestalt issues.

AMCIS 2006 Human Subjects Testing - Hypotheses H-I: Size differences (under) estimation will follow Steven’s Rule. H-II: Underestimation of size differences in rectangular (squarified treemap) and standard Voronoi partitioning is less than in (A)MWVD partitioning. H-III: Size comparisons involving overlapping circle patterns will show the same amount of error as those not involving such patterns. H-IV: Size estimation error involving discontinuous areas is larger than for those not involving discontinuous areas.

AMCIS 2006 Human Subjects Testing - Experiment Three types of partitionings: –Rectangular (squarified) treemap. –Standard Voronoi diagram. –Adaptive multipl. weighted Voronoi diagram. Task: –Select the largest of two regions. –Estimate how much larger the selected region is. –One partitioning scheme per subject. Variables measured: –Accuracy of comparisons. –Time used to make the comparisons. Subjects: 30 undergraduate MIS students –10 subjects per partitioning. –30 comparisons per subject.

AMCIS 2006 Human Subjects Testing - results H-II: Underestimation of size differences in rectangular (squarified treemap) and standard Voronoi partitioning is less than in (A)MWVD partitioning. RectangularStandard VoronoiAMWVD Area estimation error μ:.202μ:.407μ:.268 Rectangularμ/μ:.51 t: -8.98; DF: 575; p<.01 μ/μ:.75 t: -3.42; DF: 565; p<.01 Standard Voronoiμ/μ: 1.46 t: 6.54; DF: 535; p<.01

AMCIS 2006 Human Subjects Testing - results H-II: Underestimation of size differences in rectangular (squarified treemap) and standard Voronoi partitioning is less than in (A)MWVD partitioning. Selection of largest region (ordinal) IncorrectCorrectTotal Rectangular Standard Voronoi AMWVD Total –Rectangular vs. AMWVD: χ 2 =69.30; D.F.=1; p<0.1. –Standard VD vs. AMWVD: χ 2 =133.44; D.F.=1; p<0.1.

AMCIS 2006 Human Subjects Testing - results RectangularStandard VoronoiAMWVD log(time (ms)) to select largest region) μ : μ : μ : Rectangular μ / μ : t:.571; DF: 586; p:.57 μ / μ :.995 t: ; DF: 583; p:.03 Standard Voronoi μ / μ :.9904 t: ; DF: 592; p<.01 RectangularStandard VoronoiAMWVD Time (ms) used to numerically estimate the size relationship μ : 10,004 μ : 7,001 μ : 8,452 Rectangular μ / μ : t: 5.576; DF: 432; p < 0.1 μ / μ : t: 2.772; DF: 477; p <.01 Standard Voronoi μ / μ :.828 t: ; DF: 578; p <.01

AMCIS 2006 Human Subjects Testing - results H-III: Size comparisons involving overlapping circle patterns will show the same amount of error as those not involving such patterns. H-IV: Size estimation error involving discontinuous areas is larger than for those not involving discontinuous areas. –μ E AMWVD continuous (n=181) =.270 –μ E AMWVD discontinuous (n=117) =.266

AMCIS 2006 Voronoi Information Spaces - Conclusion Adaptive Multiplicatively Weighted Voronoi Diagram solves weight- proportional partitioning subject to: –inclusiveness: g i є r i –exclusiveness: ∑A i = S –locality: Δg i = 0 Squarified treemaps cannot do this. Standard and additively weighted Voronoi diagrams cannot do this. Adaptive multiplicatively weighted Voronoi diagrams perform well in human subject area comparisons: –Perform not as well as squarified treemaps (-25%). –Significantly outperform standard (and additively weighted) Voronoi diagrams.

AMCIS 2006 Voronoi Information Space - Solutions

AMCIS 2006 Voronoi Information Space - Solutions