Sciweavers

718 search results - page 109 / 144
» Coloring quasi-line graphs
Sort
View
ICMCS
2007
IEEE
203views Multimedia» more  ICMCS 2007»
15 years 8 months ago
Efficient Video Object Segmentation by Graph-Cut
Segmentation of video objects from background is a popular computer vision problem and has many important applications. Most existing methods are either computationally expensive ...
Jinjun Wang, Wei Xu, Shenghuo Zhu, Yihong Gong
SCIA
2007
Springer
153views Image Analysis» more  SCIA 2007»
15 years 8 months ago
Graph Cut Based Segmentation of Soft Shadows for Seamless Removal and Augmentation
Abstract. This paper introduces a new concept within shadow segmentation for usage in shadow removal and augmentation through construction of a multiplicity alpha overlay shadow mo...
Michael Nielsen, Claus B. Madsen
PR
2000
153views more  PR 2000»
15 years 1 months ago
A region-level motion-based graph representation and labeling for tracking a spatial image partition
This paper addresses two image sequence analysis issues under a common framework. These tasks are, "rst, motion-based segmentation and second, updating and tracking over time...
Marc Gelgon, Patrick Bouthemy
BMVC
2010
14 years 9 months ago
Saliency Segmentation based on Learning and Graph Cut Refinement
Saliency detection is a well researched problem in computer vision. In previous work, most of the effort is spent on manually devising a saliency measure. Instead we propose a sim...
Paria Mehrani, Olga Veksler
JCT
2008
76views more  JCT 2008»
15 years 1 months ago
Quadruple systems with independent neighborhoods
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
Zoltán Füredi, Dhruv Mubayi, Oleg Pikh...