Sciweavers

3091 search results - page 34 / 619
» The Color Between Two Others
Sort
View
ICANN
2005
Springer
15 years 4 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
95
Voted
LCTRTS
2007
Springer
15 years 5 months ago
Scratchpad allocation for data aggregates in superperfect graphs
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
Lian Li 0002, Quan Hoang Nguyen, Jingling Xue
186
Voted
SIGGRAPH
1996
ACM
15 years 3 months ago
Blue Screen Matting
A classical problem of imaging--the matting problem--is separation of a non-rectangular foreground image from a (usually) rectangular background image--for example, in a film fram...
Alvy Ray Smith, James F. Blinn
APPROX
2004
Springer
149views Algorithms» more  APPROX 2004»
15 years 4 months ago
Edge Coloring with Delays
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on o...
Noga Alon, Vera Asodi
ICCV
2005
IEEE
15 years 4 months ago
Inference of Non-Overlapping Camera Network Topology by Measuring Statistical Dependence
We present an approach for inferring the topology of a camera network by measuring statistical dependence between observations in different cameras. Two cameras are considered con...
Kinh Tieu, Gerald Dalley, W. Eric L. Grimson