基于两阶段最佳缝合线搜索的图像缝合算法

IF 5.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Guijin Han , Yuanzheng Zhang , Mengchun Zhou
{"title":"基于两阶段最佳缝合线搜索的图像缝合算法","authors":"Guijin Han ,&nbsp;Yuanzheng Zhang ,&nbsp;Mengchun Zhou","doi":"10.1016/j.jksuci.2024.102256","DOIUrl":null,"url":null,"abstract":"<div><div>Traditional feature matching algorithms often struggle with poor performance in scenarios involving local detail deformations under varying perspectives. Additionally, traditional optimal seamline search-based image stitching algorithms tend to overlook structural and texture information, resulting in ghosting and visible seams. To address these issues, this paper proposes an image stitching algorithm based on a two-stage optimal seamline search. The algorithm leverages a Homography Network as the foundation, incorporating a homography detail-aware network (HDAN) for feature point matching. By introducing a cost volume in the feature matching layer, the algorithm enhances the description of local detail deformation relationships, thereby improving feature matching performance under different perspectives. The two-stage optimal seamline search algorithm designed for image fusion introduces gradient and structural similarity features on top of traditional color-based optimal seamline search algorithms. The algorithm steps include: (1) Searching for structurally similar regions, i.e., high-frequency regions in high-gradient images, and using a color-based graph cut algorithm to search for seamlines within all high-frequency regions, excluding horizontal seamlines; (2) Using a dynamic programming algorithm to complete each vertical seamline, where the pixel energy is comprehensively calculated based on its differences in color and gradient with the surrounding area. The complete seamline energies are then calculated using color, gradient, and structural similarity differences within the seamline neighborhood, and the seamline with the minimum energy is selected as the optimal seamline. A simulation experiment was conducted using 30 image pairs from the UDIS-D dataset (Unsupervised Deep Image Stitching Dataset). The results demonstrate significant improvements in PSNR and SSIM metrics compared to other image stitching algorithms, with PSNR improvements ranging from 5.63% to 11.25% and SSIM improvements ranging from 11.09% to 24.54%, confirming the superiority of this algorithm in image stitching tasks. The proposed image stitching algorithm based on two-stage optimal seamline search, whether evaluated through subjective visual perception or objective data comparison, outperforms other algorithms by enhancing the natural transition of seamlines in terms of structure and texture, reducing ghosting and visible seams in stitched images.</div></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 10","pages":"Article 102256"},"PeriodicalIF":5.2000,"publicationDate":"2024-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Image stitching algorithm based on two-stage optimal seam line search\",\"authors\":\"Guijin Han ,&nbsp;Yuanzheng Zhang ,&nbsp;Mengchun Zhou\",\"doi\":\"10.1016/j.jksuci.2024.102256\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Traditional feature matching algorithms often struggle with poor performance in scenarios involving local detail deformations under varying perspectives. Additionally, traditional optimal seamline search-based image stitching algorithms tend to overlook structural and texture information, resulting in ghosting and visible seams. To address these issues, this paper proposes an image stitching algorithm based on a two-stage optimal seamline search. The algorithm leverages a Homography Network as the foundation, incorporating a homography detail-aware network (HDAN) for feature point matching. By introducing a cost volume in the feature matching layer, the algorithm enhances the description of local detail deformation relationships, thereby improving feature matching performance under different perspectives. The two-stage optimal seamline search algorithm designed for image fusion introduces gradient and structural similarity features on top of traditional color-based optimal seamline search algorithms. The algorithm steps include: (1) Searching for structurally similar regions, i.e., high-frequency regions in high-gradient images, and using a color-based graph cut algorithm to search for seamlines within all high-frequency regions, excluding horizontal seamlines; (2) Using a dynamic programming algorithm to complete each vertical seamline, where the pixel energy is comprehensively calculated based on its differences in color and gradient with the surrounding area. The complete seamline energies are then calculated using color, gradient, and structural similarity differences within the seamline neighborhood, and the seamline with the minimum energy is selected as the optimal seamline. A simulation experiment was conducted using 30 image pairs from the UDIS-D dataset (Unsupervised Deep Image Stitching Dataset). The results demonstrate significant improvements in PSNR and SSIM metrics compared to other image stitching algorithms, with PSNR improvements ranging from 5.63% to 11.25% and SSIM improvements ranging from 11.09% to 24.54%, confirming the superiority of this algorithm in image stitching tasks. The proposed image stitching algorithm based on two-stage optimal seamline search, whether evaluated through subjective visual perception or objective data comparison, outperforms other algorithms by enhancing the natural transition of seamlines in terms of structure and texture, reducing ghosting and visible seams in stitched images.</div></div>\",\"PeriodicalId\":48547,\"journal\":{\"name\":\"Journal of King Saud University-Computer and Information Sciences\",\"volume\":\"36 10\",\"pages\":\"Article 102256\"},\"PeriodicalIF\":5.2000,\"publicationDate\":\"2024-11-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of King Saud University-Computer and Information Sciences\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1319157824003458\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of King Saud University-Computer and Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1319157824003458","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

