Constraint-based automation of multimedia presentation assembly

In this paper, we present a methodology for automated construction of multi media presentations. Semantic coherency of a multimedia presentation is exp ressed in terms of presentation inclusion and exclusion constraints. When a user specifies a set of segments for a presentation, the multimedia databa se system adds segments into and/or deletes segments from the set in order to satisfy the inclusion and exclusion constraints. We discuss the consiste ncy and the satisfiability of inclusion and exclusion constraints when excl usion is allowed. Users express a presentation query by (a) pointing and cl icking to an initial set of desired multimedia segments to be included into the presentation, and (b) specifying an upper bound on the time length of the presentation. The multimedia database system then finds the set of segm ents satisfying the inclusion-exclusion constraints and the time bound. Usi ng priorities for segments and inclusion constraints, we give two algorithm s for automated presentation assembly and discuss their complexity. To auto mate the assembly of a presentation with concurrent presentation streams, w e introduce presentation organization constraints that are incorporated int o the multimedia data model, independent of any presentation. We define fou r types of presentation organization constraints that, together with an und erlying database ordering, allow us to obtain a unique presentation graph f or a given set of multimedia segments. We briefly summarize a prototype sys tem that fully incorporates the algorithms for the segment selection proble m.