MMRFiGN: An Ensemble Graph Segmentation Model for Imbalanced High-Resolution Images Informed by Multicomponent Markov Random Fields

IF 0.8 4区 数学 Q3 MATHEMATICS
A. K. Gorshenin, A. M. Dostovalova
{"title":"MMRFiGN: An Ensemble Graph Segmentation Model for Imbalanced High-Resolution Images Informed by Multicomponent Markov Random Fields","authors":"A. K. Gorshenin,&nbsp;A. M. Dostovalova","doi":"10.1134/S1064562425700255","DOIUrl":null,"url":null,"abstract":"<p>The article presents a novel MMRFiGN ensemble graph neural network model, informed by multicomponent Markov random fields, to improve object segmentation quality in high-resolution images for cases of imbalanced and volatile datasets. A key component of this model is a specially designed two-branch block of graph convolutions. This block simultaneously processes local and global image features based on multiscale image partitions using a multicomponent Markov model to reconstruct spatial relationships between features. A theorem on the faster decrease of the loss function for a multicomponent graph architecture is proven, indicating faster model training compared to graph and convolutional models of comparable size. The MMRFiGN model was tested on the task of image segmentation collected with unmanned aerial vehicles on heterogeneous urban landscapes (open datasets UAVid and UDD were used: Ultra HD 4K resolution, with an imbalance of object classes in terms of numbers). MMRFiGN has outperformed the recognition of both large (buildings, roads) and small objects of different scales (cars) compared to modern convolutional architectures (DeepLabV3, ENet) as well as transformers (SegFormer and SOTA-model 2025 LWGANet): in the first case, an increase in the <i>F</i><sub>1</sub>-score reaches 25.04% (on average, up to 12.08%), and in the second, 14.87 (on average, up to 11.52%). MMRFiGN also outperforms alternative ensemble implementations based on graph architectures with attention up to 20.97%. At the same time, MMRFiGN has fewer parameters than the basic networks, demonstrating the possibility of reduction by a factor of 1.78.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"112 1","pages":"308 - 318"},"PeriodicalIF":0.8000,"publicationDate":"2026-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Doklady Mathematics","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1134/S1064562425700255","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

The article presents a novel MMRFiGN ensemble graph neural network model, informed by multicomponent Markov random fields, to improve object segmentation quality in high-resolution images for cases of imbalanced and volatile datasets. A key component of this model is a specially designed two-branch block of graph convolutions. This block simultaneously processes local and global image features based on multiscale image partitions using a multicomponent Markov model to reconstruct spatial relationships between features. A theorem on the faster decrease of the loss function for a multicomponent graph architecture is proven, indicating faster model training compared to graph and convolutional models of comparable size. The MMRFiGN model was tested on the task of image segmentation collected with unmanned aerial vehicles on heterogeneous urban landscapes (open datasets UAVid and UDD were used: Ultra HD 4K resolution, with an imbalance of object classes in terms of numbers). MMRFiGN has outperformed the recognition of both large (buildings, roads) and small objects of different scales (cars) compared to modern convolutional architectures (DeepLabV3, ENet) as well as transformers (SegFormer and SOTA-model 2025 LWGANet): in the first case, an increase in the F1-score reaches 25.04% (on average, up to 12.08%), and in the second, 14.87 (on average, up to 11.52%). MMRFiGN also outperforms alternative ensemble implementations based on graph architectures with attention up to 20.97%. At the same time, MMRFiGN has fewer parameters than the basic networks, demonstrating the possibility of reduction by a factor of 1.78.

Abstract Image

基于多分量马尔可夫随机场的不平衡高分辨率图像集成图分割模型
本文提出了一种新的MMRFiGN集成图神经网络模型,该模型由多分量马尔可夫随机场提供信息,用于提高高分辨率图像中不平衡和不稳定数据集的目标分割质量。该模型的一个关键组成部分是一个特殊设计的图卷积的双分支块。该块在多尺度图像分割的基础上,利用多分量马尔可夫模型同时处理局部和全局图像特征,重构特征之间的空间关系。证明了多分量图结构的损失函数下降速度更快的定理,表明与同等大小的图和卷积模型相比,模型训练速度更快。在异构城市景观无人机采集的图像分割任务上对MMRFiGN模型进行了测试(使用开放数据集UAVid和UDD:超高清4K分辨率,目标类别数量不平衡)。与现代卷积架构(DeepLabV3, ENet)和变压器(SegFormer和SOTA-model 2025 LWGANet)相比,MMRFiGN在识别大型(建筑物,道路)和不同规模的小型物体(汽车)方面都表现出色:第一种情况下,f1得分提高了25.04%(平均高达12.08%),第二种情况下,f1得分提高了14.87(平均高达11.52%)。MMRFiGN也优于其他基于图架构的集成实现,关注度高达20.97%。同时,与基本网络相比,MMRFiGN具有更少的参数,表明减少了1.78倍的可能性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Doklady Mathematics
Doklady Mathematics 数学-数学
CiteScore
1.00
自引率
16.70%
发文量
39
审稿时长
3-6 weeks
期刊介绍: Doklady Mathematics is a journal of the Presidium of the Russian Academy of Sciences. It contains English translations of papers published in Doklady Akademii Nauk (Proceedings of the Russian Academy of Sciences), which was founded in 1933 and is published 36 times a year. Doklady Mathematics includes the materials from the following areas: mathematics, mathematical physics, computer science, control theory, and computers. It publishes brief scientific reports on previously unpublished significant new research in mathematics and its applications. The main contributors to the journal are Members of the RAS, Corresponding Members of the RAS, and scientists from the former Soviet Union and other foreign countries. Among the contributors are the outstanding Russian mathematicians.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书