نتایج جستجو برای: sparseness constraint

تعداد نتایج: 79838  

2007
Stephen Waydo Jerry Marsden Pietro Perona

Neurons have been identified in the human medial temporal lobe (MTL) that display a strong selectivity for only a few stimuli (such as familiar individuals or landmark buildings) out of perhaps 100 presented to the test subject. While highly selective for a particular object or category, these cells are remarkably insensitive to different presentations (i.e., different poses and views) of their...

Journal: :Neurocomputing 2008
Paul D. O'Grady Barak A. Pearlmutter

Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can be constructed by Non-negative Matrix Factorisation (NMF), a method for finding parts-based representations of non-negative data. Here, we present an extension to convolutive NMF that includes a sparseness constraint, ...

Journal: :International Journal of Computational Geometry & Applications 1995

2013
Lei Lei Chao Wang Xin Liu

Discrete wavelet transform (DWT) has been widely adopted in biomedical signal processing for denoising, compression and so on. Choosing a suitable decomposition level (DL) in DWT is of paramount importance to its performance. In this paper, we propose to exploit sparseness of the transformed signals to determine the appropriate DL. Simulation results have shown that the sparseness of transforme...

Journal: :International Journal of Computer Vision 2015

2003
R. GRIBONVAL

The purpose of this paper is to study sparse representations of signals from a general dictionary in a Banach space. For so-called localized frames in Hilbert spaces, the canonical frame coefficients are shown to provide a near sparsest expansion for several sparseness measures. However, for frames which are not localized, this no longer holds true and sparse representations may depend strongly...

Journal: :Journal of neurophysiology 2011
Ben D B Willmore James A Mazer Jack L Gallant

Theoretical studies of mammalian cortex argue that efficient neural codes should be sparse. However, theoretical and experimental studies have used different definitions of the term "sparse" leading to three assumptions about the nature of sparse codes. First, codes that have high lifetime sparseness require few action potentials. Second, lifetime-sparse codes are also population-sparse. Third,...

2008
Morten Mørup Kristoffer Hougaard Madsen Lars Kai Hansen

Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based representation. The NMF decomposition is not in general unique and a part based representation not guaranteed. However, imposing sparseness both improves the uniqueness of the decomposition and favors part based representati...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید