{"id":"W2110717089","doi":"10.1109/ccece.2008.4564701","title":"Tree structured pursuit for simultaneous image approximation","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Orthonormal basis; Tree (set theory); Haar wavelet; Set (abstract data type); Computer science; Matching pursuit; Wavelet; Artificial intelligence; Maximization; Image (mathematics); Sequence (biology); Approximation algorithm; Tree structure; Mathematics; Pattern recognition (psychology); Mathematical optimization; Wavelet transform; Computer vision; Discrete wavelet transform; Algorithm; Binary tree; Compressed sensing; Combinatorics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001984302,0.0003617782,0.0003749079,0.0004324602,0.0003157611,0.0006928805,0.0008152677,0.0001669554,0.00001070584],"category_scores_gemma":[0.000166465,0.0003545724,0.00007595656,0.0004866592,0.00006277838,0.0005403812,0.00007488211,0.0003514383,0.000007701682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001129539,"about_ca_system_score_gemma":0.0004082031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003451908,"about_ca_topic_score_gemma":0.0001094563,"domain_scores_codex":[0.997898,0.00001389778,0.0003019096,0.0006987266,0.0002924692,0.0007949536],"domain_scores_gemma":[0.9984782,0.0001747235,0.00008199497,0.0001861538,0.0005015657,0.0005773943],"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.00006526324,0.00005723521,0.0001209334,0.0001486472,0.00006836795,0.0001373564,0.001950458,0.0003493268,0.02067265,0.4327692,0.001676021,0.5419845],"study_design_scores_gemma":[0.0005966626,0.0003791847,0.0006347547,0.00004911868,0.000009613554,0.0001693857,0.000006870769,0.9897034,0.002829108,0.004153146,0.001003998,0.0004647746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01522873,0.00005512078,0.9819652,0.0007956258,0.0002054004,0.0004286426,0.000006415997,0.0002457509,0.00106905],"genre_scores_gemma":[0.8416578,0.00002983475,0.1575352,0.0003868602,0.000173416,0.00005141976,0.000006183708,0.00002175809,0.0001375982],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9893541,"threshold_uncertainty_score":0.9998906,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01928399693519086,"score_gpt":0.219391538674267,"score_spread":0.2001075417390761,"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."}}