No Cover Image

Conference Paper/Proceeding/Abstract 899 views 331 downloads

Robust and Flexible Puzzle Solving with Corner-based Cycle Consistent Correspondences

Taiwei Wang, Kristiyan Vladimirov, Shuyu Goh, Yukai Lai, Xianghua Xie, Gary Tam Orcid Logo

EG UK Conference of Computer Graphics & Visual Computing 2019

Swansea University Author: Gary Tam Orcid Logo

DOI (Published version): 10.2312/cgvc.20191266

Abstract

Solving jigsaw puzzles is a classic problem in computer vision with various applications. Over the past decades, many useful approaches have been introduced. Most existing works use edge-wise similarity measures for assembling puzzles with square pieces of the same size, and recent work innovates to...

Full description

Published in: EG UK Conference of Computer Graphics & Visual Computing 2019
Published: Bangor, UK EGUK 2019
Online Access: http://eguk.bangor.ac.uk/CGVC2019/programme.html
URI: https://cronfa.swan.ac.uk/Record/cronfa51628
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract: Solving jigsaw puzzles is a classic problem in computer vision with various applications. Over the past decades, many useful approaches have been introduced. Most existing works use edge-wise similarity measures for assembling puzzles with square pieces of the same size, and recent work innovates to use the loop constraint to improve efficiency and accuracy. We observe that most existing techniques cannot be easily extended to puzzles with rectangular pieces of arbitrary sizes, and no existing loop constraints can be used to model such challenging scenarios. In this paper, we propose a new corner-wise matching approach, modelled using the MatchLift framework to solve square puzzles with cycle consistency. We further show one exciting example illustrating how puzzles with rectangular pieces of arbitrary sizes would be solved by our technique.
College: Faculty of Science and Engineering