Sciweavers

620 search results - page 28 / 124
» A Simple and Fast Min-cut Algorithm
Sort
View
ICANN
2005
Springer
15 years 7 months ago
Fast Color-Based Object Recognition Independent of Position and Orientation
Small mobile robots typically have little on-board processing power for time-consuming vision algorithms. Here we show how they can quickly extract very dense yet highly useful inf...
Martijn van de Giessen, Jürgen Schmidhuber
AMR
2006
Springer
138views Multimedia» more  AMR 2006»
15 years 5 months ago
Fast Structuring of Large Television Streams Using Program Guides
An original task of structuring and labeling large television streams is tackled in this paper. Emphasis is put on simple and efficient methods to detect precise boundaries of prog...
Xavier Naturel, Guillaume Gravier, Patrick Gros
COR
2004
146views more  COR 2004»
15 years 1 months ago
An exact algorithm for the robust shortest path problem with interval data
The robust deviation shortest path problem with interval data is studied in this paper. After the formulation of the problem in mathematical terms, an exact algorithm, based on a ...
Roberto Montemanni, Luca Maria Gambardella
RAS
2010
106views more  RAS 2010»
15 years 11 days ago
A developmental algorithm for ocular-motor coordination
This paper presents a model of ocular-motor development, inspired by ideas and data from developmental psychology. The learning problem concerns the growth of the transform betwee...
F. Chao, M. H. Lee, J. J. Lee
CVPR
2007
IEEE
16 years 4 months ago
Efficient Sampling of Disparity Space for Fast And Accurate Matching
A simple stereo matching algorithm is proposed that visits only a small fraction of disparity space in order to find a semi-dense disparity map. It works by growing from a small s...
Jan Cech, Radim Sára