{"id":"W2109343068","doi":"10.1109/42.876306","title":"A fast implementation of the minimum spanning tree method for phase unwrapping","year":2000,"lang":"en","type":"letter","venue":"IEEE Transactions on Medical Imaging","topic":"Optical measurement and interference techniques","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Minimum spanning tree; Pixel; Phase (matter); Phase unwrapping; Computer science; Spanning tree; Image processing; Computer vision; Artificial intelligence; Algorithm; Image (mathematics); Optics; Mathematics; Physics; Interferometry; Discrete 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003666706,0.0005487611,0.0004039077,0.0005675848,0.0004857523,0.0004896865,0.0008809776,0.0008575149,0.005469044],"category_scores_gemma":[0.001217525,0.0003327156,0.0003431179,0.0006667494,0.000254617,0.0009137047,0.0004622454,0.0009443468,0.003455487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000260414,"about_ca_system_score_gemma":0.0003966138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000722979,"about_ca_topic_score_gemma":0.001297615,"domain_scores_codex":[0.999651,0.0000604657,0.0000186786,0.00003118908,0.0002154796,0.0000232308],"domain_scores_gemma":[0.9994943,0.0001726143,0.00002893753,0.0000789683,0.0001999676,0.00002515071],"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.0001581283,0.00008330561,0.0002975674,0.0003702251,0.00006215001,0.0006270207,0.0001186678,0.01973128,0.1328929,0.02247816,0.02186387,0.8013166],"study_design_scores_gemma":[0.0001157675,0.0003563234,0.0006984049,0.0001023279,0.00004785739,0.00297132,0.00005929906,0.7699556,0.07854797,0.01734509,0.1297001,0.0001000075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001849955,0.0003460011,0.994591,0.0001793712,0.0001678328,0.00003377541,0.00003408625,0.001020043,0.001778077],"genre_scores_gemma":[0.02881018,0.0005021391,0.9675991,0.00009757534,0.00008713527,0.00009734215,0.0001403207,0.0001071261,0.002559023],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005469044,"threshold_uncertainty_score":0.01829582,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04052629048466741,"score_gpt":0.3668973851913009,"score_spread":0.3263710947066335,"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."}}