{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001332882,0.0003462376,0.0004573676,0.001917023,0.0005678185,0.001348366,0.0008619628,0.0006561836,0.00430134],"category_scores_gemma":[0.00119382,0.0002879839,0.0003710494,0.002375111,0.0006750134,0.001331096,0.0005977258,0.0007744782,0.0008816121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004411484,"about_ca_system_score_gemma":0.0003904717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005377029,"about_ca_topic_score_gemma":0.006093443,"domain_scores_codex":[0.9996791,0.00006273993,0.00002056852,0.0001016859,0.0001093539,0.00002653563],"domain_scores_gemma":[0.9995969,0.0001351532,0.0000877424,0.00005154746,0.00009558014,0.00003321106],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000145761,0.0001431689,0.001461298,0.0002602997,0.00002336595,0.0003882468,0.0003567763,0.193749,0.01228423,0.5042586,0.007865579,0.2790636],"study_design_scores_gemma":[0.00001216797,0.00004129476,0.001357449,0.00003518747,0.00001718766,0.0003342151,0.0002354803,0.7059991,0.002482635,0.2776967,0.01175942,0.00002916298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05254106,0.0003369852,0.9362974,0.0003088607,0.00009788627,0.00008000597,0.0006145434,0.000333515,0.009389705],"genre_scores_gemma":[0.5973217,0.001182097,0.3838293,0.0002228339,0.0001366983,0.0002893467,0.001576929,0.0001951535,0.0152459],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005377029,"threshold_uncertainty_score":0.0143894,"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."}}