传统的特征匹配算法在涉及不同视角下局部细节变形的情况下往往表现不佳。此外,传统的基于最佳接缝线搜索的图像拼接算法往往会忽略结构和纹理信息,从而导致重影和可见接缝。为了解决这些问题,本文提出了一种基于两阶段最优接缝线搜索的图像拼接算法。该算法以同构网络为基础,结合了用于特征点匹配的同构细节感知网络(HDAN)。通过在特征匹配层引入代价量,该算法增强了对局部细节变形关系的描述,从而提高了不同视角下的特征匹配性能。为图像融合设计的两阶段最优缝合线搜索算法在传统的基于颜色的最优缝合线搜索算法基础上引入了梯度和结构相似性特征。算法步骤包括(1) 搜索结构相似区域,即高梯度图像中的高频区域,使用基于颜色的图切割算法搜索所有高频区域内的接缝线,不包括水平接缝线;(2) 使用动态编程算法完成每条垂直接缝线,根据像素与周围区域的颜色和梯度差异综合计算像素能量。然后利用接缝线邻域内的颜色、梯度和结构相似性差异计算完整的接缝线能量,并选择能量最小的接缝线作为最优接缝线。我们使用 UDIS-D 数据集(无监督深度图像拼接数据集)中的 30 对图像进行了模拟实验。结果表明,与其他图像拼接算法相比,该算法在 PSNR 和 SSIM 指标上有明显改善,PSNR 提高了 5.63% 至 11.25%,SSIM 提高了 11.09% 至 24.54%,这证实了该算法在图像拼接任务中的优越性。所提出的基于两阶段最佳缝合线搜索的图像拼接算法,无论是通过主观视觉感知还是客观数据对比进行评估,都优于其他算法,因为它增强了缝合线在结构和纹理方面的自然过渡,减少了拼接图像中的重影和可见缝。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Image stitching algorithm based on two-stage optimal seam line search
Traditional feature matching algorithms often struggle with poor performance in scenarios involving local detail deformations under varying perspectives. Additionally, traditional optimal seamline search-based image stitching algorithms tend to overlook structural and texture information, resulting in ghosting and visible seams. To address these issues, this paper proposes an image stitching algorithm based on a two-stage optimal seamline search. The algorithm leverages a Homography Network as the foundation, incorporating a homography detail-aware network (HDAN) for feature point matching. By introducing a cost volume in the feature matching layer, the algorithm enhances the description of local detail deformation relationships, thereby improving feature matching performance under different perspectives. The two-stage optimal seamline search algorithm designed for image fusion introduces gradient and structural similarity features on top of traditional color-based optimal seamline search algorithms. The algorithm steps include: (1) Searching for structurally similar regions, i.e., high-frequency regions in high-gradient images, and using a color-based graph cut algorithm to search for seamlines within all high-frequency regions, excluding horizontal seamlines; (2) Using a dynamic programming algorithm to complete each vertical seamline, where the pixel energy is comprehensively calculated based on its differences in color and gradient with the surrounding area. The complete seamline energies are then calculated using color, gradient, and structural similarity differences within the seamline neighborhood, and the seamline with the minimum energy is selected as the optimal seamline. A simulation experiment was conducted using 30 image pairs from the UDIS-D dataset (Unsupervised Deep Image Stitching Dataset). The results demonstrate significant improvements in PSNR and SSIM metrics compared to other image stitching algorithms, with PSNR improvements ranging from 5.63% to 11.25% and SSIM improvements ranging from 11.09% to 24.54%, confirming the superiority of this algorithm in image stitching tasks. The proposed image stitching algorithm based on two-stage optimal seamline search, whether evaluated through subjective visual perception or objective data comparison, outperforms other algorithms by enhancing the natural transition of seamlines in terms of structure and texture, reducing ghosting and visible seams in stitched images.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
10.50
自引率
8.70%
发文量
656
审稿时长
29 days
期刊介绍: In 2022 the Journal of King Saud University - Computer and Information Sciences will become an author paid open access journal. Authors who submit their manuscript after October 31st 2021 will be asked to pay an Article Processing Charge (APC) after acceptance of their paper to make their work immediately, permanently, and freely accessible to all. The Journal of King Saud University Computer and Information Sciences is a refereed, international journal that covers all aspects of both foundations of computer and its practical applications.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信