Self-Supervised Fragment Alignment With Gaps

被引:0
作者
Yang, Mingxin [1 ]
Svirsky, Yonatan [2 ]
Cheng, Zhanglin [1 ]
Sharf, Andrei [2 ]
机构
[1] Chinese Acad Sci, Shenzhen Inst Adv Technol SIAT, Shenzhen Key Lab Visual Comp & Analyt VisuCA, Shenzhen 518055, Peoples R China
[2] Bengurion Univ, Beer Sheva 84105, Israel
基金
国家重点研发计划;
关键词
Task analysis; Generative adversarial networks; Neural networks; Visualization; Training; Noise measurement; Image restoration; Fragment registration; fragment alignment; deep learning;
D O I
10.1109/TVCG.2023.3330859
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Image alignment and registration methods typically rely on visual correspondences across common regions and boundaries to guide the alignment process. Without them, the problem becomes significantly more challenging. Nevertheless, in real world, image fragments may be corrupted with no common boundaries and little or no overlap. In this work, we address the problem of learning the alignment of image fragments with gaps (i.e., without common boundaries or overlapping regions). Our setting is unsupervised, having only the fragments at hand with no ground truth to guide the alignment process. This is usually the situation in the restoration of unique archaeological artifacts such as frescoes and mosaics. Hence, we suggest a self-supervised approach utilizing self-examples which we generate from the existing data and then feed into an adversarial neural network. Our idea is that available information inside fragments is often sufficiently rich to guide their alignment with good accuracy. Following this observation, our method splits the initial fragments into sub-fragments yielding a set of aligned pieces. Thus, sub-fragmentation allows exposing new alignment relations and revealing inner structures and feature statistics. In fact, the new sub-fragments construct true and false alignment relations between fragments. We feed this data to a spatial transformer GAN which learns to predict the alignment between fragments gaps. We test our technique on various synthetic datasets as well as large scale frescoes and mosaics. Results demonstrate our method's capability to learn the alignment of deteriorated image fragments in a self-supervised manner, by examining inner image statistics for both synthetic and real data.
引用
收藏
页码:6235 / 6246
页数:12
相关论文
共 53 条
[1]  
Altman T., 1989, Applied Artificial Intelligence, V3, P453, DOI 10.1080/08839518908949937
[2]  
Anirudh R, 2018, Arxiv, DOI arXiv:1805.07281
[3]  
Arandjelovic R, 2019, Arxiv, DOI arXiv:1905.11369
[4]   Attention Augmented Convolutional Networks [J].
Bello, Irwan ;
Zoph, Barret ;
Vaswani, Ashish ;
Shlens, Jonathon ;
Le, Quoc V. .
2019 IEEE/CVF INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV 2019), 2019, :3285-3294
[5]  
Bora Ashish, 2018, INT C LEARNING REPRE
[6]   Solving Jigsaw Puzzles with Eroded Boundaries [J].
Bridger, Dov ;
Danon, Dov ;
Tal, Ayellet .
2020 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2020, :3523-3532
[7]   A system for high-volume acquisition and matching of fresco fragments: Reassembling theran wall paintings [J].
Brown, Benedict J. ;
Toler-Franklin, Corey ;
Nehab, Diego ;
Burns, Michael ;
Dobkin, David ;
Vlachopoulos, Andreas ;
Doumas, Christos ;
Rusinkiewicz, Szymon ;
Weyrich, Tim .
ACM TRANSACTIONS ON GRAPHICS, 2008, 27 (03)
[8]   Automatic panoramic image stitching using invariant features [J].
Brown, Matthew ;
Lowe, David G. .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 2007, 74 (01) :59-73
[9]   AUTOMATED ASSEMBLY OF SHREDDED PIECES FROM MULTIPLE PHOTOS [J].
Cao, Shengjiao ;
Liu, Hairong ;
Yan, Shuicheng .
2010 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO (ICME 2010), 2010, :358-363
[10]   Domain Generalization by Solving Jigsaw Puzzles [J].
Carlucci, Fabio M. ;
D'Innocente, Antonio ;
Bucci, Silvia ;
Caputo, Barbara ;
Tommasi, Tatiana .
2019 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2019), 2019, :2224-2233