In this paper, a new interactive algorithm for image segmentation is proposed. First, threshold segmentation is applied to the original image, and the corresponding foreground image and background image are obtained. In the foreground image, some manually selected contour pixel points of the pattern to be segmented will become the initial seed points. The set composed of seed points is defined as set E. Then, the distances between each pixel point in foreground image and each seed point in set E are computed. If the minimum distance is less than the threshold, the pixel point with minimum distance is labeled as seed point, and added to the set E. Until all the pixel points in the foreground image have been labeled, the seed points in the final set E compose the segmentation image. At last, the effectiveness of the proposed algorithm is proved by a simulation.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.