{"title":"基于广义有限换能器的压缩域二进制形状掩模的有效处理","authors":"Mohamed Abdel-Maguid, M. Moniri","doi":"10.1109/ISSPA.2003.1224963","DOIUrl":null,"url":null,"abstract":"In this paper we describe a new algorithm for binary shape masks processing in the compressed domain using generalised finite transducers [GFT] based on permutation set mapping. The proposed algorithm outperforms the existing algorithms in both compression efficiency and complexity. Moreover, the processed visual data maintain the original visual perceptual quality. Experimental results are presented to show the gain in compression efficiency.","PeriodicalId":264814,"journal":{"name":"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Efficient processing of binary shape masks in the compressed domain using generalized finite transducers\",\"authors\":\"Mohamed Abdel-Maguid, M. Moniri\",\"doi\":\"10.1109/ISSPA.2003.1224963\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we describe a new algorithm for binary shape masks processing in the compressed domain using generalised finite transducers [GFT] based on permutation set mapping. The proposed algorithm outperforms the existing algorithms in both compression efficiency and complexity. Moreover, the processed visual data maintain the original visual perceptual quality. Experimental results are presented to show the gain in compression efficiency.\",\"PeriodicalId\":264814,\"journal\":{\"name\":\"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSPA.2003.1224963\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSPA.2003.1224963","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Efficient processing of binary shape masks in the compressed domain using generalized finite transducers
In this paper we describe a new algorithm for binary shape masks processing in the compressed domain using generalised finite transducers [GFT] based on permutation set mapping. The proposed algorithm outperforms the existing algorithms in both compression efficiency and complexity. Moreover, the processed visual data maintain the original visual perceptual quality. Experimental results are presented to show the gain in compression efficiency.