299 search results - page 4 / 60 » A Convex Relaxation Approach for Computing Minimal Partition... |
CVPR
2008
IEEE
14 years 7 months ago
2008
IEEE
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
CVPR
2010
IEEE
13 years 11 months ago
2010
IEEE
We present an interactive approach for segmenting thin volumetric structures. The proposed segmentation model is based on an anisotropic weighted Total Variation energy with a glo...
EMMCVPR
2005
Springer
13 years 11 months ago
2005
Springer
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
CVPR
2010
IEEE
14 years 18 days ago
2010
IEEE
We present an interactive approach for segmenting thin volumetric structures. The proposed segmentation model is based on an anisotropic weighted Total Variation energy with a glob...
ISPD
2000
ACM
13 years 10 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...