Rectangle fitting via quadratic programming

@article{Yang2015RectangleFV,
  title={Rectangle fitting via quadratic programming},
  author={Jingyu Yang and Zhongyu Jiang},
  journal={2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)},
  year={2015},
  pages={1-6}
}
This paper investigates rectangle fitting via optimization approaches. We summarize two basic requirements for rectangular fitting, leading to a basic model that are non-convex and difficult to attack. To avoid potential trapping of local minima, we extend the basic model with centroid and orientation constraints into a quadratic programming. To achieve reliable fitting from noisy points, slack variables are introduced to soften hard constraints. The scalability to problem size are further… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Fitting Noisy Data to a Circle: A Simple Iterative Maximum Likelihood Approach

2011 IEEE International Conference on Communications (ICC) • 2011

, and A . Blake , " Grabcut : Interactive fore ­ ground extraction using iterated graph cuts

Rother. V. Kolmogorov
-1

Best jilling rectangles

F. Hurtado M. Abellanas, C. Icking, L. Ma, B. Palop, P. A. Ramos
Femuniv . • Fachbereich Informatik .

Similar Papers

Loading similar papers…