Abstract

A generic model-based segmentation algorithm is presented. Based on a set of training data, consisting of images with corresponding object segmentations, a local appearance and local shape model is build. The object is described by a set of landmarks. For each landmark a local appearance model is build. This model describes the local intensity values in the image around each landmark. The local shape model is constructed by considering the landmarks to be vertices in an undirected graph. The edges represent the relations between neighboring landmarks. By implying the markovianity property on the graph, every landmark is only directly dependent upon its neighboring landmarks, leading to a local shape model. The objective function to be minimized is obtained from a maximum a-posteriori approach. To minimize this objective function, the problem is discretized by considering a finite set of possible candidates for each landmark. In this way the segmentation problem is turned into a labeling problem. Mean field annealing is used to optimize this labeling problem. The algorithm is validated for the segmentation of teeth from cone beam computed tomography images and for automated cephalometric analysis.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call