{"id":"W1552086630","doi":"10.1109/iscas.2003.1205832","title":"An efficient interleaved tree-structured almost-perfect reconstruction filterbank","year":2003,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Filter bank; Interleaving; Algorithm; Computer science; Finite impulse response; Bandwidth (computing); Rendering (computer graphics); Multiplier (economics); Digital filter; Filter (signal processing); Tree (set theory); Low-pass filter; Mathematics; Telecommunications; Artificial intelligence; Computer vision","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.0001946226,0.0001577629,0.0001256118,0.0001265281,0.00009047827,0.000408504,0.000401275,0.00004222681,0.0001945164],"category_scores_gemma":[0.00002500024,0.0001352639,0.00006193275,0.0002965427,0.00003135826,0.0009088715,0.00003311595,0.00006995635,0.0000776971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005685446,"about_ca_system_score_gemma":0.00004149182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009666599,"about_ca_topic_score_gemma":0.00001374327,"domain_scores_codex":[0.9987155,0.000126127,0.0002643346,0.0004227494,0.000199223,0.0002721071],"domain_scores_gemma":[0.9992157,0.00003090664,0.00007076583,0.0004937003,0.00006526409,0.0001236604],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002178367,0.0001638478,0.0007129803,0.00001262499,0.00003622496,0.0000113651,0.001247977,0.0003326448,0.04813786,0.2138117,0.00267763,0.7328334],"study_design_scores_gemma":[0.002892573,0.001796545,0.006233748,0.00004680657,0.00002510349,0.0007179079,0.0008576897,0.2843855,0.6676506,0.02408143,0.009973318,0.001338799],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1202581,0.000009914927,0.8335741,0.00007828845,0.0009214053,0.0002250257,0.00000323735,0.0002627922,0.0446671],"genre_scores_gemma":[0.934445,9.915949e-7,0.06456731,0.0004932961,0.00002818351,0.00001143541,0.00001102812,0.000009096768,0.0004336569],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8141869,"threshold_uncertainty_score":0.5515901,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01756568490517528,"score_gpt":0.2560307380929843,"score_spread":0.238465053187809,"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."}}