1722 search results - page 83 / 345 » On the sample mean of graphs |
147
click to vote
ICIP
2007
IEEE
16 years 15 days ago
2007
IEEE
The geometric features of images, such as edges, are difficult to represent. When a redundant transform is used for their extraction, the compression challenge is even more dif...
154
click to vote
CCCG
2008
15 years 7 months ago
2008
Given a collection of points representing geographic data we consider the task of delineating boundaries based on the features of the points. Assuming that the features are binary...
142
click to vote
ICRA
2002
IEEE
15 years 11 months ago
2002
IEEE
As a general framework to determine a collision-free feedback motion strategies, the Random Neighborhood Graph (RNG) approach [19] defines a global navigation function over an ap...
189
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...
140
click to vote
ICRA
2005
IEEE
15 years 11 months ago
2005
IEEE
— In this paper we address the problem of generating a motion strategy to find an object in a known 3-D environment as quickly as possible on average. We use a sampling scheme t...