Sciweavers

1984 search results - page 38 / 397
» The colourful feasibility problem
Sort
View
ECCV
2002
Springer
1127views Computer Vision» more  ECCV 2002»
14 years 11 months ago
Removing Shadows from Images
Illumination conditions cause problems for many computer vision algorithms. Inparticular, shadows in an image can cause segmentation, tracking, or recognition algorithms to fail. I...
Graham D. Finlayson, Steven D. Hordley, Mark S. Dr...
VISUALIZATION
1997
IEEE
14 years 2 months ago
Volume rendering of abdominal aortic aneurysms
Volume rendering is a valuable and important technique for scientific visualization. One well known application area is the reconstruction and visualization of output from medica...
Roger C. Tam, Christopher G. Healey, Borys Flak, P...
AIPS
2004
13 years 11 months ago
Generating Robust Schedules through Temporal Flexibility
This paper considers the problem of generating partial order schedules (
Nicola Policella, Stephen F. Smith, Amedeo Cesta, ...
JGO
2008
53views more  JGO 2008»
13 years 10 months ago
Smoothing by mollifiers. Part II: nonlinear optimization
This article complements the paper [7], where we showed that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a leve...
Hubertus Th. Jongen, Oliver Stein
IPM
2008
90views more  IPM 2008»
13 years 10 months ago
Local relational string and mutual matching for image retrieval
Exhibiting new features and likely related matching techniques to efficiently retrieve images from databases remains an open problem. This paper is first devoted to such a novel d...
Adel Hafiane, Bertrand Zavidovique