Publication

Adaptive Kernel Matching Pursuit for Pattern Classification

Related publications (32)

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.

Sparsity averaging for radio-interferometric imaging

Yves Wiaux, Rafael Eduardo Carrillo Rangel, Jason Douglas McEwen

We propose a novel regularization method for compressive imaging in the context of the CS theory with coherent and redundant dictionaries. The approach relies on the conjecture that natural images exhibit strong average sparsity over multiple coherent fram ...

2013

Sparse Distributed Learning Based on Diffusion Adaptation

Ali H. Sayed

This article proposes diffusion LMS strategies for distributed estimation over adaptive networks that are able to exploit sparsity in the underlying system model. The approach relies on convex regularization, common in compressive sensing, to enhance the d ...

IEEE2013

Compressive Sampling Strategies for Multichannel Signals

Mohammad Golbabaee

Over the past decade researches in applied mathematics, signal processing and communications have introduced compressive sampling (CS) as an alternative to the Shannon sampling theorem. The two key observations making CS theory widely applicable to numerou ...

EPFL2012

Are Sparse Representations Really Relevant for Image Classification?

Vincent Lepetit, Roberto Rigamonti, Matthew Brown

Recent years have seen an increasing interest in sparse representations for image classiﬁcation and object recognition, probably motivated by evidence from the analysis of the primate visual cortex. It is still unclear, however, whether or not sparsity hel ...

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

Is Sparsity Really Relevant for Image Classification?

Vincent Lepetit, Roberto Rigamonti, Matthew Brown

Recent years have seen an increasing interest in sparseness constraints for image classiﬁcation and object recognition, probably motivated by the evidence of sparse representations internal in the primate visual cortex. It is still unclear, however, whethe ...

2010

Distributed Sensor Perception via Sparse Representation

Michael Christoph Gastpar

In this paper, sensor network scenarios are considered where the underlying signals of interest exhibit a degree of sparsity, which means that in an appropriate basis, they can be expressed in terms of a small number of nonzero coefficients. Following the ...

2010

Geometry-aware analysis of high-dimensional visual information sets

Effrosyni Kokiopoulou

Over the past few decades we have been experiencing a data explosion; massive amounts of data are increasingly collected and multimedia databases, such as YouTube and Flickr, are rapidly expanding. At the same time rapid technological advancements in mobil ...

EPFL2009

A Large Margin Algorithm for Forced Alignment

We describe and analyze a discriminative algorithm for learning to align a phoneme sequence of a speech utterance with its acoustical signal counterpart by predicting a timing sequence representing the phoneme start times. In contrast to common HMM-based a ...

John Wiley and Sons2009

Improved Phone Posterior Estimation Through k-NN and MLP-Based Similarity

Benjamin Picart

In this work, we investigate the possible use of k-nearest neighbour (kNN) classifiers to perform frame-based acoustic phonetic classification, hence replacing Gaussian Mixture Models (GMM) or MultiLayer Perceptrons (MLP) used in standard Hidden Markov Mod ...

Idiap2009

Semantic coding by supervised dimensionality reduction

Pascal Frossard, Effrosyni Kokiopoulou

This paper addresses the problem of representing multimedia information under a compressed form that permits efficient classification. The semantic coding problem starts from a subspace method where dimensionality reduction is formulated as a matrix factor ...

2008