2012-09-26 20:15:58: Created issue 'Bounding SDP-US rendering complexity' nickname render-complexity owned by Pierre-Anthony Lemieux on product Simple Delivery Profile for Closed Captions, description 'Bounding SDP-US rendering complexity
SDP-US is a profile of TTML that specifies constraints such as supported TTML features and number of regions active at any given time. It does not however impose bounds on key aspects of rendering complexity, such as character and background drawing rates. Without such bounds, a valid SDP-US document might not successfully play on all implementations or, equivalently, determining the processing requirements of an implementation is not possible.
CFF-TT is a profile of TTML developed by the DECE consortium (http://uvvu.com)
for internet delivery of subtitles and captions. Consumer devices implementing CFF-TT are expected to be widely deployed. The CFF-TT specification is publicly available at http://uvvu.com/docs/public/tspec/CFFMediaFormat-1.0.4.pdf.
As with SDP-US, CFF-TT specifies supported TTML features -- largely a superset of the features supported by SDP-US. To further simplify implementation and improve interoperability, CFF-TT also imposes bounds on rendering complexity through the use of an hypothetical rendering model.
SDP-US should consider adopting, a subset of or in its entirety, the rendering complexity bounds (and rendering model) defined by CFF-TT.
Such adoption would futher:
- simplify implementations and improve interoperability by bounding rendering (and thus document) complexity
- encourage adoption of SDP-US and TTML by ensuring that SDP-US content can be played on any CFF-compliant CE device
Adopting the CFF-TT hypothetical renderer and bounds on document complexity could be achieved in a number of ways, including:
(a) mapping the CFF-TT rendering model to the existing (XSL-based) TTML rendering model
(b) referencing the relevant sections of the CFF-TT specification defining the CFF-TT rendering model
(c) importing the CFF-TT rendering model into the SDP-US specification' non-public [Pierre-Anthony Lemieux]