Sciweavers

Share
6 search results - page 1 / 2
» Polytope kernel density estimates on Delaunay graphs
Sort
View
ICASSP
2011
IEEE
10 years 3 months ago
Polytope kernel density estimates on Delaunay graphs
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...
Erhan Bas, Deniz Erdogmus
CG
2004
Springer
10 years 11 months ago
Point cloud surfaces using geometric proximity graphs
We present a new definition of an implicit surface over a noisy point cloud, based on the weighted least squares approach. It can be evaluated very fast, but artifacts are signifi...
Jan Klein, Gabriel Zachmann
COLT
2010
Springer
10 years 10 months ago
Forest Density Estimation
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
Anupam Gupta, John D. Lafferty, Han Liu, Larry A. ...
AAAI
2007
11 years 2 months ago
A Kernel Approach to Comparing Distributions
We describe a technique for comparing distributions without the need for density estimation as an intermediate step. Our approach relies on mapping the distributions into a Reprod...
Arthur Gretton, Karsten M. Borgwardt, Malte J. Ras...
CVPR
2007
IEEE
12 years 1 months ago
A Graph Cut Approach to Image Segmentation in Tensor Space
This paper proposes a novel method to apply the standard graph cut technique to segmenting multimodal tensor valued images. The Riemannian nature of the tensor space is explicitly...
Allen Tannenbaum, James G. Malcolm, Yogesh Rathi
books