{"id":"W2963561047","doi":"10.1016/j.acha.2016.03.008","title":"Convex Optimization approach to signals with fast varying instantaneous frequency","year":2016,"lang":"en","type":"article","venue":"Applied and Computational Harmonic Analysis","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"Électricité de France","keywords":"Representation (politics); Time–frequency representation; Thresholding; Time–frequency analysis; Convex optimization; Algorithm; Computer science; SIGNAL (programming language); Harmonic; Mathematical optimization; Regular polygon; Ideal (ethics); Signal processing; Mathematics; Artificial intelligence; Digital signal processing; Acoustics; Telecommunications","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.0002909471,0.0001855365,0.0003114211,0.0003554564,0.0002142461,0.0001868438,0.0003475059,0.00004668954,0.00002499313],"category_scores_gemma":[0.00000948961,0.0001253474,0.00006979328,0.001464319,0.00006382251,0.0002334264,0.00009915778,0.00006583085,0.00001319512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004592349,"about_ca_system_score_gemma":0.00007919917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000138191,"about_ca_topic_score_gemma":5.693321e-7,"domain_scores_codex":[0.9984303,0.000072072,0.0002686171,0.000577952,0.0004028362,0.0002482618],"domain_scores_gemma":[0.9990879,0.0002544121,0.0001106184,0.000241417,0.0001552741,0.0001504049],"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.00004784099,0.0000758054,0.0001397281,0.000009102643,0.000541651,0.00001654356,0.000476395,0.8820898,0.002152225,0.06925278,0.00002481886,0.04517333],"study_design_scores_gemma":[0.001057684,0.00008641984,0.0007360829,0.0000176237,0.0003022232,0.00004501958,0.00004414346,0.9836287,0.0005898663,0.01304098,0.00002449539,0.0004267462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004096129,0.00006275493,0.989403,0.0003912983,0.00001445618,0.0001550932,0.000005303028,0.00009571643,0.005776226],"genre_scores_gemma":[0.5458279,0.000005620332,0.4536221,0.0004382023,0.00001511192,0.00001777034,0.000009954347,0.000006458117,0.00005691316],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5417318,"threshold_uncertainty_score":0.5111519,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01458388980574625,"score_gpt":0.2333666473638517,"score_spread":0.2187827575581054,"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."}}