Title :
Solve JIGSAW puzzle problems with Co-Normalization
Author :
Lei, Shaoze ; Zhang, Changshui
Author_Institution :
Dept. of Autom., Tsinghua Univ., Beijing, China
Abstract :
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.
Keywords :
Markov processes; belief networks; computer graphics; games of skill; image reconstruction; BP algorithm; MRF; Markov random field; bag of square; belief propagation algorithm; co-normalization; graphic model method; image reconstruction; jigsaw puzzle problems; nonoverlapping patches; probability one; spatial position; Image resolution; Co-Normalization; Normalization vector; coarse to fine loopy BP; marginal distribution matrix; node-oriented normalization;
Conference_Titel :
Digital Signal Processing (DSP), 2011 17th International Conference on
Conference_Location :
Corfu
Print_ISBN :
978-1-4577-0273-0
DOI :
10.1109/ICDSP.2011.6004872