Sciweavers

283 search results - page 9 / 57
» On the Use of Context Tree for Binary Image Compression
Sort
View
JFP
2006
113views more  JFP 2006»
13 years 7 months ago
Efficient manipulation of binary data using pattern matching
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...
Per Gustafsson, Konstantinos F. Sagonas
ICIP
2006
IEEE
14 years 9 months ago
A Model for the Electronic Representation of Bank Checks
The substitution of physical bank check exchange by electronic check image transfer brings agility, security and cost reduction to the clearing system. In this paper, we propose a...
Danilo Dias, Ricardo L. de Queiroz
FOSSACS
2009
Springer
14 years 2 months ago
Parameter Reduction in Grammar-Compressed Trees
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
Markus Lohrey, Sebastian Maneth, Manfred Schmidt-S...
ICIP
2010
IEEE
13 years 5 months ago
Comparison of merging orders and pruning strategies for Binary Partition Tree in hyperspectral data
Hyperspectral imaging segmentation has been an active research area over the past few years. Despite the growing interest, some factors such as high spectrum variability are still...
Silvia Valero, Philippe Salembier, Jocelyn Chanuss...
VISUALIZATION
2002
IEEE
14 years 8 days ago
BLIC: Bi-Level Isosurface Compression
In this paper we introduce a new and simple algorithm to compress isosurface data. This is the data extracted by isosurface algorithms from scalar functions defined on volume gri...
Gabriel Taubin