Sciweavers

565 search results - page 58 / 113
» Colorization by Matrix Completion
Sort
View
EJC
2007
13 years 8 months ago
Online balanced graph avoidance games
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
Martin Marciniszyn, Dieter Mitsche, Milos Stojakov...
FCT
2005
Springer
14 years 2 months ago
Exact Algorithms for Graph Homomorphisms
Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if ...
Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch
ICIAP
2003
ACM
14 years 8 months ago
A feature-based face recognition system
A completely automatic face recognition system is presented. The method works on color and gray level images: after having localized the face and the facial features, it determine...
Paola Campadelli, Raffaella Lanzarotti, C. Savazzi
ICMCS
2007
IEEE
140views Multimedia» more  ICMCS 2007»
14 years 3 months ago
Suspicious Behavior Detection in Public Transport by Fusion of Low-Level Video Descriptors
Recently great interest has been shown in the visual surveillance of public transportation systems. The challenge is the automated analysis of passenger’s behaviors with a set o...
Dejan Arsic, Björn Schuller, Gerhard Rigoll
AC
2003
Springer
14 years 1 months ago
A Face Recognition System Based on Local Feature Characterization
A completely automatic face recognition system is presented. The method works on color and gray level images: after having localized the face and the facial features, it determines...
Paola Campadelli, Raffaella Lanzarotti