| 摘要 |
<p>In order to access rapidly the description (DM) at any predetermined time (t) of a multimedia document and avoid browsing through the entire multimedia document, the invention constructs an indexing structure (SI) in the form of a binary tree having nodes which are formed by predetermined time boundaries of all the temporal description segments of the document, at the rate of one predetermined boundary (TI) per segment (SG). With each node (tg) is associated a list (Pg) of pointers to segments which temporally overlap the node. The indexing structure is scanned until the node substantially closest to the predetermined time is found so as to form a reply with the descriptors of the segments which are associated with the found node.</p> |
