{"title":"基于非等损失保护的嵌入式视频流粒子群算法","authors":"Jiajing Hu, Dong Hu","doi":"10.1109/ICCT.2010.5689025","DOIUrl":null,"url":null,"abstract":"This paper presents a new scheme for optimal packetization of scalable multimedia data over lossy network. By assigning an unequal amount of forward error correction (FEC) bits to each segment of transmission packets, the proposed algorithm protects a progressive bitstream generated by a three-dimensional set partitioning in hierarchical trees (3-D SPIHT) algorithm. The partical swarm optimization (PSO) algorithm is used to reasonably allocate bits between source coding and channel coding across packets. Experimental results show that the proposed algorithm provides close to optimal average peak signal-to-noise ratio performance and that its' running time is significantly lower than that of previously known solution.","PeriodicalId":253478,"journal":{"name":"2010 IEEE 12th International Conference on Communication Technology","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Partical swarm optimization based unequal loss protection of embedded video streams\",\"authors\":\"Jiajing Hu, Dong Hu\",\"doi\":\"10.1109/ICCT.2010.5689025\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new scheme for optimal packetization of scalable multimedia data over lossy network. By assigning an unequal amount of forward error correction (FEC) bits to each segment of transmission packets, the proposed algorithm protects a progressive bitstream generated by a three-dimensional set partitioning in hierarchical trees (3-D SPIHT) algorithm. The partical swarm optimization (PSO) algorithm is used to reasonably allocate bits between source coding and channel coding across packets. Experimental results show that the proposed algorithm provides close to optimal average peak signal-to-noise ratio performance and that its' running time is significantly lower than that of previously known solution.\",\"PeriodicalId\":253478,\"journal\":{\"name\":\"2010 IEEE 12th International Conference on Communication Technology\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE 12th International Conference on Communication Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCT.2010.5689025\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE 12th International Conference on Communication Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCT.2010.5689025","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Partical swarm optimization based unequal loss protection of embedded video streams
This paper presents a new scheme for optimal packetization of scalable multimedia data over lossy network. By assigning an unequal amount of forward error correction (FEC) bits to each segment of transmission packets, the proposed algorithm protects a progressive bitstream generated by a three-dimensional set partitioning in hierarchical trees (3-D SPIHT) algorithm. The partical swarm optimization (PSO) algorithm is used to reasonably allocate bits between source coding and channel coding across packets. Experimental results show that the proposed algorithm provides close to optimal average peak signal-to-noise ratio performance and that its' running time is significantly lower than that of previously known solution.