{"title":"无记忆采样率失真","authors":"Vinay Praneeth Boda, P. Narayan","doi":"10.1109/ALLERTON.2015.7447105","DOIUrl":null,"url":null,"abstract":"Consider a discrete memoryless multiple source with m component sources. A subset of k ≤ m sources are sampled at each time instant and jointly compressed in order to reconstruct all the m sources under a given distortion criterion. A sampling rate distortion function is characterized for the case of memoryless random sampling with the sampler possibly depending on the source outputs; and the decoder is informed of the sequence of sampled sets. Examining the structure of the optimal sampler, it is shown that deterministic sampling, characterized by a conditional point-mass, suffices. Restricted forms of sampling are also addressed. An upper bound for the sampling rate distortion function is provided when the decoder is not informed of the sequence of sampled sets.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Memoryless sampling rate distortion\",\"authors\":\"Vinay Praneeth Boda, P. Narayan\",\"doi\":\"10.1109/ALLERTON.2015.7447105\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Consider a discrete memoryless multiple source with m component sources. A subset of k ≤ m sources are sampled at each time instant and jointly compressed in order to reconstruct all the m sources under a given distortion criterion. A sampling rate distortion function is characterized for the case of memoryless random sampling with the sampler possibly depending on the source outputs; and the decoder is informed of the sequence of sampled sets. Examining the structure of the optimal sampler, it is shown that deterministic sampling, characterized by a conditional point-mass, suffices. Restricted forms of sampling are also addressed. An upper bound for the sampling rate distortion function is provided when the decoder is not informed of the sequence of sampled sets.\",\"PeriodicalId\":112948,\"journal\":{\"name\":\"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ALLERTON.2015.7447105\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2015.7447105","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Consider a discrete memoryless multiple source with m component sources. A subset of k ≤ m sources are sampled at each time instant and jointly compressed in order to reconstruct all the m sources under a given distortion criterion. A sampling rate distortion function is characterized for the case of memoryless random sampling with the sampler possibly depending on the source outputs; and the decoder is informed of the sequence of sampled sets. Examining the structure of the optimal sampler, it is shown that deterministic sampling, characterized by a conditional point-mass, suffices. Restricted forms of sampling are also addressed. An upper bound for the sampling rate distortion function is provided when the decoder is not informed of the sequence of sampled sets.