Reducing streak artifacts in computed tomography via sparse representation in coupled dictionaries

条纹 工件(错误) 稀疏逼近 人工智能 块(置换群论) 计算机科学 迭代重建 代表(政治) 模式识别(心理学) 计算机视觉 图像质量 图像(数学) 算法 数学 光学 物理 几何学 法学 政治学 政治
作者
Davood Karimi,Rabab Ward
出处
期刊:Medical Physics [Wiley]
卷期号:43 (3): 1473-1486 被引量:14
标识
DOI:10.1118/1.4942376
摘要

Purpose: Reducing the number of acquired projections is a simple and efficient way to reduce the radiation dose in computed tomography (CT). Unfortunately, this results in streak artifacts in the reconstructed images that can significantly reduce their diagnostic value. This paper presents a novel algorithm for suppressing these artifacts in 3D CT. Methods: The proposed algorithm is based on the sparse representation of small blocks of 3D CT images in learned overcomplete dictionaries. It learns two dictionaries, the first dictionary ( D a ) is for artifact‐full images that have been reconstructed from a small number (approximately 100) of projections. The other dictionary ( D c ) is for clean artifact‐free images. The core idea behind the proposed algorithm is to relate the representation coefficients of an artifact‐full block in D a to the representation coefficients of the corresponding artifact‐free block in D c . The relation between these coefficients is modeled with a linear mapping. The two dictionaries and the linear relation between the coefficients are learned simultaneously from the training data. To remove the artifacts from a test image, small blocks are extracted from this image and their sparse representation is computed in D a . The linear map is then used to compute the corresponding coefficients in D c , which are then used to produce the artifact‐suppressed blocks. Results: The authors apply the proposed algorithm on real cone‐beam CT images. Their results show that the proposed algorithm can effectively suppress the artifacts and substantially improve the quality of the reconstructed images. The images produced by the proposed algorithm have a higher quality than the images reconstructed by the FDK algorithm from twice as many projections. Conclusions: The proposed sparsity‐based algorithm can be a valuable tool for postprocessing of CT images reconstructed from a small number of projections. Therefore, it has the potential to be an effective tool for low‐dose CT.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
高贵的雅山完成签到,获得积分10
1秒前
LJH完成签到,获得积分10
1秒前
糊涂的老师完成签到,获得积分20
1秒前
英姑应助蛐蛐儿采纳,获得10
2秒前
sjh完成签到,获得积分10
3秒前
搜集达人应助Lee采纳,获得10
3秒前
3秒前
Jasper应助机智苗采纳,获得10
4秒前
zjq4302完成签到,获得积分10
4秒前
dadabad完成签到 ,获得积分10
4秒前
陶招发布了新的文献求助10
4秒前
Asteroid完成签到,获得积分10
4秒前
Monkey_Z完成签到,获得积分10
4秒前
失眠的云朵完成签到,获得积分10
4秒前
幸福的蓝血完成签到,获得积分10
4秒前
5秒前
hhan完成签到,获得积分10
5秒前
山顶洞人完成签到,获得积分10
5秒前
slm完成签到,获得积分10
5秒前
zimu012完成签到,获得积分10
6秒前
6秒前
MM完成签到,获得积分10
6秒前
科研通AI6.1应助柚子采纳,获得10
7秒前
SQ完成签到,获得积分10
7秒前
鱼鱼完成签到 ,获得积分10
7秒前
MillieWang完成签到,获得积分10
7秒前
忆Y完成签到,获得积分10
7秒前
bogula1112完成签到 ,获得积分10
7秒前
可爱的兔兔完成签到,获得积分20
7秒前
星星完成签到,获得积分10
8秒前
一颗花生完成签到,获得积分10
8秒前
suwan完成签到,获得积分10
9秒前
典雅紫萍完成签到,获得积分10
9秒前
不安凡白完成签到,获得积分10
9秒前
木子秀完成签到,获得积分10
9秒前
霸气雯完成签到,获得积分10
9秒前
辉辉完成签到,获得积分20
9秒前
大叉烧完成签到,获得积分10
9秒前
yuriyc完成签到,获得积分10
10秒前
酷炫若枫完成签到,获得积分10
10秒前
高分求助中
Clinical Epidemiology: The Essentials, 6e 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
The Graphene Handbook (2019 Edition) 800
Adhesion Science: Principles & Practice 800
Signals, Systems, and Signal Processing 610
Fundamentals of Pharmaceutical and Biologics Regulations: A Global Perspective, Second Edition 600
久松真一著作集〈第5巻〉禅と芸術 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 物理 内科学 复合材料 催化作用 物理化学 光电子学 电极 细胞生物学 基因 无机化学
热门帖子
关注 科研通微信公众号,转发送积分 6555580
求助须知:如何正确求助?哪些是违规求助? 8339901
关于积分的说明 17867083
捐赠科研通 5673398
什么是DOI,文献DOI怎么找? 2940313
邀请新用户注册赠送积分活动 1916200
关于科研通互助平台的介绍 1786376