Automatic Constraint Detection for 2D Layout Regularization

Haiyong Jiang, Liangliang Nan, Dong Ming Yan, Weiming Dong, Xiaopeng Zhang, Peter Wonka

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

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 the state of the art.

Original languageEnglish (US)
Article number7272131
Pages (from-to)1933-1944
Number of pages12
JournalIEEE Transactions on Visualization and Computer Graphics
Volume22
Issue number8
DOIs
StatePublished - Aug 1 2016
Externally publishedYes

Fingerprint

Facades
Quadratic programming

Keywords

  • constraint analysis
  • constraint detection
  • Layout regularization
  • linear integer programming

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software
  • Computer Vision and Pattern Recognition
  • Signal Processing

Cite this

Jiang, H., Nan, L., Yan, D. M., Dong, W., Zhang, X., & Wonka, P. (2016). Automatic Constraint Detection for 2D Layout Regularization. IEEE Transactions on Visualization and Computer Graphics, 22(8), 1933-1944. [7272131]. https://doi.org/10.1109/TVCG.2015.2480059

Automatic Constraint Detection for 2D Layout Regularization. / Jiang, Haiyong; Nan, Liangliang; Yan, Dong Ming; Dong, Weiming; Zhang, Xiaopeng; Wonka, Peter.

In: IEEE Transactions on Visualization and Computer Graphics, Vol. 22, No. 8, 7272131, 01.08.2016, p. 1933-1944.

Research output: Contribution to journalArticle

Jiang, H, Nan, L, Yan, DM, Dong, W, Zhang, X & Wonka, P 2016, 'Automatic Constraint Detection for 2D Layout Regularization', IEEE Transactions on Visualization and Computer Graphics, vol. 22, no. 8, 7272131, pp. 1933-1944. https://doi.org/10.1109/TVCG.2015.2480059
Jiang, Haiyong ; Nan, Liangliang ; Yan, Dong Ming ; Dong, Weiming ; Zhang, Xiaopeng ; Wonka, Peter. / Automatic Constraint Detection for 2D Layout Regularization. In: IEEE Transactions on Visualization and Computer Graphics. 2016 ; Vol. 22, No. 8. pp. 1933-1944.
@article{8a166976fdfb4787b8dab80096bf19a8,
title = "Automatic Constraint Detection for 2D Layout Regularization",
abstract = "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 the state of the art.",
keywords = "constraint analysis, constraint detection, Layout regularization, linear integer programming",
author = "Haiyong Jiang and Liangliang Nan and Yan, {Dong Ming} and Weiming Dong and Xiaopeng Zhang and Peter Wonka",
year = "2016",
month = "8",
day = "1",
doi = "10.1109/TVCG.2015.2480059",
language = "English (US)",
volume = "22",
pages = "1933--1944",
journal = "IEEE Transactions on Visualization and Computer Graphics",
issn = "1077-2626",
publisher = "IEEE Computer Society",
number = "8",

}

TY - JOUR

T1 - Automatic Constraint Detection for 2D Layout Regularization

AU - Jiang, Haiyong

AU - Nan, Liangliang

AU - Yan, Dong Ming

AU - Dong, Weiming

AU - Zhang, Xiaopeng

AU - Wonka, Peter

PY - 2016/8/1

Y1 - 2016/8/1

N2 - 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 the state of the art.

AB - 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 the state of the art.

KW - constraint analysis

KW - constraint detection

KW - Layout regularization

KW - linear integer programming

UR - http://www.scopus.com/inward/record.url?scp=84977097748&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84977097748&partnerID=8YFLogxK

U2 - 10.1109/TVCG.2015.2480059

DO - 10.1109/TVCG.2015.2480059

M3 - Article

AN - SCOPUS:84977097748

VL - 22

SP - 1933

EP - 1944

JO - IEEE Transactions on Visualization and Computer Graphics

JF - IEEE Transactions on Visualization and Computer Graphics

SN - 1077-2626

IS - 8

M1 - 7272131

ER -