Sciweavers

185 search results - page 14 / 37
» A Simple Min Cut Algorithm
Sort
View
CRV
2008
IEEE
183views Robotics» more  CRV 2008»
14 years 2 months ago
Robust Real-Time Bi-Layer Video Segmentation Using Infrared Video
In this paper, we propose a novel method for the automatic segmentation of a foreground layer from a natural scene in real time by fusing infrared, color and edge information. Thi...
Qiong Wu, Pierre Boulanger, Walter F. Bischof
ICPR
2008
IEEE
14 years 8 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
EOR
2007
73views more  EOR 2007»
13 years 7 months ago
Complete and robust no-fit polygon generation for the irregular stock cutting problem
The no-fit polygon is a construct that can be used between pairs of shapes for fast and efficient handling of geometry within irregular two-dimensional stock cutting problems. Pre...
Edmund K. Burke, Robert S. R. Hellier, Graham Kend...
CAGD
2005
113views more  CAGD 2005»
13 years 7 months ago
Fast degree elevation and knot insertion for B-spline curves
We give a new, simple algorithm for simultaneous degree elevation and knot insertion for B-spline curves. The method is based on the simple approach of computing derivatives using...
Qi-Xing Huang, Shi-Min Hu, Ralph R. Martin
ECCC
2000
93views more  ECCC 2000»
13 years 7 months ago
Improved Approximation of MAX-CUT on Graphs of Bounded Degree
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
Uriel Feige, Marek Karpinski, Michael Langberg