EEG Research with graph theory Ivan Grechikhin. EEG  Electroencephalography (EEG) – special way to retrieve the activity of brains  Graph theory – good.

Slides:



Advertisements
Similar presentations
6.896: Topics in Algorithmic Game Theory Lecture 21 Yang Cai.
Advertisements

O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.
Study of Change Blindness EEG Synchronization using Wavelet Coherence Analysis Professor: Liu Student: Ruby.
The Greedy Method1. 2 Outline and Reading The Greedy Method Technique (§5.1) Fractional Knapsack Problem (§5.1.1) Task Scheduling (§5.1.2) Minimum Spanning.
1 Switching Dominance. 2 Fun with your Hemispheres Rotate your dominant hand in one direction while at the same time rotating the opposite foot in the.
The right-hand limit of f (x), as x approaches a, equals L written: if we can make the value f (x) arbitrarily close to L by taking x to be sufficiently.
22C:19 Discrete Structures Trees Spring 2014 Sukumar Ghosh.
UofR: Neural Basis of Cognition Lecture 2 Methods, Part II Hemispheric Specialization 25 May 2010.
22C:19 Discrete Math Trees Fall 2011 Sukumar Ghosh.
Minimum Spanning Trees
Bar Graphs and Line Graphs Lesson 7-4. Bar Graph A bar graph uses vertical or horizontal bars to display numerical information. Bar graphs can be used.
Electrophysiology.
Electrophysiology. Neurons are Electrical Remember that Neurons have electrically charged membranes they also rapidly discharge and recharge those membranes.
Electroencephalography Electrical potential is usually measured at many sites on the head surface.
Brain Machine Interaction. Non-invasive BCIs Electroencephalography(EEG) - the neurophysiologic measurement of the electrical activity of the brain by.
Each of the shells has either right- or left-handed chirality. Identify which shells belong to each homochiral set. Instructions follow.
Bayesian Networks Clique tree algorithm Presented by Sergey Vichik.
DAST 2005 Tirgul 14 (and more) sample questions. DAST 2005 (reminder?) Kruskal’s MST Algorithm.
Abstract We present a method to obtain and display the significant changes in EEG dynamical connectivity (inferred from synchronization patterns) relative.
Is the following graph Hamiltonian- connected from vertex v? a). Yes b). No c). I have absolutely no idea v.
EEG synchrony pattern segmentation for the exploratory analysis of cognitive experiments Alfonso Alba1, José Luis Marroquín2, Edgar Arce1 1 Facultad de.
Minimum Spanning Trees CIS 606 Spring Problem A town has a set of houses and a set of roads. A road connects 2 and only 2 houses. A road connecting.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 10, Monday, September 22.
Presentation of Data.
Undergraduate Engineering Research Day Poster Design for UnERD 2013.
In previous sections we have been using calculators and graphs to guess the values of limits. Sometimes, these methods do not work! In this section we.
Graph Theory in Computer Science
Limits Numerically Warm-Up: What do you think the following limit equals? If you are unsure at least recall what a limit is and see if that helps direct.
Spanning Trees Introduction to Spanning Trees AQR MRS. BANKS Original Source: Prof. Roger Crawfis from Ohio State University.
7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.
Ways to study the Brain!!! Accidents: damage to brain regions can tell us about their functions Phineas Gage.
Aim: Graph Theory - Trees Course: Math Literacy Do Now: Aim: What’s a tree?
Chapter 3 Limits and the Derivative Section 1 Introduction to Limits.
Example 1 Verify a Trigonometric Identity The left-hand side of this identity is more complicated, so transform that expression into the one on the right.
Excel Charts. Column Chart The Column Chart will show the comparison of one or more series of data points. It is specially useful in comparing multiple.
GRAPHS Bar, Line, Circle. Bar Graph A bar graph uses vertical or horizontal bars to display numerical information. Bar graphs can be used to compare amounts.
Psychology Mr. Duez Unit 2 - Biological Bases of Behavior Brain Scans.
1 Infinite Limits & Vertical Asymptotes Section 1.5.
Inequalities Symbols and line graphs. Symbols  < is less than  > is greater than  < is less than or equal to  > is greater than or equal to points.
UNIT 2 LESSON 6 CS PRINCIPLES. UNIT 2 LESSON 6 OBJECTIVES Students will be able to: Write an algorithm for solving the minimum spanning tree (MST) problem.
Left/Right Hemisphere Specialization LEFT (a little bigger) RIGHT Holistic thought Seeing “big” picture before understanding details Intuition Insight.
 A research technique in which one person is studied in depth in the hope of revealing universal principles.  Phineas Gage’s Accident.
Section 3.5 Graphing Techniques: Transformations.
Graphs and MSTs Sections 1.4 and 9.1. Partial-Order Relations Everybody is not related to everybody. Examples? Direct road connections between locations.
Areas & Riemann Sums TS: Making decisions after reflection and review.
Matching Functions with their Derivatives
1.4 Solving Inequalities I can: 1.Graph inequalities 2.Solve inequalities.
Chapter 3 Limits and the Derivative Section 1 Introduction to Limits.
Welcome to MM305 Unit 6 Seminar Dr. Bob Network Models.
Hemispheres 1. 2 Switching Dominance 3 Fun with your Hemispheres Rotate your dominant hand in one direction while at the same time rotating the opposite.
Making a Graph for Science Class.. Purpose of a graph To visually display information or data collected during an experiment. Create a “snapshot” of the.
Copyright © Cengage Learning. All rights reserved. Limits: A Preview of Calculus.
::Network Optimization:: Minimum Spanning Trees and Clustering Taufik Djatna, Dr.Eng. 1.
SWBAT: - Define Statistics - Distinguish between a population and sample - Distinguish between a parameter and statistic - Distinguish between descriptive.
7.2: Riemann Sums: Left & Right-hand Sums
Minimum Spanning Trees
Greedy Technique.
Minimum Spanning Tree Chapter 13.6.
Minimum Spanning Trees
CS200: Algorithm Analysis
Connected Components Minimum Spanning Tree
2.6 Day 1 Notes Special Functions
How to Study the Brain Lesion: natural or experimentally damaged tissue of the brain used to study portions of the brain.
Minimum spanning trees
Determining the Function Obtained from a Series of Transformations.
Minimum Spanning Trees (MSTs)
Product and Composition of Limits
9.4 Absolute Value Functions and Graphs
Line Graphs.
Drawing a graph
Presentation transcript:

EEG Research with graph theory Ivan Grechikhin

EEG  Electroencephalography (EEG) – special way to retrieve the activity of brains  Graph theory – good for visualization purposes o An electrode represents a point in graph o Every electrode has a characteristic – a numerical series o Measure of closeness of two electrodes must compare two numerical series o As a result, we must somehow display the most significant or interesting connections in brain.

Technique  Measures of closeness – coherency, imaginary part of coherency, synchronization likelihood  Minimal spanning trees (MST) were used as a structure for visualizing and researching  The goal is to find difference between brain properties of left-handed and right handed people  Summarizing, we try to find differences of MST properties for left- handed and right-handed people.