{"id":"W2134436132","doi":"10.1109/cvpr.2008.4587464","title":"A Scalable graph-cut algorithm for N-D grids","year":2008,"lang":"en","type":"article","venue":"","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Maxima and minima; Scalability; Speedup; Grid; Algorithm; Computer graphics; Graph; Graphics; Theoretical computer science; Parallel computing; Artificial intelligence; Computer graphics (images); Mathematics","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.0001661468,0.00007516267,0.00009558524,0.00008136278,0.0001198862,0.0000416433,0.0004825496,0.00003974823,0.0001033691],"category_scores_gemma":[0.00003274052,0.00006237184,0.00005759528,0.0002700991,0.00007145637,0.0004135169,0.00008906462,0.00005425503,0.00005199107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001610724,"about_ca_system_score_gemma":0.00004642453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002667957,"about_ca_topic_score_gemma":0.000001258238,"domain_scores_codex":[0.999158,0.00001797497,0.000157089,0.0002370621,0.000228353,0.0002015693],"domain_scores_gemma":[0.9994081,0.00007027456,0.00003203101,0.0002868196,0.00009084915,0.0001119241],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[8.675071e-7,0.00007797249,0.00005601097,0.000007030318,0.000009894988,0.00001625648,0.0001635209,4.10886e-7,0.001110923,0.006016547,0.2190617,0.7734789],"study_design_scores_gemma":[0.001235038,0.0003769653,0.0004263741,0.00001978743,0.000007099452,0.0001679095,0.00003062974,0.1817848,0.7721582,0.02456468,0.01873447,0.000494049],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00008643685,0.00002400223,0.9945338,0.0003970445,0.0001423339,0.0002411202,0.000001793188,0.0006026512,0.003970787],"genre_scores_gemma":[0.0006697424,0.00003243344,0.9926286,0.001995737,0.00005334052,0.00009052484,0.000003292729,0.00000562088,0.004520688],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7729848,"threshold_uncertainty_score":0.254345,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02421634503250038,"score_gpt":0.2826947544486435,"score_spread":0.2584784094161431,"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."}}