90 search results - page 8 / 18 » Combinatorial Benders' Cuts |
4OR
2010
13 years 7 months ago
2010
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
PAMI
2010
13 years 5 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...
CVPR
2008
IEEE
2008
IEEE
Discovering class specific composite features through discriminative sampling with Swendsen-Wang Cut
14 years 9 months ago
This paper proposes a novel approach to discover a set of class specific "composite features" as the feature pool for the detection and classification of complex objects...
ACCV
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. Image matting and segmentation are two closely related topics that concern extracting the foreground and background of an image. While the methods based on global optimiz...