Name
Abstract | ||
|---|---|---|
Existing inpainting methods have achieved promising performance for recovering regular or small image defects. However, filling in large continuous holes remains difficult due to the lack of constraints for the hole center. In this paper, we devise a Recurrent Feature Reasoning (RFR) network which is mainly constructed by a plug-and-play Recurrent Feature Reasoning module and a Knowledge Consistent Attention (KCA) module. Analogous to how humans solve puzzles (i.e., first solve the easier parts and then use the results as additional information to solve difficult parts), the RFR module recurrently infers the hole boundaries of the convolutional feature maps and then uses them as clues for further inference. The module progressively strengthens the constraints for the hole center and the results become explicit. To capture information from distant places in the feature map for RFR, we further develop KCA and incorporate it in RFR. Empirically, we first compare the proposed RFR-Net with existing backbones, demonstrating that RFR-Net is more efficient (e.g., a 4\% SSIM improvement for the same model size). We then place the network in the context of the current state-of-the-art, where it exhibits improved performance. The corresponding source code is available at: https://github.com/jingyuanli001/RFR-Inpainting |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/CVPR42600.2020.00778 | CVPR |
DocType | Citations | PageRank |
Conference | 2 | 0.36 |
References | Authors | |
21 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jingyuan Li | 1 | 20 | 8.86 |
| Ning Wang | 2 | 79 | 24.33 |
| Lefei Zhang | 3 | 840 | 47.83 |
| Bo Du | 4 | 1662 | 130.01 |
| Dacheng Tao | 5 | 19032 | 747.78 |