Concept

Kernel density estimation

Related publications (186)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Cellular biocomposites from polylactide and microfibrillated cellulose

Pierre-Etienne Bourban, John Christopher Plummer, Razvan Cristian Neagu, Carole Boissard

This paper describes the production of "green" microfibrillated cellulose-reinforced polylactide cellular biocomposites using a wet mixing technique combined with super-critical carbon dioxide foaming. The effect of composition on the morphology, density a ...

SAGE Publications2012

Deep Learning via Semi-Supervised Embedding

Ronan Collobert

We show how nonlinear embedding algorithms popular for use with "shallow" semi-supervised learning techniques such as kernel methods can be easily applied to deep multi-layer architectures, either as a regularizer at the output layer, or on each layer of t ...

Springer2012

Integration of Urban Structures in Point Process Analysis

Loïc Gasser

Traditionally, spatial analysis of point pattern has been mostly focused on Euclidean space. As many human related phenomena take place on a network, the assumption of a continuous isotropic space fails to describe events which actually occur on a one-dime ...

2011

Learning parameterized histogram kernels on the simplex manifold for image and action classification

Vitaly Henry Ablavsky

State-of-the-art image and action classification systems often employ vocabulary-based representations. The classification accuracy achieved with such vocabulary-based representations depends significantly on the chosen histogram-distance. In particular, w ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Context models on sequences of covers

Christos Dimitrakakis

We present a class of models that, via a simple construction, enables exact, incremental, non-parametric, polynomial-time, Bayesian inference of conditional measures. The approach relies upon creating a sequence of covers on the conditioning variable and m ...

2011

Computational Criminology

Vincent Etter

In this report, we present our work done in spring 2011 on the UK crimes dataset. This dataset was first released in December 2010, and contains reports of crimes committed in England and Wales, with their type and location. We first perform some explorato ...

2011

Multispectral SIFT for Scene Category Recognition

Sabine Süsstrunk, Matthew Brown

We use a simple modification to a conventional SLR camera to capture images of several hundred scenes in colour (RGB) and near-infrared (NIR). We show that the addition of near-infrared information leads to significantly improved performance in a scene-rec ...

IEEE Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Image Denoising in Mixed Poisson-Gaussian Noise

Michaël Unser, Thierry Blu, Florian Luisier

We propose a general methodology (PURE-LET) to design and optimize a wide class of transform-domain thresholding algorithms for denoising images corrupted by mixed Poisson-Gaussian noise. We express the denoising process as a linear expansion of thresholds ...

Institute of Electrical and Electronics Engineers2011

On Variable Density Compressive Sampling

Pierre Vandergheynst, Yves Wiaux, Gilles Puy

We advocate an optimization procedure for variable density sampling in the context of compressed sensing. In this perspective, we introduce a minimization problem for the coherence between the sparsity and sensing bases, whose solution provides an optimize ...

Institute of Electrical and Electronics Engineers2011

Convolution on the n-Sphere With Application to PDF Modeling

Ivan Dokmanic

In this paper, we derive an explicit form of the convolution theorem for functions on an n-sphere. Our motivation comes from the design of a probability density estimator for n-dimensional random vectors. We propose a probability density function (pdf) est ...

Institute of Electrical and Electronics Engineers2010