Sciweavers

495 search results - page 1 / 99
» Sparse representation algorithms based on mean-field approxi...
Sort
View
TSMC
1998
117views more  TSMC 1998»
13 years 5 months ago
A mean field annealing approach to robust corner detection
—This paper is an extension of our previous paper to improve the capability of detecting corners. We proposed a method of boundary smoothing for curvature estimation using a cons...
Kwanghoon Sohn, Jung H. Kim, Winser E. Alexander
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 5 months ago
Mean field for Markov Decision Processes: from Discrete to Continuous Optimization
We study the convergence of Markov Decision Processes made of a large number of objects to optimization problems on ordinary differential equations (ODE). We show that the optimal...
Nicolas Gast, Bruno Gaujal, Jean-Yves Le Boudec
ICASSP
2011
IEEE
12 years 9 months ago
Approximate nearest-subspace representations for sound mixtures
In this paper we present a novel approach to describe sound mixtures which is based on a geometric viewpoint. In this approach we extend the idea of a nearest-neighbor representat...
Paris Smaragdis
TSP
2010
13 years 4 days ago
Double sparsity: learning sparse dictionaries for sparse signal approximation
Abstract--An efficient and flexible dictionary structure is proposed for sparse and redundant signal representation. The proposed sparse dictionary is based on a sparsity model of ...
Ron Rubinstein, Michael Zibulevsky, Michael Elad