{"title":"用于压缩的整数极坐标","authors":"Demba E. Ba, Vivek K Goyal","doi":"10.1109/ISIT.2007.4557373","DOIUrl":null,"url":null,"abstract":"This paper introduces a family of integer-to-integer approximations to the Cartesian-to-polar coordinate transformation and analyzes its application to lossy compression. A high-rate analysis is provided for an encoder that first uniformly scalar quantizes, then transforms to \"integer polar coordinates,\" and finally separately entropy codes angle and radius. For sources separable in polar coordinates, the performance (at high rate) is shown to match that of entropy-constrained unconstrained polar quantization - where the angular quantization is allowed to depend on the radius. Thus, for sources separable in polar coordinates but not separable in rectangular coordinates - including certain Gaussian scale mixtures - the proposed system performs better than any transform code. Furthermore, unlike unconstrained polar quantization, integer polar coordinates are appropriate for lossless compression of integer-valued vectors. Combination of integer polar coordinates with integer-to-integer transform coding is also discussed.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Integer Polar Coordinates for Compression\",\"authors\":\"Demba E. Ba, Vivek K Goyal\",\"doi\":\"10.1109/ISIT.2007.4557373\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper introduces a family of integer-to-integer approximations to the Cartesian-to-polar coordinate transformation and analyzes its application to lossy compression. A high-rate analysis is provided for an encoder that first uniformly scalar quantizes, then transforms to \\\"integer polar coordinates,\\\" and finally separately entropy codes angle and radius. For sources separable in polar coordinates, the performance (at high rate) is shown to match that of entropy-constrained unconstrained polar quantization - where the angular quantization is allowed to depend on the radius. Thus, for sources separable in polar coordinates but not separable in rectangular coordinates - including certain Gaussian scale mixtures - the proposed system performs better than any transform code. Furthermore, unlike unconstrained polar quantization, integer polar coordinates are appropriate for lossless compression of integer-valued vectors. Combination of integer polar coordinates with integer-to-integer transform coding is also discussed.\",\"PeriodicalId\":193467,\"journal\":{\"name\":\"2007 IEEE International Symposium on Information Theory\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2007.4557373\",\"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 International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2007.4557373","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper introduces a family of integer-to-integer approximations to the Cartesian-to-polar coordinate transformation and analyzes its application to lossy compression. A high-rate analysis is provided for an encoder that first uniformly scalar quantizes, then transforms to "integer polar coordinates," and finally separately entropy codes angle and radius. For sources separable in polar coordinates, the performance (at high rate) is shown to match that of entropy-constrained unconstrained polar quantization - where the angular quantization is allowed to depend on the radius. Thus, for sources separable in polar coordinates but not separable in rectangular coordinates - including certain Gaussian scale mixtures - the proposed system performs better than any transform code. Furthermore, unlike unconstrained polar quantization, integer polar coordinates are appropriate for lossless compression of integer-valued vectors. Combination of integer polar coordinates with integer-to-integer transform coding is also discussed.