Region Filling and Object Removal by Exemplar-Based Image Inpainting

修补 纹理合成 人工智能 稳健性(进化) 像素 计算机视觉 计算机科学 算法 图像纹理 块(置换群论) 模式识别(心理学) 数字图像 图像(数学) 数学 图像处理 基因 生物化学 化学 几何学
作者
Antonio Criminisi,Patrick Pérez,Kentaro Toyama
出处
期刊:IEEE transactions on image processing [Institute of Electrical and Electronics Engineers]
卷期号:13 (9): 1200-1212 被引量:3150
标识
DOI:10.1109/tip.2004.833105
摘要

A new algorithm is proposed for removing large objects from digital images. The challenge is to fill in the hole that is left behind in a visually plausible way. In the past, this problem has been addressed by two classes of algorithms: 1) "texture synthesis" algorithms for generating large image regions from sample textures and 2) "inpainting" techniques for filling in small image gaps. The former has been demonstrated for "textures"--repeating two-dimensional patterns with some stochasticity; the latter focus on linear "structures" which can be thought of as one-dimensional patterns, such as lines and object contours. This paper presents a novel and efficient algorithm that combines the advantages of these two approaches. We first note that exemplar-based texture synthesis contains the essential process required to replicate both texture and structure; the success of structure propagation, however, is highly dependent on the order in which the filling proceeds. We propose a best-first algorithm in which the confidence in the synthesized pixel values is propagated in a manner similar to the propagation of information in inpainting. The actual color values are computed using exemplar-based synthesis. In this paper, the simultaneous propagation of texture and structure information is achieved by a single, efficient algorithm. Computational efficiency is achieved by a block-based sampling process. A number of examples on real and synthetic images demonstrate the effectiveness of our algorithm in removing large occluding objects, as well as thin scratches. Robustness with respect to the shape of the manually selected target region is also demonstrated. Our results compare favorably to those obtained by existing techniques.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
LG发布了新的文献求助10
刚刚
easton完成签到,获得积分10
刚刚
发发发完成签到 ,获得积分10
刚刚
英姑应助aa采纳,获得10
2秒前
赘婿应助六六采纳,获得10
2秒前
rose完成签到,获得积分20
2秒前
2秒前
红蟹炸炸发布了新的文献求助10
2秒前
2秒前
cai完成签到,获得积分10
2秒前
SciGPT应助zm采纳,获得10
2秒前
3秒前
red完成签到,获得积分10
3秒前
3秒前
3秒前
4秒前
CipherSage应助TianY天翊采纳,获得10
4秒前
顾矜应助满意时光采纳,获得10
4秒前
科研通AI6.4应助恒弟弟采纳,获得10
4秒前
美满熊猫完成签到,获得积分10
4秒前
周周完成签到,获得积分10
4秒前
丹丹子完成签到 ,获得积分0
4秒前
4秒前
5秒前
5秒前
5秒前
5秒前
5秒前
yjh123应助拥抱黑暗吧采纳,获得50
5秒前
顺利舟应助淡然枫采纳,获得10
5秒前
深情安青应助还来得及采纳,获得10
5秒前
6秒前
6秒前
852应助蓝天采纳,获得10
6秒前
二一七完成签到,获得积分10
6秒前
FashionBoy应助有点意思采纳,获得10
6秒前
王华完成签到,获得积分10
6秒前
7秒前
李健应助李健课题组采纳,获得10
7秒前
无限凝竹发布了新的文献求助10
7秒前
高分求助中
Principles of Economics, 11th Edition 10000
University Physics with Modern Physics, 16th edition 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Matrix Methods in Data Mining and Pattern Recognition 510
Social Skills Improvement System-Rating Scales--Chinese Version 500
Dynamische Polarisation von H-1 und B-11 in (CH-3)-3NBH-3 500
CLSI M07 2024 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7248275
求助须知:如何正确求助?哪些是违规求助? 8871254
关于积分的说明 18716482
捐赠科研通 6927344
什么是DOI,文献DOI怎么找? 3198293
关于科研通互助平台的介绍 2373888
邀请新用户注册赠送积分活动 2173046