.png){kind=icon}
.png){kind=icon}
Return
An EM algorithm for shape classification based on level sets
.png){kind=icon}
PRE
AI
DOI：10.1016/j.media.2005.05.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose an expectation-maximization (EM) approach to separate a shape database into different shape classes, while simultaneously estimating the shape contours that best exemplify each of the different shape classes. We begin our formulation by employing the level set function as the shape descriptor. Next, for each shape class we assume that there exists an unknown underlying level set function whose zero level set describes the contour that best represents the shapes within that shape class. The level set function for each example shape in the database is modeled as a noisy measurement of the appropriate shape class's unknown underlying level set function. Based on this measurement model and the judicious introduction of the class labels as the hidden data, our EM formulation calculates the labels for shape classification and estimates the shape contours that best typify the different shape classes. This resulting iterative algorithm is computationally efficient, simple, and accurate. We demonstrate the utility and performance of this algorithm by applying it to two medical applications. (c) 2005 Elsevier B.V. All rights reserved.
Keywords:
shape classification
shape estimation
level set methods
EM algorithm
computer-aided diagnosis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
11.8
Papers:
3.8K
Citations:
2.4W
Organization
No organization information available