A1 Gori Thms and Programing Tools For

Total Page:16

File Type:pdf, Size:1020Kb

A1 Gori Thms and Programing Tools For A1gori thms and Programing Tools for Image Processing on the MPP: #2 Report for the Period March 1986 to August 1985 Anthony P. Reeves School of Electrical Engineering Cornel 1 University Ithaca, New York 14853 Work Supported by NASA Grant NAG 5-403 Algorithms and Programming Tools for Image Processing on the MPl? #2 Report for the Period March 1986 to August 1985 Anthony P. Reeves School of Electrical Engineering Cornell University Ithaca, New York 14853 Work Supported by NASA Grant NAG 5-403 Summczry The work reported here was conducted by Maria Gutierrez and Marc Willebeek-LeMair, who are graduate students at Cornell University, and myself. The work for this period iof the grant falls into two main categories algorithms for the MPP and performance analysis of data manipulations for the MPP and related archi- tectures. Maria has developed a number of novel algorithms for image warping and pyramid image filtering. Marc has investigated techniques for the parallel processing of a large number of independent irregular shaped regions on the MPP. In addition some new utilities for dealing with very long vectors and for sorting have been developed. Documentation pages for the new algorithms which are available for dis- tribution are given in Appendix A. Not all algorithms have been made to work on the MPP. The effort in the final period of the grant will concentrate on the MPP im- plementation. The performance of the MPP for a number of basic data manipulations has been determined. From these results it is possible to predict the efficiency of the MPP for a number of algorithms and applications Some of these results have been published 11,Z31 and these papers are included as Appendices C, D and E The Parallel Pascal development system, which is a portable programming environment for the MPP, has been improved and better documentation including a tutorial has been written. This environment, allows programs for the MPP to be developed on any conventional mm- puter system; it consists of a set of system programs and a library of general purpose Parallel Pascal functions The new tutorial is included as Appendix EL 2 During this report period Idria, Man: and mysel have visited the NA 4 God- dard Space Flight Center. Algorithms have been tested on the MPP and a presenta- tion on the development system was made to the MPP users group We have distri- buted the uND< version of the Parallel Pascal System to number of new sites. Some of the highlights of the rmlts of this research are listed below. Image Processing Algorithms Algorithms for image warping are described in Appendix A. The two main functions are nearest neighbor, "WARP, and bilinear interpolation BLWARP. Both of these functions are guided by the same heuristic technique which is very &cient for small arbitrary warps but can also deal with large image distortions Building on the pyramid processing primitives, which were mentioned in the previous report, Laplacian and Gaussian pyramid image filters have been implemented by the functions LAFUICIAN and GAUSSIAN respectively as outlined in Appendix A. These algorithms are used to decompose an image into a number of bandpass filtered subimages A number of interesting &cient image analysis and image filter- ing algorithms have been based on this pyramid of subimages. Local Region Processing A new approach to the parallel processing of independent regions in parallel on the MPP is being investigated. For each region in an image a tree is created which spans the region and can be used to compute features of the region. Special provisions have been made for generating trees for non-simply connected regions Techniques for parallel region merging have been developed. After merging two regions, a new tree is generated which covers the region in a minimum amount of time Using these tree procedures, an image segmentation algorithm, based on the split and merge para- digm, has been implemented. An initial paper on these techniques is in preparation. General Utilities A general purpose sorting algorithm has been implemented; this is described in the SORT documentation page in Appendix A. Based on the bitonic sorting technique this program can sort the rows, the columns or treat the whole PE matrix as a long 3 vector. Any basic data type can be sorted. There are new utilities for local mean, local median and local maximum filters; see LMEAN, LMEDIAN and LMAXIMUM in Appendix A. Also, a general purpose binary matching algorithm (COMPN)has been developed. Performance analysis An analysis of different data permutations and manipulations on the MPP is presented in [l] which is also included in Appendix C This analysis expresses the co6t of data manipulations in terms of elemental arithmetic operations; Boolean, in- teger and floating point data types are considered. Results are computed for arrays of size 128 x 128,256 x 256, and 512 x 512. An extended version of this paper, which includes a general description of the MPP, is given in [21 which is also included as Ap pendix C There has been much recent interest in the implementation of parallel pyramid data processors Such a processor could be maded with the MPP by augmenting the processor array with a pyramid structure of additional processing elements. A py- ramid processor based on the MPP is considered in 131 which is also included as Ap- pendix D. The results from an analysis of the proposed system indicate that, in gen- eral, there would be little advantage in having the additional pyramid hardware for implementing many of the pyramid algorithms References 1. A. P. Reeves and C H. Moura, "Data Manipulations on the Massively Parallel Processor," Proceedings of the Nineteenth Hawaii lnterncrtwd Conference on System Sciences, pp 222-229 (January, 19862 2 A. P. Reeves, 'The Massively Parallel Processor: A Highly Parallel scientific Computer," pp 239-252 in Data Analysis in Astrommy 11,ed. V. Di Gesu, Ple- num Press (1986). 3 A. P. Reeves, ''Pyramid Algorithms on Processor Arrays," pp 195-213 in Pyrm- kid Systems for Computer Visison, ed. V. Cantoni and S Levialdi, Academic Press (1986). Appendix A BLWARP ( 2 ) PPSPDS Users Manual BLWARP ( 2 ) NAME blwarp - Bilinear interpolation warping SYNOPSIS {$library blwsrp.pl} function blwarp( mx:pli; rp:pli;cp:pli; rf:plr; cfip1r):pli; extern rl, rh, cl, ch; TYPES plr = array [rl..rh,cl..ch] of btype; pli = array [rl..rh,cl..ch] of itype; plb = array [rl..rh,cl..ch] of boolean; Where btype is any type and itype is an integer or subrange base type EXTERN CONSTANTS rl = the smallest row number of the input matrix rh = the largest row number of the input matrix cl = the smallest column number of the input matrix ch = the largest column number of the input matrix DESCRIPTION Blwarp is a two dimensional bilinear interpolation warping function. It first finds the four ver- tices of the squares that contain each of the points that we want to interpolate. The function nnwarp is used to find these vertices and the points are given by the matrices (rp+rf) and (cp+cf). Rp and cp define the mapping to be implemented. The bilinear interpolation is performed in the following way: - cf P1 -+ * P2 II II rf I I -*P P3 * * P4 for all points P in the matrix. AUTHOR Maria C. Gutierrez SEE ALSO rotation(2),~warp(2) A. P. Reeves PPL 1 ~ ~- I COMPN(2) PPSPDS Users Manual COMPN(2) I NM compn - near neigbor comparison function I SYNOPSIS {library mx.pl } I compn (m:mtype; w:wtype ):mtype; extern sise; TYPES mtype = parallel array [lol..hil, lo2..hi2] of boolean; I wtype = array [O..size, O..size] of 0.2; DESCRIPTION Compn compares the local neighborhood of each element of the boolean input matrix m with the I window w. If a match occures then the result element is true, otherwise it is false. A zero in w matches with false in m, a one in w matches with true in m and a two in w is a don’t care. AUTHOR I A. P. Reeves I I I I I I I I m I I I A. P. Reeves PPL 1 I GAUSSIAN ( 2 ) PPSPDS Users Manual GAUSSIAN ( 2 ) I NAME gaussian - gaussian pyramid: low pass filter I SYNOPSIS {(library Pyramid.pl } function gaussian(image:gtype; weight:real):rtype; I extern nrows ncols; TYPES 1 gtype = parallel array [O..nrows, O..ncols] of (real or integer); rtype = parallel array [O..nrows, O..ncols] of real; itype = parallel array (O..nrows, O..ncols] of integer; I btype = parallel array [O..nrows, O..ncols] of boolean; EXTERN CONSTANTS nrows = The largest row number of the image matrix I ncols = The largest column number of the image matrix VARS idl,id2,upl,dnl,up2,dn2: itype I pyr msk: btype; Id1 and id2 are two global index identifying matrices as created by twodid (see mat(2)). These must be initialized first. The other matrices specify transformations for managing pyramid data; see pyramid(2) for more information. I DESCRIPTION GUU88iUn is a low pass filter function for pyramid structure images stored in atwo dimensional matrix. The successive levels of the pyramid structure are stored in successive rows of the image I matrix with the highest level image (1 pixel image) being located at position [O,O] in the input matrix. Each level is a low pass filtered copy of its predecessor and it is obtained by convolving the predecessor with a Gaussian weighting kernel. This kernel is generated from the weight I parameter; if a gaussian kernel is desired the weight should be equal to 0.4.
Recommended publications
  • Management of Large Sets of Image Data Capture, Databases, Image Processing, Storage, Visualization Karol Kozak
    Management of large sets of image data Capture, Databases, Image Processing, Storage, Visualization Karol Kozak Download free books at Karol Kozak Management of large sets of image data Capture, Databases, Image Processing, Storage, Visualization Download free eBooks at bookboon.com 2 Management of large sets of image data: Capture, Databases, Image Processing, Storage, Visualization 1st edition © 2014 Karol Kozak & bookboon.com ISBN 978-87-403-0726-9 Download free eBooks at bookboon.com 3 Management of large sets of image data Contents Contents 1 Digital image 6 2 History of digital imaging 10 3 Amount of produced images – is it danger? 18 4 Digital image and privacy 20 5 Digital cameras 27 5.1 Methods of image capture 31 6 Image formats 33 7 Image Metadata – data about data 39 8 Interactive visualization (IV) 44 9 Basic of image processing 49 Download free eBooks at bookboon.com 4 Click on the ad to read more Management of large sets of image data Contents 10 Image Processing software 62 11 Image management and image databases 79 12 Operating system (os) and images 97 13 Graphics processing unit (GPU) 100 14 Storage and archive 101 15 Images in different disciplines 109 15.1 Microscopy 109 360° 15.2 Medical imaging 114 15.3 Astronomical images 117 15.4 Industrial imaging 360° 118 thinking. 16 Selection of best digital images 120 References: thinking. 124 360° thinking . 360° thinking. Discover the truth at www.deloitte.ca/careers Discover the truth at www.deloitte.ca/careers © Deloitte & Touche LLP and affiliated entities. Discover the truth at www.deloitte.ca/careers © Deloitte & Touche LLP and affiliated entities.
    [Show full text]
  • Modern Programming Languages CS508 Virtual University of Pakistan
    Modern Programming Languages (CS508) VU Modern Programming Languages CS508 Virtual University of Pakistan Leaders in Education Technology 1 © Copyright Virtual University of Pakistan Modern Programming Languages (CS508) VU TABLE of CONTENTS Course Objectives...........................................................................................................................4 Introduction and Historical Background (Lecture 1-8)..............................................................5 Language Evaluation Criterion.....................................................................................................6 Language Evaluation Criterion...................................................................................................15 An Introduction to SNOBOL (Lecture 9-12).............................................................................32 Ada Programming Language: An Introduction (Lecture 13-17).............................................45 LISP Programming Language: An Introduction (Lecture 18-21)...........................................63 PROLOG - Programming in Logic (Lecture 22-26) .................................................................77 Java Programming Language (Lecture 27-30)..........................................................................92 C# Programming Language (Lecture 31-34) ...........................................................................111 PHP – Personal Home Page PHP: Hypertext Preprocessor (Lecture 35-37)........................129 Modern Programming Languages-JavaScript
    [Show full text]
  • TANGO Device
    School on TANGO Controls system Basics of TANGO Lorenzo Pivetta Claudio Scafuri Graziano Scalamera http://www.tango-controls.org L.Pivetta, C.Scafuri, G.Scalamera School on TANGO Control System - Trieste 4-8th July 2016 2 Prerequisites To better understand the training a background on the following arguments is desirable: ● Programming language ● Object oriented programming ● Linux/UNIX operating system ● Networking ● Control systems L.Pivetta, C.Scafuri, G.Scalamera School on TANGO Control System - Trieste 4-8th July 2016 3 Outline 1 - What is TANGO? 2 - TANGO architecture Language/OS/Compilers Device hierarchy CORBA and ZeroMQ TANGO domains TANGO device and device server TANGO Database Communication models 3 - TANGO configuration/tools Multicast Jive Polling Starter/Astor Events Pogo Alarms TANGO installation Groups Client basics TANGO ACL Logging system Historical DataBase 4 – Examples Test device L.Pivetta, C.Scafuri, G.Scalamera School on TANGO Control System - Trieste 4-8th July 2016 4 What is TANGO? Scientific workspaces Native client applications In short: Industrial SCADA Control system framework TANGO Based on CORBA and ZMQ C++ TANGO Java Archiving Python System Centralized config. database TANGO TANGO TANGO TANGO Clients binding binding binding binding (CLI/GUI) Software bus for distributed TANGO software bus objects Provides unified interface to Device Device Device Device Device Device Device Server Server Server Server Server Server Server all equipments hiding how they are HV ps + Pylon OPC UA Data Motion TANGO SNMP connected/managed
    [Show full text]
  • A Practical Guide for Improving Transparency and Reproducibility in Neuroimaging Research Krzysztof J
    bioRxiv preprint first posted online Feb. 12, 2016; doi: http://dx.doi.org/10.1101/039354. The copyright holder for this preprint (which was not peer-reviewed) is the author/funder. It is made available under a CC-BY 4.0 International license. A practical guide for improving transparency and reproducibility in neuroimaging research Krzysztof J. Gorgolewski and Russell A. Poldrack Department of Psychology, Stanford University Abstract Recent years have seen an increase in alarming signals regarding the lack of replicability in neuroscience, psychology, and other related fields. To avoid a widespread crisis in neuroimaging research and consequent loss of credibility in the public eye, we need to improve how we do science. This article aims to be a practical guide for researchers at any stage of their careers that will help them make their research more reproducible and transparent while minimizing the additional effort that this might require. The guide covers three major topics in open science (data, code, and publications) and offers practical advice as well as highlighting advantages of adopting more open research practices that go beyond improved transparency and reproducibility. Introduction The question of how the brain creates the mind has captivated humankind for thousands of years. With recent advances in human in vivo brain imaging, we how have effective tools to ​ ​ peek into biological underpinnings of mind and behavior. Even though we are no longer constrained just to philosophical thought experiments and behavioral observations (which undoubtedly are extremely useful), the question at hand has not gotten any easier. These powerful new tools have largely demonstrated just how complex the biological bases of behavior actually are.
    [Show full text]
  • Automated Regional Behavioral Analysis for Human Brain Images
    METHODS ARTICLE published: 28 August 2012 NEUROINFORMATICS doi: 10.3389/fninf.2012.00023 Automated regional behavioral analysis for human brain images Jack L. Lancaster 1*, Angela R. Laird 1, Simon B. Eickhoff 2,3, Michael J. Martinez 1, P. M i c k l e F o x 1 and Peter T. Fox 1 1 Research Imaging Institute, The University of Texas Health Science Center at San Antonio, San Antonio, TX, USA 2 Institute of Neuroscience and Medicine (INM-1), Research Center, Jülich, Germany 3 Institute for Clinical Neuroscience and Medical Psychology, Heinrich-Heine University, Düsseldorf, Germany Edited by: Behavioral categories of functional imaging experiments along with standardized brain Robert W. Williams, University of coordinates of associated activations were used to develop a method to automate regional Tennessee Health Science Center, behavioral analysis of human brain images. Behavioral and coordinate data were taken USA from the BrainMap database (http://www.brainmap.org/), which documents over 20 years Reviewed by: Glenn D. Rosen, Beth Israel of published functional brain imaging studies. A brain region of interest (ROI) for behavioral Deaconess Medical Center, USA analysis can be defined in functional images, anatomical images or brain atlases, if Khyobeni Mozhui, University of images are spatially normalized to MNI or Talairach standards. Results of behavioral Tennessee Health Science Center, analysis are presented for each of BrainMap’s 51 behavioral sub-domains spanning five USA behavioral domains (Action, Cognition, Emotion, Interoception, and Perception). For each *Correspondence: Jack L. Lancaster, Research Imaging behavioral sub-domain the fraction of coordinates falling within the ROI was computed Institute, The University of Texas and compared with the fraction expected if coordinates for the behavior were not Health Science Center at San clustered, i.e., uniformly distributed.
    [Show full text]
  • Mango Ripeness Stages Using Three Image Processing Algorithms
    RESEARCH ARTICLE Determining ‘Carabao’ Mango Ripeness Stages Using Three Image Processing Algorithms ٠ Mary Grace C. Galela ٠ Deborah S. Naciongayo ٠ Miguel Carlos S. Guillermo Cinmayii G. Manliguez ٠ Emma Ruth V. Bayogan ٠ Czaryl P. Dioquino University of the Philippines Mindanao, PHILIPPINES Abstract Harvested mangoes are commonly classified or sorted manually. This method is tedious, time consuming, inaccurate and prone to errors. Human inspection is also subjective and factors like visual stress and tiredness may arise that can result in the inconsistencies in judgment. The use of a chroma meter is reliable but the equipment is expensive. This study explored the use of three digital image processing algorithms to determine harvested ‘Carabao’ mango ripeness stages. Canny edge detection, Sobel edge detection, and Laplacian of Gaussian detection algorithms were used to extract a mango image from its original image. The mean red, green, and blue (RGB) values of the detected images were converted to L*a*b* color values which were used to identify the ripeness level of the mango image based on the standard generated from gathered data of ‘Carabao’ mangoes. The standard generated was also based on the mango peel color index scale from University of the Philippines Los Baños Postharvest Horticulture Training and Research Center (PHTRC). The algorithms’ performance had an overall accuracy of 80.5% for canny edge detection algorithm and L*a*b* color extraction using neural networks; 63.88% for Sobel edge detection algorithm and L*a*b* color extraction using rgb2lab function in MATLAB software; and 17.33% Laplacian of Gaussian detection and L*a*b* color extraction using OpenCV.
    [Show full text]
  • Working with the DICOM and Nifti Data Standards in R
    JSS Journal of Statistical Software October 2011, Volume 44, Issue 6. http://www.jstatsoft.org/ Working with the DICOM and NIfTI Data Standards in R Brandon Whitcher Volker J. Schmid Andrew Thornton Mango Solutions Ludwig-Maximilians- Cardiff University Universit¨at Munchen¨ Abstract Two packages, oro.dicom and oro.nifti, are provided for the interaction with and manipulation of medical imaging data that conform to the DICOM standard or ANA- LYZE/NIfTI formats. DICOM data, from a single file or directory tree, may be uploaded into R using basic data structures: a data frame for the header information and a matrix for the image data. A list structure is used to organize multiple DICOM files. The S4 class framework is used to develop basic ANALYZE and NIfTI classes, where NIfTI extensions may be used to extend the fixed-byte NIfTI header. One example of this, that has been implemented, is an XML-based \audit trail" tracking the history of operations applied to a data set. The conversion from DICOM to ANALYZE/NIfTI is straightforward using the capabilities of both packages. The S4 classes have been developed to provide a user- friendly interface to the ANALYZE/NIfTI data formats; allowing easy data input, data output, image processing and visualization. Keywords: export, imaging, import, medical, visualization. 1. Introduction Medical imaging is well established in both the clinical and research areas with numerous equipment manufacturers supplying a wide variety of modalities. The DICOM (Digital Imag- ing and Communications in Medicine; http://medical.nema.org/) standard was developed from earlier standards and released in 1993.
    [Show full text]
  • Image Processing Techniques for Lemons and Tomatoes Classification 785
    Image processing techniques for lemons and tomatoes classification 785 Note IMAGE PROCESSING TECHNIQUES FOR LEMONS AND TOMATOES CLASSIFICATION (1) ANTONIO CARLOS LOUREIRO LINO (2*); JULIANA SANCHES (2); INACIO MARIA DAL FABBRO (3) ABSTRACT Vegetable quality is frequently referred to size, shape, mass, firmness, color and bruises from which fruits can be classified and sorted. However, technological by small and middle producers implementation to assess this quality is unfeasible, due to high costs of software, equipment as well as operational costs. Based on these considerations, the proposal of this research is to evaluate a new open software that enables the classification system by recognizing fruit shape, volume, color and possibly bruises at a unique glance. The software named ImageJ, compatible with Windows, Linux and MAC/OS, is quite popular in medical research and practices, and offers algorithms to obtain the above mentioned parameters. The software allows calculation of volume, area, averages, border detection, image improvement and morphological operations in a variety of image archive formats as well as extensions by means of “plugins” written in Java. Key words: fruits and vegetables selection, ImageJ software, machine vision. RESUMO TÉCNICA DE PROCESSAMENTO DE IMAGEM PARA CLASSIFICAÇÃO DE LIMÕES E TOMATES A qualidade vegetal freqüentemente se refere a tamanho, forma, massa, firmeza, cor e danos, em que podem ser classificados e ordenados. Porém, sua implementação tecnológica se torna inviável, para pequenos e médios produtores, devido ao alto custo de softwares, equipamentos, além dos custos operacionais. Com base nessas considerações, a proposta deste trabalho é estudar a adaptação de um novo software, com código-fonte aberto para habilitar o sistema de classificação reconhecendo forma, volume, cor e possivelmente danos.
    [Show full text]
  • Developed by Overview Requirements Features
    Overview Features Mango Automation platform is a 100% browser-based, cross Built In Protocols platform software application that enables users to access With BACnet, Modbus, MQTT, SNMP, DNP3, SQL, and control electronic sensors, PLC’s, devices, databases or CSV Files, HTTP, and others there is no need to pay web services over multiple protocols simultaneously. Mango for extra drivers or software tools. provides an interface with which diverse data sources can be created and configured while providing downstream High Performance Time Series Historian management of user access, alerts, data logging, alarms and Mango is capable of storing billions of historical automation. values with ground breaking throughput while utilizing surprisingly small amounts of disk space. Requirements Built In Analytics Mango provides several standard web interfaces Processor Intel Core i5 or better, fully multi threaded and compatible with multiple CPU cores for users to perform quick and efficient analytics of systems. RAM - Less than 20,000 data points 8GB - Greater than 20,000 data points Report and Billing 16GB or more Create fully customized reports & bills using Excel Hard Drive - SSD Preferred documents. Reports can be manually or automatically - 500MB minimum for Mango delivered to users’ email inboxes. - 1GB per 50 million values in Time Series Database System Scalability Operating System Windows 7 or greater, Linux or Mac OSX 64 bit From a simple standalone application to a global data acquisition system with thousands of remote nodes, Server Type Physical or Virtual including Amazon or the same Mango software scales for all types needs. other hosted server Software Oracle Java JDK 1.8 Automation & Alarming Dependencies Mango includes powerful scripting environments Databases - None required that allow users to write control algorithms.
    [Show full text]
  • Mango Brochure
    Mango SolutionEasy Affordable Open Source Modern Building Automation Data Acquisition SCADA System IIoT HTTP SQL is a 100% browser-based, cross platform software SNMP application that enables users to access and control electronic sensors, PLC’s, devices, databases or web services over multiple protocols simultaneously. Mango provides an interface Many more... with which diverse data sources can be created and configured while providing downstream management of user access, alerts, data logging, alarms and automation. Built In Protocols Powerful data visualization tools bring your data to life with dynamic With BACnet, Modbus, MQTT, SNMP, DNP3, SQL, CSV Files, HTTP, and others there is no dashboards that allow you to better analyze and aggregate your data, allowing need to pay for extra drivers or software tools. Out of the box Mango will easily connect to your users to make more informed decisions. all your devices and sources of data normalizing everything into one easy to use interface. Low level protocols, like Serial or TCP, can enable you to interface with custom or proprietary Mango Automation includes everything you need to build a powerful, scalable protocols quickly. and modern systems. High Performance Time Series Historian Mango is capable of storing billions of historical values with ground breaking throughput while utilizing surprisingly small amounts of disk space. With no external server or database configuration needed, Mango is ready to provide you lightning fast performance out of the box. Built in Analytics Mango provides several standard web interfaces for users to perform quick and efficient analytics of systems. With easy to configure Watch Lists and flexible data queries you are provided with deep data visibility with little configuration needed.
    [Show full text]
  • Development of Tools for Whole-Organism High-Throughput Screening
    Development of Tools for Whole-Organism High-Throughput Screening by Harrison. Yi Liu DISSERTATION Submitted in partial satisfaction of the requirements for the degree of DOCTOR OF PHILOSOPHY in Bioengineering in the GRADUATE DIVISION of the UNIVERSITY OF CALIFORNIA, SAN FRANCISCO AND UNIVERSITY OF CALIFORNIA, BERKELEY ii Dedication & Acknowledgements I would like to thank my parents Tzung-Ying Liu and Judith Hwa, as well as my brother Jeremy Liu for their love and support over the years. I would also like to thank my advisor Dr. Bo Huang for his advice, discussion, and guidance throughout my years in graduate school. Many thanks to Dr. Su Guo for her suggestions and support during the zebrafish project. I am additionally extremely grateful to all the members of the Guo lab who have spent countless hours working with me to culture and screen zebrafish – I would not be where I am today without their hard work. Lastly, I would like to thank Dr. Daniel Fletcher and Dr. Noelle L’Etoile for their counsel over the course of this dissertation. iii Abstract Development of Tools for Whole-Organism High-Throughput Screening High-throughput screening (HTS) leverages laboratory automation and advanced analytics in order to perform experiments much more quickly than what can be accomplished by hand. Since its inception in the 1990s, HTS has revolutionized the field of drug discovery, and has been adopted by the leaders of the industry. However, the application of HTS technology has largely been limited to purified protein or cell-culture based assays, with detrimental consequences for the viability of lead compounds identified using this approach.
    [Show full text]
  • Machine Learning for Blob Detection in High-Resolution 3D Microscopy Images
    DEGREE PROJECT IN COMPUTER SCIENCE AND ENGINEERING, SECOND CYCLE, 30 CREDITS STOCKHOLM, SWEDEN 2018 Machine learning for blob detection in high-resolution 3D microscopy images MARTIN TER HAAK KTH ROYAL INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE Machine learning for blob detection in high-resolution 3D microscopy images MARTIN TER HAAK EIT Digital Data Science Date: June 6, 2018 Supervisor: Vladimir Vlassov Examiner: Anne Håkansson Electrical Engineering and Computer Science (EECS) iii Abstract The aim of blob detection is to find regions in a digital image that dif- fer from their surroundings with respect to properties like intensity or shape. Bio-image analysis is a common application where blobs can denote regions of interest that have been stained with a fluorescent dye. In image-based in situ sequencing for ribonucleic acid (RNA) for exam- ple, the blobs are local intensity maxima (i.e. bright spots) correspond- ing to the locations of specific RNA nucleobases in cells. Traditional methods of blob detection rely on simple image processing steps that must be guided by the user. The problem is that the user must seek the optimal parameters for each step which are often specific to that image and cannot be generalised to other images. Moreover, some of the existing tools are not suitable for the scale of the microscopy images that are often in very high resolution and 3D. Machine learning (ML) is a collection of techniques that give computers the ability to ”learn” from data. To eliminate the dependence on user parameters, the idea is applying ML to learn the definition of a blob from labelled images.
    [Show full text]