Shared more. Cited more. Safe forever.
    • advanced search
    • submit works
    • about
    • help
    • contact us
    • login
    View Item 
    •   MOspace Home
    • University of Missouri-Columbia
    • Office of Undergraduate Research (MU)
    • Undergraduate Research and Creative Achievements Forum (MU)
    • 2008 Undergraduate Research and Creative Achievements Forum (MU)
    • View Item
    •   MOspace Home
    • University of Missouri-Columbia
    • Office of Undergraduate Research (MU)
    • Undergraduate Research and Creative Achievements Forum (MU)
    • 2008 Undergraduate Research and Creative Achievements Forum (MU)
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.
    advanced searchsubmit worksabouthelpcontact us

    Browse

    All of MOspaceCommunities & CollectionsDate IssuedAuthor/ContributorTitleIdentifierThesis DepartmentThesis AdvisorThesis SemesterThis CollectionDate IssuedAuthor/ContributorTitleIdentifierThesis DepartmentThesis AdvisorThesis Semester

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular AuthorsStatistics by Referrer

    A novel algorithm for semiautomatic brain structure segmentation from MRI [abstract]

    Karsch, Kevin
    He, Qing
    Duan, Ye
    Miles, Judith H.
    View/Open
    [PDF] NovelAlgorithmSemiautomaticBrain.pdf (26.96Kb)
    Date
    2008
    Contributor
    University of Missouri-Columbia. Office of Undergraduate Research
    Format
    Presentation
    Metadata
    [+] Show full item record
    Abstract
    On a daily basis, numerous medical institutions use MRI segmentation to conduct research and treat patients. While there are many different segmentation algorithms that exist today, most have drawbacks in respect to either efficiency or accuracy. We present an algorithm that utilizes our unique seeding procedure and integrates several of these methods to achieve robust semiautomatic segmentation on MRI that can be done efficiently on modern CPUs. The seeding method is characterized by a progression of k-Means clustering, connected components searches, and mathematical morphology iterations in order to achieve a seed that closely resembles the target shape to be segmented. The seed is then translated into a level set equation and evolved according to a hybrid k-Means/level set force equation until the target shape is reached. Due to our seeding method, this deformation suffers from far less local minima than had we used a generic seeding procedure. Also, because the seed is near the target shape, the computational complexity is drastically reduced while evolving the level set to its steady state. The entire process requires a single mouse click from a user inside the target region and is done on one slice of an MRI scan in two dimensions.
    URI
    http://hdl.handle.net/10355/1927
    Part of
    2008 Undergraduate Research and Creative Achievements Forum (MU)
    Collections
    • 2008 Undergraduate Research and Creative Achievements Forum (MU)

    Send Feedback
    hosted by University of Missouri Library Systems
     

     


    Send Feedback
    hosted by University of Missouri Library Systems