2011 Winter Project Week:MeshCurvolver - Revision history

Pkarasev at 14:24, 14 January 2011

2011-01-14T14:24:40Z

Pkarasev: /* Key Investigators */

2011-01-10T20:07:10Z

Key Investigators

Pkarasev: /* Key Investigators */

2011-01-10T18:59:54Z

Key Investigators

Pkarasev: /* Key Investigators */

2011-01-10T18:58:57Z

Key Investigators

Pkarasev at 18:55, 10 January 2011

2011-01-10T18:55:45Z

Pkarasev: Created page with 'NOTOC Image:PW-SLC2010.png|Projects List Image:BrainH.png|Surface Mean Curvature Image:Sulci6_done2.png|Converged Contour Surr…'

2010-11-18T17:40:15Z

Created page with '__NOTOC__ <gallery> Image:PW-SLC2010.png|Projects List Image:BrainH.png|Surface Mean Curvature Image:Sulci6_done2.png|Converged Contour Surr…'

New page

__NOTOC__
<gallery>
Image:PW-SLC2010.png|[[2010_Summer_Project_Week#Projects|Projects List]]
Image:BrainH.png|Surface Mean Curvature
Image:Sulci6_done2.png|Converged Contour Surrounding Region
Image:Sulci3_init_3.png|Initial Points From User
Image:bone-end3.png|Segmenting Tibia Fracture via Surface Geometry
Image:Surface_H_c.png|Surface curvature display for segmented colon MRI in Slicer
Image:lsvtk_qtcreator.png|'Extreme Programming' with QT Creator in Ubuntu Linux
</gallery>

== Key Investigators ==
* Georgia Tech: Peter Karasev, Karol Chudy, Allen Tannenbaum
* BWH: Ron Kikinis

<div style="margin: 20px;">
<div style="width: 27%; float: left; padding-right: 3%;">

<h3>Objective</h3>
We are developing methods for segmentation of surfaces defined by polygonal meshes. In image or volume-slice segmentation, 'information' comes from image intensity, while in mesh surface segmentation the information is purely geometric. The goal of this project is to develop algorithms allowing a user to quickly and robustly segment one or several regions on a surface. Specifically, it is required to reconcile some concepts in classical differential geometry and embedded curves with the numerical and discrete-space constraints of polygon meshes.

</div>
<div style="width: 40%; float: left;">

<h3>Approach, Plan</h3>

Surface Geometry Computation

Closest Path Between Initial Points

Fast Level Set Implementation for Unstructured Mesh

Support 'global geometry' estimation for statistical analysis versus local-only for fast segmentation

Extend Functionality in VTK and ITK to perform needed operations

The module pipeline now contains three classes that extend vtkPolyDataAlgorithm. It now makes use of vtkSmartPointer.

* vtkInitClosedPath : take in poly data and set of fiducial points, create a closed path including the closest points on the mesh to the given fiducials. Searches for pre-existence of geometry information, pass-through if it already exists.

* vtkComputeLocalGeometry : take in poly data, compute curvature, its derivatives, and related differential geometric quantities. Uses its own version of curvature computation- vtk versions are not useable because they only consider 1-neighborhood. Searches for pre-existence of geometry information, pass-through if it already exists.

* vtkLevelSetMeshEvolver : take in poly data with a scalar array defining the current region boundaries. Update the boundaries with curve evolution and return poly data with updated scalar array.

</div>

<div style="width: 40%; float: left;">

</div>
</div>
<div style="width: 95%; float: left;">

==References==
P.A. Karasev, J.G. Malcolm, M. Niethammer, R. Kikinis, A. Tannenbaum. User-Driven 3D Mesh Region Targeting. SPIE Medical Imaging 2010.
</div>

@@ Line 12: / Line 12: @@
 == Key Investigators ==
-* Georgia Tech: Peter Karasev, Ivan Kolesov, Karol Chudy, Allen Tannenbaum
+* Georgia Tech: Peter Karasev, Ivan Kolesov, Anthony Blumfield, Karol Chudy, Allen Tannenbaum
 * BWH: Ron Kikinis

@@ Line 52: / Line 52: @@
 </div>
-<div style="width: 40%; float: left;">
+<div style="width: 30%; float: left;">
 <h3>Progress</h3>

← Older revision		Revision as of 18:58, 10 January 2011
Line 54:		Line 54:
	<div style="width: 40%; float: left;">		<div style="width: 40%; float: left;">

		+	<h3>Progress</h3>
		+
		+	Builds and runs in windows now, thanks to Anthony Blumfield.

	</div>		</div>

@@ Line 4: / Line 4: @@
 Image:BrainH.png|Surface Mean Curvature
 Image:Sulci6_done2.png|Converged Contour Surrounding Region
-Image:Sulci3_init_3.png|Initial Points From User
+Image:Sfls_donut.png|Sparse Field Levelset Layer Visualization
 Image:bone-end3.png|Segmenting Tibia Fracture via Surface Geometry
 Image:Surface_H_c.png|Surface curvature display for segmented colon MRI in Slicer
@@ Line 55: / Line 56: @@
 <h3>Progress</h3>
 Builds and runs in windows now, thanks to Anthony Blumfield.

@@ Line 7: / Line 7: @@
 Image:bone-end3.png|Segmenting Tibia Fracture via Surface Geometry
 Image:Surface_H_c.png|Surface curvature display for segmented colon MRI in Slicer
-Image:lsvtk_qtcreator.png|'Extreme Programming' with QT Creator in Ubuntu Linux
+Image:KSlice1.png|Femur Surface Segmentation
 </gallery>
 == Key Investigators ==
-* Georgia Tech: Peter Karasev, Karol Chudy, Allen Tannenbaum
+* Georgia Tech: Peter Karasev, Ivan Kolesov, Karol Chudy, Allen Tannenbaum
 * BWH: Ron Kikinis
@@ Line 18: / Line 19: @@
 <h3>Objective</h3>
-We are developing methods for segmentation of surfaces defined by polygonal meshes. In image or volume-slice segmentation, 'information' comes from image intensity, while in mesh surface segmentation the information is purely geometric. The goal of this project is to develop algorithms allowing a user to quickly and robustly segment one or several regions on a surface. Specifically, it is required to reconcile some concepts in classical differential geometry and embedded curves with the numerical and discrete-space constraints of polygon meshes.
+We are developing methods for segmentation of surfaces defined by polygonal meshes. In image or volume-slice segmentation, 'information' comes from image intensity, while in mesh surface segmentation the information is purely geometric. The goal of this project is to develop algorithms allowing a user to quickly and robustly segment one or several regions on a surface.
 </div>
@@ Line 35: / Line 37: @@
 Extend Functionality in VTK and ITK to perform needed operations
 * vtkInitClosedPath : take in poly data and set of fiducial points, create a closed path including the closest points on the mesh to the given fiducials. Searches for pre-existence of geometry information, pass-through if it already exists.
@@ Line 43: / Line 43: @@
 * vtkLevelSetMeshEvolver : take in poly data with a scalar array defining the current region boundaries. Update the boundaries with curve evolution and return poly data with updated scalar array.
 </div>

2011 Winter Project Week:MeshCurvolver - Revision history

Pkarasev at 14:24, 14 January 2011

Pkarasev: /* Key Investigators */

Pkarasev: /* Key Investigators */

Pkarasev: /* Key Investigators */

Pkarasev at 18:55, 10 January 2011

Pkarasev: Created page with '__NOTOC__ Image:PW-SLC2010.png|Projects List Image:BrainH.png|Surface Mean Curvature Image:Sulci6_done2.png|Converged Contour Surr…'

Pkarasev: Created page with 'NOTOC Image:PW-SLC2010.png|Projects List Image:BrainH.png|Surface Mean Curvature Image:Sulci6_done2.png|Converged Contour Surr…'