Sparse based similarity measure for mono-modal image registration

A. Ghaffari, E. Fatemizadeh
{"title":"Sparse based similarity measure for mono-modal image registration","authors":"A. Ghaffari, E. Fatemizadeh","doi":"10.1109/IRANIANMVIP.2013.6780030","DOIUrl":null,"url":null,"abstract":"Similarity measure is an important key in image registration. Most traditional intensity-based similarity measures (e.g., SSD, CC, MI, and CR) assume stationary image and pixel by pixel independence. Hence, perfect image registration cannot be achieved especially in presence of spatially-varying intensity distortions and outlier objects that appear in one image but not in the other. Here, we suppose that non stationary intensity distortion (such as Bias field or Outlier) has sparse representation in transformation domain. Based on this as-sumption, the zero norm (ℓ0)of the residual image between two registered images in transform domain is introduced as a new similarity measure in presence of non-stationary inten-sity. In this paper we replace ℓ0 norm with ℓ1 norm which is a popular sparseness measure. This measure produces accurate registration results in compare to other similarity measure such as SSD, MI and Residual Complexity RC.","PeriodicalId":297204,"journal":{"name":"2013 8th Iranian Conference on Machine Vision and Image Processing (MVIP)","volume":"41 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 8th Iranian Conference on Machine Vision and Image Processing (MVIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IRANIANMVIP.2013.6780030","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Similarity measure is an important key in image registration. Most traditional intensity-based similarity measures (e.g., SSD, CC, MI, and CR) assume stationary image and pixel by pixel independence. Hence, perfect image registration cannot be achieved especially in presence of spatially-varying intensity distortions and outlier objects that appear in one image but not in the other. Here, we suppose that non stationary intensity distortion (such as Bias field or Outlier) has sparse representation in transformation domain. Based on this as-sumption, the zero norm (ℓ0)of the residual image between two registered images in transform domain is introduced as a new similarity measure in presence of non-stationary inten-sity. In this paper we replace ℓ0 norm with ℓ1 norm which is a popular sparseness measure. This measure produces accurate registration results in compare to other similarity measure such as SSD, MI and Residual Complexity RC.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于稀疏的单模态图像配准相似度度量
相似度度量是图像配准的关键。大多数传统的基于强度的相似性度量(例如,SSD, CC, MI和CR)假设静止图像和逐像素的独立性。因此,完美的图像配准无法实现,特别是在存在空间变化的强度扭曲和在一幅图像中出现但在另一幅图像中没有出现的离群对象的情况下。在这里,我们假设非平稳强度失真(如Bias field或Outlier)在变换域中具有稀疏表示。在此假设的基础上,引入了变换域中两幅配准图像间残差图像的零范数(l0)作为非平稳强度下的一种新的相似性度量。本文用常用的稀疏性度量1范数代替了0范数。与其他相似度度量(如SSD、MI和残余复杂度RC)相比,该度量产生准确的配准结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Automated lung CT image segmentation using kernel mean shift analysis A simple and efficient approach for 3D model decomposition MRI image reconstruction via new K-space sampling scheme based on separable transform Fusion of SPECT and MRI images using back and fore ground information Real time occlusion handling using Kalman Filter and mean-shift
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1