{"id":"W2146514308","doi":"10.1109/icassp.2010.5495190","title":"An efficient tree-structured codebook design for embedded vector quantization","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Codebook; Vector quantization; Linde–Buzo–Gray algorithm; Computer science; Speech coding; Quantization (signal processing); Algorithm; Tree (set theory); Scalability; Speech recognition; Theoretical computer science; Mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.0002778546,0.0001321666,0.0001297629,0.00008866545,0.0001119775,0.0001375684,0.0009351706,0.00007604288,0.00002768777],"category_scores_gemma":[0.00009848692,0.000105195,0.0000348608,0.0001410631,0.00003199697,0.000475413,0.0001102761,0.0001115058,0.000006419789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001212486,"about_ca_system_score_gemma":0.00005861622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003517213,"about_ca_topic_score_gemma":0.00001858423,"domain_scores_codex":[0.9989471,0.00006557163,0.0001863746,0.0004183171,0.0001815698,0.0002010109],"domain_scores_gemma":[0.9986069,0.0001629555,0.00008817585,0.0009149048,0.0001285407,0.00009855201],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002153217,0.00007007165,0.000006509472,0.000004923058,0.000003068893,8.825837e-7,0.0001969264,0.003108512,0.5980848,0.3648555,0.002062402,0.03158483],"study_design_scores_gemma":[0.0001746598,0.00008820544,0.0001206709,0.000003357475,0.000001541456,0.000003081644,0.000003485575,0.5882381,0.4010845,0.008640893,0.001521218,0.0001203267],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001865073,0.000004048537,0.9958364,0.0001308613,0.0003276493,0.0006206777,0.000007853147,0.0009865345,0.0002208387],"genre_scores_gemma":[0.3272642,5.098763e-7,0.6723401,0.0002178958,0.00002407422,0.00005985998,0.00001495717,0.00001013098,0.00006825473],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5851296,"threshold_uncertainty_score":0.4289727,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02204714625483273,"score_gpt":0.3081096134178049,"score_spread":0.2860624671629721,"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."}}