{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000581497,0.000753253,0.001161607,0.001157765,0.0004157259,0.0009851158,0.001361685,0.000881439,0.003135407],"category_scores_gemma":[0.00122957,0.0005113751,0.0008364195,0.001363672,0.0003852564,0.001488976,0.001027953,0.001155195,0.001108296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008622063,"about_ca_system_score_gemma":0.001247252,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004474149,"about_ca_topic_score_gemma":0.005594154,"domain_scores_codex":[0.9994704,0.00007657534,0.00001820375,0.0001255039,0.0002551226,0.0000542155],"domain_scores_gemma":[0.9995323,0.0001564284,0.00005201016,0.00008075259,0.0001472352,0.00003129537],"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.00009876793,0.00008944033,0.0004307492,0.00007698336,0.00005795436,0.00006463685,0.00007009208,0.326091,0.02156084,0.0195209,0.00440492,0.6275338],"study_design_scores_gemma":[0.000008989764,0.00002525484,0.00009755185,0.00000427388,0.000007407003,0.00004375881,0.00001160878,0.9867787,0.00472581,0.006676177,0.001610851,0.000009566497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002299081,0.00004223915,0.9961609,0.00002576913,0.00001176164,0.00001711825,0.00002997487,0.0005587329,0.0008545071],"genre_scores_gemma":[0.08755328,0.000126394,0.9096805,0.00008909326,0.00003755127,0.00009124068,0.0002041665,0.0003293132,0.00188844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004474149,"threshold_uncertainty_score":0.01048899,"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."}}