Sciweavers

335 search results - page 44 / 67
» Non-negative sparse coding
Sort
View
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
15 years 10 months ago
The Complexity of Andersen's Analysis in Practice
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
Manu Sridharan, Stephen J. Fink
ICIP
2008
IEEE
15 years 4 months ago
Atomic decomposition dedicated to AVC and spatial SVC prediction
In this work, we propose the use of sparse signal representation techniques to solve the problem of closed-loop spatial image prediction. The reconstruction of signal in the block...
Aurelie Martin, Jean-Jacques Fuchs, Christine Guil...
ICA
2007
Springer
15 years 3 months ago
Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
In the paper we present new Alternating Least Squares (ALS) algorithms for Nonnegative Matrix Factorization (NMF) and their extensions to 3D Nonnegative Tensor Factorization (NTF) ...
Andrzej Cichocki, Rafal Zdunek, Shun-ichi Amari
CVIU
2007
113views more  CVIU 2007»
14 years 9 months ago
Primal sketch: Integrating structure and texture
This article proposes a generative image model, which is called ‘‘primal sketch,’’ following Marr’s insight and terminology. This model combines two prominent classes of...
Cheng-en Guo, Song Chun Zhu, Ying Nian Wu
ICIP
2000
IEEE
15 years 11 months ago
Image Compression with Geometrical Wavelets
We introduce a sparse image representation that takes advantage of the geometrical regularity of edges in images. A new class of one-dimensional wavelet orthonormal bases, called ...
Erwan Le Pennec, Stéphane Mallat