{"title":"基于混合变换的3D视频编码","authors":"R.K. Pantchuru, S. Gupta","doi":"10.1109/SPCOM.2004.1458355","DOIUrl":null,"url":null,"abstract":"In this paper a simple, yet efficient variation of 3D video coding has been proposed. The algorithm uses both DCT and DWT to exploit the temporal and spatial redundancies present in the video. A new tree structure has been devised. Performance comparisons of this coder is made with existing 3D wavelet coder using 3D-SPIHT algorithm. Results obtained are comparable to the existing coder. No motion compensation is used. This coder also has the interesting feature of scalability (spatial and SNR) without which its difficult to sustain in the world of Internet and mobile communication. Packetisation is carried out using packetized zero tree wavelet (PZW) using the proposed new tree structure which is resilient to packet erasures.","PeriodicalId":424981,"journal":{"name":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"3D video coding based on mixed transforms\",\"authors\":\"R.K. Pantchuru, S. Gupta\",\"doi\":\"10.1109/SPCOM.2004.1458355\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper a simple, yet efficient variation of 3D video coding has been proposed. The algorithm uses both DCT and DWT to exploit the temporal and spatial redundancies present in the video. A new tree structure has been devised. Performance comparisons of this coder is made with existing 3D wavelet coder using 3D-SPIHT algorithm. Results obtained are comparable to the existing coder. No motion compensation is used. This coder also has the interesting feature of scalability (spatial and SNR) without which its difficult to sustain in the world of Internet and mobile communication. Packetisation is carried out using packetized zero tree wavelet (PZW) using the proposed new tree structure which is resilient to packet erasures.\",\"PeriodicalId\":424981,\"journal\":{\"name\":\"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.\",\"volume\":\"79 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPCOM.2004.1458355\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPCOM.2004.1458355","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper a simple, yet efficient variation of 3D video coding has been proposed. The algorithm uses both DCT and DWT to exploit the temporal and spatial redundancies present in the video. A new tree structure has been devised. Performance comparisons of this coder is made with existing 3D wavelet coder using 3D-SPIHT algorithm. Results obtained are comparable to the existing coder. No motion compensation is used. This coder also has the interesting feature of scalability (spatial and SNR) without which its difficult to sustain in the world of Internet and mobile communication. Packetisation is carried out using packetized zero tree wavelet (PZW) using the proposed new tree structure which is resilient to packet erasures.