{"id":"https://openalex.org/W2184697154","doi":null,"title":"SubmodBoxes: near-optimal search for a set of diverse object proposals","display_name":"SubmodBoxes: near-optimal search for a set of diverse object proposals","publication_year":2015,"publication_date":"2015-12-07","ids":{"openalex":"https://openalex.org/W2184697154","mag":"2184697154"},"language":"en","primary_location":{"id":"mag:2184697154","doi":null,"is_oa":false,"landing_page_url":"https://filebox.ece.vt.edu/~dbatra/papers/sb_nips15.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4363606243","display_name":"neural information processing systems","issn_l":"1049-5258","issn":["1049-5258"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-2"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Neural Information Processing Systems","raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101420990","display_name":"Qing Sun","orcid":"https://orcid.org/0009-0005-9647-882X","observed_orcids":["https://orcid.org/0009-0005-9647-882X"]},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Qing Sun","raw_affiliation_strings":["Virginia Tech"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Virginia Tech","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014035752","display_name":"Dhruv Batra","orcid":"https://orcid.org/0000-0002-1358-0011","observed_orcids":["https://orcid.org/0000-0002-1358-0011"]},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dhruv Batra","raw_affiliation_strings":["Virginia Tech"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Virginia Tech","institution_ids":["https://openalex.org/I859038795"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I859038795"],"apc_list":null,"apc_paid":null,"fwci":0.9617,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.78006968,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"28","issue":null,"first_page":"1378","last_page":"1386"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10036","display_name":"Advanced Neural Network Applications","score":0.8041999936103821,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10036","display_name":"Advanced Neural Network Applications","score":0.8041999936103821,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11605","display_name":"Visual Attention and Saliency Detection","score":0.08460000157356262,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.04989999905228615,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/object-proposal-generation","display_name":"object proposal generation","score":0.9800000190734863},{"id":"https://openalex.org/keywords/bounding-boxes","display_name":"bounding boxes","score":0.6700000166893005},{"id":"https://openalex.org/keywords/submodular-maximization","display_name":"submodular maximization","score":0.9210000038146973},{"id":"https://openalex.org/keywords/monotone-submodular-functions","display_name":"monotone submodular functions","score":0.7599999904632568},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.7350000143051147},{"id":"https://openalex.org/keywords/diversity-measures","display_name":"diversity measures","score":0.5350000262260437},{"id":"https://openalex.org/keywords/sliding-window","display_name":"sliding window","score":0.7059999704360962},{"id":"https://openalex.org/keywords/non-maximum-suppression","display_name":"non-maximum suppression","score":0.9139999747276306}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8007247447967529},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.692317008972168},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6041754484176636},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5729561448097229},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5440300703048706},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.5180192589759827},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5039946436882019},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5029460787773132},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.49601301550865173},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49593743681907654},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4881606698036194},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3654976189136505},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3507457971572876},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3479284346103668},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2133011519908905},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2184697154","doi":null,"is_oa":false,"landing_page_url":"https://filebox.ece.vt.edu/~dbatra/papers/sb_nips15.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4363606243","display_name":"neural information processing systems","issn_l":"1049-5258","issn":["1049-5258"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-2"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Neural Information Processing Systems","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W7746136","https://openalex.org/W130067809","https://openalex.org/W639708223","https://openalex.org/W1525954826","https://openalex.org/W1594098193","https://openalex.org/W1680189815","https://openalex.org/W1722931978","https://openalex.org/W1861492603","https://openalex.org/W1898824936","https://openalex.org/W1930392762","https://openalex.org/W1952794764","https://openalex.org/W1954200810","https://openalex.org/W1991367009","https://openalex.org/W2010181071","https://openalex.org/W2017691720","https://openalex.org/W2031248101","https://openalex.org/W2037227137","https://openalex.org/W2061820396","https://openalex.org/W2066624635","https://openalex.org/W2083305840","https://openalex.org/W2088049833","https://openalex.org/W2102605133","https://openalex.org/W2104446196","https://openalex.org/W2105644991","https://openalex.org/W2106874006","https://openalex.org/W2121671791","https://openalex.org/W2130306094","https://openalex.org/W2131824593","https://openalex.org/W2144931885","https://openalex.org/W2144933361","https://openalex.org/W2146861498","https://openalex.org/W2157316274","https://openalex.org/W2158557760","https://openalex.org/W2161969291","https://openalex.org/W2168356304","https://openalex.org/W2179352600","https://openalex.org/W2186094539","https://openalex.org/W2500139799","https://openalex.org/W2952196914","https://openalex.org/W2963542991","https://openalex.org/W3097096317","https://openalex.org/W3118655244"],"related_works":["https://openalex.org/W3017594064","https://openalex.org/W2962889304","https://openalex.org/W2523335270","https://openalex.org/W2605136137","https://openalex.org/W6922331101","https://openalex.org/W7746136","https://openalex.org/W2174127440","https://openalex.org/W1594098193","https://openalex.org/W2016505890","https://openalex.org/W2298648902"],"abstract_inverted_index":{"This":[0],"paper":[1],"formulates":[2],"the":[3,24,35,55,66,94,106],"search":[4],"for":[5,58],"a":[6,18,49,71,85,102,136,144],"set":[7],"of":[8,26,37,81,88],"bounding":[9,29,39],"boxes":[10,30,40],"(as":[11],"needed":[12],"in":[13,31,41],"object":[14,140],"proposal":[15,141],"generation)":[16],"as":[17,70,114,125],"monotone":[19],"submodular":[20,59],"maximization":[21,60],"problem":[22],"over":[23],"space":[25],"all":[27],"possible":[28,38],"an":[32,42],"image.":[33],"Since":[34],"number":[36],"image":[43],"is":[44,61],"very":[45],"large":[46],"O(#pixels2),":[47],"even":[48],"single":[50],"linear":[51],"scan":[52],"to":[53,76,93,105,135],"perform":[54],"greedy":[56,67],"augmentation":[57,68],"intractable.":[62],"Thus,":[63],"we":[64,83,129],"formulate":[65],"step":[69],"Branch-and-Bound":[72],"scheme.":[73],"In":[74],"order":[75],"speed":[77],"up":[78],"repeated":[79],"application":[80],"B&B,":[82],"propose":[84],"novel":[86,145],"generalization":[87],"Minoux's":[89],"'lazy":[90],"greedy'":[91],"algorithm":[92],"B&B":[95],"tree.":[96],"Theoretically,":[97],"our":[98,132],"proposed":[99],"formulation":[100],"provides":[101],"new":[103],"understanding":[104],"problem,":[107],"and":[108,119,120],"contains":[109],"classic":[110],"heuristic":[111],"approaches":[112],"such":[113],"Sliding":[115],"Window+Non-Maximal":[116],"Suppression":[117],"(NMS)":[118],"Efficient":[121],"Subwindow":[122],"Search":[123],"(ESS)":[124],"special":[126],"cases.":[127],"Empirically,":[128],"show":[130],"that":[131],"approach":[133],"leads":[134],"state-of-art":[137],"performance":[138],"on":[139],"generation":[142],"via":[143],"diversity":[146],"measure.":[147]},"counts_by_year":[{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}