Abstract:
A regular wallpaper pattern can be generated by two basis vectors, (t1, t2). The lattice generated by (t1, t2) divides a 2D plane into identical parallelograms, called tiles. Given the natural match between tiles/basis-vectors in wallpaper theory, and observable nodes/edges in probabilistic graph models, we can encode domain knowledge from wallpaper theory into the observation model and pairwise compatibility function of a degree-4 Markov Random Field (MRF). Belief Propagation (BP) can then be used to locate a deformed lattice in an unsegmented image.
copied = false, 2000);
">
@conference{Park-2008-10109,
author = {Minwoo Park And Robert Collins And Yanxi Liu},
title = {Deformed Lattice Detection via Mean-Shift Belief Propagation},
booktitle = {Proceedings of (ECCV) European Conference on Computer Vision},
year = {2008},
month = {October},
pages = {474 - 485},
}
author = {Minwoo Park And Robert Collins And Yanxi Liu},
title = {Deformed Lattice Detection via Mean-Shift Belief Propagation},
booktitle = {Proceedings of (ECCV) European Conference on Computer Vision},
year = {2008},
month = {October},
pages = {474 - 485},
}