{"id":"W1973919754","doi":"10.1109/tcsvt.2011.2133930","title":"An Efficient Algorithm for Focus Measure Computation in Constant Time","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems for Video Technology","topic":"Image Processing Techniques and Applications","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Computation; Focus (optics); Measure (data warehouse); Algorithm; Computer science; Orientation (vector space); Filter (signal processing); Linear filter; Computer vision; Constant (computer programming); Artificial intelligence; Image processing; Mathematics; Image (mathematics); Geometry; Optics; Data mining","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.0005531036,0.001137705,0.000784614,0.00160191,0.0008289354,0.001132892,0.001457105,0.0009529419,0.009514807],"category_scores_gemma":[0.002179309,0.0004814686,0.0006937357,0.0008506184,0.0004869537,0.00160627,0.001637091,0.001250963,0.005105723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009436196,"about_ca_system_score_gemma":0.001172018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002601189,"about_ca_topic_score_gemma":0.002874448,"domain_scores_codex":[0.9992611,0.00005575607,0.00004810967,0.0001601089,0.0003992902,0.00007561167],"domain_scores_gemma":[0.9993232,0.0002037274,0.00004729507,0.0001052811,0.0002897956,0.00003066323],"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.0001928541,0.00007380474,0.0003221186,0.0001320356,0.00004676435,0.00009344387,0.000172112,0.01772428,0.05786894,0.01865996,0.008116907,0.8965969],"study_design_scores_gemma":[0.000184732,0.0002777664,0.0009037509,0.00005056983,0.00007085755,0.0005020953,0.000132745,0.8509592,0.07419281,0.02640878,0.04623092,0.00008568484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009915513,0.00006034533,0.9968573,0.00002987678,0.00002059844,0.00003623903,0.00001860389,0.00125564,0.000729814],"genre_scores_gemma":[0.02358478,0.00007268746,0.9742209,0.00004085887,0.00003238342,0.0001589846,0.0001260211,0.0001613302,0.001602073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009514807,"threshold_uncertainty_score":0.03183019,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02209227260210967,"score_gpt":0.2440471228958614,"score_spread":0.2219548502937517,"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."}}