{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006848389,0.0002921815,0.0003744796,0.0002736241,0.0002062351,0.0001098313,0.001306495,0.0002387302,0.0002830967],"category_scores_gemma":[0.0000232966,0.0002200887,0.000374619,0.0003519439,0.0001339003,0.0002982499,0.000007193237,0.001305539,0.000004686317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008903034,"about_ca_system_score_gemma":0.0002330734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006014868,"about_ca_topic_score_gemma":0.00001299164,"domain_scores_codex":[0.9971738,0.0002094488,0.0006251603,0.0005132739,0.001029435,0.0004488187],"domain_scores_gemma":[0.9986104,0.0004178363,0.0002019879,0.0005501105,0.0001282352,0.00009145997],"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":[0.00001168312,0.00009013218,0.000001027553,0.00008810767,0.00006339887,0.000009694104,0.0003329999,0.000009723939,0.002463953,0.00004456751,0.06856424,0.9283205],"study_design_scores_gemma":[0.004911626,0.0008543412,0.000009653949,0.003170288,0.0005443695,0.00009141467,0.0004115147,0.3282102,0.4681278,0.002285747,0.1899832,0.001399764],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"commentary","genre_scores_codex":[0.00002068726,0.00002405421,0.7933294,0.2047122,0.000672353,0.0004814483,0.00002248668,0.0001418394,0.0005955239],"genre_scores_gemma":[0.1050688,0.0001252645,0.2796942,0.6107913,0.002098699,0.001122897,0.00003767604,0.0001702065,0.0008909675],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9269207,"threshold_uncertainty_score":0.8974957,"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."}}