Subspace Clustering and HOSVD in Image Inpainting
Mrinmoy Ghorai* Sekhar Mandal ** Bhabatosh Chanda*
* Indian Statistical Institute , Kolkata ** Indian Institute of Engineering Science and Technology, Shibpur
* Indian Statistical Institute , Kolkata ** Indian Institute of Engineering Science and Technology, Shibpur
This work presents a Markov random field (MRF) based image inpainting algorithm, which performs patch selection based on groups of similar patches and determines optimal patch assignment through joint patch refinement of selected top similar (candidate) patches. In patch selection, a novel group-based strategy is introduced to search the candidate patches in relevant source region specified by some pre-defined groups. This overcomes the problem of searching patches in the whole source region or improper sub-regions of the input image. Further, we propose an efficient patch refinement scheme to process each candidate patch for capturing underlying pattern. This eliminates random variation and unwanted artifacts as well. Finally, this pattern is incorporated as a weighted data term in the objective function of the MRF model to improve the optimal patch assignment. Here, we use subspace clustering and higher order singular value decomposition (HOSVD) for group formation and patch refinement, respectively. Experimental results on a large number of natural images and comparisons with well known existing methods demonstrate the efficacy and superiority of the proposed method.
Steps: