Sciweavers

283 search results - page 5 / 57
» On the Use of Context Tree for Binary Image Compression
Sort
View
PRL
1998
85views more  PRL 1998»
13 years 7 months ago
Large encrypting binary images with higher security
In this paper, we present a new approach for encrypting binary images. Putting different scan patterns at the same level in Ž .the scan tree structure and employing a two-dimensi...
Kuo-Liang Chung, Lung-Chun Chang
LICS
2008
IEEE
14 years 1 months ago
Context Matching for Compressed Terms
This paper is an investigation of the matching problem for term equations s = t where s contains context variables, and both terms s and t are given using some kind of compressed ...
Adria Gascón, Guillem Godoy, Manfred Schmid...
DCC
2000
IEEE
13 years 11 months ago
Trees, Windows, and Tiles for Wavelet Image Compression
We investigate the task of compressing an image by using different probability models for compressing different regions of the image. In an earlier paper, we introduced a class of...
Wee Sun Lee
ICIP
2005
IEEE
14 years 9 months ago
Motion-compensation using variable-size block-matching with binary partition trees
A new approach to Variable Size Block Matching is proposed, based on the binary partitioning of blocks. If a particular block does not allow for accurate motion compensation, then...
Marc Servais, Theodore Vlachos, Thomas Davies
ICIP
2002
IEEE
14 years 9 months ago
Lossless video coding using optimal 3D prediction
In this paper, we consider the problem of lossless compression of video by taking into account temporal information. Video lossless compression is an interesting possibility in th...
Dania Brunello, Giancarlo Calvagno, Gian Antonio M...