2026-09-23T00:20:16Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/93342022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
Alan S. Willsky and Hamid Krim.
Pollak, Ilya
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2005-08-22T20:24:12Z
2005-08-22T20:24:12Z
1999
1999
http://hdl.handle.net/1721.1/9334
44264167
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.
Includes bibliographical references (p. 129-133) and index.
The objective of this work is to develop and analyze robust and fast image segmentation algorithms. They must be robust to pervasive, large-amplitude noise, which cannot be well characterized in terms of probabilistic distributions. This is because the applications of interest include synthetic aperture radar (SAR) segmentation in which speckle noise is a well-known problem that has defeated many algorithms. The methods must also be robust to blur, because many imaging techniques result in smoothed images. For example, SAR image formation has a natural blur associated with it, due to the finite aperture used in forming the image. We introduce a family of first-order multi-dimensional ordinary differential equations with discontinuous right-hand sides and demonstrate their applicability to segmenting both scalar-valued and vector-valued images, as well as images taking values on a circle. An equation belonging to this family is an inverse diffusion everywhere except at local extrema, where some stabilization is introduced. For this reason, we call these equations "stabilized inverse diffusion equations" ( "SIDEs" ). Existence and uniqueness of solutions, as well as stability, are proven for SIDEs. A SIDE in one spatial dimension may be interpreted as a limiting case of a semi-discretized Perona-Malik equation [49,50], which, in turn, was proposed in order to overcome certain shortcomings of Gaussian scale spaces [72]. These existing techniques are reviewed in a background chapter. SIDEs are then described and experimentally shown to suppress noise while sharpening edges present in the input image. Their application to the detection of abrupt changes in 1-D signals is also demonstrated. It is shown that a version of the SIDEs optimally solves certain change detection problems. Its relations to the Mumford-Shah functional [44] and to linear programming are discussed. Theoretical performance analysis is carried out, and a fast implementation of the algorithm is described.
by Ilya Pollak.
Ph.D.
136 p.
9905488 bytes
9905244 bytes
application/pdf
application/pdf
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.
Nonlinear scale space analysis in image processing
Nonlinear scale-space analysis in image processing
Thesis
application/pdf
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="5d24503a-9b4c-408e-b427-e9b38f9ed0ca">
<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>Nonlinear scale space analysis in image processing</Title>
<Subtitle>Nonlinear scale-space analysis in image processing</Subtitle>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>1999</PublicationDate>
<Authors>
<Author>
<DisplayName>Pollak, Ilya</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>The objective of this work is to develop and analyze robust and fast image segmentation algorithms. They must be robust to pervasive, large-amplitude noise, which cannot be well characterized in terms of probabilistic distributions. This is because the applications of interest include synthetic aperture radar (SAR) segmentation in which speckle noise is a well-known problem that has defeated many algorithms. The methods must also be robust to blur, because many imaging techniques result in smoothed images. For example, SAR image formation has a natural blur associated with it, due to the finite aperture used in forming the image. We introduce a family of first-order multi-dimensional ordinary differential equations with discontinuous right-hand sides and demonstrate their applicability to segmenting both scalar-valued and vector-valued images, as well as images taking values on a circle. An equation belonging to this family is an inverse diffusion everywhere except at local extrema, where some stabilization is introduced. For this reason, we call these equations "stabilized inverse diffusion equations" ( "SIDEs" ). Existence and uniqueness of solutions, as well as stability, are proven for SIDEs. A SIDE in one spatial dimension may be interpreted as a limiting case of a semi-discretized Perona-Malik equation [49,50], which, in turn, was proposed in order to overcome certain shortcomings of Gaussian scale spaces [72]. These existing techniques are reviewed in a background chapter. SIDEs are then described and experimentally shown to suppress noise while sharpening edges present in the input image. Their application to the detection of abrupt changes in 1-D signals is also demonstrated. It is shown that a version of the SIDEs optimally solves certain change detection problems. Its relations to the Mumford-Shah functional [44] and to linear programming are discussed. Theoretical performance analysis is carried out, and a fast implementation of the algorithm is described.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>