寻找离散和连续类源的极大极小码

2007 IEEE Sarnoff Symposium Pub Date : 2007-04-01 DOI:10.1109/SARNOF.2007.4567390

L. Wolfe

{"title":"寻找离散和连续类源的极大极小码","authors":"L. Wolfe","doi":"10.1109/SARNOF.2007.4567390","DOIUrl":null,"url":null,"abstract":"This paper suggests a signal processing method for finding the minimax codes which minimize the maximum redundancies over a class of sources with either a discrete or a continuous alphabet, and where relative entropy (cross entropy; discrimination information) is a criterion to measure the redundancy. A complexity analysis and numerical studies demonstrate the efficiency of the method.","PeriodicalId":293243,"journal":{"name":"2007 IEEE Sarnoff Symposium","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Finding minimax codes for discrete and continuous classes of sources\",\"authors\":\"L. Wolfe\",\"doi\":\"10.1109/SARNOF.2007.4567390\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper suggests a signal processing method for finding the minimax codes which minimize the maximum redundancies over a class of sources with either a discrete or a continuous alphabet, and where relative entropy (cross entropy; discrimination information) is a criterion to measure the redundancy. A complexity analysis and numerical studies demonstrate the efficiency of the method.\",\"PeriodicalId\":293243,\"journal\":{\"name\":\"2007 IEEE Sarnoff Symposium\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE Sarnoff Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SARNOF.2007.4567390\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE Sarnoff Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SARNOF.2007.4567390","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文提出了一种求极大极小码的信号处理方法，该码能使一类具有离散或连续字母的信源上的最大冗余最小化，其中相对熵(交叉熵;判别信息是衡量冗余度的一个标准。复杂性分析和数值研究表明了该方法的有效性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Finding minimax codes for discrete and continuous classes of sources

This paper suggests a signal processing method for finding the minimax codes which minimize the maximum redundancies over a class of sources with either a discrete or a continuous alphabet, and where relative entropy (cross entropy; discrimination information) is a criterion to measure the redundancy. A complexity analysis and numerical studies demonstrate the efficiency of the method.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2007 IEEE Sarnoff Symposium

自引率

0.00%

发文量