Results 1  10
of
5,889
Segmentation as MaximumWeight Independent Set
"... Given an ensemble of distinct, lowlevel segmentations of an image, our goal is to identify visually “meaningful ” segments in the ensemble. Knowledge about any specific objects and surfaces present in the image is not available. The selection of image regions occupied by objects is formalized as th ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
as the maximumweight independent set (MWIS) problem. MWIS is the heaviest subset of mutually nonadjacent nodes of an attributed graph. We construct such a graph from all segments in the ensemble. Then, MWIS selects maximally distinctive segments that together partition the image. A new MWIS algorithm
Multiobject tracking as maximum weight independent set
 In Proc. IEEE Conf. on Computer Vision and Pattern Recognition
, 2011
"... This paper addresses the problem of simultaneous tracking of multiple targets in a video. We first apply object detectors to every video frame. Pairs of detection responses from every two consecutive frames are then used to build a graph of tracklets. The graph helps transitively link the best match ..."
Abstract

Cited by 42 (1 self)
 Add to MetaCart
matching tracklets that do not violate hard and soft contextual constraints between the resulting tracks. We prove that this data association problem can be formulated as finding the maximumweight independent set (MWIS) of the graph. We present a new, polynomialtime MWIS algorithm, and prove
Clustering Aggregation as MaximumWeight Independent Set
"... We formulate clustering aggregation as a special instance of MaximumWeight Independent Set (MWIS) problem. For a given dataset, an attributed graph is constructed from the union of the input clusterings generated by different underlying clustering algorithms with different parameters. The vertices, ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We formulate clustering aggregation as a special instance of MaximumWeight Independent Set (MWIS) problem. For a given dataset, an attributed graph is constructed from the union of the input clusterings generated by different underlying clustering algorithms with different parameters. The vertices
A Variant of the Maximum Weight Independent Set Problem
, 2014
"... We study a natural extension of the Maximum Weight Independent Set Problem (MWIS), one of the most studied optimization problems in Graph algorithms. We are given a graph G = (V,E), a weight function w: V → R+, a budget function b: V → Z+, and a positive integer B. The weight (resp. budget) of a sub ..."
Abstract
 Add to MetaCart
We study a natural extension of the Maximum Weight Independent Set Problem (MWIS), one of the most studied optimization problems in Graph algorithms. We are given a graph G = (V,E), a weight function w: V → R+, a budget function b: V → Z+, and a positive integer B. The weight (resp. budget) of a
Message Passing for Maximum Weight Independent Set
"... Abstract—In this paper, we investigate the use of messagepassing algorithms for the problem of finding the maxweight independent set (MWIS) in a graph. First, we study the performance of the classical loopy maxproduct belief propagation. We show that each fixedpoint estimate of max product can be ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
Abstract—In this paper, we investigate the use of messagepassing algorithms for the problem of finding the maxweight independent set (MWIS) in a graph. First, we study the performance of the classical loopy maxproduct belief propagation. We show that each fixedpoint estimate of max product can
Messagepassing for Maximum Weight Independent Set
 In Advances in Neural Information Processing Systems (NIPS
, 2007
"... ar ..."
A Note on Greedy Algorithms for Maximum Weighted Independent Set Problem
"... In this paper, we consider three simple and natural greedy algorithms for the Maximum Weighted Independent Set problem. We show that two of them output an independent set of weight P v2V (G) W (v) d(v)+1 and the other outputs an independent set of weight P v2V (G) W (v) 2 P u2N + G ( ..."
Abstract

Cited by 39 (0 self)
 Add to MetaCart
In this paper, we consider three simple and natural greedy algorithms for the Maximum Weighted Independent Set problem. We show that two of them output an independent set of weight P v2V (G) W (v) d(v)+1 and the other outputs an independent set of weight P v2V (G) W (v) 2 P u2N + G
An Algorithm for the Maximum Weight Independent Set Problem on Outerstring Graphs *
"... Abstract Outerstring graphs are the intersection graphs of curves that lie inside a disk such that each curve intersects the boundary of the disk. Outerstring graphs are among the most general classes of intersection graphs studied. To date, no polynomial time algorithm is known for any of the clas ..."
Abstract
 Add to MetaCart
to the size of the graph. Given an outerstring graph and an intersection model consisting of polygonal arcs with a total of N segments, we develop an algorithm that solves the Maximum Weight Independent Set problem in O N 3 time. If the polygonal arcs are restricted to single segments, then outersegment
A BranchandPrice Approach for the Maximum Weight Independent Set Problem
, 2005
"... The maximum weight independent set problem (MWISP) is one of the most wellknown and wellstudied problems in combinatorial optimization. This paper presents a novel approach to solve MWISP exactly by decomposing the original graph into vertexinduced subgraphs. The approach solves MWISP for the or ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
The maximum weight independent set problem (MWISP) is one of the most wellknown and wellstudied problems in combinatorial optimization. This paper presents a novel approach to solve MWISP exactly by decomposing the original graph into vertexinduced subgraphs. The approach solves MWISP
Fast And Simple Approximation Algorithms for Maximum Weighted Independent Set of Links
"... Abstract—Finding a maximumweighted independent set of links is a fundamental problem in wireless networking and has broad applications in various wireless link scheduling problems. Under protocol interference model, it is NPhard even when all nodes have uniform (and fixed) interference radii and t ..."
Abstract
 Add to MetaCart
Abstract—Finding a maximumweighted independent set of links is a fundamental problem in wireless networking and has broad applications in various wireless link scheduling problems. Under protocol interference model, it is NPhard even when all nodes have uniform (and fixed) interference radii
Results 1  10
of
5,889