Loading…
Multi-Class Active Learning by Uncertainty Sampling with Diversity Maximization
As a way to relieve the tedious work of manual annotation, active learning plays important roles in many applications of visual concept recognition. In typical active learning scenarios, the number of labelled data in the seed set is usually small. However, most existing active learning algorithms o...
Saved in:
Published in: | International journal of computer vision 2015-06, Vol.113 (2), p.113-127 |
---|---|
Main Authors: | , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c422t-8683f2743c2bf57cba719b672ec74db5654a145fa1286a81ea37ee868d6b6b453 |
---|---|
cites | cdi_FETCH-LOGICAL-c422t-8683f2743c2bf57cba719b672ec74db5654a145fa1286a81ea37ee868d6b6b453 |
container_end_page | 127 |
container_issue | 2 |
container_start_page | 113 |
container_title | International journal of computer vision |
container_volume | 113 |
creator | Yang, Yi Ma, Zhigang Nie, Feiping Chang, Xiaojun Hauptmann, Alexander G. |
description | As a way to relieve the tedious work of manual annotation, active learning plays important roles in many applications of visual concept recognition. In typical active learning scenarios, the number of labelled data in the seed set is usually small. However, most existing active learning algorithms only exploit the labelled data, which often suffers from over-fitting due to the small number of labelled examples. Besides, while much progress has been made in binary class active learning, little research attention has been focused on multi-class active learning. In this paper, we propose a semi-supervised batch mode multi-class active learning algorithm for visual concept recognition. Our algorithm exploits the whole active pool to evaluate the uncertainty of the data. Considering that uncertain data are always similar to each other, we propose to make the selected data as diverse as possible, for which we explicitly impose a diversity constraint on the objective function. As a multi-class active learning algorithm, our algorithm is able to exploit uncertainty across multiple classes. An efficient algorithm is used to optimize the objective function. Extensive experiments on action recognition, object classification, scene recognition, and event detection demonstrate its advantages. |
doi_str_mv | 10.1007/s11263-014-0781-x |
format | article |
fullrecord | <record><control><sourceid>gale_proqu</sourceid><recordid>TN_cdi_proquest_journals_1680923760</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A435335027</galeid><sourcerecordid>A435335027</sourcerecordid><originalsourceid>FETCH-LOGICAL-c422t-8683f2743c2bf57cba719b672ec74db5654a145fa1286a81ea37ee868d6b6b453</originalsourceid><addsrcrecordid>eNp1kUtLAzEYRYMoWB8_wN2AKxepeWe6LPVVqAjWrkMmzdTITKYmqbb-elPGhS4kiw8u53xJuABcYDTECMnriDERFCLMIJIlhtsDMMBcUogZ4odggEYEQS5G-BicxPiGECIloQPw9LhpkoOTRsdYjE1yH7aYWR2886ui2hULb2xI2vm0K-a6XTf7_NOl1-ImoyG6nD_qrWvdl06u82fgqNZNtOc_8xQs7m5fJg9w9nQ_nYxn0DBCEixFSWsiGTWkqrk0lZZ4VAlJrJFsWXHBmcaM1xqTUugSW02ltdlaikpUjNNTcNnvXYfufWNjUm_dJvh8pcKizL-lUqBMDXtqpRurnK-7FLTJZ2lbZzpva5fzMaOcUo6IzMLVHyEzyW7TSm9iVNP5818W96wJXYzB1modXKvDTmGk9qWovhSVS1H7UtQ2O6R3Ymb9yoZfz_5X-gbxM45B</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1680923760</pqid></control><display><type>article</type><title>Multi-Class Active Learning by Uncertainty Sampling with Diversity Maximization</title><source>ABI/INFORM Global</source><source>Springer Nature:Jisc Collections:Springer Nature Read and Publish 2023-2025: Springer Reading List</source><creator>Yang, Yi ; Ma, Zhigang ; Nie, Feiping ; Chang, Xiaojun ; Hauptmann, Alexander G.</creator><creatorcontrib>Yang, Yi ; Ma, Zhigang ; Nie, Feiping ; Chang, Xiaojun ; Hauptmann, Alexander G.</creatorcontrib><description>As a way to relieve the tedious work of manual annotation, active learning plays important roles in many applications of visual concept recognition. In typical active learning scenarios, the number of labelled data in the seed set is usually small. However, most existing active learning algorithms only exploit the labelled data, which often suffers from over-fitting due to the small number of labelled examples. Besides, while much progress has been made in binary class active learning, little research attention has been focused on multi-class active learning. In this paper, we propose a semi-supervised batch mode multi-class active learning algorithm for visual concept recognition. Our algorithm exploits the whole active pool to evaluate the uncertainty of the data. Considering that uncertain data are always similar to each other, we propose to make the selected data as diverse as possible, for which we explicitly impose a diversity constraint on the objective function. As a multi-class active learning algorithm, our algorithm is able to exploit uncertainty across multiple classes. An efficient algorithm is used to optimize the objective function. Extensive experiments on action recognition, object classification, scene recognition, and event detection demonstrate its advantages.</description><identifier>ISSN: 0920-5691</identifier><identifier>EISSN: 1573-1405</identifier><identifier>DOI: 10.1007/s11263-014-0781-x</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Active learning ; Algorithms ; Analysis ; Artificial Intelligence ; Computer Imaging ; Computer Science ; Data mining ; Exploitation ; Image Processing and Computer Vision ; Labeling ; Optimization algorithms ; Pattern Recognition ; Pattern Recognition and Graphics ; Studies ; Vision ; Vision systems</subject><ispartof>International journal of computer vision, 2015-06, Vol.113 (2), p.113-127</ispartof><rights>Springer Science+Business Media New York 2014</rights><rights>COPYRIGHT 2015 Springer</rights><rights>Springer Science+Business Media New York 2015</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c422t-8683f2743c2bf57cba719b672ec74db5654a145fa1286a81ea37ee868d6b6b453</citedby><cites>FETCH-LOGICAL-c422t-8683f2743c2bf57cba719b672ec74db5654a145fa1286a81ea37ee868d6b6b453</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/1680923760/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/1680923760?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,780,784,11688,27924,27925,36060,44363,74895</link.rule.ids></links><search><creatorcontrib>Yang, Yi</creatorcontrib><creatorcontrib>Ma, Zhigang</creatorcontrib><creatorcontrib>Nie, Feiping</creatorcontrib><creatorcontrib>Chang, Xiaojun</creatorcontrib><creatorcontrib>Hauptmann, Alexander G.</creatorcontrib><title>Multi-Class Active Learning by Uncertainty Sampling with Diversity Maximization</title><title>International journal of computer vision</title><addtitle>Int J Comput Vis</addtitle><description>As a way to relieve the tedious work of manual annotation, active learning plays important roles in many applications of visual concept recognition. In typical active learning scenarios, the number of labelled data in the seed set is usually small. However, most existing active learning algorithms only exploit the labelled data, which often suffers from over-fitting due to the small number of labelled examples. Besides, while much progress has been made in binary class active learning, little research attention has been focused on multi-class active learning. In this paper, we propose a semi-supervised batch mode multi-class active learning algorithm for visual concept recognition. Our algorithm exploits the whole active pool to evaluate the uncertainty of the data. Considering that uncertain data are always similar to each other, we propose to make the selected data as diverse as possible, for which we explicitly impose a diversity constraint on the objective function. As a multi-class active learning algorithm, our algorithm is able to exploit uncertainty across multiple classes. An efficient algorithm is used to optimize the objective function. Extensive experiments on action recognition, object classification, scene recognition, and event detection demonstrate its advantages.</description><subject>Active learning</subject><subject>Algorithms</subject><subject>Analysis</subject><subject>Artificial Intelligence</subject><subject>Computer Imaging</subject><subject>Computer Science</subject><subject>Data mining</subject><subject>Exploitation</subject><subject>Image Processing and Computer Vision</subject><subject>Labeling</subject><subject>Optimization algorithms</subject><subject>Pattern Recognition</subject><subject>Pattern Recognition and Graphics</subject><subject>Studies</subject><subject>Vision</subject><subject>Vision systems</subject><issn>0920-5691</issn><issn>1573-1405</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>M0C</sourceid><recordid>eNp1kUtLAzEYRYMoWB8_wN2AKxepeWe6LPVVqAjWrkMmzdTITKYmqbb-elPGhS4kiw8u53xJuABcYDTECMnriDERFCLMIJIlhtsDMMBcUogZ4odggEYEQS5G-BicxPiGECIloQPw9LhpkoOTRsdYjE1yH7aYWR2886ui2hULb2xI2vm0K-a6XTf7_NOl1-ImoyG6nD_qrWvdl06u82fgqNZNtOc_8xQs7m5fJg9w9nQ_nYxn0DBCEixFSWsiGTWkqrk0lZZ4VAlJrJFsWXHBmcaM1xqTUugSW02ltdlaikpUjNNTcNnvXYfufWNjUm_dJvh8pcKizL-lUqBMDXtqpRurnK-7FLTJZ2lbZzpva5fzMaOcUo6IzMLVHyEzyW7TSm9iVNP5818W96wJXYzB1modXKvDTmGk9qWovhSVS1H7UtQ2O6R3Ymb9yoZfz_5X-gbxM45B</recordid><startdate>20150601</startdate><enddate>20150601</enddate><creator>Yang, Yi</creator><creator>Ma, Zhigang</creator><creator>Nie, Feiping</creator><creator>Chang, Xiaojun</creator><creator>Hauptmann, Alexander G.</creator><general>Springer US</general><general>Springer</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>ISR</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PYYUZ</scope><scope>Q9U</scope></search><sort><creationdate>20150601</creationdate><title>Multi-Class Active Learning by Uncertainty Sampling with Diversity Maximization</title><author>Yang, Yi ; Ma, Zhigang ; Nie, Feiping ; Chang, Xiaojun ; Hauptmann, Alexander G.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c422t-8683f2743c2bf57cba719b672ec74db5654a145fa1286a81ea37ee868d6b6b453</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Active learning</topic><topic>Algorithms</topic><topic>Analysis</topic><topic>Artificial Intelligence</topic><topic>Computer Imaging</topic><topic>Computer Science</topic><topic>Data mining</topic><topic>Exploitation</topic><topic>Image Processing and Computer Vision</topic><topic>Labeling</topic><topic>Optimization algorithms</topic><topic>Pattern Recognition</topic><topic>Pattern Recognition and Graphics</topic><topic>Studies</topic><topic>Vision</topic><topic>Vision systems</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yang, Yi</creatorcontrib><creatorcontrib>Ma, Zhigang</creatorcontrib><creatorcontrib>Nie, Feiping</creatorcontrib><creatorcontrib>Chang, Xiaojun</creatorcontrib><creatorcontrib>Hauptmann, Alexander G.</creatorcontrib><collection>CrossRef</collection><collection>Gale In Context: Science</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><jtitle>International journal of computer vision</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yang, Yi</au><au>Ma, Zhigang</au><au>Nie, Feiping</au><au>Chang, Xiaojun</au><au>Hauptmann, Alexander G.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Multi-Class Active Learning by Uncertainty Sampling with Diversity Maximization</atitle><jtitle>International journal of computer vision</jtitle><stitle>Int J Comput Vis</stitle><date>2015-06-01</date><risdate>2015</risdate><volume>113</volume><issue>2</issue><spage>113</spage><epage>127</epage><pages>113-127</pages><issn>0920-5691</issn><eissn>1573-1405</eissn><abstract>As a way to relieve the tedious work of manual annotation, active learning plays important roles in many applications of visual concept recognition. In typical active learning scenarios, the number of labelled data in the seed set is usually small. However, most existing active learning algorithms only exploit the labelled data, which often suffers from over-fitting due to the small number of labelled examples. Besides, while much progress has been made in binary class active learning, little research attention has been focused on multi-class active learning. In this paper, we propose a semi-supervised batch mode multi-class active learning algorithm for visual concept recognition. Our algorithm exploits the whole active pool to evaluate the uncertainty of the data. Considering that uncertain data are always similar to each other, we propose to make the selected data as diverse as possible, for which we explicitly impose a diversity constraint on the objective function. As a multi-class active learning algorithm, our algorithm is able to exploit uncertainty across multiple classes. An efficient algorithm is used to optimize the objective function. Extensive experiments on action recognition, object classification, scene recognition, and event detection demonstrate its advantages.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11263-014-0781-x</doi><tpages>15</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0920-5691 |
ispartof | International journal of computer vision, 2015-06, Vol.113 (2), p.113-127 |
issn | 0920-5691 1573-1405 |
language | eng |
recordid | cdi_proquest_journals_1680923760 |
source | ABI/INFORM Global; Springer Nature:Jisc Collections:Springer Nature Read and Publish 2023-2025: Springer Reading List |
subjects | Active learning Algorithms Analysis Artificial Intelligence Computer Imaging Computer Science Data mining Exploitation Image Processing and Computer Vision Labeling Optimization algorithms Pattern Recognition Pattern Recognition and Graphics Studies Vision Vision systems |
title | Multi-Class Active Learning by Uncertainty Sampling with Diversity Maximization |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T14%3A46%3A50IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Multi-Class%20Active%20Learning%20by%20Uncertainty%20Sampling%20with%20Diversity%20Maximization&rft.jtitle=International%20journal%20of%20computer%20vision&rft.au=Yang,%20Yi&rft.date=2015-06-01&rft.volume=113&rft.issue=2&rft.spage=113&rft.epage=127&rft.pages=113-127&rft.issn=0920-5691&rft.eissn=1573-1405&rft_id=info:doi/10.1007/s11263-014-0781-x&rft_dat=%3Cgale_proqu%3EA435335027%3C/gale_proqu%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c422t-8683f2743c2bf57cba719b672ec74db5654a145fa1286a81ea37ee868d6b6b453%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1680923760&rft_id=info:pmid/&rft_galeid=A435335027&rfr_iscdi=true |