File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/CVPR.2013.97
- Scopus: eid_2-s2.0-84887399890
- WOS: WOS:000331094300090
- Find via
Supplementary
- Citations:
- Appears in Collections:
Conference Paper: Learning by associating ambiguously labeled images
Title | Learning by associating ambiguously labeled images |
---|---|
Authors | |
Keywords | low rank partial permutation matrix weakly supervised learning |
Issue Date | 2013 |
Citation | Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2013, p. 708-715 How to Cite? |
Abstract | We study in this paper the problem of learning classifiers from ambiguously labeled images. For instance, in the collection of new images, each image contains some samples of interest (ee.g.,human faces), and its associated caption has labels with the true ones included, while the sample-label association is unknown. The task is to learn classifiers from these ambiguously labeled images and generalize to new images. An essential consideration here is how to make use of the information embedded in the relations between samples and labels, both within each image and across the image set. To this end, we propose a novel framework to address this problem. Our framework is motivated by the observation that samples from the same class repetitively appear in the collection of ambiguously labeled training images, while they are just ambiguously labeled in each image. If we can identify samples of the same class from each image and associate them across the image set, the matrix formed by the samples from the same class would be ideally low-rank. By leveraging such a low-rank assumption, we can simultaneously optimize a partial permutation matrix (PPM) for each image, which is formulated in order to exploit all information between samples and labels in a principled way. The obtained PPMs can be readily used to assign labels to samples in training images, and then a standard SVM classifier can be trained and used for unseen data. Experiments on benchmark datasets show the effectiveness of our proposed method. © 2013 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/321538 |
ISSN | 2023 SCImago Journal Rankings: 10.331 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zeng, Zinan | - |
dc.contributor.author | Xiao, Shijie | - |
dc.contributor.author | Jia, Kui | - |
dc.contributor.author | Chan, Tsung Han | - |
dc.contributor.author | Gao, Shenghua | - |
dc.contributor.author | Xu, Dong | - |
dc.contributor.author | Ma, Yi | - |
dc.date.accessioned | 2022-11-03T02:19:37Z | - |
dc.date.available | 2022-11-03T02:19:37Z | - |
dc.date.issued | 2013 | - |
dc.identifier.citation | Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2013, p. 708-715 | - |
dc.identifier.issn | 1063-6919 | - |
dc.identifier.uri | http://hdl.handle.net/10722/321538 | - |
dc.description.abstract | We study in this paper the problem of learning classifiers from ambiguously labeled images. For instance, in the collection of new images, each image contains some samples of interest (ee.g.,human faces), and its associated caption has labels with the true ones included, while the sample-label association is unknown. The task is to learn classifiers from these ambiguously labeled images and generalize to new images. An essential consideration here is how to make use of the information embedded in the relations between samples and labels, both within each image and across the image set. To this end, we propose a novel framework to address this problem. Our framework is motivated by the observation that samples from the same class repetitively appear in the collection of ambiguously labeled training images, while they are just ambiguously labeled in each image. If we can identify samples of the same class from each image and associate them across the image set, the matrix formed by the samples from the same class would be ideally low-rank. By leveraging such a low-rank assumption, we can simultaneously optimize a partial permutation matrix (PPM) for each image, which is formulated in order to exploit all information between samples and labels in a principled way. The obtained PPMs can be readily used to assign labels to samples in training images, and then a standard SVM classifier can be trained and used for unseen data. Experiments on benchmark datasets show the effectiveness of our proposed method. © 2013 IEEE. | - |
dc.language | eng | - |
dc.relation.ispartof | Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition | - |
dc.subject | low rank | - |
dc.subject | partial permutation matrix | - |
dc.subject | weakly supervised learning | - |
dc.title | Learning by associating ambiguously labeled images | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/CVPR.2013.97 | - |
dc.identifier.scopus | eid_2-s2.0-84887399890 | - |
dc.identifier.spage | 708 | - |
dc.identifier.epage | 715 | - |
dc.identifier.isi | WOS:000331094300090 | - |