Paper
4 March 2015 Image completion using image skimming
Author Affiliations +
Proceedings Volume 9410, Visual Information Processing and Communication VI; 94100L (2015) https://doi.org/10.1117/12.2084988
Event: SPIE/IS&T Electronic Imaging, 2015, San Francisco, California, United States
Abstract
This paper is concerned with the problem of image completion where the goal is to fill large missing parts (holes) in an image, video or a scene in a visually-plausible and a computationally-efficient manner. Recently, the literature on hole filling was dominated by exemplar-based (patch-based) filling techniques with a two-stage unified pipeline that starts by building a bag of significant patches (BoSP), and then uses that bag to fill the hole. In this paper, we propose a new framework which addresses the inherent limitations of the state-of-the-art techniques. Our method capitalizes on a newly-developed technique for image skimming, followed by a novel procedure to propagate the constructed skim to within the hole. Experimental results show that our method compares favourably with the state-of-the-art.
© (2015) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ahmad Al-Kabbany and Eric Dubois "Image completion using image skimming", Proc. SPIE 9410, Visual Information Processing and Communication VI, 94100L (4 March 2015); https://doi.org/10.1117/12.2084988
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Binary data

Expectation maximization algorithms

Image processing

RGB color model

Video

Visualization

Data modeling

RELATED CONTENT

Saliency detection via background features
Proceedings of SPIE (August 09 2018)
Maximizing inpainting efficiency without sacrificing quality
Proceedings of SPIE (January 18 2010)
New results in color image quantization
Proceedings of SPIE (May 19 1992)

Back to Top