{"id":"https://openalex.org/W1935827911","doi":"https://doi.org/10.1109/cvpr.2015.7298645","title":"Graph-based simplex method for pairwise energy minimization with binary variables","display_name":"Graph-based simplex method for pairwise energy minimization with binary variables","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W1935827911","doi":"https://doi.org/10.1109/cvpr.2015.7298645","mag":"1935827911"},"language":"en","primary_location":{"id":"doi:10.1109/cvpr.2015.7298645","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2015.7298645","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)","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/A5062954968","display_name":"Daniel Pr\u016f\u0161a","orcid":"https://orcid.org/0000-0003-4866-5709"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Daniel Prusa","raw_affiliation_strings":["Center for Machine Perception, Czech Technical University, Prague, Czech Republic","Center for Machine Perception, Faculty of Electrical Engineering, Czech Technical University, Karlovo n\u00e1m\u011bst\u00ed 13, 121 35 Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Center for Machine Perception, Czech Technical University, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]},{"raw_affiliation_string":"Center for Machine Perception, Faculty of Electrical Engineering, Czech Technical University, Karlovo n\u00e1m\u011bst\u00ed 13, 121 35 Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062954968"],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":0.5523,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.73773073,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"1","issue":null,"first_page":"475","last_page":"483"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11605","display_name":"Visual Attention and Saliency Detection","score":0.996399998664856,"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/T11605","display_name":"Visual Attention and Saliency Detection","score":0.996399998664856,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9790999889373779,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9786999821662903,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/pairwise-comparison","display_name":"Pairwise comparison","score":0.7967271208763123},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.736636757850647},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7329418063163757},{"id":"https://openalex.org/keywords/energy-minimization","display_name":"Energy minimization","score":0.6572544574737549},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6376513242721558},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6324883103370667},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6298937797546387},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.5930379033088684},{"id":"https://openalex.org/keywords/revised-simplex-method","display_name":"Revised simplex method","score":0.581232488155365},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5736508965492249},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5515685081481934},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.515173077583313},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4848412275314331},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4720229506492615},{"id":"https://openalex.org/keywords/energy","display_name":"Energy (signal processing)","score":0.43849778175354004},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2965223789215088},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.29531604051589966},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18385890126228333},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12104228138923645}],"concepts":[{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.7967271208763123},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.736636757850647},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7329418063163757},{"id":"https://openalex.org/C14961307","wikidata":"https://www.wikidata.org/wiki/Q5377176","display_name":"Energy minimization","level":2,"score":0.6572544574737549},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6376513242721558},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6324883103370667},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6298937797546387},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.5930379033088684},{"id":"https://openalex.org/C191157680","wikidata":"https://www.wikidata.org/wiki/Q17085895","display_name":"Revised simplex method","level":4,"score":0.581232488155365},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5736508965492249},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5515685081481934},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.515173077583313},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4848412275314331},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4720229506492615},{"id":"https://openalex.org/C186370098","wikidata":"https://www.wikidata.org/wiki/Q442787","display_name":"Energy (signal processing)","level":2,"score":0.43849778175354004},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2965223789215088},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29531604051589966},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18385890126228333},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12104228138923645},{"id":"https://openalex.org/C147597530","wikidata":"https://www.wikidata.org/wiki/Q369472","display_name":"Computational chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cvpr.2015.7298645","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2015.7298645","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.9100000262260437}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W10769007","https://openalex.org/W1988937492","https://openalex.org/W2029479369","https://openalex.org/W2054867510","https://openalex.org/W2074078071","https://openalex.org/W2082935303","https://openalex.org/W2113137767","https://openalex.org/W2120340025","https://openalex.org/W2135414191","https://openalex.org/W2137117160","https://openalex.org/W2138165282","https://openalex.org/W2140502500","https://openalex.org/W2142406598","https://openalex.org/W2143516773","https://openalex.org/W2144306116","https://openalex.org/W2153396823","https://openalex.org/W2164918853","https://openalex.org/W4293052541","https://openalex.org/W6811808729"],"related_works":["https://openalex.org/W2384679317","https://openalex.org/W1570109187","https://openalex.org/W2911215968","https://openalex.org/W2491692165","https://openalex.org/W2366013513","https://openalex.org/W2371263478","https://openalex.org/W2477407501","https://openalex.org/W2020093019","https://openalex.org/W3125083766","https://openalex.org/W2032433437"],"abstract_inverted_index":{"We":[0,67],"show":[1],"how":[2],"the":[3,10,34,42,48,57],"simplex":[4,58],"algorithm":[5,35],"can":[6],"be":[7],"tailored":[8],"to":[9,40,62,85],"linear":[11],"programming":[12],"relaxation":[13],"of":[14,33],"pairwise":[15],"energy":[16,50,83],"minimization":[17,51,84],"with":[18],"binary":[19,82],"variables.":[20],"A":[21],"special":[22],"structure":[23],"formed":[24],"by":[25],"basic":[26],"and":[27,38],"nonbasic":[28],"variables":[29],"in":[30,89],"each":[31],"stage":[32],"is":[36],"identified":[37],"utilized":[39],"perform":[41],"whole":[43],"iterative":[44],"process":[45],"combinatorially":[46],"over":[47,56],"input":[49],"graph":[52],"rather":[53],"than":[54,79],"algebraically":[55],"tableau.":[59],"This":[60],"leads":[61],"a":[63,90],"new":[64],"efficient":[65],"solver.":[66],"demonstrate":[68],"that":[69],"for":[70],"some":[71],"computer":[72],"vision":[73],"instances":[74],"it":[75],"performs":[76],"even":[77],"better":[78],"methods":[80],"reducing":[81],"finding":[86],"maximum":[87],"flow":[88],"network.":[91]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}