{"id":"https://openalex.org/W2533218643","doi":"https://doi.org/10.1109/iccv.2009.5459262","title":"Image segmentation with a bounding box prior","display_name":"Image segmentation with a bounding box prior","publication_year":2009,"publication_date":"2009-09-01","ids":{"openalex":"https://openalex.org/W2533218643","doi":"https://doi.org/10.1109/iccv.2009.5459262","mag":"2533218643"},"language":"en","primary_location":{"id":"doi:10.1109/iccv.2009.5459262","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccv.2009.5459262","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE 12th International Conference on Computer Vision","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"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/A5083458209","display_name":"Victor Lempitsky","orcid":"https://orcid.org/0000-0003-4118-710X"},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Victor Lempitsky","raw_affiliation_strings":["Microsoft Research Cambridge, UK"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Cambridge, UK","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013834379","display_name":"Pushmeet Kohli","orcid":"https://orcid.org/0000-0002-7466-7997"},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Pushmeet Kohli","raw_affiliation_strings":["Microsoft Research Cambridge, UK"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Cambridge, UK","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102921586","display_name":"Carsten Rother","orcid":null},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Carsten Rother","raw_affiliation_strings":["Microsoft Research Cambridge, UK"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Cambridge, UK","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042656810","display_name":"Toby Sharp","orcid":null},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Toby Sharp","raw_affiliation_strings":["Microsoft Research Cambridge, UK"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Cambridge, UK","institution_ids":["https://openalex.org/I4210164937"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5083458209"],"corresponding_institution_ids":["https://openalex.org/I4210164937"],"apc_list":null,"apc_paid":null,"fwci":20.9955,"has_fulltext":false,"cited_by_count":400,"citation_normalized_percentile":{"value":0.99566828,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"277","last_page":"284"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10036","display_name":"Advanced Neural Network Applications","score":0.9997000098228455,"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.9997000098228455,"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/T10052","display_name":"Medical Image Segmentation Techniques","score":0.9994999766349792,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-bounding-box","display_name":"Minimum bounding box","score":0.8675811290740967},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.8669538497924805},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7000141739845276},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.6961510181427002},{"id":"https://openalex.org/keywords/thresholding","display_name":"Thresholding","score":0.6060941815376282},{"id":"https://openalex.org/keywords/segmentation","display_name":"Segmentation","score":0.553159236907959},{"id":"https://openalex.org/keywords/image-segmentation","display_name":"Image segmentation","score":0.5342005491256714},{"id":"https://openalex.org/keywords/cut","display_name":"Cut","score":0.49085932970046997},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4876500368118286},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4868306517601013},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.44810619950294495},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4255516231060028},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.412596732378006},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37827831506729126},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.37131205201148987},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.3514227867126465},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3205593228340149},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21449050307273865}],"concepts":[{"id":"https://openalex.org/C147037132","wikidata":"https://www.wikidata.org/wiki/Q6865426","display_name":"Minimum bounding box","level":3,"score":0.8675811290740967},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.8669538497924805},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7000141739845276},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.6961510181427002},{"id":"https://openalex.org/C191178318","wikidata":"https://www.wikidata.org/wiki/Q2256906","display_name":"Thresholding","level":3,"score":0.6060941815376282},{"id":"https://openalex.org/C89600930","wikidata":"https://www.wikidata.org/wiki/Q1423946","display_name":"Segmentation","level":2,"score":0.553159236907959},{"id":"https://openalex.org/C124504099","wikidata":"https://www.wikidata.org/wiki/Q56933","display_name":"Image segmentation","level":3,"score":0.5342005491256714},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.49085932970046997},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4876500368118286},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4868306517601013},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.44810619950294495},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4255516231060028},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.412596732378006},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37827831506729126},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.37131205201148987},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.3514227867126465},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3205593228340149},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21449050307273865},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/iccv.2009.5459262","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccv.2009.5459262","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE 12th International Conference on Computer Vision","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.162.1602","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.162.1602","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/~victlem/iccv2009.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.162.64","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.162.64","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/~victlem/iccv2009TR.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.212.2171","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.212.2171","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/~pkohli/papers/lkrs_iccv09_TR.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.8899999856948853}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W79315950","https://openalex.org/W1516029338","https://openalex.org/W1582660705","https://openalex.org/W1785730614","https://openalex.org/W2038495454","https://openalex.org/W2053913299","https://openalex.org/W2102691397","https://openalex.org/W2113137767","https://openalex.org/W2120804060","https://openalex.org/W2124351162","https://openalex.org/W2134820502","https://openalex.org/W2147899407","https://openalex.org/W2169551590","https://openalex.org/W2533218643","https://openalex.org/W6630946317","https://openalex.org/W6634826441","https://openalex.org/W6638212498","https://openalex.org/W6675664397"],"related_works":["https://openalex.org/W4237171675","https://openalex.org/W3036286480","https://openalex.org/W4287027631","https://openalex.org/W3192357901","https://openalex.org/W2387360586","https://openalex.org/W2952736415","https://openalex.org/W4243797343","https://openalex.org/W3209723314","https://openalex.org/W3205398323","https://openalex.org/W2883297582"],"abstract_inverted_index":{"User-provided":[0],"object":[1],"bounding":[2,27,50],"box":[3,28,51,74],"is":[4,85,139],"a":[5,58,79,116,130,147,157],"simple":[6],"and":[7,36,69,161,172],"popular":[8],"interaction":[9],"paradigm":[10],"considered":[11],"by":[12],"many":[13],"existing":[14],"interactive":[15],"image":[16],"segmentation":[17,77],"frameworks.":[18],"However,":[19],"these":[20],"frameworks":[21],"tend":[22],"to":[23,30,38,56,98],"exploit":[24],"the":[25,40,49,64,72,76,92,106,134,153,163,167],"provided":[26],"merely":[29],"exclude":[31],"its":[32],"exterior":[33],"from":[34,66],"consideration":[35],"sometimes":[37],"initialize":[39],"energy":[41,94],"minimization.":[42],"In":[43],"this":[44],"paper,":[45],"we":[46],"discuss":[47],"how":[48],"can":[52,125],"be":[53,126],"further":[54],"used":[55,127],"impose":[57],"powerful":[59],"topological":[60],"prior,":[61],"which":[62,138],"prevents":[63],"solution":[65],"excessive":[67],"shrinking":[68],"ensures":[70],"that":[71],"user-provided":[73],"bounds":[75],"in":[78],"sufficiently":[80],"tight":[81],"way.":[82],"The":[83,123],"prior":[84,169],"expressed":[86],"using":[87],"hard":[88],"constraints":[89],"incorporated":[90],"into":[91],"global":[93],"minimization":[95],"framework":[96],"leading":[97],"an":[99],"NP-hard":[100],"integer":[101],"program.":[102],"We":[103,151],"then":[104],"investigate":[105],"possible":[107],"optimization":[108],"strategies":[109],"including":[110],"linear":[111],"relaxation":[112],"as":[113,115,129,146],"well":[114],"new":[117,168],"graph":[118],"cut":[119],"algorithm":[120],"called":[121],"pinpointing.":[122],"latter":[124],"either":[128],"rounding":[131],"method":[132],"for":[133],"fractional":[135],"LP":[136],"solution,":[137],"provably":[140],"better":[141],"than":[142],"thresholding-based":[143],"rounding,":[144],"or":[145],"fast":[148],"standalone":[149],"heuristic.":[150],"evaluate":[152],"proposed":[154],"algorithms":[155],"on":[156],"publicly":[158],"available":[159],"dataset,":[160],"demonstrate":[162],"practical":[164],"benefits":[165],"of":[166],"both":[170],"qualitatively":[171],"quantitatively.":[173]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":16},{"year":2023,"cited_by_count":21},{"year":2022,"cited_by_count":25},{"year":2021,"cited_by_count":23},{"year":2020,"cited_by_count":23},{"year":2019,"cited_by_count":24},{"year":2018,"cited_by_count":23},{"year":2017,"cited_by_count":24},{"year":2016,"cited_by_count":27},{"year":2015,"cited_by_count":46},{"year":2014,"cited_by_count":33},{"year":2013,"cited_by_count":39},{"year":2012,"cited_by_count":21}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}