By Topic

Solve JIGSAW puzzle problems with Co-Normalization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Shaoze Lei ; Dept. of Autom., Tsinghua Univ., Beijing, China ; Changshui Zhang

Recently a graphic model method has been developed to reconstruct an image from a bag of square, non-overlapping patches. Markov Random Field (MRF) is used to model this type of jigsaw puzzle problem. In this model, each node represents a spatial position where patches are placed. Belief Propagation (BP) algorithm is used to solve the model. BP naturally fulfills the fact that each node should be assigned a patch with probability one. However, the fact that all patches should be equally used in the reconstructed image with probability one is neglected. As a result, there is little chance for some patches to be used in the reconstructed image. In this paper, we propose a Co-Normalization method to encourage equal treatment toward patches and nodes. Our method naturally yields a new update formula for the exclusivity term introduced by previous work. This term requires each patch to be used only once in the reconstructed image. Experiments show that our method preserves exclusivity term's requirement and adds a new requirement of equal usage of patches. Image reconstruction results show that our method solves the jigsaw puzzle problem much better.

Published in:

Digital Signal Processing (DSP), 2011 17th International Conference on

Date of Conference:

6-8 July 2011