Proceedings of 1994 Workshop on Information Theory and Statistics

27-29 Oct. 1994

Filter Results

Displaying Results 1 - 25 of 89
  • Proceedings of 1994 Workshop on Information Theory and Statistics

    Publication Year: 1994
    Request permission for commercial reuse | PDF file iconPDF (476 KB)
    Freely Available from IEEE
  • Tree-structured clustered probability models for texture

    Publication Year: 1994
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (32 KB)

    Summary form only given, as follows. A cluster-based probability model has been found to perform extremely well at capturing the complex structures in natural textures (e.g., better than Markov random field models). Its success is mainly due to its ability to handle high dimensionality, via large conditioning neighborhoods over multiple scales, and to generalize salient characteristics from limite... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding for noisy feasible channels

    Publication Year: 1994
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (65 KB)

    Summary form only given. The author proves a constructive version of Shannon's fundamental theorem of information theory. The new theorem holds for any feasible channel. A channel is feasible provided it is computable by a polynomial time computation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding for distributed computation

    Publication Year: 1994
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (76 KB)

    Summary form only given. The author describes analogous coding theorems for the more general, interactive, communications required in computation. In this case the bits transmitted in the protocol are not known to the processors in advance but are determined dynamically. First he shows that any interactive protocol of length T between two processors connected by a noiseless channel can be simulate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tracking long-range dependencies with wavelets

    Publication Year: 1994
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB)

    Long-range dependent processes exhibit features, such as 1/f spectra, for which wavelets offer versatile tools and provide a unifying framework. This efficiency is demonstrated on both continuous processes, point processes and filtered point processes. The fractal shot noise model is also considered. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mismatched encoding in rate distortion theory

    Publication Year: 1994
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (71 KB)

    Summary form only given. A length n block code C of size 2/sup nR/ over a finite alphabet /spl chi//spl circ//sub 0/ is used to encode a memoryless source over a finite alphabet /spl chi/. A length n source sequence x is described by the index i of the codeword x/spl circ//sub 0/(i) that is nearest to x according to the single-letter distortion function d/sub 0/(x,x/spl circ//sub 0/). Based on the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonparametric kernel estimation for error density

    Publication Year: 1994
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (53 KB)

    Summary form only given. Consider a linear model, y/sub i/=x'/sub i//spl beta/+e/sub i/, i=1,2,..., x'/sub i/s are p(/spl ges/1) dimension known vectors and /spl beta/(/spl isin/R/spl deg/) is an unknown parametric vector and e/sub i/ are assumed i.i.d.r.v.'s from a common unknown density function f(x) with med (e/sub i/)=0. Based on LAD (least absolute deviations) estimator /spl beta//spl tilde/ ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discussion of a statistical channel

    Publication Year: 1994
    Cited by:  Papers (5)
    Request permission for commercial reuse | PDF file iconPDF (126 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1994
    Request permission for commercial reuse | PDF file iconPDF (82 KB)
    Freely Available from IEEE
  • Selection of best bases for classification and regression

    Publication Year: 1994
    Cited by:  Papers (34)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB)

    We describe extensions to the “best-basis” method to select orthonormal bases suitable for signal classification (or regression) problems from a collection of orthonormal bases using the relative entropy (or regression errors). Once these bases are selected, the most significant coordinates are fed into a traditional classifier (or regression method) such as linear discriminant analysi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximized mutual information using macrocanonical probability distributions

    Publication Year: 1994
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (96 KB)

    A maximum entropy formulation leads to a neural network which is factorable in both form and function into individual neurons corresponding to the Hopfield neural model. A maximized mutual information criterion dictates the optimal learning methodology using locally available information View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New distortion measures for speech processing

    Publication Year: 1994
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    New distortion measures are derived from a recently proposed characterization function of stationary time series and are shown to be more robust than some commonly-used distortion measures such as the Kullback-Leibler spectral divergence in speech processing View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finite-precision intrinsic randomness and source resolvability

    Publication Year: 1994
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (100 KB)

    Random number generators are important devices in randomized algorithms, Monte-Carlo methods, and in simulation studies of random systems. A random number generator is usually modeled as a random source emitting independent, equally likely random bits. In practice, the random source one has at hand can deviate from this idealized model, and the random number generator operates by applying a determ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Equilibria in infinite random graphs

    Publication Year: 1994
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB)

    A load balancing problem is formulated for infinite networks or graphs. There are overlapping sets of locations, each set having an associated possibly random amount of load to be distributed. The total load at a location is the sum of the contributions due to the sets that contain it. Equilibrium is said to hold if the load corresponding to any one set cannot be reassigned to improve the balance ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive edge detection in compound Gauss-Markov random fields using the minimum description length principle

    Publication Year: 1994
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    Edge location in compound Gauss-Markov random fields (CGMRF) is formulated as a parameter estimation problem. Since the number of parameters is unknown, a minimum-description-length (MDL) criterion is proposed for image restoration based on the CGMRF model View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detecting regularity in point processes generated by humans

    Publication Year: 1994
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (96 KB)

    Detecting minefields in the presence of clutter is an important challenge for the Navy. Mine-fields have point patterns that tend to be regular for a variety of reasons including strategic doctrine, safety, tactical efficiency, and perhaps most intriguing the human element. For example, humans have a tendency to make lottery number selections, a one-dimensional discrete point process, in a non-uni... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Jeffreys' prior yields the asymptotic minimax redundancy

    Publication Year: 1994
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (100 KB)

    We determine the asymptotic minimax redundancy of universal data compression in a parametric setting and show that it corresponds to the use of Jeffreys prior. Statistically, this formulation of the coding problem can be interpreted in a prior selection context and in an estimation context View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimal randomness and information theory

    Publication Year: 1994
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (108 KB)

    This is a tutorial survey of recent information theoretic results dealing with the minimal randomness necessary for the generation of random processes with prescribed distributions View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Markov random fields on graphs for natural languages

    Publication Year: 1994
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (108 KB)

    The use of model-based methods for data compression for English dates back at least to Shannon's Markov chain (n-gram) models, where the probability of the next word given all previous words equals the probability of the next word given the previous n-1 words. A second approach seeks to model the hierarchical nature of language via tree graph structures arising from a context-free language (CFL). ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MMSE parameter estimation of exponentially damped sinusoids

    Publication Year: 1994
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    An efficient iterative MMSE algorithm that estimates the parameters of exponentially damped sinusoids embedded in white Gaussian noise is proposed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling Gauss Markov random fields at multiple resolutions

    Publication Year: 1994
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (100 KB)

    A multiresolution model for Gauss Markov random fields (GMRF) is presented. Based on information theoretic measures, techniques are presented to estimate the GMRF parameters of a process at coarser resolutions from the parameters at fine resolution View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The application of Akaike information criterion based pruning to nonparametric density estimates

    Publication Year: 1994
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (84 KB)

    This paper examines the application of Akaike (1974) information criterion (AIC) based pruning to the refinement of nonparametric density estimates obtained via the adaptive mixtures (AM) procedure of Priebe (see JASA, vol.89, no.427, p.796-806, 1994) and Marchette. The paper details a new technique that uses these two methods in conjunction with one another to predict the appropriate number of te... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on universal coding: the next generation

    Publication Year: 1994
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (60 KB)

    An important class of universal encoders is the one where the encoder is fed by two inputs: a) The incoming string of data to be compressed. b) An N-bit description of the source statistics (i.e. a “training sequence”). We consider fixed-to-variable universal encoders that noiselessly compress blocks of length l View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive signal representations: How much is too much?

    Publication Year: 1994
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (96 KB)

    Adaptive signal representations in overcomplete libraries of waveforms have been very popular. One naturally expects that in searching through a large number of signal representations for noisy data, one is at risk of identifying apparent structure in the data which turns out to be spurious, noise-induced artifacts. We show how to use penalties based on the logarithm of library complexity to tempe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Testing of composite hypotheses and ID-codes

    Publication Year: 1994
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (56 KB)

    A geometrical approach to ID-codes, based on their equivalence to some natural notions from mathematical statistics is described. That not only enlarges the available analytical apparatus, but also enables us to strengthen some known results View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.