V. N. Karnaukhov, V. I. Kober, M. G. Mozerov, L. V. Zimina
{"title":"Superpixel-Segmentation Based on Energy Minimization and Convolution with the Geodesic Distance Kernel","authors":"V. N. Karnaukhov, V. I. Kober, M. G. Mozerov, L. V. Zimina","doi":"10.1134/s1064226924700189","DOIUrl":null,"url":null,"abstract":"<p><b>Abstract</b>—The energy minimization or maximum a posteriori probability (MAP) method is the basis for solving many computer vision problems, including the segmentation problem. However, it is assumed that the number of regions during segmentation is quite small. At the same time, in the problem of superpixel segmentation or otherwise excessive segmentation, the number of such areas exceeds 1000, which makes the computational optimization problem by the MAP method practically impossible. In this paper, we propose a solution that reduces segmentation with any number of areas to the problem of marking only nine labels. In addition, convolution with the geodesic distance kernel is used to enhance the robustness of optimization. This makes it possible to obtain single-linked superpixels at the output of the algorithm, unlike many other methods that require additional adjustments. The effectiveness of the proposed method is compared and measured by the precision-recall criteria, as well as by visual illustration.</p>","PeriodicalId":50229,"journal":{"name":"Journal of Communications Technology and Electronics","volume":"12 1","pages":""},"PeriodicalIF":0.4000,"publicationDate":"2024-09-11","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/s1064226924700189","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0
Abstract—The energy minimization or maximum a posteriori probability (MAP) method is the basis for solving many computer vision problems, including the segmentation problem. However, it is assumed that the number of regions during segmentation is quite small. At the same time, in the problem of superpixel segmentation or otherwise excessive segmentation, the number of such areas exceeds 1000, which makes the computational optimization problem by the MAP method practically impossible. In this paper, we propose a solution that reduces segmentation with any number of areas to the problem of marking only nine labels. In addition, convolution with the geodesic distance kernel is used to enhance the robustness of optimization. This makes it possible to obtain single-linked superpixels at the output of the algorithm, unlike many other methods that require additional adjustments. The effectiveness of the proposed method is compared and measured by the precision-recall criteria, as well as by visual illustration.
期刊介绍：
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号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
