Results 1 
2 of
2
Joint fixedrate universal lossy coding and identification of continuousalphabet memoryless sources
 IEEE Trans. Inform. Theory
"... The problem of joint universal source coding and identification is considered in the setting of fixedrate lossy coding of continuousalphabet memoryless sources. For a wide class of bounded distortion measures, it is shown that any compactly parametrized family of R dvalued i.i.d. sources with abs ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
The problem of joint universal source coding and identification is considered in the setting of fixedrate lossy coding of continuousalphabet memoryless sources. For a wide class of bounded distortion measures, it is shown that any compactly parametrized family of R dvalued i.i.d. sources with absolutely continuous distributions satisfying appropriate smoothness and Vapnik–Chervonenkis learnability conditions, admits a joint scheme for universal lossy block coding and parameter estimation, such that when the block length n tends to infinity, the overhead perletter rate and the distortion redundancies converge to zero as O(n −1 log n) and O ( � n −1 log n), respectively. Moreover, the active source can be determined at the decoder up to a ball of radius O ( � n −1 log n) in variational distance, asymptotically almost surely. The system has finite memory length equal to the block length, and can be thought of as blockwise application of a timeinvariant nonlinear filter with initial conditions determined from the previous block. Comparisons are presented with several existing schemes for universal vector quantization, which do not include parameter estimation explicitly, and an extension to unbounded distortion measures is outlined. Finally, finite mixture classes and exponential families are given as explicit examples of parametric sources admitting joint universal compression and modeling schemes of the kind studied here. Keywords: Learning, minimumdistance density estimation, twostage codes, universal vector quantization, Vapnik– Chervonenkis dimension. I.
Joint FixedRate Universal Lossy Coding and Identification of ContinuousAlphabet Memoryless Sources
"... AbstractThe problem of joint universal source coding and density estimation is considered in the setting of fixedrate lossy coding of continuousalphabet memoryless sources. For a wide class of bounded distortion measures, it is shown that any compactly parametrized family of d valued independen ..."
Abstract
 Add to MetaCart
AbstractThe problem of joint universal source coding and density estimation is considered in the setting of fixedrate lossy coding of continuousalphabet memoryless sources. For a wide class of bounded distortion measures, it is shown that any compactly parametrized family of d valued independent and identically distributed (i.i.d.) sources with absolutely continuous distributions satisfying appropriate smoothness and VapnikChervonenkis (VC) learnability conditions, admits a joint scheme for universal lossy block coding and parameter estimation, such that when the block length n tends to infinity, the overhead perletter rate and the distortion redundancies converge to zero as O(n 01 log n) and O( n 01 log n), respectively. Moreover, the active source can be determined at the decoder up to a ball of radius O( n 01 log n) in variational distance, asymptotically almost surely. The system has finite memory length equal to the block length, and can be thought of as blockwise application of a timeinvariant nonlinear filter with initial conditions determined from the previous block. Comparisons are presented with several existing schemes for universal vector quantization, which do not include parameter estimation explicitly, and an extension to unbounded distortion measures is outlined. Finally, finite mixture classes and exponential families are given as explicit examples of parametric sources admitting joint universal compression and modeling schemes of the kind studied here.