{"id":"W2102151593","doi":"10.1109/cvpr.2006.251","title":"Region-Tree Based Stereo Using Dynamic Programming Optimization","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scan line; Artificial intelligence; Dynamic programming; Tree (set theory); Adjacency list; Benchmark (surveying); Minimum spanning tree; Spanning tree; Graph; Pixel; Tree structure; Computer vision; Algorithm; Pattern recognition (psychology); Theoretical computer science; Mathematics; Geography; Binary tree","routes":{"ca_aff":true,"ca_fund":true,"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.00007110614,0.00008713585,0.00007200439,0.00009967767,0.0001138359,0.0001719676,0.0002236635,0.00002128511,0.000008813365],"category_scores_gemma":[0.00001474688,0.00007839152,0.00003368642,0.0003402541,0.00001881504,0.0005942255,0.00005227892,0.00004785776,0.000005129007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004942032,"about_ca_system_score_gemma":0.00003756257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002322101,"about_ca_topic_score_gemma":0.000008478174,"domain_scores_codex":[0.9992452,0.00002809565,0.0001474311,0.0002471597,0.0001384621,0.0001935998],"domain_scores_gemma":[0.9995347,0.00002592656,0.00006226974,0.0002860177,0.0000560207,0.0000350226],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002098256,0.00007247323,0.001047298,0.00001019533,0.000002079569,0.00002038717,0.00002516863,0.5951239,0.0004967253,0.01414447,0.00005833125,0.3889968],"study_design_scores_gemma":[0.000201735,0.00001032216,0.0000990268,0.00001933155,0.000001496222,0.000008799999,0.00001323777,0.9975456,0.0003993096,0.0004191639,0.001169991,0.0001119714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003828834,0.00003106176,0.9962156,0.0002147703,0.00009678956,0.0001020217,5.861967e-8,0.0002904603,0.002666393],"genre_scores_gemma":[0.253104,5.343556e-7,0.7465144,0.0001316848,0.000009990072,0.000001905362,0.000001711655,0.000006362349,0.0002294081],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4024217,"threshold_uncertainty_score":0.3196714,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01539783865266012,"score_gpt":0.2701525401106041,"score_spread":0.2547547014579439,"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."}}