{"id":"W1970535101","doi":"10.1007/s00211-013-0569-x","title":"A spatially continuous max-flow and min-cut framework for binary labeling problems","year":2013,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Flow (mathematics); Binary number; A priori and a posteriori; Mathematical optimization; Maximum flow problem; Regular polygon; Convergence (economics); Cut; Minimum cut; Algorithm; Maximum cut; Segmentation; Applied mathematics; Graph; Combinatorics; Computer science; Image segmentation; Artificial intelligence; Geometry","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":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003038003,0.0002427442,0.0003300977,0.00009364813,0.0001316019,0.001148379,0.0007773069,0.0001286271,0.00003162278],"category_scores_gemma":[0.0003379943,0.0002097605,0.00006726648,0.0002192341,0.0000815965,0.001341391,0.0003848037,0.0001651807,0.0001169048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001553737,"about_ca_system_score_gemma":0.00004483583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000162701,"about_ca_topic_score_gemma":9.930749e-7,"domain_scores_codex":[0.9985295,0.00002351844,0.000358744,0.0004733328,0.0002299191,0.0003850002],"domain_scores_gemma":[0.9986578,0.0002386355,0.0002140772,0.000566602,0.000208255,0.0001145808],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001903802,0.0008241729,0.0004381091,0.002395671,0.0001584396,0.0000281072,0.009397068,0.00003519977,0.02915076,0.1388606,0.03081409,0.7878787],"study_design_scores_gemma":[0.000295642,0.0002782783,0.0000374109,0.0006847836,0.00001690213,0.00006584323,0.00006356534,0.1504585,0.01417448,0.8295793,0.003804388,0.0005409635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007559393,0.0004473084,0.9860867,0.001377967,0.00009241657,0.0008947184,0.000004676623,0.0007829412,0.002753913],"genre_scores_gemma":[0.07314377,0.00001157957,0.9252388,0.0003251361,0.0000434151,0.0004909792,0.000002633894,0.000038407,0.000705229],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7873378,"threshold_uncertainty_score":0.9998885,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0179829033841774,"score_gpt":0.2563476440346922,"score_spread":0.2383647406505148,"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."}}