Proceedings of the 14th ACM International Conference on Multimedia 2006
DOI: 10.1145/1180639.1180845
|View full text |Cite
|
Sign up to set email alerts
|

Modelling dependency in multimedia streams

Abstract: Expressing and analysing data dependency in multimedia streams is promising, since content-aware policies at a transport level would benefit from such services. In this paper we present a format-independent dependency model aimed at specifying, validating and reasoning about structural dependency in multimedia streams. Based on this model, we developed a universal dependency description language and a dependency validation service to serve as an infrastructure for content-aware transport layers. Driven by appl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
5
0

Year Published

2007
2007
2011
2011

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 25 publications
0
5
0
Order By: Relevance
“…As will be seen in Section 4.1, a considerable number of algorithms have been developed for optimising the Rate-Distortion (R-D) performance of multimedia delivery (Chakareski et al, 2004a;Chou, 2006;Cranley & Murphy, 2006;Eichhorn, 2006). These algorithms vary in their guarantees of tractability, complexity, and the range of metadata required as inputs to the process.…”
Section: Multiple Optimisation Algorithmsmentioning
confidence: 99%
See 1 more Smart Citation
“…As will be seen in Section 4.1, a considerable number of algorithms have been developed for optimising the Rate-Distortion (R-D) performance of multimedia delivery (Chakareski et al, 2004a;Chou, 2006;Cranley & Murphy, 2006;Eichhorn, 2006). These algorithms vary in their guarantees of tractability, complexity, and the range of metadata required as inputs to the process.…”
Section: Multiple Optimisation Algorithmsmentioning
confidence: 99%
“…Consequently, Chakareski proposes a low-complexity approximation of the lagrangian optimisation problem, by ignoring interdependencies between Data Units and instead assuming that distortion from packet loss on subsequent packets is additive. Eichhorn (2006) suggests the opposite approximation: Chakareski ignores actual dependencies; Eichhorn ignores actual distortions, and asserts that dependency alone may be sufficient. Finally, Cranley & Murphy (2006) trade temporal resolution against spatial resolution and use subjective testing to arrive at a so-called Optimum Adaptation Trajectory.…”
Section: R-d Optimisationmentioning
confidence: 99%
“…Examples include the approaches by Chou [4], Chakareski [14], Eichhorn [15] and Cranley and Murphy [11]. Typically, these algorithms base rate-distortion optimization on error-probability cost functions, where errors are characterised in such a way as to encompass bit error rate, packet loss, and delay (such that the packet is too late to be useful).…”
Section: Rdo Delivery Nodementioning
confidence: 99%
“…(4) describes the probability that a packet, which is not lost, 2 This is an approximation as the actual distortion that may also depend on the delivery status of prior and subsequent NALs. The distortion model can be extended to capture these loss correlations [29]- [31]. Furthermore, we assume that distortions caused by loss of multiple packets are additive, which is reasonable for sparse losses.…”
mentioning
confidence: 99%
“…Most distortion occurs in the first few frames after a loss and breaks after the next I frame; the error depends on the video content of subsequent frames and on the coding decisions. Another approach is to assign distortion values based solely on the GOP structure, ignoring the video content and coding decisions, or to use a model for dependencies [31].…”
mentioning
confidence: 99%