By Pavan kumar V.V.N. Introduction  Brain’s has extraordinary computational power which is determined in large part by the topology and geometry of its.

Slides:



Advertisements
Similar presentations
ADAPTIVE FASTEST PATH COMPUTATION ON A ROAD NETWORK: A TRAFFIC MINING APPROACH Hector Gonzalez, Jiawei Han, Xiaolei Li, Margaret Myslinska, John Paul Sondag.
Advertisements

Communication Networks Recitation 3 Bridges & Spanning trees.
1 Constructing Splits Graphs Author: Andreas W.M. Dress Daniel H. Huson Presented by: Bakhtiyar Uddin.
Approximations of points and polygonal chains
Whole genome alignments Genome 559: Introduction to Statistical and Computational Genomics Prof. James H. Thomas.
Collision Detection and Resolution Zhi Yuan Course: Introduction to Game Development 11/28/
Image Analysis Phases Image pre-processing –Noise suppression, linear and non-linear filters, deconvolution, etc. Image segmentation –Detection of objects.
20 10 School of Electrical Engineering &Telecommunications UNSW UNSW 10 Nicholas Webb (Author), David Taubman (Supervisor) 15 October 2010.
Introduction to Spatial Database System Presented by Xiaozhi Yu.
Convex Hulls in Two Dimensions Definitions Basic algorithms Gift Wrapping (algorithm of Jarvis ) Graham scan Divide and conquer Convex Hull for line intersections.
Good afternoon everyone.
A Geometric Database for Gene Expression Data Baylor College of Medicine Gregor Eichele Christina Thaller Wah Chiu James Carson Rice University Tao Ju.
Implementation of ICP Variants Pavan Ram Piratla Janani Venkateswaran.
Query Processing in Databases Dr. M. Gavrilova.  Introduction  I/O algorithms for large databases  Complex geometric operations in graphical querying.
A Versatile Depalletizer of Boxes Based on Range Imagery Dimitrios Katsoulas*, Lothar Bergen*, Lambis Tassakos** *University of Freiburg **Inos Automation-software.
© University of Minnesota Data Mining for the Discovery of Ocean Climate Indices 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance.
CS223B Assignment 1 Recap. Lots of Solutions! 37 Groups Many different approaches Let’s take a peek at all 37 results on one image from the test set.
Visual Querying By Color Perceptive Regions Alberto del Bimbo, M. Mugnaini, P. Pala, and F. Turco University of Florence, Italy Pattern Recognition, 1998.
Presented by Ozgur D. Sahin. Outline Introduction Neighborhood Functions ANF Algorithm Modifications Experimental Results Data Mining using ANF Conclusions.
OBBTree: A Hierarchical Structure for Rapid Interference Detection Gottschalk, M. C. Lin and D. ManochaM. C. LinD. Manocha Department of Computer Science,
Tracking Moving Objects in Anonymized Trajectories Nikolay Vyahhi 1, Spiridon Bakiras 2, Panos Kalnis 3, and Gabriel Ghinita 3 1 St. Petersburg State University.
Data Input How do I transfer the paper map data and attribute data to a format that is usable by the GIS software? Data input involves both locational.
Efficient Distance Computation between Non-Convex Objects by Sean Quinlan presented by Teresa Miller CS 326 – Motion Planning Class.
Carmine Cerrone, Raffaele Cerulli, Bruce Golden GO IX Sirmione, Italy July
Collision Detection David Johnson Cs6360 – Virtual Reality.
GI Systems and Science January 23, Points to Cover  What is spatial data modeling?  Entity definition  Topology  Spatial data models Raster.
Esri UC 2014 | Technical Workshop | Data Alignment and Management in ArcMap Lisa Stanners, Sean Jones.
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
A Randomized Approach to Robot Path Planning Based on Lazy Evaluation Robert Bohlin, Lydia E. Kavraki (2001) Presented by: Robbie Paolini.
NATIONAL INSTITUTE OF SCIENCE & TECHNOLOGY Presented by:Manoj Kumar Gantayat CS: Technical Seminar Presentation by MANOJ KUMAR GANTAYAT.
Efficient Gathering of Correlated Data in Sensor Networks
COMPUTER AIDED DESIGN -(CAD)-3
© Manfred Huber Autonomous Robots Robot Path Planning.
Introduction to Neural Networks. Neural Networks in the Brain Human brain “computes” in an entirely different way from conventional digital computers.
An Integration Framework for Sensor Networks and Data Stream Management Systems.
Graph Abstraction for Simplified Proofreading of Slice-based Volume Segmentation Ronell Sicat 1, Markus Hadwiger 1, Niloy Mitra 1,2 1 King Abdullah University.
Real Time Motion Planning. Introduction  What is Real time Motion Planning?  What is the need for real time motion Planning?  Example scenarios in.
OPTIMIZATION OF FUNCTIONAL BRAIN ROIS VIA MAXIMIZATION OF CONSISTENCY OF STRUCTURAL CONNECTIVITY PROFILES Dajiang Zhu Computer Science Department The University.
How to reform a terrain into a pyramid Takeshi Tokuyama (Tohoku U) Joint work with Jinhee Chun (Tohoku U) Naoki Katoh (Kyoto U) Danny Chen (U. Notre Dame)
PMLAB Finding Similar Image Quickly Using Object Shapes Heng Tao Shen Dept. of Computer Science National University of Singapore Presented by Chin-Yi Tsai.
Path Planning for a Point Robot
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe, M. Overmars.
Exploiting Context Analysis for Combining Multiple Entity Resolution Systems -Ramu Bandaru Zhaoqi Chen Dmitri V.kalashnikov Sharad Mehrotra.
2 COEN Computer Graphics I Evening’s Goals n Discuss application bottleneck determination n Discuss various optimizations for making programs execute.
BotGraph: Large Scale Spamming Botnet Detection Yao Zhao, Yinglian Xie, Fang Yu, Qifa Ke, Yuan Yu, Yan Chen, and Eliot Gillum Speaker: 林佳宜.
Neighborhood-Based Topology Recognition in Sensor Networks S.P. Fekete, A. Kröller, D. Pfisterer, S. Fischer, and C. Buschmann Corby Ziesman.
Introduction to Neural Networks and Example Applications in HCI Nick Gentile.
Approximate Inference: Decomposition Methods with Applications to Computer Vision Kyomin Jung ( KAIST ) Joint work with Pushmeet Kohli (Microsoft Research)
J. Hwang, T. He, Y. Kim Presented by Shan Gao. Introduction  Target the scenarios where attackers announce phantom nodes.  Phantom node  Fake their.
University “Ss. Cyril and Methodus” SKOPJE Cluster-based MDS Algorithm for Nodes Localization in Wireless Sensor Networks Ass. Biljana Stojkoska.
SybilGuard: Defending Against Sybil Attacks via Social Networks.
9 of 18 Introduction to medial axis transforms and their computation Outline DefinitionsMAS PropertiesMAS CAD modelsTJC The challenges for computingTJC.
Complex brain networks: graph theoretical analysis of structural and functional systems.
1 Efficient Discovery of Frequent Approximate Sequential Patterns Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu ICDM 2007.
Graphs. Introduction Graphs are a collection of vertices and edges Graphs are a collection of vertices and edges The solid circles are the vertices A,
What is GIS? “A powerful set of tools for collecting, storing, retrieving, transforming and displaying spatial data”
Large Scale Structure of the Universe Sameshan Perumal and Carl Hultquist.
1. For minimum vertex cover problem in the following graph give
A Binary Linear Programming Formulation of the Graph Edit Distance Presented by Shihao Ji Duke University Machine Learning Group July 17, 2006 Authors:
Catalogs contain hundreds of millions of objects
Figure 1. Competition for establishing neural connections
Introduction to Event-Driven Programming
Spatial Database Systems
Geographical Information Systems
Query Processing in Databases Dr. M. Gavrilova
De-anonymizing the Internet Using Unreliable IDs By Yinglian Xie, Fang Yu, and Martín Abadi Presented by Peng Cheng 03/22/2017.
Finite Element Surface-Based Stereo 3D Reconstruction
Neuro-RAM Unit in Spiking Neural Networks with Applications
David Johnson Cs6360 – Virtual Reality
Presentation transcript:

