M. G. Mozerov, V. N. Karnaukhov, V. I. Kober, L. V. Zimina
{"title":"Accurate and Fast Geodesic Distance Calculation Algorithm for Superpixel Segmentation","authors":"M. G. Mozerov, V. N. Karnaukhov, V. I. Kober, L. V. Zimina","doi":"10.1134/s1064226923140139","DOIUrl":null,"url":null,"abstract":"<p><b>Abstract</b>—Modeling in an affine space on the basis of a geodesic distance makes it possible to implement important computer vision techniques. Among these applications is superpixel segmentation, in which geodesic distances from the center of specified segments to an arbitrary image point are calculated. Meanwhile, the algorithms proposed so far for calculating such distances in segmentation problems have been heuristic, iterative approaches, which do not guarantee the expected result. In this study, a new fast algorithm for calculating the geodesic distance is proposed, which is proven to be accurate. The image segments obtained using this algorithm are simply connected regions. The algorithm yields simply connected superpixels at the output, in contrast to many other approaches based on the spatial proximity of the geodesic distance and requiring an additional correction. The proposed technique surpasses its analogs in the border recognition efficiency and computational speed.</p>","PeriodicalId":50229,"journal":{"name":"Journal of Communications Technology and Electronics","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2024-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Communications Technology and Electronics","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1134/s1064226923140139","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0
Abstract—Modeling in an affine space on the basis of a geodesic distance makes it possible to implement important computer vision techniques. Among these applications is superpixel segmentation, in which geodesic distances from the center of specified segments to an arbitrary image point are calculated. Meanwhile, the algorithms proposed so far for calculating such distances in segmentation problems have been heuristic, iterative approaches, which do not guarantee the expected result. In this study, a new fast algorithm for calculating the geodesic distance is proposed, which is proven to be accurate. The image segments obtained using this algorithm are simply connected regions. The algorithm yields simply connected superpixels at the output, in contrast to many other approaches based on the spatial proximity of the geodesic distance and requiring an additional correction. The proposed technique surpasses its analogs in the border recognition efficiency and computational speed.
期刊介绍：
Journal of Communications Technology and Electronics is a journal that publishes articles on a broad spectrum of theoretical, fundamental, and applied issues of radio engineering, communication, and electron physics. It publishes original articles from the leading scientific and research centers. The journal covers all essential branches of electromagnetics, wave propagation theory, signal processing, transmission lines, telecommunications, physics of semiconductors, and physical processes in electron devices, as well as applications in biology, medicine, microelectronics, nanoelectronics, electron and ion emission, etc.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
