Projects:LabelSpace

From NAMIC Wiki
Revision as of 01:00, 16 November 2013 by Ygao (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search
Home < Projects:LabelSpace
Back to Stony Brook University Algorithms

Label Space: A Coupled Multi-Shape Representation

Many techniques for multi-shape representation may often develop inaccuracies stemming from either approximations or inherent variation. Label space is an implicit representation that offers unbiased algebraic manipulation and natural expression of label uncertainty. We demonstrate smoothing and registration on multi-label brain MRI.


Description

Two key aspects of coupled multi-object shape analysis are the choice of representation and subsequent registration to align the sample set. Current techniques for such analysis tend to trade off performance between the two tasks, performing well for one task but developing problems when used for the other. We propose label space, a representation that is both flexible and well suited for both tasks. Under this framework, object labels are mapped to vertices of a regular simplex, e.g. the unit interval for two labels, a triangle for three labels, a tetrahedron for four labels, etc. This forms a linear space with the property that all labels are equally spaced. On examination, this representation has several desirable properties: algebraic operations may be done directly, label uncertainty is expressed as a weighted mixture of labels, interpolation is unbiased toward any label or the background, and registration may be performed directly. To demonstrate these properties, we describe variational registration directly in this space. Many registration methods fix one of the maps and align the rest of the set to this fixed map. To remove the bias induced by arbitrary selection of the fixed map, we align a set of label maps to their intrinsic mean map.


Figure 1: The first three label space configurations: a unit interval for two labels, a triangle for three labels, and a tetrahedron for four labels (left to right).
Figure 2: Alignment of a set of 30 maps used in the study by Tsai et al. (2003). The original and aligned sets are superimposed for visualization.

Key Investigators

  • Georgia Tech Algorithms: James Malcolm, Yogesh Rathi, Allen Tannenbaum

Publications