Automatic constraint detection for 2D layout regularization.

H Jiang Liangliang Nan D Yan W Dong X Zhang P Wonka

Optimization and Control mathscidoc:1912.43137

IEEE Transactions on Visualization and Computer Graphics, 2015.9
In this paper, we address the problem of constraint detection for layout regularization. The layout we consider is a set of two-dimensional elements where each element is represented by its bounding box. Layout regularization is important in digitizing plans or images, such as floor plans and facade images, and in the improvement of user-created contents, such as architectural drawings and slide layouts. To regularize a layout, we aim to improve the input by detecting and subsequently enforcing alignment, size, and distance constraints between layout elements. Similar to previous work, we formulate layout regularization as a quadratic programming problem. In addition, we propose a novel optimization algorithm that automatically detects constraints. We evaluate the proposed framework using a variety of input layouts from different applications. Our results demonstrate that our method has superior performance to
No keywords uploaded!
[ Download ] [ 2019-12-21 11:24:44 uploaded by liangliangnan ] [ 109 downloads ] [ 0 comments ]
@inproceedings{h2015automatic,
  title={Automatic constraint detection for 2D layout regularization.},
  author={H Jiang, Liangliang Nan, D Yan, W Dong, X Zhang, and P Wonka},
  url={http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20191221112444993256697},
  booktitle={IEEE Transactions on Visualization and Computer Graphics},
  year={2015},
}
H Jiang, Liangliang Nan, D Yan, W Dong, X Zhang, and P Wonka. Automatic constraint detection for 2D layout regularization.. 2015. In IEEE Transactions on Visualization and Computer Graphics. http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20191221112444993256697.
Please log in for comment!
 
 
Contact us: office-iccm@tsinghua.edu.cn | Copyright Reserved