550 likes | 758 Views
Inpainting. Ya -Fan Su and Tao- Sheng Ou Group 31. A. Criminisi , P. Perez, and K. Toyama, "Region Filling and Object Removal by Exemplar-Based Image Inpainting ," IEEE Trans. Image Processing , 13(9), pp. 1200-1212, September 2004.
E N D
Inpainting Ya-Fan Su and Tao-ShengOu Group 31 A. Criminisi, P. Perez, and K. Toyama, "Region Filling and Object Removal by Exemplar-Based Image Inpainting," IEEE Trans. Image Processing, 13(9), pp. 1200-1212, September 2004. J. Sun, L. Yuan, J. Jia, and H.-Y. Shum, “Image Completion with Structure Propagation,” SIGGRAPH, Vol. 24, pp. 861-868, 2005
What can Inpainting do? • You can remove the annoying things in the image by inpainting Could we remove (inpaint) him?
Two Systems we Implemented • Exemplar-Based Inpainting • Structure Propagation Inpainting A. Criminisi, P. Perez, and K. Toyama, "Region Filling and Object Removal by Exemplar-Based Image Inpainting," IEEE Trans. Image Processing, 13(9), pp. 1200-1212, September 2004. J. Sun, L. Yuan, J. Jia, and H.-Y. Shum, “Image Completion with Structure Propagation,” SIGGRAPH, Vol. 24, pp. 861-868, 2005
Two Systems we Implemented • Exemplar-Based Inpainting • Structure Propagation Inpainting
Systems • Exemplar-Based Inpainting • Structure Propagation Inpainting
2 Key Ideas • Exemplar-based synthesis • Filling order
2 Key Ideas • Exemplar-based synthesis • Filling order
Exemplar-Based Synthesis • Inpaint the target region patch by patch, and each pasted patch is sampled from the source region candidate patches target patch
2 Key Ideas • Exemplar-based synthesis • Filling order
Filling Order (1/2) onion peel filling order of this work
Filling Order (2/2) • The regions which are on the continuation of strong edges should be inpainted earlier Unit vector orthogonal to the contour Tangent direction of gradient
Markov Random Field (MRF) Label1 Label1 Label1 Label1 Label1 Label1 Label2 Label2 Label2 Label2 Label2 Label2 Label3 Label3 Label3 Label3 Label3 Label3 …… …… …… …… …… ……
Markov Random Field – Data Term DcostA,1 DcostC,1 DcostA,2 DcostC,2 A C DcostA,3 DcostC,3 …… ……
Markov Random Field – Smoothness Term Scost(A,1),(B,1) Scost(A,2),(B,1) A B Scost(A,3),(B,1) ……
Utilizing Markov Random Field • Various robust algorithms, such as belief propagation and graph cut, are developed to solve the MRF energy minimization problem • By formulating a problem as a MRF problem, it can easily be solved by applying these algorithms
Energy Terms for Structure Propagation Data cost 1 Data cost 2 Smoothness cost
Experimental Results We could not inpaint the rainbow well because there are no suitable examples
Conclusions • The algorithms applied in this project are rather robust in the sense that the parameters are not sensitive • Exemplar-based inpaintingalgorithm still has its limitations, because there may be no suitable example-patch in the image