IEICE TRANSACTIONS on Communications
A Mathematical Analysis on Error Propagation of EREC and Its Application to Optimal Channel-Matched Searching Pattern for Robust Transmission of Coded Video
Summary :
The error resilient entropy coding (EREC) provides efficient resynchronization method to the coded bitstream, which might be corrupted by transmission errors. The technique has been given more prominence, nowadays, because it achieves fast resynchronization without sizable overhead, and thereby provides graceful quality degradation according to the network conditions. This paper presents a novel framework to analyze the performance of EREC in terms of the error probability in decoding a basic resynchronization unit (RU) for various error prone networks. In order to show the feasibility of the proposed framework, this paper also proposes a novel EREC algorithm based on the slightly modified H.263 bitstream syntax. The proposed scheme minimizes the effect of errors on low frequency DCT coefficients and incorporates near optimal channel-matched searching pattern (SP), which guarantees the best possible quality of reproduced video. Given the number of bits generated for each RU, the near optimal SP is produced by the proposed iterative deterministic partial SP update method, which reduces the complexity of finding optimal solution, O((N-1)!), to O(m·N2). The proposed EREC algorithm significantly improves the decoded video quality, especially when the bit error rate is in the rage of 10-3-10-4. Up to 5 dB enhancement of the PSNR value was observed in a single video frame.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E90-B No.9 pp.2571-2587
- Publication Date
- 2007/09/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1093/ietcom/e90-b.9.2571
- Type of Manuscript
- PAPER
- Category
- Multimedia Systems for Communications
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yong-Goo KIM, Yungho CHOI, Yoonsik CHOE, "A Mathematical Analysis on Error Propagation of EREC and Its Application to Optimal Channel-Matched Searching Pattern for Robust Transmission of Coded Video" in IEICE TRANSACTIONS on Communications,
vol. E90-B, no. 9, pp. 2571-2587, September 2007, doi: 10.1093/ietcom/e90-b.9.2571.
Abstract: The error resilient entropy coding (EREC) provides efficient resynchronization method to the coded bitstream, which might be corrupted by transmission errors. The technique has been given more prominence, nowadays, because it achieves fast resynchronization without sizable overhead, and thereby provides graceful quality degradation according to the network conditions. This paper presents a novel framework to analyze the performance of EREC in terms of the error probability in decoding a basic resynchronization unit (RU) for various error prone networks. In order to show the feasibility of the proposed framework, this paper also proposes a novel EREC algorithm based on the slightly modified H.263 bitstream syntax. The proposed scheme minimizes the effect of errors on low frequency DCT coefficients and incorporates near optimal channel-matched searching pattern (SP), which guarantees the best possible quality of reproduced video. Given the number of bits generated for each RU, the near optimal SP is produced by the proposed iterative deterministic partial SP update method, which reduces the complexity of finding optimal solution, O((N-1)!), to O(m·N2). The proposed EREC algorithm significantly improves the decoded video quality, especially when the bit error rate is in the rage of 10-3-10-4. Up to 5 dB enhancement of the PSNR value was observed in a single video frame.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e90-b.9.2571/_p
Copy
@ARTICLE{e90-b_9_2571,
author={Yong-Goo KIM, Yungho CHOI, Yoonsik CHOE, },
journal={IEICE TRANSACTIONS on Communications},
title={A Mathematical Analysis on Error Propagation of EREC and Its Application to Optimal Channel-Matched Searching Pattern for Robust Transmission of Coded Video},
year={2007},
volume={E90-B},
number={9},
pages={2571-2587},
abstract={The error resilient entropy coding (EREC) provides efficient resynchronization method to the coded bitstream, which might be corrupted by transmission errors. The technique has been given more prominence, nowadays, because it achieves fast resynchronization without sizable overhead, and thereby provides graceful quality degradation according to the network conditions. This paper presents a novel framework to analyze the performance of EREC in terms of the error probability in decoding a basic resynchronization unit (RU) for various error prone networks. In order to show the feasibility of the proposed framework, this paper also proposes a novel EREC algorithm based on the slightly modified H.263 bitstream syntax. The proposed scheme minimizes the effect of errors on low frequency DCT coefficients and incorporates near optimal channel-matched searching pattern (SP), which guarantees the best possible quality of reproduced video. Given the number of bits generated for each RU, the near optimal SP is produced by the proposed iterative deterministic partial SP update method, which reduces the complexity of finding optimal solution, O((N-1)!), to O(m·N2). The proposed EREC algorithm significantly improves the decoded video quality, especially when the bit error rate is in the rage of 10-3-10-4. Up to 5 dB enhancement of the PSNR value was observed in a single video frame.},
keywords={},
doi={10.1093/ietcom/e90-b.9.2571},
ISSN={1745-1345},
month={September},}
Copy
TY - JOUR
TI - A Mathematical Analysis on Error Propagation of EREC and Its Application to Optimal Channel-Matched Searching Pattern for Robust Transmission of Coded Video
T2 - IEICE TRANSACTIONS on Communications
SP - 2571
EP - 2587
AU - Yong-Goo KIM
AU - Yungho CHOI
AU - Yoonsik CHOE
PY - 2007
DO - 10.1093/ietcom/e90-b.9.2571
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E90-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2007
AB - The error resilient entropy coding (EREC) provides efficient resynchronization method to the coded bitstream, which might be corrupted by transmission errors. The technique has been given more prominence, nowadays, because it achieves fast resynchronization without sizable overhead, and thereby provides graceful quality degradation according to the network conditions. This paper presents a novel framework to analyze the performance of EREC in terms of the error probability in decoding a basic resynchronization unit (RU) for various error prone networks. In order to show the feasibility of the proposed framework, this paper also proposes a novel EREC algorithm based on the slightly modified H.263 bitstream syntax. The proposed scheme minimizes the effect of errors on low frequency DCT coefficients and incorporates near optimal channel-matched searching pattern (SP), which guarantees the best possible quality of reproduced video. Given the number of bits generated for each RU, the near optimal SP is produced by the proposed iterative deterministic partial SP update method, which reduces the complexity of finding optimal solution, O((N-1)!), to O(m·N2). The proposed EREC algorithm significantly improves the decoded video quality, especially when the bit error rate is in the rage of 10-3-10-4. Up to 5 dB enhancement of the PSNR value was observed in a single video frame.
ER -
English
