Hierarchical gradient modulation for multi-resolution image registration

IF 7.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Luhang Shen , Jinfang Ouyang , Zizhao Guo , Na Ying , Huahua Chen , Chunsheng Guo
{"title":"Hierarchical gradient modulation for multi-resolution image registration","authors":"Luhang Shen ,&nbsp;Jinfang Ouyang ,&nbsp;Zizhao Guo ,&nbsp;Na Ying ,&nbsp;Huahua Chen ,&nbsp;Chunsheng Guo","doi":"10.1016/j.patcog.2025.112525","DOIUrl":null,"url":null,"abstract":"<div><div>In image registration, traditional methods often require manual supervision or the use of paired image data to optimize transformations, which can be both labor-intensive and limited in generalization. Unsupervised methods, by contrast, aim to automatically learn the optimal alignment between images without relying on labeled data, but they often struggle with balancing the complex trade-off between regularization and similarity loss, leading to issues with model tuning and weak generalization across diverse datasets. In this paper, a novel hierarchical gradient modulation strategy is proposed for multi-resolution image registration. This method introduces a compatibility criterion based on the relationship between the gradients of similarity loss and regularization loss. It evaluates the compatibility between similarity and regularization gradients, integrates them through intuitive strategies that align mutually reinforcing gradients, project conflicting gradients orthogonally to avoid interference, and balance gradients of equal importance through averaging. It prioritizes global deformation with stronger regularization at low resolution and focuses on fine details with reduced regularization at high resolution. Experimental results on common medical datasets, forward-looking sonar datasets, and fabric defect detection datasets demonstrate that the proposed method achieves superior registration performance compared to baseline methods and state-of-the-art hyperparameter-related research without incurring additional computational costs, achieving optimal loss balance in a multi-resolution structure.</div></div>","PeriodicalId":49713,"journal":{"name":"Pattern Recognition","volume":"172 ","pages":"Article 112525"},"PeriodicalIF":7.6000,"publicationDate":"2025-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pattern Recognition","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0031320325011884","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

In image registration, traditional methods often require manual supervision or the use of paired image data to optimize transformations, which can be both labor-intensive and limited in generalization. Unsupervised methods, by contrast, aim to automatically learn the optimal alignment between images without relying on labeled data, but they often struggle with balancing the complex trade-off between regularization and similarity loss, leading to issues with model tuning and weak generalization across diverse datasets. In this paper, a novel hierarchical gradient modulation strategy is proposed for multi-resolution image registration. This method introduces a compatibility criterion based on the relationship between the gradients of similarity loss and regularization loss. It evaluates the compatibility between similarity and regularization gradients, integrates them through intuitive strategies that align mutually reinforcing gradients, project conflicting gradients orthogonally to avoid interference, and balance gradients of equal importance through averaging. It prioritizes global deformation with stronger regularization at low resolution and focuses on fine details with reduced regularization at high resolution. Experimental results on common medical datasets, forward-looking sonar datasets, and fabric defect detection datasets demonstrate that the proposed method achieves superior registration performance compared to baseline methods and state-of-the-art hyperparameter-related research without incurring additional computational costs, achieving optimal loss balance in a multi-resolution structure.

Abstract Image

多分辨率图像配准的分层梯度调制
在图像配准中,传统的方法通常需要人工监督或使用成对的图像数据来优化变换,这既费力又泛化能力有限。相比之下,无监督方法的目标是在不依赖标记数据的情况下自动学习图像之间的最佳对齐,但它们往往难以平衡正则化和相似度损失之间的复杂权衡,导致模型调优和跨不同数据集的弱泛化问题。本文提出了一种用于多分辨率图像配准的分层梯度调制策略。该方法引入了一种基于相似损失梯度和正则化损失梯度关系的兼容准则。它评估相似性梯度和正则化梯度之间的兼容性,通过直观的策略将它们整合起来,通过对齐相互增强的梯度,正交投影冲突梯度以避免干扰,并通过平均来平衡同等重要的梯度。它在低分辨率下优先考虑具有较强正则化的全局变形,在高分辨率下关注具有较低正则化的精细细节。在常见医疗数据集、前视声纳数据集和织物缺陷检测数据集上的实验结果表明,与基线方法和最先进的超参数相关研究相比,该方法在不产生额外计算成本的情况下取得了更好的配准性能,在多分辨率结构中实现了最佳损失平衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Pattern Recognition
Pattern Recognition 工程技术-工程:电子与电气
CiteScore
14.40
自引率
16.20%
发文量
683
审稿时长
5.6 months
期刊介绍: The field of Pattern Recognition is both mature and rapidly evolving, playing a crucial role in various related fields such as computer vision, image processing, text analysis, and neural networks. It closely intersects with machine learning and is being applied in emerging areas like biometrics, bioinformatics, multimedia data analysis, and data science. The journal Pattern Recognition, established half a century ago during the early days of computer science, has since grown significantly in scope and influence.
×
引用
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学术官方微信