Sciweavers

1749 search results - page 58 / 350
» Conditional colorings of graphs
Sort
View
ICPR
2008
IEEE
16 years 7 months ago
Silhouette extraction based on iterative spatio-temporal local color transformation and graph-cut segmentation
We propose an iterative scheme of spatio-temporal local color transformation of background and graphcut segmentation for silhouette extraction. Given an initial background subtrac...
Yasushi Makihara, Yasushi Yagi
ICPR
2002
IEEE
16 years 7 months ago
3D Real-Time Head Tracking Fusing Color Histograms and Stereovision
A system that performs the tracking of a human head in 3D in real time is presented. The head shape is modeled by an ellipse with a trained color histogram of skin and hair sample...
Francesc Moreno, Adrià Tarrida, Juan Andrad...
DAM
2007
79views more  DAM 2007»
15 years 6 months ago
Necessary conditions for multistationarity in discrete dynamical systems
R. Thomas conjectured, twenty years ago, that the presence of a positive circuit in the interaction graph of a dynamical system is a necessary condition for the presence of severa...
Adrien Richard, Jean-Paul Comet
CPAIOR
2007
Springer
16 years 13 days ago
Necessary Condition for Path Partitioning Constraints
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...
Nicolas Beldiceanu, Xavier Lorca
BVAI
2007
Springer
16 years 13 days ago
Classification with Positive and Negative Equivalence Constraints: Theory, Computation and Human Experiments
We tested the efficiency of category learning when participants are provided only with pairs of objects, known to belong either to the same class (Positive Equivalence Constraints ...
Rubi Hammer, Tomer Hertz, Shaul Hochstein, Daphna ...