Sciweavers

Share
ICASSP
2011
IEEE
8 years 7 months ago
Image compression using learned dictionaries by RLS-DLA and compared with K-SVD
The recently presented recursive least squares dictionary learning algorithm (RLS-DLA) is tested in a general image compression application. Dictionaries are learned in the pixel ...
Karl Skretting, Kjersti Engan
DATESO
2009
158views Database» more  DATESO 2009»
9 years 1 months ago
Benchmarking Coding Algorithms for the R-tree Compression
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications i...
Jirí Walder, Michal Krátký, R...
SIGPRO
2010
137views more  SIGPRO 2010»
9 years 2 months ago
Satellite image compression by post-transforms in the wavelet domain
This paper proposes a novel compression scheme with a tunable complexity-ratedistortion trade-off. As images increase in size and resolution, more efficient compression schemes w...
Xavier Delaunay, Marie Chabert, Vincent Charvillat...
TCSV
2002
67views more  TCSV 2002»
9 years 3 months ago
A new compression scheme for color-quantized images
An efficient compression scheme for color-quantized images based on progressive coding of color information has been developed. Instead of sorting color indexes into a linear list ...
Xin Chen, Sam Kwong, Ju-fu Feng
TNN
1998
113views more  TNN 1998»
9 years 3 months ago
Image compression by self-organized Kohonen map
—This paper presents a compression scheme for digital still images, by using the Kohonen’s neural network algorithm, not only for its vector quantization feature, but also for ...
C. Amerijckx, Michel Verleysen, Philippe Thissen, ...
CG
2004
Springer
9 years 3 months ago
Compression of soft-body animation sequences
We describe a compression scheme for the geometry component of 3D animation sequences. This scheme is based on the principle component analysis (PCA) method, which represents the ...
Zachi Karni, Craig Gotsman
NIPS
2008
9 years 5 months ago
Theory of matching pursuit
We analyse matching pursuit for kernel principal components analysis (KPCA) by proving that the sparse subspace it produces is a sample compression scheme. We show that this bound...
Zakria Hussain, John Shawe-Taylor
DCC
2010
IEEE
9 years 7 months ago
A Fast Compact Prefix Encoding for Pattern Matching in Limited Resources Devices
This paper improves the Tagged Suboptimal Codes (TSC) compression scheme in several ways. We show how to process the TSC as a universal code. We introduce the TSCk as a family of ...
S. Harrusi, Amir Averbuch, N. Rabin
COLT
2005
Springer
9 years 9 months ago
Unlabeled Compression Schemes for Maximum Classes,
We give a compression scheme for any maximum class of VC dimension d that compresses any sample consistent with a concept in the class to at most d unlabeled points from the domain...
Dima Kuzmin, Manfred K. Warmuth
ISCA
2005
IEEE
87views Hardware» more  ISCA 2005»
9 years 9 months ago
A Robust Main-Memory Compression Scheme
Lossless data compression techniques can potentially free up more than 50% of the memory resources. However, previously proposed schemes suffer from high access costs. The propose...
Magnus Ekman, Per Stenström
books