Results 221 to 230 of about 1,973 (264)

Estimating topological entropy via a symbolic data compression technique

Physical Review E, 2003
We estimate topological entropy via symbolic dynamics using a data compression technique called the context-tree weighting method. Unlike other symbolic dynamical approaches, which often have to choose ad hoc parameters such as the depth of a tree, the context-tree weighting method is almost parameter-free and infers the transition structure of the ...
Yoshito, Hirata, Alistair I, Mees
openaire   +2 more sources

Semantic judgments of compressed monosyllables: Evidence for phonetic symbolism

Journal of Psycholinguistic Research, 1982
Both frequency and speed of utterance have been implicated in studies of phonetic symbolism. Therefore, these two variables were manipulated independently. Three monosyllables were recorded and distorted by either increasing or decreasing frequency, holding speed constant, and by increasing or decreasing speed, holding frequency constant.
R D, Tarte, M W, O'Boyle
openaire   +2 more sources

Entropy and Compressibility of Symbol Sequences

1996
The purpose of this paper is to investigate long-range correlations in symbol sequences using methods of statistical physics and nonlinear dynamics. Beside the principal interest in the analysis of correlations and fluctuations comprising many letters, our main aim is related here to the problem of sequence compression.
Ebeling, Werner, Pöschel, Thorsten, Neiman, Alexander   +2 more
openaire   +1 more source

ETAO: Symbol mapping transformation method for text compression

2011 3rd International Conference on Computer Research and Development, 2011
This paper is proposing a novel idea for text transformation based on mapping single letters form the standard alphabetical order into the same set of single letters reordered by their relative frequencies. This method can be used as a complementary algorithm to enhance the statistical compression techniques.
null Fadlelmoula Mohamed Baloul, null Mohsin Hassan Abdullah, null Elsadig Ahmed Babikir   +2 more
openaire   +1 more source

Compression Algorithms for Symbolic Data

1997
In Chapters 4 and 5, we will learn how some important data compression algorithms work. The marketplace has selected these algorithms for its de facto and official standards because they are effective and implementable, allowing many other compression techniques to languish or remain subjects for further investigation. This chapter begins by looking at
openaire   +1 more source

Symbolic document image compression based on pattern matching techniques

SPIE Proceedings, 2011
In this paper, a novel compression algorithm for Chinese document images is proposed. Initially, documents are segmented into readable components such as characters and punctuation marks. Similar patterns within the text are found by shape context matching and grouped to form a set of prototype symbols.
Chwan-Yi Shiah, Yun-Sheng Yen
openaire   +1 more source

Huffman Binary Coding of WLN Symbols for File-Compression

Journal of Chemical Documentation, 1974
Construction of Huffman binary codes for WLN symbols is described for the compression of a WLN file. Here, a parenthesized representation of the tree structure is used for computer encoding.
Subramanian, K, Krishnan, S, Krishnamurthy, EV   +2 more
openaire   +1 more source

An algebraic method for compressing symbolic data tables

Intelligent Data Analysis, 2006
Although symbolic data tables summarize huge sets of data they can still become very large in size. This paper proposes a novel technique for compressing a symbolic data table using the recently emerged Compound Term Composition Algebra. One advantage of CTCA is that the closed world hypotheses of its operations can lead to a remarkably high ...
openaire   +1 more source

Compressive sampling based multiple symbol differential detection for UWB IR signals

2012 IEEE International Conference on Ultra-Wideband, 2012
In this paper, a compressive sampling (CS) based multiple symbol differential detector is proposed, using the principle of a generalized likelihood ratio test (GLRT). The proposed detector works on the compressed samples directly, thereby avoiding the reconstruction step and thus resulting in a reduced implementation complexity along with a reduced ...
GISHKORI S, LEUS G, LOTTICI, VINCENZO
openaire   +1 more source

A novel technique for the watermarking of symbolically compressed documents

Second International Conference on Document Image Analysis for Libraries (DIAL'06), 2006
Symbolic compression is a lossy compression technique which has been found to perform very efficiently for Indian language text document images. A novel and efficient watermarking technique is proposed for such documents compressed symbolically. The approach embeds the watermark into prototypes which are unaffected during compression, leading to an ...
S. Palit, U. Garain
openaire   +1 more source