By Pavan kumar V.V.N

Introduction  Brain’s has extraordinary computational power which is determined in large part by the topology and geometry of its structures.  Brain Tissue Scanner (BTS) is the unique instrument which will enable an entire mouse brain to be imaged and reconstructed at the neuronal level of detail.

Introduction  BTS will take approximately one month to scan the entire mouse brain  Since only a small percentage(less than 10%) of neurons will be stained, the neurons reconstructed from BTS data will be augmented with synthetic neurons that are grown based on the measured biological neurons.

Introduction  In this paper generation and connection of the anatomically realistic synthetic neurons is explained.  Strategy used is probabilistic roadmap methods(PRM)  In PRM nodes represent neurons and edges represent connections(synapses).

Neuron PRM Framework  Goal is to map and understand the connectivity and geometry of the cortical network.  The cerebral cortex is partitioned into a set of finite elements (FEs).  Then there are two stages 1.Neuron generation 2.Synapses generation The basic building blocks of this process are below.

Synthetic neurons generated and connected in the cortex

Neuron PRM Framework: Finite elements, Neuron generation/connection, roadmap graph, and database

A 1-fold rectangle tree

Generation of Neurons  An abstract neuron contains information regarding position, type, associated FE, and a unique ID.  Position and type are generated randomly based on some given statistical distribution stored in the FE’s database.  Next, an L-system is used to create a morpholigically correct synthetic neuron based on the information contained in the abstract neuron and on statistics provided by the database in the host FE for that neuron type.

