Joint universal lossy coding and identification of i.i.d. vector sources

Details Joint universal lossy coding and identification of i.i.d. vector sources Joint universal lossy coding and identification of i.i.d. vector sources

2006-01-17

arxiv.org/abs/cs/0601074v2

Computer Science

Information Theory

5 (or 6 with hyperref) pages, 2 eps figures; final version to appear in Proc. ISIT 2006; full version of this paper was submit

Scientific paper

The problem of joint universal source coding and modeling, addressed by Rissanen in the context of lossless codes, is generalized to fixed-rate lossy coding of continuous-alphabet memoryless sources. We show that, for bounded distortion measures, any compactly parametrized family of i.i.d. real vector sources with absolutely continuous marginals (satisfying appropriate smoothness and Vapnik--Chervonenkis learnability conditions) admits a joint scheme for universal lossy block coding and parameter estimation, and give nonasymptotic estimates of convergence rates for distortion redundancies and variational distances between the active source and the estimated source. We also present explicit examples of parametric sources admitting such joint universal compression and modeling schemes.

Affiliated with

Also associated with

No associations

Rating

Joint universal lossy coding and identification of i.i.d. vector sources does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Joint universal lossy coding and identification of i.i.d. vector sources, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Joint universal lossy coding and identification of i.i.d. vector sources will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-228774