{"id":"W3009926847","doi":"10.1109/access.2020.2990155","title":"Maximum Feasible Subsystem Algorithms for Recovery of Compressively Sensed Speech","year":2020,"lang":"en","type":"preprint","venue":"IEEE Access","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compressed sensing; Computer science; Signal recovery; SIGNAL (programming language); Speech recognition; TIMIT; Algorithm; Compression (physics); Quality (philosophy); Hidden Markov model","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.0009186342,0.000980464,0.0005377464,0.0005550319,0.0003189599,0.0005512547,0.0007318126,0.0007772971,0.002835892],"category_scores_gemma":[0.003804946,0.0003445134,0.0004299601,0.0006843337,0.0008268306,0.001185071,0.001159725,0.001128457,0.0006507746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003808799,"about_ca_system_score_gemma":0.0007335757,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001451407,"about_ca_topic_score_gemma":0.002355274,"domain_scores_codex":[0.9995791,0.0001620692,0.00002549749,0.00005077421,0.0001555477,0.00002697122],"domain_scores_gemma":[0.9989754,0.0006395432,0.0001096944,0.0001176838,0.0001254944,0.00003223727],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000337658,0.0000773889,0.0004140534,0.0002979273,0.00005199788,0.0001271183,0.0003131797,0.5041808,0.03438799,0.08113715,0.003532534,0.3751422],"study_design_scores_gemma":[0.0000152808,0.00007258234,0.0001195679,0.00001588635,0.000005448521,0.0000598085,0.00003048392,0.9784597,0.006608112,0.01255149,0.002049201,0.00001240342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004179251,0.0001002481,0.9948305,0.00007235619,0.000008083005,0.00002327609,0.00001751068,0.0001269491,0.0006417866],"genre_scores_gemma":[0.1617641,0.0003927931,0.8338875,0.00007474476,0.00004050446,0.0001671052,0.0001991423,0.0001075593,0.003366639],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002835892,"threshold_uncertainty_score":0.009487033,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1070657736775267,"score_gpt":0.3230070308887786,"score_spread":0.2159412572112519,"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."}}