138 search results - page 5 / 28 » Efficient Planar Graph Cuts with Applications in Computer Vi... |
ECCV
2010
Springer
13 years 8 months ago
2010
Springer
Many methods for object recognition, segmentation, etc., rely on tessellation of an image into "superpixels". A superpixel is an image patch which is better aligned with ...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
In recent years, segmentation with graph cuts is increasingly used for a variety of applications, such as photo/video editing, medical image processing, etc. One of the most common...
ICPR
2008
IEEE
14 years 9 months ago
2008
IEEE
We present a simple but efficient model for object segmentation in video scenes that integrates motion and color information in a joint probabilistic framework. Optical flow is mo...
CVPR
1997
IEEE
14 years 1 days ago
1997
IEEE
ÐWe propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and their consistencies in the image data, our approach ...
EVOW
2004
Springer
14 years 1 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...