Lecture 20

30
Surface Modeling Visualization using BrainVISA Bill Rogers UTHSCSA – Research Imaging Center

Transcript of Lecture 20

Page 1: Lecture 20

Surface Modeling Visualization using BrainVISA

Bill RogersUTHSCSA – Research Imaging Center

Page 2: Lecture 20

Why Use Surface Modeling

• Visualization of Structure• Analysis of Structure• Dynamic control of view

Page 3: Lecture 20

What Makes a Surface

• A surface is usually defined as a mesh• The mesh is composed of vertices, edges,

normals and polygons• The vertices define the surface boundary• Vertices are connected by edges• Edges are combined to make polygons• Normals determine side of surface as well as

viewing properties

Page 4: Lecture 20

Vertices and Edges

Page 5: Lecture 20

Polygons

Page 6: Lecture 20

Polygon Mesh Surface

Page 7: Lecture 20

Parametric Surfaces

• Surface in Euclidean space defined by a parametric equation with two parameters

• A set of weighted control points determine the location of individual surface points

• The come in several flavors including Bezier, B-Spline, NURBS

Page 8: Lecture 20

NURBS surface with control points

Page 9: Lecture 20

NURBS Surfaces

Page 10: Lecture 20

Isosurface extractionor

Where to put the surface

Page 11: Lecture 20

Isosurfaces

• A 3-D surface corresponding to points with a single scalar value (or narrow range of values).

• The scalar value corresponds to an interface between voxels of different properties.

Page 12: Lecture 20

The Surface is Only as Good as the Tissue Classification

• Bias Correction• Partial Volume Effect• Classification of voxels

Page 13: Lecture 20

Isosurface Extraction Techniques

• Geometric Decomposition Techniques– Geometric techniques retain the original

representation of the volume and partition along divisions in the voxel volume

• Span Space Decomposition Techniques– Span space decomposition techniques create and

manipulate abstract representations of the voxels

Page 14: Lecture 20

Methods of Isosurface Extraction

• Marching Cubes (Geometric)

• BONO - branch-on-need octree (Geometric)

• ISSUE - Isosurfacing in Span Space with Utmost Efficiency (Span Space)

• Interval Tree – (Span Space)

Page 15: Lecture 20

Marching Cubes

• William E. Lorensen, Harvey E. Cline: Marching Cubes: A high resolution 3D surface construction algorithm. In: Computer Graphics, Vol. 21, Nr. 4, July 1987

• Computes polygons where the isosurface passes through eight nearest neighbors

• Gradient of scalar value at each grid point used for surface normal

• Other algorithms are always compared to Marching Cubes

Page 16: Lecture 20

Marching Cubes• 15 Unique cube configurations that can be

rotated and reflected to 256 configurations

Page 17: Lecture 20

Marching Cubes DemoGraphics cards aren’t just for games anymore

Page 18: Lecture 20

Mesh Segmentation

Page 19: Lecture 20

Introduction to BrainVisa• Origin and Development

• Collaborative work of methodologists of the Institut Fédératif de Recherche

• Core development now at the Service Hospitalier Frédéric Joliot

• Framework for Image Processing• GUI for chaining applications together

– GUI developed in Python– Command line application developed in C++

• Database for organization of input and output files• Visualization package for viewing results

Page 20: Lecture 20

BrainVISA Availability

• Multiplatform– Linux (Fedora, Redhat, Mandriva)– Macintosh (OS X)– Windows (2000, XP)

• Download at http://brainvisa.info/

Page 21: Lecture 20

BrainVISA Demo

Page 22: Lecture 20

BrainVISA Curvature Mapping

Page 23: Lecture 20

BrainVISA Cortical Folds

Page 24: Lecture 20

RIC BrainVisa Extensions

Page 25: Lecture 20

RIC Cortical Thickness

Page 26: Lecture 20

White matter surface normals

Page 27: Lecture 20

RIC Sulcal Length and Depth

Page 28: Lecture 20

Mapping Mesh to Volume

Page 29: Lecture 20

RIC 3D Gyrification Index

Page 30: Lecture 20

Removing Effect of Ventricles