Results 211 to 220 of about 1,973 (264)
Some of the next articles are maybe not open access.
Symbolic substitution system for data compression
Applied Optics, 1993A new application of symbolic substitution is presented for string matching with the goal of data compression. A temporal sequence of input symbols is mapped onto a two-dimensional array that contains a tree structure, which in turn is mapped into another array for string generation.
S D, Goodman, M A, Brooke
openaire +2 more sources
Data compression and information retrieval via symbolization
Chaos: An Interdisciplinary Journal of Nonlinear Science, 1998Converting a continuous signal into a multisymbol stream is a simple method of data compression which preserves much of the dynamical information present in the original signal. The retrieval of selected types of information from symbolic data involves binary operations and is therefore optimal for digital computers.
Tang, X. Z., Tracy, E. R.
openaire +2 more sources
Symbol representation in map image compression
Proceedings of the 2004 ACM symposium on Applied computing, 2004We propose map image compression system, in which we separate text and symbol information from the rest of the data. The text and other symbols are stored as one bitmap for each symbol into a dictionary. The technical challenge of the work is to convert the symbol data directly to output format similar to that of the JBIG2 standard.
Akimov Alexander, Pasi Fränti
openaire +1 more source
Compressive symbol detection via template matching
2017 International Conference on Information and Communication Technology Convergence (ICTC), 2017In this paper, we consider a method to detect digital modulated symbols from compressively sampled measurements in digital communication system. We describe a method to build a dictionary matrix considering signal modulations, and propose a template matching based algorithm which is effective to recover the information symbols using the dictionary.
Jae-Hyuck Park +2 more
openaire +1 more source
Universal Lossless Compression of Erased Symbols
IEEE Transactions on Information Theory, 2008A source X goes through an erasure channel whose output is Z. The goal is to compress losslessly X when the compressor knows X and Z and the decompressor knows Z. We propose a universal algorithm based on context-tree weighting (CTW), parameterized by a memory-length parameter.
Jiming Yu, Sergio Verdu
openaire +1 more source
Convolutional Autoencoder for Compressive Symbol Detection
2018 International Conference on Information and Communication Technology Convergence (ICTC), 2018This paper deals with a problem of digital communication which samples a signal compressively below its symbol rate and restores the original message symbols. We propose a method to optimize the sensing and restoration modules by designing them as the encoder and decoder of a convolutional autoencoder.
Jae-Hyuck Park, Yookyung Kim
openaire +1 more source
Duplicate detection for symbolically compressed documents
Proceedings of the Fifth International Conference on Document Analysis and Recognition. ICDAR '99 (Cat. No.PR00318), 1999A new family of symbolic compression algorithms has recently been developed that includes the ongoing JBIG2 standardization effort as well as related commercial products. These techniques are specifically designed for binary document images. They cluster individual blobs in a document and store the sequence of occurrence of blobs and representative ...
null Dar-Shyang Lee, J.J. Hull
openaire +1 more source
Symbolic versor compression algorithm
Acta Mathematica Scientia, 2009Abstract In an inner-product space, an invertible vector generates a reflection with respect to a hyperplane, and the Clifford product of several invertible vectors, called a versor in Clifford algebra, generates the composition of the corresponding reflections, which is an orthogonal transformation.
openaire +1 more source
Symbolic Compression and Processing of Document Images
Computer Vision and Image Understanding, 1998In this paper, we describe a compression and representation scheme which exploits the component-level redundancy found within a document image. The approach identifies patterns which appear repeatedly, represents similar patterns with a single prototype, stores the location of pattern instances, and codes the residuals between the prototypes and the ...
Omid E Kia +3 more
openaire +1 more source
Combined symbol matching facsimile data compression system
Proceedings of the IEEE, 1980A facsimile data compression system, called combined symbol matching (CSM), is presented. The system operates in two modes: facsimile and symbol recognition. In the facsimile mode, a symbol blocking operator isolates document symbols such as alphanumeric characters and other recurring binary patterns. The first symbol encountered is placed in a library,
W.K. Pratt +4 more
openaire +1 more source