{"id":"W2097098226","doi":"10.1186/1687-6180-2013-155","title":"Deterministic construction of Fourier-based compressed sensing matrices using an almost difference set","year":2013,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compressed sensing; Block matrix; DFT matrix; Matrix (chemical analysis); Algorithm; Concatenation (mathematics); Fast Fourier transform; Discrete Fourier transform (general); Fourier transform; Mathematics; Sparse matrix; Single-entry matrix; Integer matrix; Row; Computer science; Combinatorics; Symmetric matrix; Short-time Fourier transform; Fourier analysis; Square matrix; Mathematical analysis; Nonnegative matrix; Physics","routes":{"ca_aff":true,"ca_fund":true,"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.0009577027,0.0005917256,0.0005243991,0.000779007,0.0004020068,0.0007191484,0.0008464939,0.0005855165,0.001904977],"category_scores_gemma":[0.003560005,0.0003461851,0.0006433017,0.0006650945,0.001016584,0.001212071,0.00121218,0.001133395,0.000508966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005304546,"about_ca_system_score_gemma":0.0006738275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005263554,"about_ca_topic_score_gemma":0.0005206267,"domain_scores_codex":[0.9987928,0.0003170768,0.00006364333,0.0002221464,0.0005379099,0.00006637333],"domain_scores_gemma":[0.9985296,0.0007231981,0.0001562892,0.0002790524,0.000257872,0.00005402281],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001853866,0.00009177327,0.0006393587,0.0002015289,0.00005523113,0.0002212642,0.0002323152,0.1919418,0.04050424,0.6089562,0.002360575,0.1546104],"study_design_scores_gemma":[0.00002215189,0.0001749066,0.0002155261,0.00002295557,0.00001220266,0.0003337993,0.00003071233,0.9205124,0.01417108,0.05841687,0.006046071,0.00004133545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006106422,0.00008558924,0.9921364,0.00007446399,0.00003434536,0.00002467374,0.00003849808,0.00007268778,0.001426999],"genre_scores_gemma":[0.2790604,0.000433934,0.7167882,0.0002228877,0.0001254927,0.0001962279,0.0003260953,0.00007561763,0.002771209],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001904977,"threshold_uncertainty_score":0.00637275,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02972731232095498,"score_gpt":0.2877581266520866,"score_spread":0.2580308143311316,"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."}}