355 search results - page 46 / 71 » From Moving Edges to Moving Regions |
ARVLSI
1999
IEEE
13 years 12 months ago
1999
IEEE
We describe a multi-chip CMOS VLSI visual motion processing system which combines analog circuitry with an asynchronous digital interchip communications protocol to allow more com...
VISUALIZATION
1998
IEEE
13 years 12 months ago
1998
IEEE
Conventional wisdom says that in order to produce high-quality simplified polygonal models, one must retain and use information about the original model during the simplification ...
DAM
2008
13 years 7 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
: Cross-match spatially clusters and organizes several astronomical point-source measurements from one or more surveys. Ideally, each object would be found in each survey. Unfortun...
PAMI
2008
13 years 7 months ago
2008
The Expectation Maximization (EM) algorithm is widely used for learning finite mixture models despite its greedy nature. Most popular model-based clustering techniques might yield...