{"id":"W1535506841","doi":"10.1007/11559573_69","title":"Compressing 2-D Shapes Using Concavity Trees","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lossless compression; Lossy compression; Silhouette; Computer science; Set (abstract data type); Representation (politics); Image compression; Data compression; Compression (physics); Algorithm; Binary tree; Binary number; Artificial intelligence; Pattern recognition (psychology); Image (mathematics); Mathematics; Image processing; Arithmetic","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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007408136,0.0007275429,0.0007187282,0.0009642018,0.000380744,0.002674086,0.005072782,0.0003646317,0.00001309275],"category_scores_gemma":[0.0001347018,0.0006996627,0.0001665297,0.0006414906,0.001413177,0.002871695,0.00281627,0.0008992694,0.00002516916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005135083,"about_ca_system_score_gemma":0.0007455129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002601501,"about_ca_topic_score_gemma":0.00004878919,"domain_scores_codex":[0.9954056,0.00003405429,0.0006613139,0.001862955,0.001179375,0.000856723],"domain_scores_gemma":[0.9972481,0.0004596517,0.0004667948,0.001256986,0.0003545471,0.00021388],"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.000002498434,0.00003410834,0.00002483188,0.0000313683,0.000007473414,0.00008659728,0.0002498651,0.01342486,0.001386316,0.005729479,0.00001313863,0.9790094],"study_design_scores_gemma":[0.0001602688,0.00007549247,0.00003914987,0.0009368217,0.000009860481,0.0001226846,6.32785e-8,0.8347253,0.008801056,0.1524941,0.001720884,0.0009142575],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009741676,0.001015953,0.9867745,0.0003347993,0.0005587925,0.0002903427,0.000005329226,0.0007889425,0.01013393],"genre_scores_gemma":[0.2157398,0.00001841925,0.7823977,0.00116481,0.0004097385,0.000003854945,0.000002031086,0.00004761151,0.0002160163],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9780952,"threshold_uncertainty_score":0.9995455,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0332014866826259,"score_gpt":0.2870011038123816,"score_spread":0.2537996171297557,"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."}}