Learning task-specific similarity
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2006. === Includes bibliographical references (p. 139-147). === The right measure of similarity between examples is important in many areas of computer science. In particular it is...
Main Author: | |
---|---|
Other Authors: | |
Format: | Others |
Language: | English |
Published: |
Massachusetts Institute of Technology
2007
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/36138 |
id |
ndltd-MIT-oai-dspace.mit.edu-1721.1-36138 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-MIT-oai-dspace.mit.edu-1721.1-361382019-05-02T16:24:09Z Learning task-specific similarity Shakhnarovich, Gregory Trevor J. Darrell. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2006. Includes bibliographical references (p. 139-147). The right measure of similarity between examples is important in many areas of computer science. In particular it is a critical component in example-based learning methods. Similarity is commonly defined in terms of a conventional distance function, but such a definition does not necessarily capture the inherent meaning of similarity, which tends to depend on the underlying task. We develop an algorithmic approach to learning similarity from examples of what objects are deemed similar according to the task-specific notion of similarity at hand, as well as optional negative examples. Our learning algorithm constructs, in a greedy fashion, an encoding of the data. This encoding can be seen as an embedding into a space, where a weighted Hamming distance is correlated with the unknown similarity. This allows us to predict when two previously unseen examples are similar and, importantly, to efficiently search a very large database for examples similar to a query. This approach is tested on a set of standard machine learning benchmark problems. The model of similarity learned with our algorithm provides and improvement over standard example-based classification and regression. We also apply this framework to problems in computer vision: articulated pose estimation of humans from single images, articulated tracking in video, and matching image regions subject to generic visual similarity. by Gregory Shakhnarovich. Ph.D. 2007-02-21T11:38:24Z 2007-02-21T11:38:24Z 2005 2006 Thesis http://hdl.handle.net/1721.1/36138 72694007 eng 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 147 p. application/pdf Massachusetts Institute of Technology |
collection |
NDLTD |
language |
English |
format |
Others
|
sources |
NDLTD |
topic |
Electrical Engineering and Computer Science. |
spellingShingle |
Electrical Engineering and Computer Science. Shakhnarovich, Gregory Learning task-specific similarity |
description |
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2006. === Includes bibliographical references (p. 139-147). === The right measure of similarity between examples is important in many areas of computer science. In particular it is a critical component in example-based learning methods. Similarity is commonly defined in terms of a conventional distance function, but such a definition does not necessarily capture the inherent meaning of similarity, which tends to depend on the underlying task. We develop an algorithmic approach to learning similarity from examples of what objects are deemed similar according to the task-specific notion of similarity at hand, as well as optional negative examples. Our learning algorithm constructs, in a greedy fashion, an encoding of the data. This encoding can be seen as an embedding into a space, where a weighted Hamming distance is correlated with the unknown similarity. This allows us to predict when two previously unseen examples are similar and, importantly, to efficiently search a very large database for examples similar to a query. This approach is tested on a set of standard machine learning benchmark problems. The model of similarity learned with our algorithm provides and improvement over standard example-based classification and regression. We also apply this framework to problems in computer vision: articulated pose estimation of humans from single images, articulated tracking in video, and matching image regions subject to generic visual similarity. === by Gregory Shakhnarovich. === Ph.D. |
author2 |
Trevor J. Darrell. |
author_facet |
Trevor J. Darrell. Shakhnarovich, Gregory |
author |
Shakhnarovich, Gregory |
author_sort |
Shakhnarovich, Gregory |
title |
Learning task-specific similarity |
title_short |
Learning task-specific similarity |
title_full |
Learning task-specific similarity |
title_fullStr |
Learning task-specific similarity |
title_full_unstemmed |
Learning task-specific similarity |
title_sort |
learning task-specific similarity |
publisher |
Massachusetts Institute of Technology |
publishDate |
2007 |
url |
http://hdl.handle.net/1721.1/36138 |
work_keys_str_mv |
AT shakhnarovichgregory learningtaskspecificsimilarity |
_version_ |
1719039857545707520 |