Robust learning and segmentation for secure understanding
Name
62277937-MIT.pdf
Description
Full printable version
Size
2.04 MB
Format
Adobe PDF
Checksum (MD5)
82d607f7bf38f54ee2495250b0a435d0
Author(s)
Martin, Ian Stefan
Advisor(s)
Tomaso Poggio.
Date Issued
2005
Publisher
Massachusetts Institute of Technology
Abstract
This thesis demonstrates methods useful in learning to understand images from only a few examples, but they are by no means limited to this application. Boosting techniques are popular because they learn effective classification functions and identify the most relevant features at the same time. However, in general, they overfit and perform poorly on data sets that contain many features, but few examples. A novel stochastic regularization technique is presented, based on enhancing data sets with corrupted copies of the examples to produce a more robust classifier. This regularization technique enables the gentle boosting algorithm to work well with only a few examples. It is tested on a variety of data sets from various domains, including object recognition and bioinformatics, with convincing results. In the second part of this work, a novel technique for extracting texture edges is introduced, based on the combination of a patch-based approach, and non-param8tric tests of distributions. This technique can reliably detect texture edges using only local information, making it a useful preprocessing step prior to segmentation. Combined with a parametric deformable model, this technique provides smooth boundaries and globally salient structures.
Description
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (p. 85-91).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
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.
Persistent DSpace Link
