{"title":"音频广义LZ压缩的参数分析","authors":"D. Kirovski, Zeph Landau","doi":"10.1109/DCC.2005.70","DOIUrl":null,"url":null,"abstract":"Summary form only given. We introduced (Kirovski and Landau (2004)) a memory-based model of the source signal, which explores multimedia repetitiveness to improve upon compression rates achieved by classic memoryless or simple prediction-based audio compression algorithms such as MP3. The representation error is masked using a psycho-acoustic filter. The goal of the masking function is to set the error such that reconstruction of audible samples is exact whereas the reconstruction of inaudible samples is such that the absolute magnitude of the error is minimized. We compute the entropy of the quantized pointers to all blocks, the quantized pointers to the applied transforms, the quantized scalars used to create the linear combination of transformed blocks, and the error vector returned.","PeriodicalId":91161,"journal":{"name":"Proceedings. Data Compression Conference","volume":"40 1","pages":"465-"},"PeriodicalIF":0.0000,"publicationDate":"2005-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Parameter analysis for the generalized LZ compression of audio\",\"authors\":\"D. Kirovski, Zeph Landau\",\"doi\":\"10.1109/DCC.2005.70\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Summary form only given. We introduced (Kirovski and Landau (2004)) a memory-based model of the source signal, which explores multimedia repetitiveness to improve upon compression rates achieved by classic memoryless or simple prediction-based audio compression algorithms such as MP3. The representation error is masked using a psycho-acoustic filter. The goal of the masking function is to set the error such that reconstruction of audible samples is exact whereas the reconstruction of inaudible samples is such that the absolute magnitude of the error is minimized. We compute the entropy of the quantized pointers to all blocks, the quantized pointers to the applied transforms, the quantized scalars used to create the linear combination of transformed blocks, and the error vector returned.\",\"PeriodicalId\":91161,\"journal\":{\"name\":\"Proceedings. Data Compression Conference\",\"volume\":\"40 1\",\"pages\":\"465-\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-03-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. Data Compression Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.2005.70\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.2005.70","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Parameter analysis for the generalized LZ compression of audio
Summary form only given. We introduced (Kirovski and Landau (2004)) a memory-based model of the source signal, which explores multimedia repetitiveness to improve upon compression rates achieved by classic memoryless or simple prediction-based audio compression algorithms such as MP3. The representation error is masked using a psycho-acoustic filter. The goal of the masking function is to set the error such that reconstruction of audible samples is exact whereas the reconstruction of inaudible samples is such that the absolute magnitude of the error is minimized. We compute the entropy of the quantized pointers to all blocks, the quantized pointers to the applied transforms, the quantized scalars used to create the linear combination of transformed blocks, and the error vector returned.