{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005979431,0.0004387826,0.0005552683,0.0002664117,0.000259062,0.0002505165,0.004638502,0.000190233,0.0000979649],"category_scores_gemma":[0.000107882,0.0003681607,0.00009391847,0.0004292412,0.0001871696,0.002742401,0.001126569,0.0002791127,0.000009872186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004368689,"about_ca_system_score_gemma":0.0002861968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002652311,"about_ca_topic_score_gemma":0.000003503524,"domain_scores_codex":[0.9965087,0.0002514361,0.0008084921,0.001318859,0.0006091157,0.0005034212],"domain_scores_gemma":[0.9952193,0.00045831,0.0006752833,0.002799041,0.0006086678,0.0002394293],"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.00007591852,0.000387884,0.000009518967,0.00008631605,0.00001610733,0.000003087845,0.00009655266,0.002422436,0.05658924,0.0009851631,0.01198351,0.9273443],"study_design_scores_gemma":[0.001140387,0.0001551029,0.0001256795,0.0005794561,0.00001823042,0.000002881265,0.00001017252,0.7643564,0.2042221,0.0004481209,0.02858784,0.0003536764],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001954628,0.0003402627,0.9949386,0.0008501898,0.0001999503,0.001198785,0.001705864,0.0004949693,0.00007597101],"genre_scores_gemma":[0.06309972,0.0001101147,0.9336182,0.0002205825,0.0001125469,0.0002391015,0.002393242,0.00003759776,0.0001688218],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9269906,"threshold_uncertainty_score":0.999877,"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."}}