196 search results - page 27 / 40 » Globally optimal bilinear programming for computer vision ap... |
CVPR
2007
IEEE
14 years 1 months ago
2007
IEEE
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
ISPD
2004
ACM
14 years 27 days ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
SCALESPACE
2007
Springer
14 years 1 months ago
2007
Springer
This paper introduces a new framework for two-phase image segmentation, namely the Fuzzy Region Competition. A generic formulation is developed that extends in a convex way several...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
Traditional image mosaicing usually relies on rigid image transformations. In many medical applications, however, tissue deformation during image acquisition or 3D parallax effect...