共查询到20条相似文献,搜索用时 0 毫秒
1.
Over the last few years, there has been a tremendous increase in the number of interactive multimedia presentations prepared
by different individuals and organizations. In this paper, we present an algebra for creating and querying interactive multimedia
presentation databases. This algebra operates on trees whose branches reflect different possible playouts of a set of presentations.
The algebra not only extends all the classical relational operators to such databases, but also introduces a variety of novel
operators for combining multiple presentations. As our algebra supports merging parts or all of existing presentations, this
algebra can also be used as an authoring tool for creating multimedia presentations. We prove a host of equivalence results
for queries in this algebra, which may be used to build query optimizers for interactive presentation databases. 相似文献
2.
A multimedia application involves information that may be in a form of video, images, audio, text and graphics, need to be
stored, retrieved and manipulated in large databases. In this paper, we propose an object-oriented database schema that supports
multimedia documents and their temporal, spatial and logical structures. We present a document example and show how the schema
can adress all the structures described. We also present a multimedia query specification language that can be used to describe
a multimedia content portion to be retrieved from the database. The language provides means by which the user can specify
the information on the media as well as the temoral and spatial relationships among these media. 相似文献
3.
The problem of presenting database query results has not been investigated sufficiently. This work proposes an approach to
identify effective presentations for the results of database queries. This will be done by considering different kinds of
information, such as user goals, the characteristics of the data to be presented, and the relationships among them. Our approach
is based on the definition of composition operations which, on the basis of elementary presentation types, allow us to obtain designs of complex final presentations. Some effectiveness criteria are considered in order to identify
those presentations which best match the user's goals and cognitive abilities. We consider multimedia environments at both
the data and presentation level. 相似文献
4.
In a multimedia server, multiple media streams are generally serviced in a cyclic fashion. Due to non-uniform playback rates
and asynchronous arrivals of queries, there tends to be spare disk bandwidth in each service cycle. In this paper, we study
the issue of dynamically using spare disk bandwidth and buffer to maximize the system throughput of a multimedia server. We
introduce the concept of minimizing buffer consumption as the criterion to select an appropriate media stream to utilize the spare system resources. Buffer consumption measures
not only the amount of buffer but also the amount of time such buffer space is occupied (i.e., the space-time product). Different
alternatives to utilizing spare disk bandwidth are examined, including different rate-adjustable retrievals of an already
activated stream and prefetching the next waiting stream. For rate-adjustable retrievals, we study buffer consumption-based and remaining-time-based criteria for selecting an active stream to increase retrievals. Simulations are conducted to evaluate and compare different
cases. The results show that (1) minimizing buffer consumption is the right criterion for maximizing the system throughput
with spare disk bandwidth; (2) in general, prefetching a waiting stream incurs more buffer consumption, and thus is less effective
than rate-adjustable retrieval of active streams in maximizing the system throughput; and (3) the advantage of rate-adjustable
retrieval over prefetching is especially significant when service cycle time is small. 相似文献
5.
We describe a system for generating and controlling sound effects from within applications. We discuss performance demands
and current technology constraints on sound synthesis methods, highlight several distinct interactive control strategies,
and demonstrate a development environment for making a large database of heterogeneous sound models manageable by developers
who are not sound synthesis experts. 相似文献
6.
I. Mirbel B. Pernici T. Sellis S. Tserkezoglou M. Vazirgiannis 《The VLDB Journal The International Journal on Very Large Data Bases》2000,9(2):111-130
Abstract. When authoring multimedia scenarios, and in particular scenarios with user interaction, where the sequence and time of occurrence
of interactions is not predefined, it is difficult to guarantee the consistency of the resulting scenarios. As a consequence,
the execution of the scenario may result in unexpected behavior or inconsistent use of media. The present paper proposes a methodology
for checking the temporal integrity of interactive multimedia document (IMD) scenarios at authoring time at various levels.
The IMD flow is mainly defined by the events occurring during the IMD session. Integrity checking consists of a set of discrete
steps, during which we transform the scenario into temporal constraint networks representing the constraints linking the different
possible events in the scenario. Temporal constraint verification techniques are applied to verify the integrity of the scenario,
deriving a minimal network, showing possible temporal relationships between events given a set of constraints.
Received June 9, 1998 / Accepted November 10, 1999 相似文献
7.
Denise J. Ecklund Vera Goebel Thomas Plagemann Earl F. Ecklund Jr. 《Multimedia Systems》2002,8(5):431-442
In this paper, we present a separable, reusable middleware solution that provides coordinated, end-to-end QoS management
over any type of service component, and can use existing (legacy) QoS management solutions (by using wrappers) in a distributed
multimedia system. Our middleware solution incorporates strategic and tactical QoS managers, and supports protocols and messages
between tactical managers and managed application components, and between QoS managers in the management hierarchy. Strategic
QoS managers take a global view of QoS provided by a set of application components within the manager's policy domain. Tactical
QoS managers provide local control over application components. We introduce the concept of QoS policy domains to scope the
authority of a strategic QoS manager. We describe how the management hierarchy is dynamically configured and reconfigured
based on runtime needs of the application. 相似文献
8.
Minos N. Garofalakis Banu Özden Avi Silberschatz 《The VLDB Journal The International Journal on Very Large Data Bases》1998,7(4):206-225
The Enhanced Pay-Per-View (EPPV) model for providing continuous-media services associates with each continuous-media clip
a display frequency that depends on the clip's popularity. The aim is to increase the number of clients that can be serviced
concurrently beyond the capacity limitations of available resources, while guaranteeing a constraint on the response time.
This is achieved by sharing periodic continuous-media streams among multiple clients. The EPPV model offers a number of advantages
over other data-sharing schemes (e.g., batching), which make it more attractive to large-scale service providers. In this
paper, we provide a comprehensive study of the resource-scheduling problems associated with supporting EPPV for continuous-media
clips with (possibly) different display rates, frequencies, and lengths. Our main objective is to maximize the amount of disk
bandwidth that is effectively scheduled under the given data layout and storage constraints. Our formulation gives rise to
-hard combinatorial optimization problems that fall within the realm of hard real-time scheduling theory. Given the intractability
of the problems, we propose novel heuristic solutions with polynomial-time complexity. We also present preliminary experimental
results for the average case behavior of the proposed scheduling schemes and examine how they compare to each other under
different workloads. A major contribution of our work is the introduction of a robust scheduling framework that, we believe,
can provide solutions for a variety of realistic EPPV resource-scheduling scenarios, as well as any scheduling problem involving
regular, periodic use of a shared resource. Based on this framework, we propose various interesting research directions for
extending the results presented in this paper.
Received June 9, 1998 / Accepted October 13, 1998 相似文献
9.
Aya Soffer Hanan Samet 《The VLDB Journal The International Journal on Very Large Data Bases》1998,7(4):253-274
Symbolic images are composed of a finite set of symbols that have a semantic meaning. Examples of symbolic images include
maps (where the semantic meaning of the symbols is given in the legend), engineering drawings, and floor plans. Two approaches
for supporting queries on symbolic-image databases that are based on image content are studied. The classification approach
preprocesses all symbolic images and attaches a semantic classification and an associated certainty factor to each object
that it finds in the image. The abstraction approach describes each object in the symbolic image by using a vector consisting
of the values of some of its features (e.g., shape, genus, etc.). The approaches differ in the way in which responses to queries
are computed. In the classification approach, images are retrieved on the basis of whether or not they contain objects that
have the same classification as the objects in the query. On the other hand, in the abstraction approach, retrieval is on
the basis of similarity of feature vector values of these objects. Methods of integrating these two approaches into a relational
multimedia database management system so that symbolic images can be stored and retrieved based on their content are described.
Schema definitions and indices that support query specifications involving spatial as well as contextual constraints are presented.
Spatial constraints may be based on both locational information (e.g., distance) and relational information (e.g., north of).
Different strategies for image retrieval for a number of typical queries using these approaches are described. Estimated costs
are derived for these strategies. Results are reported of a comparative study of the two approaches in terms of image insertion
time, storage space, retrieval accuracy, and retrieval time.
Received June 12, 1998 / Accepted October 13, 1998 相似文献
10.
Nevzat Hurkan Balkir Gultekin Ozsoyoglu 《The VLDB Journal The International Journal on Very Large Data Bases》1998,7(4):294-307
Most multimedia servers reported in the literature are designed to serve multiple and independent video/audio streams. We
think that, in future, multimedia servers will also serve complete presentations. Multimedia presentations provide unique
opportunities to develop algorithms for buffer management and admission control, as execution-time consumption requirements
of presentations are known a priori. In this paper, we examine presentations in three different domains (heavyweight, middleweight,
and lightweight) and provide buffer management and admission control algorithms for the three domains. We propose two improvements
(flattening and dynamic-adjustments) on the schedules created for the heavyweight presentations. Results from a simulation
environment are presented.
Received June 9, 1998 / Accepted October 13, 1998 相似文献
11.
Adaptive multimedia synchronization in a teleconference system 总被引:3,自引:0,他引:3
In this paper, we present an adaptive buffering scheme for implementing intra-stream and inter-stream synchronization in
real-time multimedia applications. The essence of the proposed scheme is to dynamically enforce equalized delays to incoming
media streams, in order to piece-wise smooth the network delay variations and to synchronize the streams at the sink. An adaptive
control mechanism based on an event-counting algorithm is employed to calibrate the PlayOut Clocks (POCs), which manages the
presentations of multimedia data. The algorithm does not rely on globally synchronized clock and makes minimal assumption
on underlying network delay distribution. Also, the user defined quality of service (QoS) specifications can be directly incorporated
into the design parameters of the synchronization algorithm. The proposed synchronization scheme has been experimentally implemented
in a teleconference system which consists of separately controllable audio, video, and data channels. The modular structure
of the synchronization control provides the flexibility to maintain an arbitrary synchronization group in conjunction with
a distributed conference management scheme. This paper also shows the experimental results of the test implementation and
the suitability of the proposed scheme with respect to the multimedia traffic across an FDDI/Ethernet network. 相似文献
12.
In this paper, we investigate a playout scheduling framework for supporting the continuous and synchronized presentations
of multimedia streams in a distributed multimedia presentation system. We assume a situation in which the server and network
transmissions provide sufficient support for the delivery of media objects. In this context, major issues regarding the enforcement
of the smooth presentation of multimedia streams at client sites must be addressed to deal with rate variance of stream presentations
and delay variance of networks. We develop various playout-scheduling algorithms that are adaptable to quality-of-service
parameters. The proposed algorithms permit the local adjustment of unsynchronized presentations by gradually accelerating
or retarding presentation components, rather than abruptly skipping or pausing the presentation materials. A comprehensive
experimental analysis of the proposed algorithms demonstrates that our algorithms can effectively avoid playout gaps (or hiccups)
in the presentations. This scheduling framework can be readily used to support customized multimedia presentations. 相似文献
13.
Multimedia systems must be able to support a certain quality of service (QoS) to satisfy the stringent real-time performance
requirements of their applications. HeiRAT, the Heidelberg Resource Administration Technique, is a comprehensive QoS management
system that was designed and implemented in connection with a distributed multimedia platform for networked PCs and workstations.
HeiRAT includes techniques for QoS negotiation, QoS calculation, resource reservation, and resource scheduling for local and
network resources. 相似文献
14.
Nikitas M. Sgouros 《Multimedia Systems》2003,8(6):470-481
Interactive performance systems allow multiple, networked users to take part in a performance either as players or audience
members and influence the performance's development in real time. Among the most prominent research issues concerning the
development of these systems are the provision of effective interaction capabilities and adequate means of expression to the
audience. This article describes a set of methods for the detection, analysis, synchronization and rendering of audience behavior
in real-time during such an event. Furthermore, it describes ways in which audience feedback is utilized to dynamically index
the contents of a performance so as to embed this event in large-scale multimedia services. All these methods have been applied
in the creation of MISSION, a multi-user game involving both players and audience. This article presents and analyzes the
design of the system and the results of user trials with it. 相似文献
15.
As multimedia applications spread widely, it is crucial for programming and design support systems to handle “time” in multimedia
documents effectively and flexibly. This paper presents a set of interactive system support tools for designing and maintaining
the temporal behavior of multimedia documents. The tool set provides mechanisms for anomaly detection, temporal query processing,
and interactive scheduling. It is based on a fast incremental constraint solver we have developed, which can be adapted by
any constraint-based system. The incremental constraint solver provides immediate feedback to the user, supporting a highly
interactive design process. Combined with existing optimal layout generation mechanisms proposed in the literature, our tools
effectively utilize the flexibility provided by constraint-based systems. 相似文献
16.
One of the challenges in the design of a distributed multimedia system
is devising suitable specification models for various schemas in
different levels of the system.
Another important research issue is
the integration and synchronization of heterogeneous multimedia
objects. In this paper, we present our models for multimedia schemas
and transformation algorithms. They transform high-level
multimedia objects into schemas that can be used to
support the presentation and communication of the multimedia objects.
A key module in the system is the Object Exchange Manager (OEM). In this paper,
we present the design and implementation of the OEM module,
and discuss in detail the interaction
between the OEM and other modules in a
distributed multimedia system. 相似文献
17.
The multimedia multicasting problem 总被引:4,自引:0,他引:4
This paper explores the problems associated with the multicasting of continuous media to support multimedia group applications.
The interaction between multicasting and the delivery of multiple time-correlated continuous-media streams with real-time
delay requirements poses various new and interesting problems in research on communication protocols and architectures. We
describe these problems, and identify where the opportunities are for effective solutions, all in the context of providing
an overview of the current state of research in multimedia multicasting. The issues we discuss include quality of service,
resource reservations, routing, error and traffic control, heterogeneity, and the use of hierarchical coding and open-loop
control techniques. 相似文献
18.
Update propagation strategies to improve freshness in lazy master replicated databases 总被引:4,自引:0,他引:4
Esther Pacitti Eric Simon 《The VLDB Journal The International Journal on Very Large Data Bases》2000,8(3-4):305-318
Many distributed database applications need to replicate data to improve data availability and query response time. The two-phase
commit protocol guarantees mutual consistency of replicated data but does not provide good performance. Lazy replication has
been used as an alternative solution in several types of applications such as on-line financial transactions and telecommunication
systems. In this case, mutual consistency is relaxed and the concept of freshness is used to measure the deviation between
replica copies. In this paper, we propose two update propagation strategies that improve freshness. Both of them use immediate
propagation: updates to a primary copy are propagated towards a slave node as soon as they are detected at the master node
without waiting for the commitment of the update transaction. Our performance study shows that our strategies can improve
data freshness by up to five times compared with the deferred approach.
Received April 24, 1998 / Revised June 7, 1999 相似文献
19.
In this paper, we propose a multi-level abstraction mechanism for capturing the spatial and temporal semantics associated
with various objects in an input image or in a sequence of video frames. This abstraction can manifest itself effectively
in conceptualizing events and views in multimedia data as perceived by individual users. The objective is to provide an efficient
mechanism for handling content-based queries, with the minimum amount of processing performed on raw data during query evaluation.
We introduce a multi-level architecture for video data management at different levels of abstraction. The architecture facilitates
a multi-level indexing/searching mechanism. At the finest level of granularity, video data can be indexed based on mere appearance
of objects and faces. For management of information at higher levels of abstractions, an object-oriented paradigm is proposed
which is capable of supporting domain specific views. 相似文献
20.
Multimedia streams such as audio and video impose tight temporal constraints for their presentation. Often, related multimedia
streams, such as audio and video, must be presented in a synchronized way. We introduce a novel scheme to ensure the continuous
and synchronous delivery of distributed stored multimedia streams across a communications network. We propose a new protocol for synchronized playback and compute the buffer
required to achieve both, the continuity within a single substream and the synchronization between related substreams. The
scheme is very general and does not require synchronized clocks. Using a resynchronization protocol based on buffer level
control, the scheme is able to cope with server drop-outs and clock drift. The synchronization scheme has been implemented
and the paper concludes with our experimental results. 相似文献