{"id":"W2161950782","doi":"10.1109/ccece.2004.1347647","title":"A novel way of lossless compression of digital mammograms using grammar codes","year":2004,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Huffman coding; Lossless compression; Computer science; Data compression; Arithmetic coding; Artificial intelligence; Shannon–Fano coding; Grammar; Tunstall coding; Variable-length code; Algorithm; Context-adaptive binary arithmetic coding; Speech recognition; Theoretical computer science; Decoding methods; Linguistics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"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.000257576,0.0003808291,0.000271384,0.0007358711,0.0002013034,0.0003263994,0.0005838207,0.0004656097,0.001005132],"category_scores_gemma":[0.001514644,0.0001119183,0.0002815623,0.0007258423,0.0004418254,0.0006209976,0.0004629543,0.0004512496,0.0002984329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002426646,"about_ca_system_score_gemma":0.0004591269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001087393,"about_ca_topic_score_gemma":0.0009275621,"domain_scores_codex":[0.9996605,0.00003846881,0.00002039282,0.00004360771,0.000215435,0.00002165919],"domain_scores_gemma":[0.9993681,0.0002300901,0.00005177048,0.0001114408,0.0002180787,0.00002045143],"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.0004061536,0.0001473296,0.001471699,0.0002683485,0.00005843301,0.00148818,0.0004640844,0.05309787,0.3905507,0.02379575,0.004441272,0.5238102],"study_design_scores_gemma":[0.0001052785,0.0004206855,0.001699935,0.00005033911,0.00006536506,0.002883018,0.00007455278,0.5974225,0.3729366,0.006148444,0.01812273,0.00007052554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1025781,0.000518233,0.8910468,0.0003545441,0.0001700664,0.0001374501,0.0002284887,0.002118969,0.002847459],"genre_scores_gemma":[0.4384439,0.0006273616,0.5540888,0.0002726828,0.0001076078,0.0001519378,0.0007305616,0.0002605874,0.00531653],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001087393,"threshold_uncertainty_score":0.003362536,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03239428672204853,"score_gpt":0.2643504340551029,"score_spread":0.2319561473330544,"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."}}