{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006184187,0.00009593605,0.0001395832,0.000125289,0.0001331271,0.0001169811,0.0002813203,0.00003169155,0.0001059636],"category_scores_gemma":[0.00002431536,0.00009086596,0.00007136435,0.0002816883,0.00002631138,0.0005754352,0.00002620367,0.00004190314,0.000008159447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004727993,"about_ca_system_score_gemma":0.0000378222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004800672,"about_ca_topic_score_gemma":0.00000750792,"domain_scores_codex":[0.9988463,0.00007960424,0.0003717604,0.0001974441,0.0002804839,0.0002244048],"domain_scores_gemma":[0.9992775,0.0002247992,0.0001215881,0.000143421,0.0001896864,0.00004298125],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000094351,0.0002733214,0.0001476295,0.0002842361,0.0000782782,0.000004634054,0.02146469,0.07419609,0.3427248,0.2666968,0.002934379,0.2911008],"study_design_scores_gemma":[0.002022478,0.0002075338,0.0004523154,0.00001966631,0.00001083515,0.000005885923,0.0003087175,0.8500452,0.1449243,0.001481704,0.0003534345,0.0001678986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05115816,0.00001474322,0.947033,0.0004088041,0.0002284569,0.0004083127,0.00001918412,0.00005678046,0.0006725284],"genre_scores_gemma":[0.7183702,0.000002698491,0.2812935,0.0001733015,0.00003024458,0.00001960046,0.00001673595,0.000004982865,0.00008879318],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7758491,"threshold_uncertainty_score":0.3705406,"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."}}