{"id":"W2012632681","doi":"10.1016/j.image.2012.01.020","title":"A family of fast index and redundancy assignments for error resilient multiple description coding","year":2012,"lang":"en","type":"article","venue":"Signal Processing Image Communication","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University; Communications Research Centre Canada","funders":"","keywords":"Decoding methods; Computer science; Binary number; Algorithm; Quantization (signal processing); Redundancy (engineering); Robustness (evolution); Multiple description coding; Theoretical computer science; Mathematics; 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.002189722,0.001339289,0.000865604,0.001352328,0.001148377,0.001060512,0.002017577,0.0009647015,0.003351497],"category_scores_gemma":[0.00657336,0.0004755985,0.0005903381,0.001419722,0.0008423072,0.001944304,0.002434511,0.00175314,0.001156158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008730387,"about_ca_system_score_gemma":0.001372553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001262301,"about_ca_topic_score_gemma":0.001727314,"domain_scores_codex":[0.9984346,0.0004468566,0.00009719036,0.0002138108,0.0006392098,0.000168302],"domain_scores_gemma":[0.9973049,0.001014334,0.000192049,0.000891706,0.0005029728,0.0000940208],"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.0006374965,0.0001600509,0.0003261069,0.0002927176,0.0000605796,0.000167469,0.0001731235,0.09806636,0.02125019,0.1886292,0.01367285,0.6765638],"study_design_scores_gemma":[0.0001196293,0.0003100352,0.0002407915,0.0001104725,0.00005078659,0.000395292,0.00005120932,0.7734894,0.02562387,0.180133,0.0193849,0.00009070998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008387021,0.0007803328,0.986654,0.0001892933,0.0001107296,0.0001286465,0.0001854236,0.0009950544,0.002569502],"genre_scores_gemma":[0.2111531,0.001238639,0.7767998,0.0004772811,0.0001851128,0.0004911243,0.0006057746,0.0003524255,0.008696683],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003351497,"threshold_uncertainty_score":0.01158053,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05354517223124848,"score_gpt":0.32467601010648,"score_spread":0.2711308378752315,"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."}}