Pixel and Patch Reordering for Fast Patch Selection in Exemplar-Based Image Inpainting

スポンサーリンク

概要

• 論文の詳細を見る

• This letter presents a scheme to improve the running time of exemplar-based image inpainting, first proposed by Criminisi et al. In the exemplar-based image inpainting, a patch that contains unknown pixels is compared to all the patches in the known region in order to find the best match. This is very time-consuming and hinders the practicality of Criminisi's method to be used in real time. We show that a simple bounding algorithm can significantly reduce number of distance calculations, and thus the running time. Performance of the bounding algorithm is affected by the order of patches that are compared, as well as the order of pixels in a patch. We present pixel and patch ordering schemes that improve the performance of bounding algorithms. Experiments with well-known images used in inpainting literature show that the proposed reordering scheme can reduce running time of the bounding algorithm up to 50%.

著者

• So Jungmin

  Dept. Of Computer Engineering Hallym University

• KIM Jiseong

  Dept. of Computer Engineering, Hallym University

• KIM Baeksop

  Dept. of Computer Engineering, Hallym University

関連論文

• SCAP : Energy Efficient Event Detection in Large-Scale Wireless Sensor Networks with Multiple Sinks
• Pixel and Patch Reordering for Fast Patch Selection in Exemplar-Based Image Inpainting

スポンサーリンク