Nature Methods: doi: /nmeth Supplementary Figure 1
|
|
- Amice Heath
- 5 years ago
- Views:
Transcription
1 Supplementary Figure 1 Performance analysis under four different clustering scenarios. Performance analysis under four different clustering scenarios. i) Standard Conditions, ii) a sparse data set with only 10% as many localisations, iii) clusters which are twice as large and iv) only 10 localisations per cluster and 90% of localisations in the background. a) Histograms of the number of clusters per region. b) Histograms of the cluster radii. c) Histograms of the number of localisations per cluster and d) Histograms of the percentage of localisations found in clusters. In all cases the blue dashed line represents the true value. Histograms are calculated from 100 simulated data sets for each scenario.
2 Supplementary Figure 2 Estimation of cluster descriptors as simulation parameters vary (n = 100 per point). Estimation of cluster descriptors as simulation parameters vary (n = 100 per point). i) Measured localisations per cluster. ii) Measured cluster radii. iii) Measured percentage of localisations in clusters and iv) measured number of clusters per region. a) Simulated number of localisations per cluster, b) simulated cluster radii and c) simulated fraction of background localisations. Blue dashed lines represent simulated values.
3 Supplementary Figure 3 Comparison of our algorithm with DBSCAN. Comparison of our algorithm with DBSCAN. a-d) Comparison of the proposal generating algorithm (I) with DBSCAN (II) when each method is allowed to optimise its analysis parameters based on our Bayesian scoring mechanism, run on simulated data in the Standard Conditions (n = 100). a) Number of clusters per region, b) percentage of localisations in clusters, c) number of localisations per cluster and d) cluster radii. e-h) Histograms of key cluster descriptors generated by DBSCAN with fixed r = 50 nm and T = 78 from simulated data in the Standard Conditions (n = 100). e) Number of clusters per region, f) number of localisations per cluster, g) percentage of localisations in clusters and h) cluster radii. Blue dashed lines represent simulated values.
4 Supplementary Figure 4 Analysis of simulated data from the standard and sparse conditions (n = 100) by alternative clustering techniques. Analysis of simulated data from the Standard (a-f) and sparse (g-l) conditions (n = 100) by alternative clustering techniques. a and g) Cluster heat maps generated from Getis and Franklin s Local Point Pattern Analysis. b and h) Binary maps generated from these heat maps. c and i) Number of clusters per region extracted from the binary maps. d and j) Percentage of localisations in clusters. Blue dashed lines represent simulated values. e and k) Ripley s K function curves for example data sets together with 99% confidence intervals (C.I.) generated by simulating 100 CSR datasets. f and i) Pair Correlation curves for example data sets.
5 Supplementary Figure 5 Analysis of simulated data with 100 nm clusters and data with 90% of localizations in the background (n = 100) by alternative clustering techniques. Analysis of simulated data with 100 nm clusters (a-f) and data with 90% of localisations in the background (g-l) (n = 100) by alternative clustering techniques. a and g) Cluster heat maps generated from Getis and Franklin s Local Point Pattern Analysis. b and h) Binary maps generated from these heat maps. c and i) Number of clusters per region extracted from the binary maps. d and j) Percentage of localisations in clusters. Blue dashed lines represent simulated values. e and k) Ripley s K function curves for example data sets together with 99% confidence intervals (C.I.) generated by simulating 100 CSR datasets. f and i) Pair Correlation curves for example data sets.
6 Supplementary Figure 6 Performance of the algorithm on data sets (n = 100) with an uneven background. Performance of the algorithm on data sets (n = 100) with an uneven background, following a Beta(2,2) (i) or a Beta(5,1) (ii) distribution. a) Representative data. b) Log(posterior probability) heat maps. c) The highest scoring cluster proposal. d) Histograms of cluster radii. e) Histograms of the number of localisations per cluster. f) Histograms of the number of clusters. g) Histograms of the percentage of localisations found in clusters. Blue dashed lines represent true values.
7 Supplementary Figure 7 Analysis of simulated data with an uneven background by alternative clustering techniques. Analysis of simulated data with an uneven background, following a Beta(2,2) (a-f) or a Beta(5,1) (g-l) distribution (n = 100) by alternative clustering techniques. a and g) Cluster heat maps generated from Getis and Franklin s Local Point Pattern Analysis. b and h) Binary maps generated from these heat maps. c and i) Number of clusters per region extracted from the binary maps. d and j) Percentage of localisations in clusters. Blue dashed lines represent simulated values. e and k) Ripley s K function curves for example data sets together with 99% confidence intervals (C.I.) generated by simulating 100 CSR datasets. f and i) Pair Correlation curves for example data sets.
8 Supplementary Figure 8 Histograms of the measured number of localizations per cluster and cluster radii for simulated dimers, trimers and hexamers. Histograms of the measured number of localisations per cluster and cluster radii for simulated dimers, trimers and hexamers in a dense or sparse distribution (n = 100 per condition). These were simulated by generating localisations with identical coordinates which were then independently scrambled according to each point s localisation precision. The detection problem becomes harder as the overall density increases. We therefore performed the analysis at two different densities (2000 and 200 overall localisations).
9 Supplementary Figure 9 Performance of the algorithm on data sets (n = 100) with different cluster sizes within the same ROI. Performance of the algorithm on data sets (n = 100) with different cluster sizes within the same ROI, 5x 50 nm and 5x 100 nm (i), 5x 10 nm and 5x 100 nm (ii) and a range of cluster sizes between 10 and 100 nm (iii). a) Representative data. b) Log(posterior probability) heat maps. c) The highest scoring cluster proposal and d) histograms of the measured cluster radii. Blue dashed lines represent simulated values.
10 Supplementary Figure 10 Side by side comparison of methods applied to three simulated conditions. Side by side comparison of our method (I), Getis s method (II) and DBSCAN (III) applied to three simulated conditions (n = 100 datasets each). The conditions are Standard Conditions (representative dataset shown in Fig. 2a i), Standard Conditions but with larger clusters (representative dataset shown in Fig. 2a iii) and Standard Conditions with uneven background (representative dataset shown in Supplementary Fig. 6a ii).
11 Supplementary Figure 11 Sensitivity of the measured clustering descriptors to the prior settings. Sensitivity of the measured clustering descriptors (percentage of localisations in clusters, cluster radii, number of clusters per ROI and the number of localisations per cluster) to the prior settings. a) Illustration of the sensitivity of measured cluster descriptors to varying the Dirichlet process concentration coefficient, α. b) Sensitivity to the prior probability of any localisation being allocated to the background. c) Sensitivity to the prior distribution on the cluster radius. Two possible distributions are considered, one taken from experimental data (i) and a flat distribution between zero and half the size of the ROI (ii).
12 Supplementary Figure 12 Data preprocessing steps. Data preprocessing steps. a) Determination of the optimal merge time. Following the method of Annibale et al, we plot the total number of localisations in a representative image against the merge time for CD3ζ -meos3 in primary T cells. The average optimum merge time was found to be three frames (30 ms). This example is representative of four such plots. b and c) Representative histogram of the localisation precisions calculated for CD3ζ data in resting T cells (b) and in activated cells (c), using the method of Quan et al.
13 Supplementary Figure 13 Bayesian analysis of CD3ζ clustering in activated primary human T cells with localizations from the same ROI divided into two equally sized data sets. Bayesian analysis of CD3ζ clustering in activated primary human T cells with localisations from the same ROI divided into two equallysized data sets. a) and b) Highest scoring cluster proposals. c) and d) Log(posterior probability) heat maps.
14 Supplementary Figure 14 Data on CD3ζ clustering analysed by alternative approaches in resting and activated primary human T cells. Data on CD3ζ clustering analysed by alternative approaches in resting and activated primary human T cells. a) Representative cluster maps (n = 30) generated by Getis and Franklin s Local Point Pattern Analysis of a 3000 x 3000 nm area. b) Representative binary maps showing clustered areas. c) Ripley s K function (average of n = 30 regions). d) Pair correlation curves (average of n = 30 regions) and e) Cluster statistics on the percentage of localisations found in clusters, number of clusters per region and cluster radii extracted from the binary maps in b).
Supplementary Material
Supplementary Material Figure 1S: Scree plot of the 400 dimensional data. The Figure shows the 20 largest eigenvalues of the (normalized) correlation matrix sorted in decreasing order; the insert shows
More informationQuantifying Caveolin-1 Molecular Domains via Machine Learning and Computational Network Analysis of Super-resolution Microscopy Data
Quantifying Caveolin-1 Molecular Domains via Machine Learning and Computational Network Analysis of Super-resolution Microscopy Data Ismail M. Khater1, Fanrui Meng2, Ivan Robert Nabi2, Ghassan Hamarneh1
More informationUniversity of Florida CISE department Gator Engineering. Clustering Part 4
Clustering Part 4 Dr. Sanjay Ranka Professor Computer and Information Science and Engineering University of Florida, Gainesville DBSCAN DBSCAN is a density based clustering algorithm Density = number of
More informationClustering Part 4 DBSCAN
Clustering Part 4 Dr. Sanjay Ranka Professor Computer and Information Science and Engineering University of Florida, Gainesville DBSCAN DBSCAN is a density based clustering algorithm Density = number of
More informationMorphometric Analysis of Biomedical Images. Sara Rolfe 10/9/17
Morphometric Analysis of Biomedical Images Sara Rolfe 10/9/17 Morphometric Analysis of Biomedical Images Object surface contours Image difference features Compact representation of feature differences
More informationContents. 2.5 DBSCAN Pair Auto-Correlation Saving your results References... 18
Contents 1 Getting Started... 2 1.1 Launching the program:... 2 1.2 Loading and viewing your data... 2 1.3 Setting parameters... 5 1.4 Cropping points... 6 1.5 Selecting regions of interest... 7 2 Analysis...
More information2.830J / 6.780J / ESD.63J Control of Manufacturing Processes (SMA 6303) Spring 2008
MIT OpenCourseWare http://ocw.mit.edu.83j / 6.78J / ESD.63J Control of Manufacturing Processes (SMA 633) Spring 8 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
More informationPresentation of GcoPS Icy plugin
Presentation of GcoPS Icy plugin GcoPS is a fully automatic and non parametric colocalization algorithm with four possible outputs: Statistical test: GcoPS computes a statistical test to evaluate the global
More information2. (a) Briefly discuss the forms of Data preprocessing with neat diagram. (b) Explain about concept hierarchy generation for categorical data.
Code No: M0502/R05 Set No. 1 1. (a) Explain data mining as a step in the process of knowledge discovery. (b) Differentiate operational database systems and data warehousing. [8+8] 2. (a) Briefly discuss
More informationSTATA 13 INTRODUCTION
STATA 13 INTRODUCTION Catherine McGowan & Elaine Williamson LONDON SCHOOL OF HYGIENE & TROPICAL MEDICINE DECEMBER 2013 0 CONTENTS INTRODUCTION... 1 Versions of STATA... 1 OPENING STATA... 1 THE STATA
More informationFrequency Distributions
Displaying Data Frequency Distributions After collecting data, the first task for a researcher is to organize and summarize the data so that it is possible to get a general overview of the results. Remember,
More informationCPSC 340: Machine Learning and Data Mining. Density-Based Clustering Fall 2016
CPSC 340: Machine Learning and Data Mining Density-Based Clustering Fall 2016 Assignment 1 : Admin 2 late days to hand it in before Wednesday s class. 3 late days to hand it in before Friday s class. 0
More informationEvaluation Measures. Sebastian Pölsterl. April 28, Computer Aided Medical Procedures Technische Universität München
Evaluation Measures Sebastian Pölsterl Computer Aided Medical Procedures Technische Universität München April 28, 2015 Outline 1 Classification 1. Confusion Matrix 2. Receiver operating characteristics
More informationProtein structure determination by single-wavelength anomalous diffraction phasing of X-ray free-electron laser data
Supporting information IUCrJ Volume 3 (2016) Supporting information for article: Protein structure determination by single-wavelength anomalous diffraction phasing of X-ray free-electron laser data Karol
More informationCOMP 465: Data Mining Still More on Clustering
3/4/015 Exercise COMP 465: Data Mining Still More on Clustering Slides Adapted From : Jiawei Han, Micheline Kamber & Jian Pei Data Mining: Concepts and Techniques, 3 rd ed. Describe each of the following
More informationIDENTIFYING OPTICAL TRAP
IDENTIFYING OPTICAL TRAP Yulwon Cho, Yuxin Zheng 12/16/2011 1. BACKGROUND AND MOTIVATION Optical trapping (also called optical tweezer) is widely used in studying a variety of biological systems in recent
More informationPackage sparsereg. R topics documented: March 10, Type Package
Type Package Package sparsereg March 10, 2016 Title Sparse Bayesian Models for Regression, Subgroup Analysis, and Panel Data Version 1.2 Date 2016-03-01 Author Marc Ratkovic and Dustin Tingley Maintainer
More informationStatistical Analysis of Metabolomics Data. Xiuxia Du Department of Bioinformatics & Genomics University of North Carolina at Charlotte
Statistical Analysis of Metabolomics Data Xiuxia Du Department of Bioinformatics & Genomics University of North Carolina at Charlotte Outline Introduction Data pre-treatment 1. Normalization 2. Centering,
More informationFurther Maths Notes. Common Mistakes. Read the bold words in the exam! Always check data entry. Write equations in terms of variables
Further Maths Notes Common Mistakes Read the bold words in the exam! Always check data entry Remember to interpret data with the multipliers specified (e.g. in thousands) Write equations in terms of variables
More informationNature Methods: doi: /nmeth Supplementary Figure 1
Supplementary Figure 1 Schematic representation of the Workflow window in Perseus All data matrices uploaded in the running session of Perseus and all processing steps are displayed in the order of execution.
More informationFEKO Mesh Optimization Study of the EDGES Antenna Panels with Side Lips using a Wire Port and an Infinite Ground Plane
FEKO Mesh Optimization Study of the EDGES Antenna Panels with Side Lips using a Wire Port and an Infinite Ground Plane Tom Mozdzen 12/08/2013 Summary This study evaluated adaptive mesh refinement in the
More informationUniversity of Florida CISE department Gator Engineering. Clustering Part 5
Clustering Part 5 Dr. Sanjay Ranka Professor Computer and Information Science and Engineering University of Florida, Gainesville SNN Approach to Clustering Ordinary distance measures have problems Euclidean
More informationMultivariate Calibration Quick Guide
Last Updated: 06.06.2007 Table Of Contents 1. HOW TO CREATE CALIBRATION MODELS...1 1.1. Introduction into Multivariate Calibration Modelling... 1 1.1.1. Preparing Data... 1 1.2. Step 1: Calibration Wizard
More informationUniversity of Florida CISE department Gator Engineering. Data Preprocessing. Dr. Sanjay Ranka
Data Preprocessing Dr. Sanjay Ranka Professor Computer and Information Science and Engineering University of Florida, Gainesville ranka@cise.ufl.edu Data Preprocessing What preprocessing step can or should
More informationAfter opening Stata for the first time: set scheme s1mono, permanently
Stata 13 HELP Getting help Type help command (e.g., help regress). If you don't know the command name, type lookup topic (e.g., lookup regression). Email: tech-support@stata.com. Put your Stata serial
More informationPEOPLE IN SEATS COUNTING VIA SEAT DETECTION FOR MEETING SURVEILLANCE
PEOPLE IN SEATS COUNTING VIA SEAT DETECTION FOR MEETING SURVEILLANCE Hongyu Liang, Jinchen Wu, and Kaiqi Huang National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy of Science
More informationBluman & Mayer, Elementary Statistics, A Step by Step Approach, Canadian Edition
Bluman & Mayer, Elementary Statistics, A Step by Step Approach, Canadian Edition Online Learning Centre Technology Step-by-Step - Minitab Minitab is a statistical software application originally created
More informationMarkov chain Monte Carlo methods
Markov chain Monte Carlo methods (supplementary material) see also the applet http://www.lbreyer.com/classic.html February 9 6 Independent Hastings Metropolis Sampler Outline Independent Hastings Metropolis
More informationAnalyzing Dshield Logs Using Fully Automatic Cross-Associations
Analyzing Dshield Logs Using Fully Automatic Cross-Associations Anh Le 1 1 Donald Bren School of Information and Computer Sciences University of California, Irvine Irvine, CA, 92697, USA anh.le@uci.edu
More informationData Preprocessing. Data Preprocessing
Data Preprocessing Dr. Sanjay Ranka Professor Computer and Information Science and Engineering University of Florida, Gainesville ranka@cise.ufl.edu Data Preprocessing What preprocessing step can or should
More informationPHASEQUANT (User Manual)
PHASEQUANT (User Manual) ROI Pane Toolbar Threshold Bar Canvas Threshold Display Training Pane Buttons Fig 1. PhaseQuant GUI 1. INSTALLATION AND LOADING 1.1 Installing PhaseQuant Download the zip file
More informationDimension Induced Clustering
Dimension Induced Clustering Aris Gionis Alexander Hinneburg Spiros Papadimitriou Panayiotis Tsaparas HIIT, University of Helsinki Martin Luther University, Halle Carnegie Melon University HIIT, University
More informationApplied Regression Modeling: A Business Approach
i Applied Regression Modeling: A Business Approach Computer software help: SAS SAS (originally Statistical Analysis Software ) is a commercial statistical software package based on a powerful programming
More informationUsing PC SAS/ASSIST* for Statistical Analyses
Using PC SAS/ASSIST* for Statistical Analyses Margaret A. Nemeth, Monsanto Company lptroductjon SAS/ASSIST, a user friendly, menu driven applications system, is available on several platforms. This paper
More informationClassifying Images with Visual/Textual Cues. By Steven Kappes and Yan Cao
Classifying Images with Visual/Textual Cues By Steven Kappes and Yan Cao Motivation Image search Building large sets of classified images Robotics Background Object recognition is unsolved Deformable shaped
More informationratio of the volume under the 2D MTF of a lens to the volume under the 2D MTF of a diffraction limited
SUPPLEMENTARY FIGURES.9 Strehl ratio (a.u.).5 Singlet Doublet 2 Incident angle (degree) 3 Supplementary Figure. Strehl ratio of the singlet and doublet metasurface lenses. Strehl ratio is the ratio of
More informationOPTIMISATION OF PIN FIN HEAT SINK USING TAGUCHI METHOD
CHAPTER - 5 OPTIMISATION OF PIN FIN HEAT SINK USING TAGUCHI METHOD The ever-increasing demand to lower the production costs due to increased competition has prompted engineers to look for rigorous methods
More informationThree-dimensional structure and flexibility of a membrane-coating module of the nuclear pore complex
CORRECTION NOTICE Nat. Struct. Mol. Biol. advance online publication, doi:10.1038/nsmb.1618 (7 June 2009) Three-dimensional structure and flexibility of a membrane-coating module of the nuclear pore complex
More informationPart I, Chapters 4 & 5. Data Tables and Data Analysis Statistics and Figures
Part I, Chapters 4 & 5 Data Tables and Data Analysis Statistics and Figures Descriptive Statistics 1 Are data points clumped? (order variable / exp. variable) Concentrated around one value? Concentrated
More informationLecture-17: Clustering with K-Means (Contd: DT + Random Forest)
Lecture-17: Clustering with K-Means (Contd: DT + Random Forest) Medha Vidyotma April 24, 2018 1 Contd. Random Forest For Example, if there are 50 scholars who take the measurement of the length of the
More informationPoints Lines Connected points X-Y Scatter. X-Y Matrix Star Plot Histogram Box Plot. Bar Group Bar Stacked H-Bar Grouped H-Bar Stacked
Plotting Menu: QCExpert Plotting Module graphs offers various tools for visualization of uni- and multivariate data. Settings and options in different types of graphs allow for modifications and customizations
More informationSupplementary text S6 Comparison studies on simulated data
Supplementary text S Comparison studies on simulated data Peter Langfelder, Rui Luo, Michael C. Oldham, and Steve Horvath Corresponding author: shorvath@mednet.ucla.edu Overview In this document we illustrate
More informationHW4 VINH NGUYEN. Q1 (6 points). Chapter 8 Exercise 20
HW4 VINH NGUYEN Q1 (6 points). Chapter 8 Exercise 20 a. For each figure, could you use single link to find the patterns represented by the nose, eyes and mouth? Explain? First, a single link is a MIN version
More informationAlpha-Beta Community
Alpha-Beta Community Supasorn Suwajanakorn March 15, 2010 Supasorn Suwajanakorn () Alpha-Beta Community March 15, 2010 1 / 19 Definition from Nina s paper Definition 1. Given a graph G = (V, E), where
More informationConfiguring Topic Models for Software Engineering Tasks in TraceLab
Configuring Topic Models for Software Engineering Tasks in TraceLab Bogdan Dit Annibale Panichella Evan Moritz Rocco Oliveto Massimiliano Di Penta Denys Poshyvanyk Andrea De Lucia TEFSE 13 San Francisco,
More informationA System of Image Matching and 3D Reconstruction
A System of Image Matching and 3D Reconstruction CS231A Project Report 1. Introduction Xianfeng Rui Given thousands of unordered images of photos with a variety of scenes in your gallery, you will find
More informationDistance-based Methods: Drawbacks
Distance-based Methods: Drawbacks Hard to find clusters with irregular shapes Hard to specify the number of clusters Heuristic: a cluster must be dense Jian Pei: CMPT 459/741 Clustering (3) 1 How to Find
More informationCwRS Site definition: demonstration of the use of LPIS. Aim, data and SW used
CwRS Site definition: demonstration of the use of LPIS Olivier Leo, Csaba Wirnhardt http://www.mars.jrc.it http://www.jrc.cec.eu.int 9th conference on Controls with Remote sensing Köln, 28-29 November
More informationVIDAEXPERT: DATA ANALYSIS Here is the Statistics button.
Here is the Statistics button. After creating dataset you can analyze it in different ways. First, you can calculate statistics. Open Statistics dialog, Common tabsheet, click Calculate. Min, Max: minimal
More informationConfidence Intervals: Estimators
Confidence Intervals: Estimators Point Estimate: a specific value at estimates a parameter e.g., best estimator of e population mean ( ) is a sample mean problem is at ere is no way to determine how close
More informationCHAPTER 3 ASSOCIATON RULE BASED CLUSTERING
41 CHAPTER 3 ASSOCIATON RULE BASED CLUSTERING 3.1 INTRODUCTION This chapter describes the clustering process based on association rule mining. As discussed in the introduction, clustering algorithms have
More informationBuilding Classifiers using Bayesian Networks
Building Classifiers using Bayesian Networks Nir Friedman and Moises Goldszmidt 1997 Presented by Brian Collins and Lukas Seitlinger Paper Summary The Naive Bayes classifier has reasonable performance
More informationSTATISTICS FOR PSYCHOLOGISTS
STATISTICS FOR PSYCHOLOGISTS SECTION: JAMOVI CHAPTER: USING THE SOFTWARE Section Abstract: This section provides step-by-step instructions on how to obtain basic statistical output using JAMOVI, both visually
More informationScalable Bayes Clustering for Outlier Detection Under Informative Sampling
Scalable Bayes Clustering for Outlier Detection Under Informative Sampling Based on JMLR paper of T. D. Savitsky Terrance D. Savitsky Office of Survey Methods Research FCSM - 2018 March 7-9, 2018 1 / 21
More informationLocal Readjustment for High-Resolution 3D Reconstruction: Supplementary Material
Local Readjustment for High-Resolution 3D Reconstruction: Supplementary Material Siyu Zhu 1, Tian Fang 2, Jianxiong Xiao 3, and Long Quan 4 1,2,4 The Hong Kong University of Science and Technology 3 Princeton
More information1. Basic Steps for Data Analysis Data Editor. 2.4.To create a new SPSS file
1 SPSS Guide 2009 Content 1. Basic Steps for Data Analysis. 3 2. Data Editor. 2.4.To create a new SPSS file 3 4 3. Data Analysis/ Frequencies. 5 4. Recoding the variable into classes.. 5 5. Data Analysis/
More informationMWPHARM++ USER MANUAL
MWPHARM++ USER MANUAL LOGIN SCREEN After launch and load the app, it is necessary to log in. By default (until the user changes it) via: Username: admin and Password: admin or Username: user and Password:
More information1.) ( ) Step 1: Factor the numerator and the denominator. Find the domain. is in lowest terms.
GP3-HW11 College Algebra Sketch the graph of each rational function. 1.) Step 1: Factor the numerator and the denominator. Find the domain. { } Step 2: Rewrite in lowest terms. The rational function is
More informationDecimals should be spoken digit by digit eg 0.34 is Zero (or nought) point three four (NOT thirty four).
Numeracy Essentials Section 1 Number Skills Reading and writing numbers All numbers should be written correctly. Most pupils are able to read, write and say numbers up to a thousand, but often have difficulty
More informationComputer Vision. Exercise Session 10 Image Categorization
Computer Vision Exercise Session 10 Image Categorization Object Categorization Task Description Given a small number of training images of a category, recognize a-priori unknown instances of that category
More informationA novel template matching method for human detection
University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 2009 A novel template matching method for human detection Duc Thanh Nguyen
More informationSecond revision: Supplementary Material Linking brain-wide multivoxel activation patterns to behaviour: examples from language and math
Second revision: Supplementary Material Linking brain-wide multivoxel activation patterns to behaviour: examples from language and math Rajeev D. S. Raizada, Feng Ming Tsao, Huei-Mei Liu, Ian D. Holloway,
More informationChapter 2: Understanding Data Distributions with Tables and Graphs
Test Bank Chapter 2: Understanding Data with Tables and Graphs Multiple Choice 1. Which of the following would best depict nominal level data? a. pie chart b. line graph c. histogram d. polygon Ans: A
More informationIQC monitoring in laboratory networks
IQC for Networked Analysers Background and instructions for use IQC monitoring in laboratory networks Modern Laboratories continue to produce large quantities of internal quality control data (IQC) despite
More informationEconomic Geography An analysis of the determinants of 3G and 4G coverage in the UK
An analysis of the determinants of 3G and 4G coverage in the UK Research Document Publication date: 16 December 2016 About this document In 2015, Ofcom published a report entitled Economic geography: an
More informationLecture 11: Classification
Lecture 11: Classification 1 2009-04-28 Patrik Malm Centre for Image Analysis Swedish University of Agricultural Sciences Uppsala University 2 Reading instructions Chapters for this lecture 12.1 12.2 in
More informationDOE SENSITIVITY ANALYSIS WITH LS-OPT AND VISUAL EXPLORATION OF DESIGN SPACE USING D-SPEX AUTHORS: CORRESPONDENCE: ABSTRACT KEYWORDS:
DOE SENSITIVITY ANALYSIS WITH LS-OPT AND VISUAL EXPLORATION OF DESIGN SPACE USING D-SPEX AUTHORS: Katharina Witowski Heiner Muellerschoen Marko Thiele DYNAmore GmbH Uwe Gerlinger AUDI AG CORRESPONDENCE:
More informationHardware Implementation of the Logarithm Function
DEPARTMENT OF ELECTRICAL AND INFORMATION TECHNOLOGY, FACULTY OF ENGINEERING, LTH MASTER OF SCIENCE THESIS Hardware Implementation of the Logarithm Function using Improved Parabolic Synthesis Author: Jingou
More informationAppendix B: Vehicle Dynamics Simulation Results
Appendix B: Vehicle Dynamics Simulation Results B-1 Vehicle dynamic analyses were undertaken for the three barrier types under each of the curve, shoulder, and barrier placement factors identified. This
More informationSTREAMING FRAGMENT ASSIGNMENT FOR REAL-TIME ANALYSIS OF SEQUENCING EXPERIMENTS. Supplementary Figure 1
STREAMING FRAGMENT ASSIGNMENT FOR REAL-TIME ANALYSIS OF SEQUENCING EXPERIMENTS ADAM ROBERTS AND LIOR PACHTER Supplementary Figure 1 Frequency 0 1 1 10 100 1000 10000 1 10 20 30 40 50 60 70 13,950 Bundle
More informationUsing the IMfig program.
Using the IMfig program. IMfig is a program for generating a figure of an isolation-with-migration model from the output file generated by running the IMa2 program. IMfig generates an eps (encapsulated
More informationCHAPTER 9 INPAINTING USING SPARSE REPRESENTATION AND INVERSE DCT
CHAPTER 9 INPAINTING USING SPARSE REPRESENTATION AND INVERSE DCT 9.1 Introduction In the previous chapters the inpainting was considered as an iterative algorithm. PDE based method uses iterations to converge
More informationUsing the Design Tool for Inventory & Monitoring (DTIM) Chip Scott October 6, 2009
Using the Design Tool for Inventory & Monitoring (DTIM) Chip Scott October 6, 2009 The Design Tool for Inventory and Monitoring (DTIM) is an MS Excel spreadsheet that assists you in meeting your inventory
More informationA New Online Clustering Approach for Data in Arbitrary Shaped Clusters
A New Online Clustering Approach for Data in Arbitrary Shaped Clusters Richard Hyde, Plamen Angelov Data Science Group, School of Computing and Communications Lancaster University Lancaster, LA1 4WA, UK
More informationHello, Thanks for the introduction
Hello, Thanks for the introduction 1 In this paper we suggest an efficient data-structure for precomputed shadows from point light or directional light-sources. Because, in fact, after more than four decades
More informationCPSC 340: Machine Learning and Data Mining. Hierarchical Clustering Fall 2017
CPSC 340: Machine Learning and Data Mining Hierarchical Clustering Fall 2017 Assignment 1 is due Friday. Admin Follow the assignment guidelines naming convention (a1.zip/a1.pdf). Assignment 0 grades posted
More informationEXERCISE: GETTING STARTED WITH SAV
Sequencing Analysis Viewer (SAV) Overview 1 EXERCISE: GETTING STARTED WITH SAV Purpose This exercise explores the following topics: How to load run data into SAV How to explore run metrics with SAV Getting
More informationExploring Econometric Model Selection Using Sensitivity Analysis
Exploring Econometric Model Selection Using Sensitivity Analysis William Becker Paolo Paruolo Andrea Saltelli Nice, 2 nd July 2013 Outline What is the problem we are addressing? Past approaches Hoover
More informationLane Markers Detection based on Consecutive Threshold Segmentation
ISSN 1746-7659, England, UK Journal of Information and Computing Science Vol. 6, No. 3, 2011, pp. 207-212 Lane Markers Detection based on Consecutive Threshold Segmentation Huan Wang +, Mingwu Ren,Sulin
More informationSupplementary Information: Heat generation and light scattering of green fluorescent protein-like pigments in coral tissue
1 2 3 Supplementary Information: Heat generation and light scattering of green fluorescent protein-like pigments in coral tissue 4 5 6 Running title: Coral heating and FPs 7 8 Niclas H. Lyndby a, Michael
More informationMAT 110 WORKSHOP. Updated Fall 2018
MAT 110 WORKSHOP Updated Fall 2018 UNIT 3: STATISTICS Introduction Choosing a Sample Simple Random Sample: a set of individuals from the population chosen in a way that every individual has an equal chance
More information12 Merge/Splice, TVD Merge/Splice
Section 12 12 Merge/Splice, TVD Merge/Splice The Wizard, Merge, Splice and TVD module allows data from one or more database files to be manipulated in the depth domain and output to one or more destination
More informationFathom Dynamic Data TM Version 2 Specifications
Data Sources Fathom Dynamic Data TM Version 2 Specifications Use data from one of the many sample documents that come with Fathom. Enter your own data by typing into a case table. Paste data from other
More informationGabor Filter for Accurate IRIS Segmentation Analysis
Gabor Filter for Accurate IRIS Segmentation Analysis Rupesh Mude M.Tech Scholar (SE) Rungta College of Engineering and Technology, Bhilai Meenakshi R Patel HOD, Computer Science and Engineering Rungta
More informationDeveloped as part of a research contract from EPA Region 9 Partnered with Dr. Paul English, CA DPH EHIB
Air quality hazards defined by CalEPA/ CARB with recommendations for health protective buffer zones to separate these hazards from sensitive populations Developed as part of a research contract from EPA
More informationMonday, May 4, Discs RAID: Introduction Error detection and correction Error detection: Simple parity Error correction: Hamming Codes
Monday, May 4, 2015 Topics for today Secondary memory Discs RAID: Introduction Error detection and correction Error detection: Simple parity Error correction: Hamming Codes Storage management (Chapter
More informationEpithelial rosette detection in microscopic images
Epithelial rosette detection in microscopic images Kun Liu,3, Sandra Ernst 2,3, Virginie Lecaudey 2,3 and Olaf Ronneberger,3 Department of Computer Science 2 Department of Developmental Biology 3 BIOSS
More informationIn this tutorial, we show how to implement this approach and how to interpret the results with Tanagra.
Subject Implementing the Principal Component Analysis (PCA) with TANAGRA. The PCA belongs to the factor analysis approaches. It is used to discover the underlying structure of a set of variables. It reduces
More informationApplied Regression Modeling: A Business Approach
i Applied Regression Modeling: A Business Approach Computer software help: SPSS SPSS (originally Statistical Package for the Social Sciences ) is a commercial statistical software package with an easy-to-use
More informationMicroscopic Measurement
Microscopic Measurement Estimating Specimen Size : The area of the slide that you see when you look through a microscope is called the " field of view ". If you know the diameter of your field of view,
More informationDATA WAREHOUING UNIT I
BHARATHIDASAN ENGINEERING COLLEGE NATTRAMAPALLI DEPARTMENT OF COMPUTER SCIENCE SUB CODE & NAME: IT6702/DWDM DEPT: IT Staff Name : N.RAMESH DATA WAREHOUING UNIT I 1. Define data warehouse? NOV/DEC 2009
More informationClustering Algorithm (DBSCAN) VISHAL BHARTI Computer Science Dept. GC, CUNY
Clustering Algorithm (DBSCAN) VISHAL BHARTI Computer Science Dept. GC, CUNY Clustering Algorithm Clustering is an unsupervised machine learning algorithm that divides a data into meaningful sub-groups,
More informationMinitab Study Card J ENNIFER L EWIS P RIESTLEY, PH.D.
Minitab Study Card J ENNIFER L EWIS P RIESTLEY, PH.D. Introduction to Minitab The interface for Minitab is very user-friendly, with a spreadsheet orientation. When you first launch Minitab, you will see
More informationIndividualness and Determinantal Point Processes for Pedestrian Detection: Supplementary Material
Individualness and Determinantal Point Processes for Pedestrian Detection: Supplementary Material Donghoon Lee 1, Geonho Cha 1, Ming-Hsuan Yang 2, and Songhwai Oh 1 1 Electrical and Computer Engineering,
More information6.034 Design Assignment 2
6.034 Design Assignment 2 April 5, 2005 Weka Script Due: Friday April 8, in recitation Paper Due: Wednesday April 13, in class Oral reports: Friday April 15, by appointment The goal of this assignment
More informationDevelopment of a guidance document on How to perform a shredder campaign Background information
Development of a guidance document on How to perform a shredder campaign Background information Contract no. 070307/2011/603989/ETU/C2 Authors: Knut Sander, Stephanie Schilling Impressum / Imprint: ÖKOPOL
More informationarxiv: v1 [cs.lg] 8 Oct 2018
Hierarchical clustering that takes advantage of both density-peak and density-connectivity Ye Zhu a,, Kai Ming Ting b, Yuan Jin a, Maia Angelova a a School of Information Technology, Deakin University,
More informationChapter DM:II. II. Cluster Analysis
Chapter DM:II II. Cluster Analysis Cluster Analysis Basics Hierarchical Cluster Analysis Iterative Cluster Analysis Density-Based Cluster Analysis Cluster Evaluation Constrained Cluster Analysis DM:II-1
More informationClustering. Robert M. Haralick. Computer Science, Graduate Center City University of New York
Clustering Robert M. Haralick Computer Science, Graduate Center City University of New York Outline K-means 1 K-means 2 3 4 5 Clustering K-means The purpose of clustering is to determine the similarity
More informationMETHODS TO OPTIMALLY TRADE BANDWIDTH AGAINST BUFFER SIZE FOR A VBR STREAM. Stefan Hofbauer
METHODS TO OPTIMALLY TRADE BANDWIDTH AGAINST BUFFER SIZE FOR A VBR STREAM Stefan Hofbauer Overview Motivation Problem description Algorithms Buffer-increasing trade-off algorithm Rate-increasing trade-off
More information