{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009787169,0.0006057246,0.0006339641,0.0006012804,0.0002523195,0.0007433469,0.0006194412,0.0007488503,0.001764051],"category_scores_gemma":[0.002633466,0.0003259995,0.000641886,0.001261065,0.0006495744,0.0008810062,0.001261471,0.001516471,0.0008560206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000502478,"about_ca_system_score_gemma":0.0005715523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001084418,"about_ca_topic_score_gemma":0.0009735925,"domain_scores_codex":[0.9993481,0.0002179899,0.00002586248,0.0001005754,0.0002655807,0.00004193313],"domain_scores_gemma":[0.9994616,0.0003065421,0.00004333638,0.0000686866,0.00009330978,0.00002649739],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001616727,0.00004897063,0.0003640822,0.0002341562,0.00008159628,0.0001446916,0.000175997,0.3516869,0.02627546,0.3718171,0.004016003,0.2449935],"study_design_scores_gemma":[0.000006711383,0.00003360787,0.00005718042,0.00000872886,0.000005553346,0.00003968178,0.000006645268,0.9619425,0.00131724,0.03380843,0.002767146,0.000006595579],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001200906,0.0001286711,0.9980233,0.00003834995,0.00001480938,0.000007874975,0.00001330163,0.00005501434,0.0005178429],"genre_scores_gemma":[0.1281895,0.001184793,0.864994,0.0001081528,0.0001266488,0.0001870888,0.0002184126,0.0001085452,0.004882825],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001764051,"threshold_uncertainty_score":0.005901337,"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."}}