{"id":"W2168632843","doi":"10.1109/dcc.2005.4","title":"A Fast Trellis-Based Rate-Allocation Algorithm for Robust Transmission of Progressively Coded Images over Noisy Channels","year":2005,"lang":"en","type":"article","venue":"Data Compression Conference","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Trellis (graph); Algorithm; Set partitioning in hierarchical trees; Computer science; Viterbi algorithm; Transmission (telecommunications); Channel (broadcasting); Soft output Viterbi algorithm; Binary search algorithm; Set (abstract data type); Decoding methods; Search algorithm; Image compression; Image (mathematics); Image processing; Artificial intelligence; Telecommunications; Sequential decoding; Block code","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.001104396,0.0006677983,0.0006881931,0.000855802,0.0005118079,0.0007864768,0.001042257,0.0008878515,0.005599263],"category_scores_gemma":[0.002732158,0.0003945583,0.0004227413,0.0008214614,0.0006113307,0.0008645905,0.0006064114,0.001107168,0.002276561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007953725,"about_ca_system_score_gemma":0.0008603378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001694499,"about_ca_topic_score_gemma":0.002839338,"domain_scores_codex":[0.9994239,0.0001401066,0.00004592623,0.00008691876,0.0002536859,0.00004958928],"domain_scores_gemma":[0.9988772,0.0005095392,0.0001179899,0.0001332849,0.0003293361,0.00003257056],"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.0007821474,0.0000853103,0.0004017954,0.0003398914,0.0001359456,0.0002693986,0.0002320222,0.1705533,0.1374161,0.03458597,0.01415974,0.6410383],"study_design_scores_gemma":[0.0001058117,0.0002690595,0.0003327944,0.00004370732,0.00005130358,0.0005124604,0.00001873319,0.9309249,0.05079124,0.006741253,0.01012621,0.00008254193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004917925,0.0005492323,0.9923471,0.00009197739,0.00008171547,0.00006804702,0.00005066856,0.0008417222,0.001051601],"genre_scores_gemma":[0.1213766,0.0006466672,0.8713208,0.0001233891,0.0001605702,0.0002690183,0.0003537878,0.0001915094,0.005557705],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005599263,"threshold_uncertainty_score":0.01873142,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06167895276373782,"score_gpt":0.3254128228690572,"score_spread":0.2637338701053193,"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."}}