Computer Science – Information Theory
Scientific paper
2007-04-20
Computer Science
Information Theory
5 pages, 1 eps figure; to appear in Proc. ISIT 2007
Scientific paper
The problem of joint universal source coding and modeling, treated in the context of lossless codes by Rissanen, was recently generalized to fixed-rate lossy coding of finitely parametrized continuous-alphabet i.i.d. sources. We extend these results to variable-rate lossy block coding of stationary ergodic sources and show that, for bounded metric distortion measures, any finitely parametrized family of stationary sources satisfying suitable mixing, smoothness and Vapnik-Chervonenkis learnability conditions admits universal schemes for joint lossy source coding and identification. We also give several explicit examples of parametric sources satisfying the regularity conditions.
No associations
LandOfFree
Joint universal lossy coding and identification of stationary mixing 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 stationary mixing 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 stationary mixing sources will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-573248