{"title":"基于四叉树的二源图像编码","authors":"P. Farrelle, Anil K. Jain","doi":"10.1109/MILCOM.1986.4805874","DOIUrl":null,"url":null,"abstract":"In this paper we describe an adaptation of our two source RBC algorithm[1] where we introduce a variable block size. The blocks are chosen to meet some uniformity criterion and are generated via a quad-tree segmentation of the image which allows the segmentation overhead to be coded very efficiently. The prediction component is improved over standard RBC prediction with a fixed block size and some images may be coded using the prediction alone. However it is more economical to also code the residual component for more detailed images.","PeriodicalId":126184,"journal":{"name":"MILCOM 1986 - IEEE Military Communications Conference: Communications-Computers: Teamed for the 90's","volume":"39 12","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1986-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Quad-Tree based Two Source Image Coding\",\"authors\":\"P. Farrelle, Anil K. Jain\",\"doi\":\"10.1109/MILCOM.1986.4805874\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we describe an adaptation of our two source RBC algorithm[1] where we introduce a variable block size. The blocks are chosen to meet some uniformity criterion and are generated via a quad-tree segmentation of the image which allows the segmentation overhead to be coded very efficiently. The prediction component is improved over standard RBC prediction with a fixed block size and some images may be coded using the prediction alone. However it is more economical to also code the residual component for more detailed images.\",\"PeriodicalId\":126184,\"journal\":{\"name\":\"MILCOM 1986 - IEEE Military Communications Conference: Communications-Computers: Teamed for the 90's\",\"volume\":\"39 12\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1986-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"MILCOM 1986 - IEEE Military Communications Conference: Communications-Computers: Teamed for the 90's\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MILCOM.1986.4805874\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"MILCOM 1986 - IEEE Military Communications Conference: Communications-Computers: Teamed for the 90's","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.1986.4805874","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper we describe an adaptation of our two source RBC algorithm[1] where we introduce a variable block size. The blocks are chosen to meet some uniformity criterion and are generated via a quad-tree segmentation of the image which allows the segmentation overhead to be coded very efficiently. The prediction component is improved over standard RBC prediction with a fixed block size and some images may be coded using the prediction alone. However it is more economical to also code the residual component for more detailed images.