{"id":"W2149320434","doi":"10.1109/mwscas.1995.510187","title":"A window-sequence coding transformation suitable for computationally-efficient bit-serial implementation of stack filters","year":2002,"lang":"en","type":"article","venue":"","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Algorithm; Binary number; Window (computing); Stack (abstract data type); Binary tree; Computational complexity theory; Coding (social sciences); Data compression; Pixel; Filter (signal processing); Transformation (genetics); Mathematics; Artificial intelligence; Computer vision; Arithmetic","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.0002563657,0.0004791182,0.0003343742,0.0005557095,0.0002055322,0.0004037759,0.0003779803,0.0003151808,0.002286439],"category_scores_gemma":[0.0009451876,0.0001604555,0.0003298032,0.0008296394,0.000290056,0.0005445451,0.0002299323,0.0005916252,0.0008805581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002619055,"about_ca_system_score_gemma":0.0006214627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009920459,"about_ca_topic_score_gemma":0.001341279,"domain_scores_codex":[0.999849,0.00002177369,0.00001362469,0.00002117026,0.0000767536,0.00001770276],"domain_scores_gemma":[0.9997283,0.00007672699,0.00002984914,0.00005666657,0.00009585562,0.00001271598],"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.0002986795,0.00007262918,0.0005542105,0.0001782691,0.00003352417,0.0002639442,0.0001294804,0.03381445,0.3742435,0.06385108,0.004234455,0.5223258],"study_design_scores_gemma":[0.00005470358,0.0003152678,0.0009042814,0.00003601868,0.0000429883,0.0008917544,0.00003176061,0.6823324,0.2838579,0.007851308,0.02363765,0.0000440593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007023063,0.00007527199,0.9914315,0.00002662671,0.000043875,0.0000578471,0.00003847448,0.0004265594,0.0008766439],"genre_scores_gemma":[0.1075411,0.0002708548,0.8894987,0.00005367676,0.00005633931,0.0002153797,0.000241874,0.0001056959,0.002016304],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002286439,"threshold_uncertainty_score":0.007648885,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06778550920019694,"score_gpt":0.3334298825703825,"score_spread":0.2656443733701856,"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."}}