BAYESIAN MODEL SELECTION IN SSMs 863
(a) (b)
Figure 1. Shape representation using the explained hybrid point sets: (a) Binary representation of a shape
in the training set. (b) Corresponding SDF, with overlaid narrow band (shading) and zero level set contour
(thick line). The shape is represented as a set of the points in the narrow band, where each point is defined by
concatenating its spatial coordinates and SDF value (i.e., ˜x =[x
T
,φ(x)]
T
). The latter can aid in reconstructing
the shape with the correct orientation and topology.
goals, we construct the SSM in section 2.6 by determining the virtual point correspondences
[30] and applying the PCA.
2.1. Shape representation. The input data to our algorithm consists of K binary masks,
as D dimensional images, from which we constitute our training point sets. To this end, it
is customary to sample the points from the surface of the binary masks and thus ignore the
orientation of the surfaces (or the polarity of the masks). Without this information, recon-
struction of surfaces from points can be handled through various approaches. For instance,
Zhao, Osher, and Fedkiw [58] first computed an unsigned distance map from the points by
solving the Eikonal equation; then a geodesic active contour was driven toward the point set
using advection on the distance map. This step is time-consuming and, during its evolution,
contour can be trapped in a local minima. In other related works, the direction of normal
vectors to the surface is estimated and inconsistent normal vectors are flipped [29]. Then an
SDF is constructed by moving along the normals in both directions of the surface [9]. Without
explicit information on the surface normal, its automated extraction from geometry alone is
a nontrivial and ambiguous process for complex and closed structures.
Here, we take a different approach and include additional distance features on a surface’s
narrow band for unambiguous surface reconstruction. As shown in Figure 1, given a binary
mask we first construct an SDF, whose zero level set represents the surface of the mask.
Next, we collect all the points within a narrow band of thickness δ around the zero level
set. Each point is defined as an augmented D + 1 dimensional vector and consists of spatial
coordinates and the corresponding SDF value. Distance information is conveyed through our
EM algorithm to the constructed statistical model and can be used to infer the implied surface
from the mean model. To reconstruct a surface, we first interpolate the values of the SDF on
a regular grid of voxels and then extract the zero level set (see (3.2)).
2.2. Sparsity and alignment through EM algorithm. Let X = {X
k
},1≤ k ≤ K,denote
the set of K observed (D + 1) dimensional training point sets defined as X
k
= {˜x
ki
∈ R
D+1
|
1 ≤ i ≤ N
k
}.Letφ
k
denote the SDF from the surface of the kth segmented training shape.