{"id":"W2642600425","doi":"10.23977/cpcs.2016.11003","title":"Parallel Matched Filtering Algorithm with Low Complexity","year":2016,"lang":"en","type":"article","venue":"Computing Performance and Communication systems","topic":"Video Coding and Compression Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Algorithm; Computational complexity theory; Block (permutation group theory); Computer science; Filter (signal processing); Discrete Fourier transform (general); Fast Fourier transform; Cooley–Tukey FFT algorithm; Current (fluid); Fourier transform; Mathematics; Short-time Fourier transform; Fourier analysis; Computer vision; Engineering","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003620533,0.0001618268,0.0002283068,0.00009413208,0.0004852633,0.0002343209,0.001337992,0.00006253146,0.000001482682],"category_scores_gemma":[0.000009193514,0.0001007391,0.00002269307,0.000224054,0.0001723356,0.0004641619,0.0008579312,0.000134185,0.00002267481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003159965,"about_ca_system_score_gemma":0.00002399905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002484313,"about_ca_topic_score_gemma":0.000001199245,"domain_scores_codex":[0.9988632,0.00009561471,0.0002889256,0.0002963059,0.0001995584,0.0002564467],"domain_scores_gemma":[0.9981924,0.0001366439,0.0002030197,0.001304001,0.0001054397,0.00005848631],"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.00001400628,0.00005501615,0.00751545,0.000116461,0.0000296395,0.000002395641,0.0008590575,0.0006456911,0.0006116522,0.0207128,0.0005654369,0.9688724],"study_design_scores_gemma":[0.001320872,0.0002257766,0.01934294,0.002475472,0.000006851509,0.0001877364,0.0003747586,0.9687272,0.001767594,0.0008823419,0.004086985,0.0006014894],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2231015,0.0005530202,0.7742308,0.0007233419,0.00009907737,0.0001371377,9.254893e-7,0.0006743383,0.0004798141],"genre_scores_gemma":[0.9108473,0.0003450504,0.0885514,0.00004667757,0.00002140509,0.00002132892,0.000001302508,0.000008420961,0.0001571245],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9682709,"threshold_uncertainty_score":0.4108023,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03568547939035854,"score_gpt":0.2493188993824006,"score_spread":0.2136334199920421,"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."}}