{"id":"W2024909582","doi":"10.1006/cviu.2000.0859","title":"Polyhedral Representation and Adjacency Graph in n-dimensional Digital Images","year":2000,"lang":"en","type":"article","venue":"Computer Vision and Image Understanding","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Adjacency list; Digital topology; Euclidean geometry; Mathematics; Digital geometry; Combinatorics; Digital image; Graph; Representation (politics); Adjacency matrix; Euclidean distance; Topology (electrical circuits); Computer science; Discrete mathematics; Image processing; Image (mathematics); Topological space; Artificial intelligence; General topology; Geometry; Extension topology","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":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0001436125,0.000178113,0.00017828,0.0002770363,0.000145409,0.001890949,0.0002462524,0.00004563972,0.00001345457],"category_scores_gemma":[0.00001527222,0.0001628896,0.00003710148,0.000374261,0.00018125,0.004453631,0.0003224248,0.000124578,0.000007652835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000558493,"about_ca_system_score_gemma":0.00002058398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008561515,"about_ca_topic_score_gemma":0.00000106571,"domain_scores_codex":[0.9987119,0.00003336297,0.0002478535,0.0005362097,0.0002165956,0.0002541113],"domain_scores_gemma":[0.9994807,0.00009659422,0.0000514004,0.0002310721,0.0000302668,0.000109994],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005808214,0.0001962729,0.002196147,0.00005774719,0.00001493428,0.000286604,0.0009559231,0.000015207,0.003869418,0.01573872,0.0050084,0.9716026],"study_design_scores_gemma":[0.003199242,0.0009411795,0.02232919,0.0009930683,0.00001327808,0.001128746,0.0002444659,0.3696891,0.00528695,0.5941176,0.0005277428,0.001529384],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05656853,0.0002755564,0.9373679,0.0008531479,0.00007967225,0.0001378069,0.00000280933,0.0003078595,0.004406764],"genre_scores_gemma":[0.8764402,0.00006574799,0.123084,0.0002374004,0.00002473244,0.000002446324,0.000004757826,0.00001133037,0.0001294255],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9700732,"threshold_uncertainty_score":0.9991452,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02395372269932123,"score_gpt":0.2807965282528208,"score_spread":0.2568428055534995,"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."}}