Sciweavers

443 search results - page 47 / 89
» Testing Hypergraph Coloring
Sort
View
JEI
2002
88views more  JEI 2002»
13 years 8 months ago
Natural image database and its use for scene illuminant estimation
This paper describes a database collecting natural color images, called the Natural Image Database, and shows how it is used for illuminant estimation problems. First, we present ...
Shoji Tominaga
SMC
2010
IEEE
198views Control Systems» more  SMC 2010»
13 years 7 months ago
Fast tracking of natural textures using fractal snakes
Abstract — The natural environments that robotic applications often encounter can present difficult problems for imagebased task execution. Prior efforts have used both grayscale...
Christopher E. Smith
ICMCS
2009
IEEE
150views Multimedia» more  ICMCS 2009»
13 years 6 months ago
Analysis of appearance features for human matching between different fields of view
Human matching between different fields of view is a difficult problem in intelligent video surveillance; whereas fusing multiple features has become a strong tool to solve it. In...
Xiaowei Lv, Qing-Jie Kong, Fei Weng, Yuncai Liu
ICPR
2004
IEEE
14 years 9 months ago
Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
Fred W. DePiero
AI
2005
Springer
13 years 8 months ago
: Compiling problem specifications into SAT
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
Marco Cadoli, Andrea Schaerf