Sciweavers

437 search results - page 61 / 88
» A New Method for Computing Optical Flow
Sort
View
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
14 years 5 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Jeff Erickson
CVPR
2005
IEEE
14 years 10 months ago
Segmentation of Edge Preserving Gradient Vector Flow: An Approach Toward Automatically Initializing and Splitting of Snakes
Active contours or snakes have been extensively utilized in handling image segmentation and classification problems. In traditional active contour models, snake initialization is ...
Chunming Li, Jundong Liu, Martin D. Fox
CVPR
2008
IEEE
14 years 10 months ago
Motion from blur
Motion blur retains some information about motion, based on which motion may be recovered from blurred images. This is a difficult problem, as the situations of motion blur can be...
Shengyang Dai, Ying Wu
ICCV
2001
IEEE
14 years 9 months ago
A Background Model Initialization Algorithm for Video Surveillance
Many motion detection and tracking algorithms rely on the process of background subtraction, a technique which detects changes from a model of the background scene. We present a n...
Daniel Gutchess, Miroslav Trajkovic, Eric Cohen-So...
GECCO
2007
Springer
119views Optimization» more  GECCO 2007»
14 years 2 months ago
Optimising the flow of experiments to a robot scientist with multi-objective evolutionary algorithms
A Robot Scientist is a physically implemented system that applies artificial intelligence to autonomously discover new knowledge through cycles of scientific experimentation. Ad...
Emma Byrne