Share Email Print

Proceedings Paper

Two fast algorithms of image inpainting
Author(s): Yuqing He; Zhengxin Hou; Chengyou Wang
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Digital image inpainting is an interesting new research topic in multimedia computing and image processing since 2000. This talk covers the most recent contributions in digital image inpainting and image completion, as well as concepts in video inpainting. Image inpainting refers to reconstructing the corrupt regions where the data are all destroyed. A primary class of the technique is to build up a Partial Differential Equation (PDE), consider it as a boundary problem, and solve it by some iterative method. The most representative and creative one of the inpainting algorithms is Bertalmio-Sapiro-Caselles-Bellester (BSCB) model. After summarizes the development of image inpainting technique, this paper points the research at the improvement on BSCB model, and proposes two algorithms to solve the two drawbacks of this model. The first is selective adaptive interpolation which develops the traditional adaptive interpolation algorithm by introducing a priority value. Besides much faster than BSCB model, it can improve the inpainting effects. The second takes selective adaptive interpolation as a preprocessing step, reduces the operation time and improves the inpainting quality further.

Paper Details

Date Published: 28 November 2007
PDF: 7 pages
Proc. SPIE 6833, Electronic Imaging and Multimedia Technology V, 68330Q (28 November 2007); doi: 10.1117/12.757191
Show Author Affiliations
Yuqing He, Tianjin Univ. (China)
Zhengxin Hou, Tianjin Univ. (China)
Chengyou Wang, Tianjin Univ. (China)

Published in SPIE Proceedings Vol. 6833:
Electronic Imaging and Multimedia Technology V
Liwei Zhou; Chung-Sheng Li; Minerva M. Yeung, Editor(s)

© SPIE. Terms of Use
Back to Top