2026-09-19T10:44:34Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/580772022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
Polina Golland and Bruce Fischl.
Yeo, B. T. Thomas (Boon Thye Thomas)
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2010-09-01T16:25:52Z
2010-09-01T16:25:52Z
2010
2010
http://hdl.handle.net/1721.1/58077
635490785
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 127-141).
In medical image analysis, registration is necessary to establish spatial correspondences across two or more images. Registration is rarely the end-goal, but instead, the results of image registration are used in other tasks, such as voxel-based morphometry, functional group analysis, image segmentation and tracking. In this thesis, we argue that the quality of image registration should be evaluated in the context of the application. Consequently, we develop a framework for learning registration cost functions optimized for specific tasks. We demonstrate that by taking into account the application, we not only achieve better registration, but also potentially resolve certain ambiguities and ill-posed nature of image registration. We first develop a generative model for joint registration and segmentation of images. By jointly modeling registration and the application of image segmentation, we demonstrate improvements in parcellation of the cerebral cortex into different structural units. In this thesis, we work with spherical representations of the human cerebral cortex. Consequently, we develop a fast algorithm for registering spherical images. Application to the cortex shows that our algorithm achieves state-of-the-art accuracy, while being an order of magnitude faster than competing diffeomorphic, landmark-free algorithms. Finally, we consider the problem of automatically determining the "free" parameters of registration cost functions.
(cont.) Registration is usually formulated as an optimization problem with multiple tunable parameters that are manually set. By introducing a second layer of optimization over and above the usual registration, this thesis provides the first effective approach to optimizing thousands of registration parameters to improve alignment of a new image as measured by an application-specific performance measure. Much previous work has been devoted to developing generic registration algorithms, which are then specialized to particular imaging modalities (e.g., MR), particular imaging targets (e.g., cardiac) and particular post- registration analyses (e.g., segmentation). Our framework provides a principled method for adapting generic algorithms to specific applications. For example, we estimate the optimal weights or cortical folding template of the generic weighted Sum of Squared Differences dissimilarity measure for localizing underlying cytoarchitecture and functional regions of the cerebral cortex. The generality of the framework suggests potential applications to other problems in science and engineering formulated as optimization problems.
by B.T. Thomas Yeo.
Ph.D.
141 p.
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Learning task-optimal image registration with applications in localizing structure and function in the cerebral cortex
Thesis
application/pdf
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="f6a8aecc-7bf1-476e-b727-5e0b06be187d">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Learning task-optimal image registration with applications in localizing structure and function in the cerebral cortex</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2010</PublicationDate>
<Authors>
<Author>
<DisplayName>Yeo, B. T. Thomas (Boon Thye Thomas)</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>In medical image analysis, registration is necessary to establish spatial correspondences across two or more images. Registration is rarely the end-goal, but instead, the results of image registration are used in other tasks, such as voxel-based morphometry, functional group analysis, image segmentation and tracking. In this thesis, we argue that the quality of image registration should be evaluated in the context of the application. Consequently, we develop a framework for learning registration cost functions optimized for specific tasks. We demonstrate that by taking into account the application, we not only achieve better registration, but also potentially resolve certain ambiguities and ill-posed nature of image registration. We first develop a generative model for joint registration and segmentation of images. By jointly modeling registration and the application of image segmentation, we demonstrate improvements in parcellation of the cerebral cortex into different structural units. In this thesis, we work with spherical representations of the human cerebral cortex. Consequently, we develop a fast algorithm for registering spherical images. Application to the cortex shows that our algorithm achieves state-of-the-art accuracy, while being an order of magnitude faster than competing diffeomorphic, landmark-free algorithms. Finally, we consider the problem of automatically determining the "free" parameters of registration cost functions.</Abstract>
<Abstract>(cont.) Registration is usually formulated as an optimization problem with multiple tunable parameters that are manually set. By introducing a second layer of optimization over and above the usual registration, this thesis provides the first effective approach to optimizing thousands of registration parameters to improve alignment of a new image as measured by an application-specific performance measure. Much previous work has been devoted to developing generic registration algorithms, which are then specialized to particular imaging modalities (e.g., MR), particular imaging targets (e.g., cardiac) and particular post- registration analyses (e.g., segmentation). Our framework provides a principled method for adapting generic algorithms to specific applications. For example, we estimate the optimal weights or cortical folding template of the generic weighted Sum of Squared Differences dissimilarity measure for localizing underlying cytoarchitecture and functional regions of the cerebral cortex. The generality of the framework suggests potential applications to other problems in science and engineering formulated as optimization problems.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>