EPFL
 Biomedical Imaging GroupSTI
EPFL
  Publications
English only   BIG > Publications > MR Images Segmentation


 CONTENTS
 Home Page
 News & Events
 People
 Publications
 Tutorials and Reviews
 Research
 Demos
 Download Algorithms

 DOWNLOAD
 PDF
 Postscript
 All BibTeX References

Unsupervised Connectivity-Based Thresholding Segmentation of Midsagittal Brain MR Images

C. Lee, S. Huh, T.A. Ketter, M. Unser

Computers in Biology and Medicine, vol. 28, no. 3, pp. 309-338, May 1998.



In this paper, we propose an algorithm for automated segmentation of midsagittal brain MR images. First, we apply thresholding to obtain binary images. From the binary images, we locate some landmarks. Based on the landmarks and anatomical information, we preprocess the binary images, which substantially simplifies the subsequent operations. To separate regions that are incorrectly merged after this initial segmentation, a new connectivity-based threshold algorithm is proposed. Assuming that some prior information about the general shape and location of objects is available, the algorithm finds a boundary between two regions using the path connection algorithm and changing the threshold adaptively. In order to test the robustness of the proposed algorithm, we applied the algorithm to 120 midsagittal brain images and obtained satisfactory results.


@ARTICLE(http://bigwww.epfl.ch/publications/lee9802.html,
AUTHOR="Lee, C. and Huh, S. and Ketter, T.A. and Unser, M.",
TITLE="Unsupervised Connectivity-Based Thresholding Segmentation of
        Midsagittal Brain {MR} Images",
JOURNAL="Computers in Biology and Medicine",
YEAR="1998",
volume="28",
number="3",
pages="309--338",
month="May",
note="")

© 1998 Elsevier. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from Elsevier.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.