IPAM Workshop on Image Processing for Random Shapes: Applications to Brain Mapping, Geophysics and Astrophysics UCLA May 21-25, 2007 Geometric Shape Descriptors.

Slides:



Advertisements
Similar presentations
Binary Shape Clustering via Zernike Moments
Advertisements

Discrimination amongst k populations. We want to determine if an observation vector comes from one of the k populations For this purpose we need to partition.
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Image classification Given the bag-of-features representations of images from different classes, how do we learn a model for distinguishing them?
Evaluating Color Descriptors for Object and Scene Recognition Koen E.A. van de Sande, Student Member, IEEE, Theo Gevers, Member, IEEE, and Cees G.M. Snoek,
電腦視覺 Computer and Robot Vision I
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
By: Michael Vorobyov. Moments In general, moments are quantitative values that describe a distribution by raising the components to different powers.
IPAM Graduate Summer School Mathematics in Brain Mapping UCLA July 17, 2004 Cortical Surface Correction and Conformal Flat Mapping: TopoCV and CirclePack.
Some Methods for Modeling Cortical Surface Yuai Hua
1 Machine Learning: Lecture 10 Unsupervised Learning (Based on Chapter 9 of Nilsson, N., Introduction to Machine Learning, 1996)
Computer vision: models, learning and inference Chapter 13 Image preprocessing and feature extraction.
Extended Gaussian Images
Fast and Extensible Building Modeling from Airborne LiDAR Data Qian-Yi Zhou Ulrich Neumann University of Southern California.
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
Corp. Research Princeton, NJ Cut Metrics and Geometry of Grid Graphs Yuri Boykov, Siemens Research, Princeton, NJ joint work with Vladimir Kolmogorov,
Content Based Image Clustering and Image Retrieval Using Multiple Instance Learning Using Multiple Instance Learning Xin Chen Advisor: Chengcui Zhang Department.
Offset of curves. Alina Shaikhet (CS, Technion)
1 Learning to Detect Objects in Images via a Sparse, Part-Based Representation S. Agarwal, A. Awan and D. Roth IEEE Transactions on Pattern Analysis and.
Prénom Nom Document Analysis: Linear Discrimination Prof. Rolf Ingold, University of Fribourg Master course, spring semester 2008.
Lower Bounds for the Ropelength of Reduced Knot Diagrams by: Robert McGuigan.
E.G.M. PetrakisTexture1 Repeative patterns of local variations of intensity on a surface –texture pattern: texel Texels: similar shape, intensity distribution.
Smart Traveller with Visual Translator for OCR and Face Recognition LYU0203 FYP.
Invariant SPHARM Shape Descriptors for Complex Geometry in MR Region of Interest Analysis Ashish Uthama 1 Rafeef Abugharbieh 1 Anthony Traboulsee 2 Martin.
Handwritten Character Recognition using Hidden Markov Models Quantifying the marginal benefit of exploiting correlations between adjacent characters and.
Image Segmentation by Clustering using Moments by, Dhiraj Sakumalla.
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
Psy B07 Chapter 1Slide 1 ANALYSIS OF VARIANCE. Psy B07 Chapter 1Slide 2 t-test refresher  In chapter 7 we talked about analyses that could be conducted.
Attention Deficit Hyperactivity Disorder (ADHD) Student Classification Using Genetic Algorithm and Artificial Neural Network S. Yenaeng 1, S. Saelee 2.
CSE554AlignmentSlide 1 CSE 554 Lecture 8: Alignment Fall 2014.
Probability of Error Feature vectors typically have dimensions greater than 50. Classification accuracy depends upon the dimensionality and the amount.
Image Pattern Recognition The identification of animal species through the classification of hair patterns using image pattern recognition: A case study.
Review of Vector Analysis
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
Machine Vision for Robots
ECE 8443 – Pattern Recognition LECTURE 03: GAUSSIAN CLASSIFIERS Objectives: Normal Distributions Whitening Transformations Linear Discriminants Resources.
Statistical Decision Making. Almost all problems in statistics can be formulated as a problem of making a decision. That is given some data observed from.
OPTIMIZATION OF FUNCTIONAL BRAIN ROIS VIA MAXIMIZATION OF CONSISTENCY OF STRUCTURAL CONNECTIVITY PROFILES Dajiang Zhu Computer Science Department The University.
Texture. Texture is an innate property of all surfaces (clouds, trees, bricks, hair etc…). It refers to visual patterns of homogeneity and does not result.
Axial Flip Invariance and Fast Exhaustive Searching with Wavelets Matthew Bolitho.
Intersubject Normalization for Group Analyses in fMRI
Author :Monica Barbu-McInnis, Jose G. Tamez-Pena, Sara Totterman Source : IEEE International Symposium on Biomedical Imaging April 2004 Page(s): 840 -
Gauss’s Law Chapter 21 Summary Sheet 2. EXERCISE: Draw electric field vectors due to the point charge shown, at A, B and C +.. B. A C Now draw field lines.
CSE554AlignmentSlide 1 CSE 554 Lecture 8: Alignment Fall 2013.
D. M. J. Tax and R. P. W. Duin. Presented by Mihajlo Grbovic Support Vector Data Description.
ECE 8443 – Pattern Recognition LECTURE 08: DIMENSIONALITY, PRINCIPAL COMPONENTS ANALYSIS Objectives: Data Considerations Computational Complexity Overfitting.
Lecture 4 Linear machine
1Ellen L. Walker Category Recognition Associating information extracted from images with categories (classes) of objects Requires prior knowledge about.
IMPORTANCE OF STATISTICS MR.CHITHRAVEL.V ASST.PROFESSOR ACN.
CZ5225: Modeling and Simulation in Biology Lecture 7, Microarray Class Classification by Machine learning Methods Prof. Chen Yu Zong Tel:
Chapter 13 (Prototype Methods and Nearest-Neighbors )
ECE 8443 – Pattern Recognition LECTURE 04: PERFORMANCE BOUNDS Objectives: Typical Examples Performance Bounds ROC Curves Resources: D.H.S.: Chapter 2 (Part.
ECE 8443 – Pattern Recognition ECE 8527 – Introduction to Machine Learning and Pattern Recognition LECTURE 04: GAUSSIAN CLASSIFIERS Objectives: Whitening.
Identifying “Best Bet” Web Search Results by Mining Past User Behavior Author: Eugene Agichtein, Zijian Zheng (Microsoft Research) Source: KDD2006 Reporter:
Next, this study employed SVM to classify the emotion label for each EEG segment. The basic idea is to project input data onto a higher dimensional feature.
Accuracy, Reliability, and Validity of Freesurfer Measurements David H. Salat
The gray-white matter boundary defines the locations and directions of the primary currents in the cortex and can be used as an anatomical constraint for.
Kim HS Introduction considering that the amount of MRI data to analyze in present-day clinical trials is often on the order of hundreds or.
CIVET seminar Presentation day: Presenter : Park, GilSoon.
Statistical Decision Making. Almost all problems in statistics can be formulated as a problem of making a decision. That is given some data observed from.
Methods of multivariate analysis Ing. Jozef Palkovič, PhD.
ASP algorithm Image term Stretch term Bending term Self-proximity term Vertex-vertex proximity constraints.
CSE 554 Lecture 8: Alignment
In Search of the Optimal Set of Indicators when Classifying Histopathological Images Catalin Stoean University of Craiova, Romania
A Hybrid PCA-LDA Model for Dimension Reduction Nan Zhao1, Washington Mio2 and Xiuwen Liu1 1Department of Computer Science, 2Department of Mathematics Florida.
Computer Vision Lecture 16: Texture II
Detecting Gray Matter Maturation via Tensor-based Surface Morphometry
Gauss’s Law Chapter 21 Summary Sheet 2.
Presentation transcript:

IPAM Workshop on Image Processing for Random Shapes: Applications to Brain Mapping, Geophysics and Astrophysics UCLA May 21-25, 2007 Geometric Shape Descriptors for Shape Analysis and Sulcal Classification of MRI Data Monica K. Hurdal Department of Mathematics, Florida State University, Tallahassee

Motivation Increasingly, diseases that affect brain function are being correlated to structural brain changes. Classification and identification of differences in brain anatomy (i.e. differences in shape) due to disease is difficult due to individual variability in folding patterns. Parcellation and labeling of cortical features are critical for brain cartography and conveying information to compare subjects or populations. Parcellation and labeling are manually intensive processes confounded by variability in folding patterns. Methods are needed to quantify properties of the shape of the cortical surface on a global as well as local level.

Brains are Heterogeneous Slide from Duke course

Important Questions How much variation is there in the size, shape or location of an individual healthy brain structure? To what extend does function and disease depend on the anatomy of the brain? Potential of using structural abnormality as a measure of development, normal aging, and disease

Anatomical Localization Sulci and Gyri gray matter (dendrites & synapses) white matter (axons) FUNDUS BANK SULCUS GYRUS SULCUS gray/white border pial surface FISSURE Source: Ludwig & Klingler, 1956 in Tamraz & Comair, 2000

Shape Analysis, Curve Shape Descriptors & Features Properties of shape curves and surfaces in 3D can be described by invariant features. Sulcal or gyral curves that fall in the same class exhibit geometric resemblance, but significant intra-class variations have been observed as well. Thus, starting with a collection of shape descriptors, it is essential to develop algorithmic procedures to extract (learn) the features that can be used effectively for parcellation, labeling and disease quantification.

Motivation for the Measures We notice that the brain sulci are a set of space curves. Interested in geometric invariant features of polygonal curves such as writhe, mathematical moments, extremal length. Methods are inspired by generalized Gauss Integrals. Methodology proposed is concerned with crossings seen in planar projections of curves. Thickness and length are also considered. Central sulcus Calcarine sulcus Superior Temporal sulcus Superior Frontal sulcus Central sulcus Calcarine sulcus Superior Temporal sulcus Superior Frontal sulcus Precentral sulcus

Geometric Shape Descriptors Generalized Gauss Integrals Thickness and Ropelength

Crossing Signs At a crossing point c of an oriented regular diagram of a knot (or curve), we have two possible configurations. Either sign(c)=+1 or sign(c)=-1.

Projected Writhe Wr(γ,  ) = -3 where γ =closed space curve projected into the plane in the direction of the vector 

Writhing Number In general, almost all projections of a curve into the plane in the direction of the vector  will be regular, where at most two projected edges intersect, and that intersection is transverse. ‏For any regular projection, each crossing c can be assigned a value of according to the right hand rule. ‏The Writhe (or projected writhing number), Wr(  ), is defined as the average over all projections of the projected writhing number ‏The projected writhing number of a closed space curve γ, denoted by Wr( γ ), can be calculated using generalized Gauss integrals.

Calculating Writhe using a Gauss Integral Given a simple closed curve, the writhe is defined by the double integral: where D is the diagonal of. What about polygonal curves?

Polygonal Open Curves Source: Knotplot by R Scharein

Consider an Oriented Polygonal Curve For any pair of edges e i, e j, consider the set of points u on the unit sphere such that e i and e j are crossing when looking in the direction of the vector u.

Writhe The writhe can be computed as: where w(i, j) is the area spanned by e i and e j. Since w(i, j) = w(j, i),

I (1,2) & I |1,2| We set Here w(i 1,i 2 ) is the contribution to the writhing number coming from the i 1 th and the i 2 th line segments. w(i 1,i 2 ) is equal to the probability from an arbitrary direction to see the i 1 th and the i 2 th line segment cross, multiplied by the sign of this crossing. Thus, geometrically this notion of writhe number is still the projected writhing number averaged over all projections. Taking the absolute value inside the sum one gets the average crossing number:

Higher Order Writhing Numbers: A Family of Measures where N is the number of vertices for the polygonal curve Reference: P. Rogen, B. Fain;2003 PNAS, Vol 100 No. 1, ‏By combining these numbers, we can make a whole set of structural higher order writhing measures, e.g.

Importance Plane curves A and B possess the same writhe and average crossing number. The higher-order invariants, however, distinguish the two curves. Reference: P. Rogen, B. Fain;2003 PNAS, Vol 100 No. 1,

A set of measures given by: divided by the length L of the curve were computed.

Geometric Shape Descriptors Generalized Gauss Integrals Thickness and Ropelength

The thickness of a knot is the radius of the largest embedded normal tube around the knot. The ropelength is the quotient of its length and its thickness. Source: Knotplot by R Scharein

Methods: Cortical Surface Extraction & Sulcal Curve Generation Extract region of interest from MRI volume (e.g. cortical hemisphere) Create topologically correct triangulated surface of neural tissue from MRI volume Compute principal curvatures Consider curves which are oriented polygonal curves in Euclidean 3-space: trace lines of principal curvature using dynamic programming Compute shape features: writhe and higher order writhing numbers, thickness, ropelength

Data: Cortical Hemispheres 15 normal right-handed subjects from a static force experiment (7 females, 8 males; ages 19-45) Topologically correct cortical left and right hemispheres reconstructed from MRI data Five sulcal curves tracked on each pial surface hemisphere: calcarine, central, precentral, superior frontal, superior temporal sulci

Methodology (0.3, 0.5, … 0.7) Brain surfaceSulcus pathsVector of Geometric Measures Central sulcus Calcarine sulcus Superior Temporal sulcus Superior Frontal sulcus

Subject 2 Subject 1 Writhe Invariants Notice that the orders of magnitude of most invariants are similar, yet the values of the invariants are different. This suggests two facts: 1. It might possible to identify a specific sulcus for labeling 2. It might be possible to classify populations.

Classification Methods & Results A vector of 24 features composed of scaled Gauss integrals, ropelength, thickness, length were used as the basis for classification. Experiment 1: Sulcal curves were separated into two classes: i) left and ii) right hemisphere (5 sulcal paths per hemisphere; 15 curve sets from left hemisphere, 15 curve sets from right; 75 curves per class) Experiment 2: Sulcal curves separated into two classes: i) male and ii) female subjects (sulci from one hemisphere only; 8 males, 7 females) Discrimination via Multiple Discriminant Analysis (MDA): –The projection maximizes the distance between the means of the classes while minimizing the variance within each class.

