{"id":"W2128936061","doi":"10.1109/icpr.1992.202081","title":"An optimal algorithm for detecting straight lines in chain codes","year":2003,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Simple (philosophy); Task (project management); Computer science; Pixel; Algorithm; Chain (unit); SIMPLE algorithm; Artificial intelligence; Engineering","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.0004229741,0.0001063909,0.0001128111,0.0001147733,0.00005464454,0.000458553,0.0005042041,0.00004384536,0.000004606882],"category_scores_gemma":[0.00009899942,0.00009588943,0.0000274231,0.0002657174,0.00002706185,0.001361535,0.00004850445,0.00006201341,0.000001667484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002024169,"about_ca_system_score_gemma":0.00004939054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005068363,"about_ca_topic_score_gemma":0.00001316984,"domain_scores_codex":[0.999133,0.00002533062,0.0001742485,0.00031335,0.0001004653,0.0002536012],"domain_scores_gemma":[0.9995011,0.00006761785,0.00004229086,0.000254497,0.00008118146,0.00005330427],"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.000001030892,0.00008205289,0.00002876177,0.000009275981,0.000001930858,0.000006133532,0.000140532,0.00003685888,0.001811073,0.009781311,0.0000885443,0.9880125],"study_design_scores_gemma":[0.0001702842,0.00014703,0.00002111285,0.00002023148,8.810134e-7,0.00001677296,0.00003660819,0.6624306,0.324127,0.01193071,0.0009077277,0.0001910627],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001544312,0.00004364227,0.9927418,0.00009547413,0.00004979009,0.0001533561,0.000001446737,0.0005710988,0.004799093],"genre_scores_gemma":[0.1548225,9.591154e-7,0.8447566,0.0001726131,0.00001730191,0.0000349815,7.697304e-7,0.000008861181,0.0001854359],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9878215,"threshold_uncertainty_score":0.4421837,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02199845669990743,"score_gpt":0.2996762361821774,"score_spread":0.27767777948227,"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."}}