Sciweavers

666 search results - page 57 / 134
» Unbalanced Graph Cuts
Sort
View

Lecture Notes
2770views
15 years 6 months ago
Lectures on Medical Image Analysis
Easy and neat set of lecture notes in Medical Image Analysis taught at West Virginia University by Prof. Tim McGraw. It covers several famous computer vision techniques such as act...
Tim McGraw
ICPR
2008
IEEE
14 years 11 months ago
Segmentation by combining parametric optical flow with a color model
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...
Adrian Ulges, Thomas M. Breuel
ENDM
2008
82views more  ENDM 2008»
13 years 10 months ago
Finding Folkman Numbers via MAX CUT Problem
In this note we report on our recent work, still in progress, regarding Folkman numbers. Let f(2, 3, 4) denote the smallest integer n such that there exists a K4
Andrzej Dudek, Vojtech Rödl
ENDM
2007
114views more  ENDM 2007»
13 years 10 months ago
The Connectivity of addition Cayley graphs
For any finite abelian group G and any subset S ⊆ G, we determine the connectivity of the addition Cayley graph induced by S on G. Moreover, we show that if this graph is not c...
David J. Grynkiewicz, Vsevolod F. Lev, Oriol Serra
CVPR
2012
IEEE
12 years 15 days ago
Segmentation using superpixels: A bipartite graph partitioning approach
Grouping cues can affect the performance of segmentation greatly. In this paper, we show that superpixels (image segments) can provide powerful grouping cues to guide segmentation...
Zhenguo Li, Xiao-Ming Wu, Shih-Fu Chang