{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/9334"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/9334","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Nonlinear scale space analysis in image processing","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_html":"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_has_math":false,"creators":["Pollak, Ilya"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Alan S. Willsky and Hamid Krim."],"committee_chairs":[],"committee_members":[],"year":1999,"date_issued":"1999","date_published":"1999","updated_at":"2026-07-22T22:21:24Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["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."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/9334","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Alan S. Willsky and Hamid Krim."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Pollak, Ilya"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2005-08-22T20:24:12Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2005-08-22T20:24:12Z"]},{"key":"dc:date.issued","label":"Date","values":["1999"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["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."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/9334"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.","Includes bibliographical references (p. 129-133) and index."]},{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Ph.D."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Nonlinear scale space analysis in image processing"]}]}],"canonical_facts":{"dc:contributor.advisor":["Alan S. Willsky and Hamid Krim."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:creator":["Pollak, Ilya"],"dc:date.accessioned":["2005-08-22T20:24:12Z"],"dc:date.available":["2005-08-22T20:24:12Z"],"dc:date.issued":["1999"],"dc:description":["Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.","Includes bibliographical references (p. 129-133) and index."],"dc:description.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."],"dc:description.degree":["Ph.D."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/1721.1/9334"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["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."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Nonlinear scale space analysis in image processing"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:24Z"}