{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002021352,0.0008446504,0.0006798633,0.00137389,0.0003002975,0.0007812488,0.0007443964,0.0005944315,0.005366013],"category_scores_gemma":[0.001523006,0.0005613148,0.0005735382,0.002140006,0.0005325315,0.001333394,0.001463656,0.001078735,0.001559052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000292536,"about_ca_system_score_gemma":0.000412543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001381495,"about_ca_topic_score_gemma":0.002987146,"domain_scores_codex":[0.999718,0.00002569138,0.00001713069,0.00003623508,0.0001757168,0.0000272493],"domain_scores_gemma":[0.9992679,0.0003096294,0.00005605186,0.0002146649,0.0001142987,0.00003730979],"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.0004259904,0.0001097113,0.0006622878,0.0003054723,0.00004865578,0.0004297879,0.0003045494,0.1060894,0.1132071,0.02625051,0.009462926,0.7427037],"study_design_scores_gemma":[0.00005614041,0.0002652431,0.0008413095,0.0000539997,0.00003621042,0.0009072112,0.0001385289,0.8827952,0.07187423,0.0219841,0.02099178,0.00005605909],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07297706,0.0007948282,0.9156758,0.0002216141,0.0001789656,0.00009987492,0.0003844718,0.002138379,0.007528896],"genre_scores_gemma":[0.2836781,0.001455779,0.6981838,0.0002621088,0.0001832325,0.0001562494,0.001205646,0.0007365096,0.01413861],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005366013,"threshold_uncertainty_score":0.01795113,"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."}}