Sciweavers

756 search results - page 61 / 152
» Quantization of Sparse Representations
Sort
View
ICIP
2008
IEEE
14 years 9 months ago
Spatio-spectral reconstruction of the multispectral datacube using sparse recovery
Multispectral scene information is useful for radiometric graphics, material identification and imaging systems simulation. The multispectral scene can be described as a datacube,...
Manu Parmar, Steven Lansel, Brian A. Wandell
SDM
2007
SIAM
118views Data Mining» more  SDM 2007»
13 years 9 months ago
On Privacy-Preservation of Text and Sparse Binary Data with Sketches
In recent years, privacy preserving data mining has become very important because of the proliferation of large amounts of data on the internet. Many data sets are inherently high...
Charu C. Aggarwal, Philip S. Yu
ORL
2011
13 years 2 months ago
Convex approximations to sparse PCA via Lagrangian duality
We derive a convex relaxation for cardinality constrained Principal Component Analysis (PCA) by using a simple representation of the L1 unit ball and standard Lagrangian duality. ...
Ronny Luss, Marc Teboulle
TIP
2010
189views more  TIP 2010»
13 years 6 months ago
Image Inpainting by Patch Propagation Using Patch Sparsity
Abstract—This paper introduces a novel examplar-based inpainting algorithm through investigating the sparsity of natural image patches. Two novel concepts of sparsity at the patc...
Zongben Xu, Jian Sun
BALT
2006
13 years 11 months ago
A Multiple Correspondence Analysis to Organize Data Cubes
Abstract. On Line Analytical Processing (OLAP) is a technology basically created to provide users with tools in order to explore and navigate into data cubes. Unfortunately, in hug...
Riadh Ben Messaoud, Omar Boussaid, Sabine Loudcher...