{"id":"W2755962443","doi":"10.1109/icip.2017.8296526","title":"A two-stage minimum spanning tree (MST) based clustering algorithm for 2D deformable registration of time sequenced images","year":2017,"lang":"en","type":"article","venue":"","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Minimum spanning tree; Spanning tree; Artificial intelligence; Image registration; Similarity (geometry); Computer vision; Distortion (music); Cluster analysis; Computer science; Sequence (biology); Image (mathematics); Tree (set theory); Pattern recognition (psychology); Algorithm; Mathematics; Combinatorics","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.001142682,0.001090448,0.001058919,0.001752687,0.001047162,0.0006849875,0.001594227,0.001584393,0.002202158],"category_scores_gemma":[0.002491368,0.0008746265,0.001741966,0.001907174,0.0005924858,0.001440788,0.001137446,0.001488859,0.001573403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008259963,"about_ca_system_score_gemma":0.001511277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005075241,"about_ca_topic_score_gemma":0.008400354,"domain_scores_codex":[0.9990547,0.0001646947,0.00008889877,0.000280941,0.0003571609,0.00005365044],"domain_scores_gemma":[0.9992096,0.000209778,0.0001254736,0.0001292856,0.0002804304,0.00004539096],"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.0001603827,0.000116354,0.0009301447,0.0002448606,0.0001972051,0.0001766205,0.0003819447,0.2639407,0.07585461,0.01096156,0.006876281,0.6401592],"study_design_scores_gemma":[0.00001548724,0.00007542024,0.0004702306,0.00001683749,0.00003061777,0.0002237829,0.0000320028,0.9719533,0.0158623,0.005270024,0.005996167,0.00005389367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002121025,0.00005592967,0.9968461,0.00003493663,0.00001593954,0.00003981465,0.00003186622,0.0006690366,0.0001852623],"genre_scores_gemma":[0.02671271,0.00009727892,0.971662,0.00003770984,0.00001372705,0.0001351246,0.0002641931,0.0002289953,0.0008481797],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005075241,"threshold_uncertainty_score":0.01009142,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03140793188984856,"score_gpt":0.3253633132593516,"score_spread":0.2939553813695031,"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."}}