The Experts below are selected from a list of 4695 Experts worldwide ranked by ideXlab platform
Shakeel Ahmad - One of the best experts on this subject based on the ideXlab platform.
-
1Unequal Error Protection using Fountain Codes with Applications to Video Communication
2016Co-Authors: Shakeel Ahmad, Raouf Hamzaoui, Marwan Al-akaidiAbstract:Application-layer forward error correction (FEC) is used in many multimedia communication systems to address the problem of packet loss in lossy packet networks. One powerful form of application-layer FEC is unequal error protection which protects the information symbols according to their importance. We propose a method for unequal error protection with a Fountain code. When the information symbols were partitioned into two protection classes (most important and least important), our method required a smaller transmission Bit Budget to achieve low Bit error rates compared to the two state of the art techniques. We also compared our method to the two state of the art techniques for video unicast and multicast over a lossy network. Simulations for the scalable video coding (SVC) extension of the H.264/AVC standard showed that our method required a smaller transmission Bit Budget to achieve high quality video. EDICS: 5-HIDE. Index terms: Fountain codes, unequal error protection, video transmission. I
-
unequal error protection using fountain codes with applications to video communication
IEEE Transactions on Multimedia, 2011Co-Authors: Shakeel Ahmad, Raouf Hamzaoui, Marwan AlakaidiAbstract:Application-layer forward error correction (FEC) is used in many multimedia communication systems to address the problem of packet loss in lossy packet networks. One powerful form of application-layer FEC is unequal error protection which protects the information symbols according to their importance. We propose a method for unequal error protection with a Fountain code. When the information symbols were partitioned into two protection classes (most important and least important), our method required a smaller transmission Bit Budget to achieve low Bit error rates compared to the two state-of-the-art techniques. We also compared our method to the two state-of-the-art techniques for video unicast and multicast over a lossy network. Simulations for the scalable video coding (SVC) extension of the H.264/AVC standard showed that our method required a smaller transmission Bit Budget to achieve high-quality video.
-
Optimal Packet Loss Protection of Progressively Compressed 3-D Meshes
IEEE Transactions on Multimedia, 2009Co-Authors: Shakeel Ahmad, Raouf Hamzaoui, Marwan Al-akaidiAbstract:We consider a state-of-the-art system that uses layered source coding and forward error correction with Reed-Solomon codes to efficiently transmit 3-D meshes over lossy packet networks. Given a transmission Bit Budget, the performance of this system can be optimized by determining how many layers should be sent, how each layer should be packetized, and how many parity Bits should be allocated to each layer such that the expected distortion at the receiver is minimum. The previous solution for this optimization problem uses exhaustive search, which is not feasible when the transmission Bit Budget is large. We propose instead an exact algorithm that solves this optimization problem in linear time and space. We illustrate the advantages of our approach by providing experimental results for the compressed progressive meshes (CPM) mesh compression technique.
-
ICME - Optimal Error Protection of Progressively Compressed 3D Meshes
2006 IEEE International Conference on Multimedia and Expo, 2006Co-Authors: Shakeel Ahmad, Raouf HamzaouiAbstract:Given a number of available layers of source data and a transmission Bit Budget, we propose an algorithm that determines how many layers should be sent and how many protection Bits should be allocated to each transmitted layer such that the expected distortion at the receiver is minimum. The algorithm is used for robust transmission of progressively compressed 3D models over a packet erasure channel. In contrast to the previous approach, which uses exhaustive search, the time complexity of our algorithm is linear in the transmission Bit Budget.
Raouf Hamzaoui - One of the best experts on this subject based on the ideXlab platform.
-
1Unequal Error Protection using Fountain Codes with Applications to Video Communication
2016Co-Authors: Shakeel Ahmad, Raouf Hamzaoui, Marwan Al-akaidiAbstract:Application-layer forward error correction (FEC) is used in many multimedia communication systems to address the problem of packet loss in lossy packet networks. One powerful form of application-layer FEC is unequal error protection which protects the information symbols according to their importance. We propose a method for unequal error protection with a Fountain code. When the information symbols were partitioned into two protection classes (most important and least important), our method required a smaller transmission Bit Budget to achieve low Bit error rates compared to the two state of the art techniques. We also compared our method to the two state of the art techniques for video unicast and multicast over a lossy network. Simulations for the scalable video coding (SVC) extension of the H.264/AVC standard showed that our method required a smaller transmission Bit Budget to achieve high quality video. EDICS: 5-HIDE. Index terms: Fountain codes, unequal error protection, video transmission. I
-
unequal error protection using fountain codes with applications to video communication
IEEE Transactions on Multimedia, 2011Co-Authors: Shakeel Ahmad, Raouf Hamzaoui, Marwan AlakaidiAbstract:Application-layer forward error correction (FEC) is used in many multimedia communication systems to address the problem of packet loss in lossy packet networks. One powerful form of application-layer FEC is unequal error protection which protects the information symbols according to their importance. We propose a method for unequal error protection with a Fountain code. When the information symbols were partitioned into two protection classes (most important and least important), our method required a smaller transmission Bit Budget to achieve low Bit error rates compared to the two state-of-the-art techniques. We also compared our method to the two state-of-the-art techniques for video unicast and multicast over a lossy network. Simulations for the scalable video coding (SVC) extension of the H.264/AVC standard showed that our method required a smaller transmission Bit Budget to achieve high-quality video.
-
Optimal Packet Loss Protection of Progressively Compressed 3-D Meshes
IEEE Transactions on Multimedia, 2009Co-Authors: Shakeel Ahmad, Raouf Hamzaoui, Marwan Al-akaidiAbstract:We consider a state-of-the-art system that uses layered source coding and forward error correction with Reed-Solomon codes to efficiently transmit 3-D meshes over lossy packet networks. Given a transmission Bit Budget, the performance of this system can be optimized by determining how many layers should be sent, how each layer should be packetized, and how many parity Bits should be allocated to each layer such that the expected distortion at the receiver is minimum. The previous solution for this optimization problem uses exhaustive search, which is not feasible when the transmission Bit Budget is large. We propose instead an exact algorithm that solves this optimization problem in linear time and space. We illustrate the advantages of our approach by providing experimental results for the compressed progressive meshes (CPM) mesh compression technique.
-
ICME - Optimal Error Protection of Progressively Compressed 3D Meshes
2006 IEEE International Conference on Multimedia and Expo, 2006Co-Authors: Shakeel Ahmad, Raouf HamzaouiAbstract:Given a number of available layers of source data and a transmission Bit Budget, we propose an algorithm that determines how many layers should be sent and how many protection Bits should be allocated to each transmitted layer such that the expected distortion at the receiver is minimum. The algorithm is used for robust transmission of progressively compressed 3D models over a packet erasure channel. In contrast to the previous approach, which uses exhaustive search, the time complexity of our algorithm is linear in the transmission Bit Budget.
Haoshan Shi - One of the best experts on this subject based on the ideXlab platform.
-
APPT - An effective real-time rate control scheme for video codec
Lecture Notes in Computer Science, 1Co-Authors: Wei Sun, Haoshan ShiAbstract:To reduce the complexity of the Bit allocation scheme for real-time video codec and keep an acceptable video quality, an effective rate control scheme combined with the fast mode decision is proposed. The length of each GOP(group of pictures) is dynamically determined according to the content of the video clip. The algorithm employs a MAD-tracing based model to allocate Bit Budget between frames within the same GOP. More motional and active macroblocks(MBs) get more Bits than other MBs in the same frame. The median result then can be reused to accelerate fast mode decision procedure. Experimental results show the proposed methods can enhance the overall quality of compressed video.
Marwan Alakaidi - One of the best experts on this subject based on the ideXlab platform.
-
unequal error protection using fountain codes with applications to video communication
IEEE Transactions on Multimedia, 2011Co-Authors: Shakeel Ahmad, Raouf Hamzaoui, Marwan AlakaidiAbstract:Application-layer forward error correction (FEC) is used in many multimedia communication systems to address the problem of packet loss in lossy packet networks. One powerful form of application-layer FEC is unequal error protection which protects the information symbols according to their importance. We propose a method for unequal error protection with a Fountain code. When the information symbols were partitioned into two protection classes (most important and least important), our method required a smaller transmission Bit Budget to achieve low Bit error rates compared to the two state-of-the-art techniques. We also compared our method to the two state-of-the-art techniques for video unicast and multicast over a lossy network. Simulations for the scalable video coding (SVC) extension of the H.264/AVC standard showed that our method required a smaller transmission Bit Budget to achieve high-quality video.
Marwan Al-akaidi - One of the best experts on this subject based on the ideXlab platform.
-
1Unequal Error Protection using Fountain Codes with Applications to Video Communication
2016Co-Authors: Shakeel Ahmad, Raouf Hamzaoui, Marwan Al-akaidiAbstract:Application-layer forward error correction (FEC) is used in many multimedia communication systems to address the problem of packet loss in lossy packet networks. One powerful form of application-layer FEC is unequal error protection which protects the information symbols according to their importance. We propose a method for unequal error protection with a Fountain code. When the information symbols were partitioned into two protection classes (most important and least important), our method required a smaller transmission Bit Budget to achieve low Bit error rates compared to the two state of the art techniques. We also compared our method to the two state of the art techniques for video unicast and multicast over a lossy network. Simulations for the scalable video coding (SVC) extension of the H.264/AVC standard showed that our method required a smaller transmission Bit Budget to achieve high quality video. EDICS: 5-HIDE. Index terms: Fountain codes, unequal error protection, video transmission. I
-
Optimal Packet Loss Protection of Progressively Compressed 3-D Meshes
IEEE Transactions on Multimedia, 2009Co-Authors: Shakeel Ahmad, Raouf Hamzaoui, Marwan Al-akaidiAbstract:We consider a state-of-the-art system that uses layered source coding and forward error correction with Reed-Solomon codes to efficiently transmit 3-D meshes over lossy packet networks. Given a transmission Bit Budget, the performance of this system can be optimized by determining how many layers should be sent, how each layer should be packetized, and how many parity Bits should be allocated to each layer such that the expected distortion at the receiver is minimum. The previous solution for this optimization problem uses exhaustive search, which is not feasible when the transmission Bit Budget is large. We propose instead an exact algorithm that solves this optimization problem in linear time and space. We illustrate the advantages of our approach by providing experimental results for the compressed progressive meshes (CPM) mesh compression technique.