212 search results - page 7 / 43 » On convex formulation of the floorplan area minimization pro... |
AAAI
1992
13 years 9 months ago
1992
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
SCALESPACE
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper we provide a method to find global minimizers of certain non-convex 2-phase image segmentation problems. This is achieved by formulating a convex minimizat...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We consider the problem of globally minimizing the sum of many rational functions over a given compact semialgebraic set. The number of terms can be large (10 to 100), the degree ...
MMSP
2008
IEEE
14 years 2 months ago
2008
IEEE
—This paper addresses the problem of dense disparity estimation from a pair of color stereo images. Based on a convex set theoretic formulation, the stereo matching problem is ca...
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...