Comments on "optimal erasure protection for scalably compressed video streams with limited retransmission"
In order to prove a key result for their development (Lemma 2), Taubman and Thie need the assumption that the upper boundary of the convex hull of the channel coding probability-redundancy characteristic is sufficiently dense. Since a floor value for the density level for which the claim to hold is...
Veröffentlicht in: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 18(2009), 1 vom: 15. Jan., Seite 214-6 |
---|---|
1. Verfasser: | |
Format: | Online-Aufsatz |
Sprache: | English |
Veröffentlicht: |
2009
|
Zugriff auf das übergeordnete Werk: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society |
Schlagworte: | Comment Letter |
Zusammenfassung: | In order to prove a key result for their development (Lemma 2), Taubman and Thie need the assumption that the upper boundary of the convex hull of the channel coding probability-redundancy characteristic is sufficiently dense. Since a floor value for the density level for which the claim to hold is not specified, it is not clear whether their lemma applies to practical situations. In this correspondence, we show that the constraint of sufficient density can be removed, and, thus, we validate the conclusion of the lemma for any scenario encountered in practice |
---|---|
Beschreibung: | Date Completed 19.02.2009 Date Revised 19.12.2008 published: Print CommentOn: IEEE Trans Image Process. 2005 Aug;14(8):1006-19. - PMID 16121450 Citation Status MEDLINE |
ISSN: | 1941-0042 |
DOI: | 10.1109/TIP.2008.2008043 |