{"id":"https://openalex.org/W2767246023","doi":"https://doi.org/10.1109/stc-csit.2017.8098764","title":"Computation of the minimum distance between non-convex polygons for segmentation quality evaluation","display_name":"Computation of the minimum distance between non-convex polygons for segmentation quality evaluation","publication_year":2017,"publication_date":"2017-09-01","ids":{"openalex":"https://openalex.org/W2767246023","doi":"https://doi.org/10.1109/stc-csit.2017.8098764","mag":"2767246023"},"language":"en","primary_location":{"id":"doi:10.1109/stc-csit.2017.8098764","is_oa":false,"landing_page_url":"https://doi.org/10.1109/stc-csit.2017.8098764","pdf_url":null,"source":{"id":"https://openalex.org/S4306498091","display_name":"2017 12th International Scientific and Technical Conference on Computer Sciences and Information Technologies (CSIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 12th International Scientific and Technical Conference on Computer Sciences and Information Technologies (CSIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086209954","display_name":"Oleh Berezsky","orcid":"https://orcid.org/0000-0001-9931-4154"},"institutions":[{"id":"https://openalex.org/I160977438","display_name":"West Ukrainian National University","ror":"https://ror.org/047988g19","country_code":"UA","type":"education","lineage":["https://openalex.org/I160977438"]}],"countries":["UA"],"is_corresponding":true,"raw_author_name":"O. M. Berezsky","raw_affiliation_strings":["Department of Computer Engineering, Ternopil National Economic University, Ternopil, Ukraine"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Ternopil National Economic University, Ternopil, Ukraine","institution_ids":["https://openalex.org/I160977438"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062532429","display_name":"Oleh Pitsun","orcid":"https://orcid.org/0000-0003-0280-8786"},"institutions":[{"id":"https://openalex.org/I160977438","display_name":"West Ukrainian National University","ror":"https://ror.org/047988g19","country_code":"UA","type":"education","lineage":["https://openalex.org/I160977438"]}],"countries":["UA"],"is_corresponding":false,"raw_author_name":"O.Y. Pitsun","raw_affiliation_strings":["Department of Computer Engineering, Ternopil National Economic University, Ternopil, Ukraine"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Ternopil National Economic University, Ternopil, Ukraine","institution_ids":["https://openalex.org/I160977438"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086209954"],"corresponding_institution_ids":["https://openalex.org/I160977438"],"apc_list":null,"apc_paid":null,"fwci":0.197,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.56695652,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"27","issue":null,"first_page":"183","last_page":"186"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10052","display_name":"Medical Image Segmentation Techniques","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10052","display_name":"Medical Image Segmentation Techniques","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12549","display_name":"Image and Object Detection Techniques","score":0.984499990940094,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12923","display_name":"Digital Image Processing Techniques","score":0.9782999753952026,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.697839617729187},{"id":"https://openalex.org/keywords/point-in-polygon","display_name":"Point in polygon","score":0.586580216884613},{"id":"https://openalex.org/keywords/hausdorff-distance","display_name":"Hausdorff distance","score":0.5860914587974548},{"id":"https://openalex.org/keywords/segmentation","display_name":"Segmentation","score":0.5620325803756714},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4857940673828125},{"id":"https://openalex.org/keywords/rectilinear-polygon","display_name":"Rectilinear polygon","score":0.4600628912448883},{"id":"https://openalex.org/keywords/convex-polygon","display_name":"Convex polygon","score":0.4399757385253906},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4188213348388672},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.4184652864933014},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40000709891319275},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3555939495563507},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33374685049057007},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.26724231243133545},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.2635535001754761},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12906038761138916},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.10591855645179749}],"concepts":[{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.697839617729187},{"id":"https://openalex.org/C59902600","wikidata":"https://www.wikidata.org/wiki/Q1575331","display_name":"Point in polygon","level":3,"score":0.586580216884613},{"id":"https://openalex.org/C141898687","wikidata":"https://www.wikidata.org/wiki/Q1501997","display_name":"Hausdorff distance","level":2,"score":0.5860914587974548},{"id":"https://openalex.org/C89600930","wikidata":"https://www.wikidata.org/wiki/Q1423946","display_name":"Segmentation","level":2,"score":0.5620325803756714},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4857940673828125},{"id":"https://openalex.org/C170542616","wikidata":"https://www.wikidata.org/wiki/Q7303186","display_name":"Rectilinear polygon","level":4,"score":0.4600628912448883},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.4399757385253906},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4188213348388672},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.4184652864933014},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40000709891319275},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3555939495563507},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33374685049057007},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26724231243133545},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.2635535001754761},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12906038761138916},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.10591855645179749}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/stc-csit.2017.8098764","is_oa":false,"landing_page_url":"https://doi.org/10.1109/stc-csit.2017.8098764","pdf_url":null,"source":{"id":"https://openalex.org/S4306498091","display_name":"2017 12th International Scientific and Technical Conference on Computer Sciences and Information Technologies (CSIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 12th International Scientific and Technical Conference on Computer Sciences and Information Technologies (CSIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1483679902","https://openalex.org/W2031639350","https://openalex.org/W2156808562","https://openalex.org/W2208654542","https://openalex.org/W2505323866","https://openalex.org/W2529076738","https://openalex.org/W6628839852","https://openalex.org/W6658284909"],"related_works":["https://openalex.org/W1812659169","https://openalex.org/W2798354335","https://openalex.org/W3102284731","https://openalex.org/W2123516473","https://openalex.org/W27130204","https://openalex.org/W1823682487","https://openalex.org/W2148315837","https://openalex.org/W1579553590","https://openalex.org/W2392617612","https://openalex.org/W2375168923"],"abstract_inverted_index":{"In":[0],"this":[1],"research":[2],"study,":[3],"the":[4,7,11,20,25,35,39,45],"authors":[5],"developed":[6],"algorithms":[8,54],"for":[9],"computing":[10],"minimum":[12,40],"distances":[13,41],"between":[14,42],"non-convex":[15,29],"polygons.":[16],"The":[17,52],"purpose":[18],"of":[19,47],"study":[21],"is":[22],"to":[23,58],"develop":[24],"algorithm":[26,36],"that":[27,37],"transforms":[28],"polygons":[30,33,43],"into":[31],"multi-convex":[32],"and":[34,49],"computes":[38],"on":[44],"basis":[46],"Gromov-Hausdorff":[48],"Gromov-Fr\u00e9chet":[50],"metrics.":[51],"proposed":[53],"have":[55],"been":[56],"used":[57],"quantify":[59],"segmentation":[60],"quality.":[61]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}