26 search results - page 3 / 6 » Incremental Maximum Flows for Fast Envelope Computation |
ACCV
2010
Springer
13 years 2 months ago
2010
Springer
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
ICNP
1999
IEEE
13 years 11 months ago
1999
IEEE
This paper introduces a scalable maxmin flow control protocol which guarantees the minimum rate for each connection-oriented flow without requiring per-flow information. The proto...
ICPR
2008
IEEE
14 years 8 months ago
2008
IEEE
The paper presents an incremental method for accurate iris segmentation. Firstly, observing the characteristics of iris images, we search for a square region that contains pupil w...
ICCAD
2001
IEEE
14 years 4 months ago
2001
IEEE
Abstract: We propose an effective algorithm for power optimization in behavioral synthesis. In previous work, it has been shown that several hardware allocation/binding problems fo...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...