{"id":"W2161252119","doi":"10.1109/icip.2005.1530048","title":"A near minimum sparse pattern coding based scheme for binary image compression","year":2005,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Coding (social sciences); Computer science; Binary number; Image compression; Data compression; Scheme (mathematics); Algorithm; Context-adaptive binary arithmetic coding; Computational complexity theory; Sparse approximation; Neural coding; Image (mathematics); Binary code; Artificial intelligence; Pattern recognition (psychology); Mathematics; Image processing; 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.000358997,0.0003187292,0.0004721745,0.0006566337,0.0003341683,0.0004490408,0.0007514302,0.0006714679,0.001593728],"category_scores_gemma":[0.001445676,0.0001583441,0.0002452109,0.0007773764,0.0004517324,0.001236513,0.0006695578,0.0008425023,0.0005911748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002757054,"about_ca_system_score_gemma":0.000331471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004176365,"about_ca_topic_score_gemma":0.0006160681,"domain_scores_codex":[0.9995697,0.0001112996,0.00002372954,0.00004520304,0.0002249257,0.00002504282],"domain_scores_gemma":[0.9995999,0.00009691067,0.00004266081,0.0001237111,0.000113848,0.00002304387],"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.0005119508,0.0001332106,0.0005026034,0.0002320992,0.00004192429,0.0002415838,0.0001645309,0.04757074,0.1971324,0.07825887,0.005673827,0.6695363],"study_design_scores_gemma":[0.0001078623,0.0004465611,0.0006451176,0.00005070008,0.00003279008,0.001187023,0.00003920673,0.8728775,0.08945826,0.01909997,0.01598902,0.00006591879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01142192,0.0002848811,0.9863517,0.0002294491,0.00008178007,0.00006042778,0.00004304036,0.000225916,0.00130087],"genre_scores_gemma":[0.2111298,0.0004290061,0.7845449,0.0002454914,0.000113347,0.000159659,0.0002191575,0.00004991476,0.003108589],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001593728,"threshold_uncertainty_score":0.005331576,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02626181006219587,"score_gpt":0.2747040050506007,"score_spread":0.2484421949884048,"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."}}