{"id":"W3032691033","doi":"10.1109/tip.2020.2995056","title":"An ILP Model for Multi-Label MRFs With Connectivity Constraints","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Integer programming; Prior probability; Linear programming; Computer science; Markov random field; Cutting-plane method; Mathematical optimization; Markov chain; Segmentation; Pascal (unit); Artificial intelligence; Algorithm; Image segmentation; Mathematics; Machine learning; Bayesian probability","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001306262,0.0002310351,0.0002268816,0.00008048092,0.0004126288,0.0002911184,0.0004531656,0.0000690668,0.000004194346],"category_scores_gemma":[0.00001737056,0.0002069082,0.00005680283,0.0004061683,0.000194455,0.002650204,0.000002575034,0.0002733506,0.000004795682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004262759,"about_ca_system_score_gemma":0.0001967231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002174252,"about_ca_topic_score_gemma":0.000004468638,"domain_scores_codex":[0.9986172,0.00003070877,0.0002072095,0.0006189233,0.0002028301,0.0003231231],"domain_scores_gemma":[0.9990745,0.00005746381,0.0001025096,0.0002849782,0.0002810966,0.0001994091],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001424442,0.0004146878,0.000002232421,0.0001255809,0.00001706213,0.00001173901,0.001395721,0.003506797,0.09160008,0.000106694,0.00001853052,0.9026584],"study_design_scores_gemma":[0.0007358441,0.0003079229,0.000001554625,0.00004033981,0.00001404469,0.00001041338,0.00004477464,0.689844,0.3084883,0.0002952989,0.00001155106,0.0002060204],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008123403,0.00003084002,0.9971572,0.0005375145,0.00004140368,0.000455352,0.00003319724,0.0008735101,0.0000586225],"genre_scores_gemma":[0.4814722,0.000004773292,0.5178354,0.0005788885,0.00001584887,0.000054908,6.98877e-7,0.00001842306,0.00001880302],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9024524,"threshold_uncertainty_score":0.8437473,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07521069551906115,"score_gpt":0.3430743059022073,"score_spread":0.2678636103831461,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}