{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006323466,0.0007504806,0.0008790165,0.001186707,0.0009476385,0.001212673,0.0009876846,0.001080587,0.004619651],"category_scores_gemma":[0.001993178,0.0004369592,0.0008416397,0.001374345,0.000499889,0.001730478,0.000911517,0.0009143985,0.001980787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006813724,"about_ca_system_score_gemma":0.001824952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002570012,"about_ca_topic_score_gemma":0.002097352,"domain_scores_codex":[0.9987936,0.0001213597,0.00006561488,0.000230359,0.0006843324,0.0001047136],"domain_scores_gemma":[0.9994527,0.0001574139,0.00005090163,0.0001105377,0.0002081955,0.00002042841],"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.0003572562,0.0001098166,0.0009602641,0.0001450042,0.0001161633,0.0001300762,0.0001127471,0.0531869,0.04146905,0.03006543,0.004310864,0.8690364],"study_design_scores_gemma":[0.0001394863,0.000203592,0.0006712027,0.00003041628,0.00008684597,0.0007215376,0.00004356137,0.9114079,0.0420985,0.02310093,0.02143434,0.00006161908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00449875,0.0002270647,0.9923236,0.00008518559,0.00007410028,0.00004301404,0.00002315835,0.0005765872,0.002148522],"genre_scores_gemma":[0.1089271,0.000443095,0.8810338,0.0001738725,0.0001554848,0.0002314353,0.0001863552,0.000113579,0.008735208],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004619651,"threshold_uncertainty_score":0.01545429,"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."}}