Generation of Synapses  Statistically each neuron has thousands of synapses and there are on the order of sixteen million neurons in the cortex of the mouse.  Hence a brute force strategy which tests all pairs of neurons is not feasible.  To address this issue, simple metrics are defined to reject neuron pairs and identify potential synapses very quickly.

Generation of Synapses  Most neuron pairs are quickly rejected by a filtering test which checks for intersection of their bounding volumes.  When the intersection of a pair of neurons is discovered, we connect their associated vertices in the roadmap.  This is shown below.

Neurons in one FE surrounded by bounding volumes

Generation of Synapses  The bounding volumes used are  spheres  boxes  convex hulls.  The bounding sphere and bounding box provide fast construction and intersection tests  convex hull is more accurate in terms of approximating the shape of the target neuron.

Generation of synapses  The strategy sketched above performs O(n^2) bounding volume intersection tests.  For the bounding box representation, it is reduced this to O(nlogn+k) where k is number of intersections by using Edelsbrunner’s rectangle tree.  If neuron pair’s bounding volumes intersect, a more detailed computation will more precisely compute synapse locations.

Generation of synapses  The fact used is that synapses are usually found between segments and spines.  For each pair of connected neurons, we compute distances from spines of one neuron to the segments of the other neuron.  If the distance is less than a user specified value for synapse gap, this spine, segment pair is marked as synaptic site.

Experiments

Experiments Synapse discovery for 40,000 neurons

Experiments  The running time for building these volumes, as expected, was much faster for the bounding sphere and the bounding box than for the convex hull.  For the connection phase 10,000 neurons with the bounding sphere, bounding box, and the convex hull are tested.  Threshold used for synaptic gap is  It is identified that convex hull is the fastest.  Though it takes more time in the first phase it will filter more number of neurons.

 The error rate is defined as : (N empty-abs-syn)/(N total-abs-syn) where N empty-abs-syn is the number of abstract synapses which did not contain any real synapse. N total-abs-syn is total number of abstract synapses in the given roadmap.  This measure gives us an indication of the accuracy of the bounding volume methods

Conclusion  A prototype developed system that will eventually be used to (re)construct an entire mouse cortical network containing over 15 million neurons.  N-PRM, for constructing a hierarchical model of the cortical network uses L-System neuron generators.  various bounding volumes for reducing the cost of synapse identification are studied.

Thank You