Left-Right Hemisphere Distinction Data divided into two classes: Left and right 5 sulcus paths per hemisphere 15 curve sets from left hemisphere, 15 from right Then we compute the vectors of geometric measures, and project the values in the plane using MDA

Left-Right Hemispheres

Male-Female Distinction We divided the data into two classes: Male and Female. We consider only sulci from one hemisphere (5 sulci per brain). Compute the vectors of geometric measures, and project by using MDA.

Similar results obtained for data from the left hemisphere Male-Female, Right Hemisphere

Classification Using Machine Learning Methods MDA results suggest classification scheme possible WEKA: open source machine learning software Left-Right Hemisphere: 50% considered for training; a number of methods classified 100% correctly (including Ridor, Lazy LWL) Male-Female: 75% considered for training; 100% accuracy using Voted Perceptron; 75% accuracy using Ridor; as amount of training decreases, percentage of accuracy drops Other scenarios, including sulcal curve classification have been successful (see poster)

Conclusions We used a novel set of geometric measures that seem to capture the anatomy of the brain. Originally for closed curves, these measures have been extended to open and broken curves. We perform a number of experiments to test the performance of the Gauss integral measures, length and thickness.

Conclusions We have a method that could allow a criteria for separating their functional information on the basis of the gross neuroanatomy parameters. Our method get us one step closer to identify classes of brain anatomy and categorizing function and behavior.

Future Directions Future direction of this research is to refine the features in order to make discrimination more sensitive, e.g. labeling of sulci on the same hemisphere. Develop methods that determine which features and algorithms are optimal for classification. These methods need to be tailored to specific applications. Evaluate robustness of features due to alternate surface reconstructions, other sulci or gyri. With these invariant features, it might be possible to identify specific sulci for labeling. Use these measures to differentiate between specific populations.

Acknowledgements Juan Gutierrez, Aaron Kline, Christian Laing, Debbie Smith (Math, FSU) David Rottenberg (Radiology, Neurology, U. Minnesota) for 15 subject MRI data NIH Human Brain Project Grant EB02013 NSF Focused Research Group Grant DMS More information on Brain Mapping: URL: