{"id":"W4245251483","doi":"10.32920/ryerson.14657334.v1","title":"Variable Length K-SVD: A New Dictionary Learning Approach and Multi-Stage OMP Method for Sparse Representation","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Machine Learning and ELM","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Matching pursuit; Sparse approximation; K-SVD; Computer science; Dictionary learning; Pattern recognition (psychology); Artificial intelligence; Representation (politics); Set (abstract data type); Discrete cosine transform; Singular value decomposition; Matching (statistics); Algorithm; Mathematics; Image (mathematics); Compressed sensing","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007188353,0.0008608556,0.00108596,0.001049889,0.0004268264,0.001166407,0.001279834,0.001264819,0.002792913],"category_scores_gemma":[0.001625065,0.000424804,0.0009056536,0.001695172,0.0007448146,0.001822982,0.001316457,0.002181967,0.002224971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003502342,"about_ca_system_score_gemma":0.0007638893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00111289,"about_ca_topic_score_gemma":0.001424805,"domain_scores_codex":[0.9992096,0.0001577095,0.00005027466,0.0001796275,0.0003500506,0.00005259376],"domain_scores_gemma":[0.9993512,0.0001801103,0.00007359341,0.00009876263,0.000255639,0.00004066836],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002729904,0.0001353239,0.0007774336,0.000742194,0.0001781676,0.0003177462,0.0001609297,0.08584177,0.07497484,0.05643629,0.01754377,0.7626186],"study_design_scores_gemma":[0.00003464398,0.0002088053,0.0005482755,0.00006455777,0.00004110976,0.0007156554,0.00004740047,0.9129339,0.02448034,0.01672709,0.04411801,0.00008018745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001125098,0.000739546,0.996847,0.0001273258,0.0001277243,0.000025205,0.00006287645,0.0002223474,0.0007228699],"genre_scores_gemma":[0.03696411,0.00287975,0.9512644,0.0002045941,0.0003579087,0.0001155039,0.0005551025,0.0002077225,0.007451005],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002792913,"threshold_uncertainty_score":0.009343266,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08513676587764696,"score_gpt":0.3569399542030978,"score_spread":0.2718031883254508,"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."}}