{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002777411,0.001401014,0.002126666,0.001971542,0.001172152,0.003123127,0.003956554,0.002478929,0.005816187],"category_scores_gemma":[0.00671725,0.001232498,0.001486212,0.002823123,0.002210673,0.004392322,0.003190094,0.004877423,0.0008030388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002850943,"about_ca_system_score_gemma":0.002257224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00512432,"about_ca_topic_score_gemma":0.004708127,"domain_scores_codex":[0.9987491,0.0005374988,0.0000457288,0.0002564467,0.000305725,0.0001054209],"domain_scores_gemma":[0.9976266,0.001411744,0.0001957261,0.000223632,0.0003195801,0.0002227219],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009643904,0.00009980874,0.0002481004,0.0002414824,0.00003707328,0.00009137642,0.0001467572,0.3328704,0.001664463,0.5998646,0.00578332,0.05885611],"study_design_scores_gemma":[0.00001623298,0.00002962927,0.00009090773,0.00002995018,0.00001540768,0.00003341334,0.0000218855,0.7234898,0.0003887586,0.2719347,0.003933737,0.00001554502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002622475,0.0004971644,0.9942446,0.0003379306,0.00003862253,0.00003073511,0.00009474922,0.00009893864,0.00203474],"genre_scores_gemma":[0.1443282,0.00176459,0.8406357,0.000336964,0.000416165,0.0003880196,0.0004989626,0.0003818852,0.01124948],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005816187,"threshold_uncertainty_score":0.0206852,"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."}}