arXiv:cs.LG· Guillaume Brouillette (Universit\'e du Qu\'ebec \`a Trois-Rivi\`eres, Trois-Rivi\`eres, Canada), Alain Goupil (Universit\'e du Qu\'ebec \`a Trois-Rivi\`eres, Trois-Rivi\`eres, Canada), Pierre-Olivier Paris\'e (Universit\'e du Qu\'ebec \`a Trois-Rivi\`eres, Trois-Rivi\`eres, Canada), Fadel Tour\'e (Universit\'e du Qu\'ebec \`a Trois-Rivi\`eres, Trois-Rivi\`eres, Canada)·· 4 小时前AI 评分30
不变切线角描述子与 Band U-Net:用于 2D 碎片邻接预测
An Invariant Tangent-Angle Descriptor and a Band U-Net for 2D Fragment Adjacency Prediction
AI 导读
研究者用切线角轮廓描述子替换 Beaulac 论文两阶段流程中的局部图像窗口打分,并用 Band U-Net 替代最终分类器,实现碎片旋转不变且与轮廓起点无关的 2D 碎片邻接预测。
正文
Abstract:This paper addresses the prediction of adjacency between pairs of 2D fragments based on their contours. We improved the two-stage architecture proposed in Beaulac's thesis, in which a rotation-equivariant Siamese convolutional neural network scores pairs of local image windows along the two contours of two fragments. The scores are gathered in an adjacency matrix in which a ResNet detects the partial anti-diagonal band that reveals the adjacency of two fragments. In the current work, we keep the pipeline and replace the local score by a comparison of tangent-angle profiles of contour windows, making it, by construction, invariant to fragment rotation and agnostic to the selected contour-starting point. These adaptations may be either a training-free likelihood ratio or a small one-dimensional convolutional model trained on corresponding points. We also replaced the final classifier by a band U-Net that segments the band and classifies the pair, so that the shared arc is obtained along with the decision. In the synthetic data set of the original thesis, the tangent descriptor performs as well as or better than the image-window approach in all tested configurations. The proposed pipeline reaches an accuracy of 98%, vs 93% to 95% for the original approach once its evaluation is corrected. We tested our pipeline, with models trained only on synthetic data, on the PairingNet benchmark, and obtained an AUC of 0.93. Furthermore, under the PairingNet pair-searching protocol conditions, our learned descriptor obtains a Recall@10 of 0.82 on the real set against 0.56 from the best model of the original paper.
| Comments: | 14 pages, 4 figures, 6 tables |
| Subjects: | Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG) |
| ACM classes: | I.4.8; I.5.4 |
| Cite as: | arXiv:2610.09459 [cs.CV] |
| (or arXiv:2610.09459v1 [cs.CV] for this version) | |
| https://doi.org/10.48550/arXiv.2610.09459 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Guillaume Brouillette [view email]
[v1]
Wed, 7 Oct 2026 05:14:44 UTC (348 KB)
来源:arXiv:cs.LG · arxiv.org