Sciweavers

999 search results - page 126 / 200
» Finding shapes in a set of points
Sort
View
CVPR
2004
IEEE
15 years 1 months ago
Efficient Graphical Models for Processing Images
Graphical models are powerful tools for processing images. However, the large dimensionality of even local image data poses a difficulty: representing the range of possible graphi...
Marshall F. Tappen, Bryan C. Russell, William T. F...
CAD
2007
Springer
14 years 9 months ago
Generating strictly non-self-overlapping structured quadrilateral grids
In this paper, we present a BPM (Bézier Patch Mapping) algorithm which generates a strictly non-self-overlapping structured quadrilateral grid in a given four-sided planar region...
Hongwei Lin, Kai Tang, Ajay Joneja, Hujun Bao
CORR
2000
Springer
67views Education» more  CORR 2000»
14 years 9 months ago
The dynamics of iterated transportation simulations
Abstract: Iterating between a router and a traffic micro-simulation is an increasibly accepted method for doing traffic assignment. This paper, after pointing out that the analytic...
Kai Nagel, Marcus Rickert, Patrice M. Simon, Marti...
ACSC
2007
IEEE
15 years 1 months ago
Segmentation and Border Identification of Cells in Images of Peripheral Blood Smear Slides
We present an unsupervised blood cell segmentation algorithm for images taken from peripheral blood smear slides. Unlike prior algorithms the method is fast; fully automated; find...
Nicola Ritter, James R. Cooper
ECAI
2010
Springer
14 years 11 months ago
Sound and Complete Landmarks for And/Or Graphs
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...
Emil Keyder, Silvia Richter, Malte Helmert