共查询到20条相似文献,搜索用时 250 毫秒
1.
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. 相似文献
2.
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. 相似文献
3.
Due to their large bandwidth demand and synchronization requirements, multimedia applications, in general, consume buffers
of huge size, which prevents potential customers from using multimedia services. We recognize the problem and propose a hierarchical
architecture to reduce the buffer size. The architecture can be applied to both 1- and - applications. We establish the architecture by first determining neighbor sets and then applying a grouping algorithm and
a renegotiation process. This architecture can also meet the synchronization requirements of multimedia applications. We evaluate
the performance of the architecture through simulations and compare it with that of a direct connection architecture. The result shows that the hierarchical architecture reduces the buffer size significantly without
serious penalty to the total bandwidth and without introducing extra hot spots. 相似文献
4.
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. 相似文献
5.
Ada Wai-chee Fu Polly Mei-shuen Chan Yin-Ling Cheung Yiu Sang Moon 《The VLDB Journal The International Journal on Very Large Data Bases》2000,9(2):154-173
Abstract. For some multimedia applications, it has been found that domain objects cannot be represented as feature vectors in a multidimensional
space. Instead, pair-wise distances between data objects are the only input. To support content-based retrieval, one approach
maps each object to a k-dimensional (k-d) point and tries to preserve the distances among the points. Then, existing spatial access index methods such as the R-trees
and KD-trees can support fast searching on the resulting k-d points. However, information loss is inevitable with such an approach since the distances between data objects can only
be preserved to a certain extent. Here we investigate the use of a distance-based indexing method. In particular, we apply
the vantage point tree (vp-tree) method. There are two important problems for the vp-tree method that warrant further investigation,
the n-nearest neighbors search and the updating mechanisms. We study an n-nearest neighbors search algorithm for the vp-tree, which is shown by experiments to scale up well with the size of the dataset
and the desired number of nearest neighbors, n. Experiments also show that the searching in the vp-tree is more efficient than that for the -tree and the M-tree. Next, we propose solutions for the update problem for the vp-tree, and show by experiments that the algorithms are
efficient and effective. Finally, we investigate the problem of selecting vantage-point, propose a few alternative methods,
and study their impact on the number of distance computation.
Received June 9, 1998 / Accepted January 31, 2000 相似文献
6.
In this paper, we present a novel approach for multimedia data indexing and retrieval that is machine independent and highly
flexible for sharing multimedia data across applications. Traditional multimedia data indexing and retrieval problems have
been attacked using the central data server as the main focus, and most of the indexing and query-processing for retrieval
are highly application dependent. This precludes the use of created indices and query processing mechanisms for multimedia
data which, in general, have a wide variety of uses across applications. The approach proposed in this paper addresses three
issues: 1. multimedia data indexing; 2. inference or query processing; and 3. combining indices and inference or query mechanism
with the data to facilitate machine independence in retrieval and query processing. We emphasize the third issue, as typically
multimedia data are huge in size and requires intra-data indexing. We describe how the proposed approach addresses various
problems faced by the application developers in indexing and retrieval of multimedia data. Finally, we present two applications
developed based on the proposed approach: video indexing; and video content authorization for presentation. 相似文献
7.
The next generation of interactive multimedia documents can contain both static media, e.g., text, graph, image, and continuous
media, e.g., audio and video, and can provide user interactions in distributed environments. However, the temporal information
of multimedia documents cannot be described using traditional document structures, e.g., Open Document Architecture (ODA)
and Standard Generalized Mark-up Language (SGML); the continuous transmission of media units also raises some new synchronization
problems, which have not been met before, for processing user interactions. Thus, developing a distributed interactive multimedia
document system should resolve the issues of document model, presentation control architecture, and control scheme. In this
paper, we (i) propose a new multimedia document model that contains the logical structure, the layout structure, and the temporal
structure to formally describe multimedia documents, and (ii) point out main interaction-based synchronization problems, and
propose a control architecture and a token-based control scheme to solve these interaction-based synchronization problems.
Based on the proposed document model, control architecture, and control scheme, a distributed interactive multimedia document
development mechanism, which is called MING-I, is developed on SUN workstations. 相似文献
8.
Network synchronization plays a significant role
in transmitting multimedia objects over computer networks.
Even packets from a single channel must be synchronized due to
the problems in a packet switching environment, such as
network jitter, frequency, and time offsets. We present an
algorithm that determines the set of packets generated
periodically by various participants arriving at a node. The basic
advantage of the proposed algorithm is that the receiver
estimates the reference times (expected arrival times of the
packets) and achieves synchronization, without knowledge of the
packet delays.
The
accuracy is improved and the complexity is reduced by
predicting the time/frequency offsets between the clocks at the
source and the mixer. The error is calculated by the Chernoff
bound, demonstrated by simulation, and shown to be acceptable
in practical applications. 相似文献
9.
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. 相似文献
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.
In this paper, we present two novel disk failure recovery methods that utilize the inherent characteristics of video streams
for efficient recovery. Whereas the first method exploits the inherent redundancy in video streams (rather than error-correcting
codes) to approximately reconstruct data stored on failed disks, the second method exploits the sequentiality of video playback
to reduce the overhead of online failure recovery in conventional RAID arrays. For the former approach, we present loss-resilient
versions of JPEG and MPEG compression algorithms. We present an inherently redundant array of disks (IRAD) architecture that combines these loss-resilient compression algorithms with techniques for efficient placement of video streams
on disk arrays to ensure that on-the-fly recovery does not impose any additional load on the array. Together, they enhance
the scalability of multimedia servers by (1) integrating the recovery process with the decompression of video streams, and
thereby distributing the reconstruction process across the clients; and (2) supporting graceful degradation in the quality
of recovered images with increase in the number of disk failures. We present analytical and experimental results to show that
both schemes significantly reduce the failure recovery overhead in a multimedia server. 相似文献
12.
K. Selçuk Candan Eric Lemar V.S. Subrahmanian 《The VLDB Journal The International Journal on Very Large Data Bases》2000,9(2):131-153
Abstract. Though there has been extensive work on multimedia databases in the last few years, there is no prevailing notion of a multimedia
view, nor there are techniques to create, manage, and maintain such views. Visualizing the results of a dynamic multimedia
query or materializing a dynamic multimedia view corresponds to assembling and delivering an interactive multimedia presentation
in accordance with the visualization specifications. In this paper, we suggest that a non-interactive multimedia presentation
is a set of virtual objects with associated spatial and temporal presentation constraints. A virtual object is either an object, or the result of a query.
As queries may have different answers at different points in time, scheduling the presentation of such objects is nontrivial.
We then develop a probabilistic model of interactive multimedia presentations, extending the non-interactive model described
earlier. We also develop a probabilistic model of interactive visualization where the probabilities reflect the user profiles,
or the likelihood of certain user interactions. Based on this probabilistic model, we develop three utility-theoretic based
types of prefetching algorithms that anticipate how users will interact with the presentation. These prefetching algorithms
allow efficient visualization of the query results in accordance with the underlying specification. We have built a prototype
system that incorporates these algorithms. We report on the results of experiments conducted on top of this implementation.
Received June 10, 1998 / Accepted November 10, 1999 相似文献
13.
Without user interactions, multimedia presentations are just fancy slide shows with sound and video supports. User interactions
by themselves do not change the temporal relationships among multimedia objects, such as texts, graphics, images, audio, and
video, but affect the playback schedules. In this paper, we propose a synchronization mechanism to guarantee the quality of
multimedia presentation with user interactions. In our protocol, each presentation site requests media transmission from the
required media servers at certain time intervals prior to the playback deadlines, where these time intervals are the response
times to cover possible experienced end-to-end delays and packet losses, and waits for an initial setup time to ensure intermedia
synchronization before starting the presentation. Users may interact with the presentation. This synchronization mechanism
solves the problems incurred by user interactions by determining the new presentation scenario produced by the interactive
operation, calculating the corresponding setup time, and then rendering the new playback and retrieval schedules. 相似文献
14.
15.
An adaptive protocol for synchronizing media streams 总被引:8,自引:0,他引:8
Stream synchronization is widely regarded as a fundamental problem in the field of multimedia systems. Solutions to this
problem can be divided into adaptive and rigid mechanisms. While rigid mechanisms are based on worst case assumptions, adaptive
ones monitor the underlying network and are able to adapt themselves to changing network conditions. In this paper, we will
present an adaptive stream synchronization protocol. This protocol supports any kind of distribution of the sources and
sinks of the streams to be synchronized. It is based on a buffer-level control mechanism, allowing immediate corrections
when the danger of a buffer overflow or underflow is recognized. Moreover, the proposed protocol is flexible enough to support
a wide variety of synchronization policies, which can be dynamically changed while synchronization is in progress. Finally,
the message overhead of this protocol is low, because control messages are only exchanged when network conditions change. 相似文献
16.
In this paper, we propose a new communication abstraction known as the group channel which facilitates and supports the implementation
of multiparty interactive multimedia (MIM) applications such as video conferencing. The group channel is a high-level abstraction for group communication. The credit scheme and the dynamic bandwidth calibration scheme are provided as an integral part of the group channel service for allocating
network bandwidth dynamically as participants join and leave the group channel. The multimedia transport protocol (MTP) is
proposed as a realization of the group channel service in the ATM network. Its prototype implementation and a simple multiparty
video-conferencing application built on top of the MTP prototype are described in this paper. Our results show that the group
channel is capable of guaranteeing the performance of MIM applications irrespective of the group size and differences in workstation
speeds. 相似文献
17.
Recent advances in computer technologies have made it feasible to provide multimedia services, such as news distribution
and entertainment, via high-bandwidth networks. The storage and retrieval of large multimedia objects (e.g., video) becomes
a major design issue of the multimedia information system. While most other works on multimedia storage servers assume an
on-line disk storage system, we consider a two-tier storage architecture with a robotic tape library as the vast near-line
storage and an on-line disk system as the front-line storage. Magnetic tapes are cheaper, more robust, and have a larger
capacity; hence, they are more cost effective for large scale storage systems (e.g., video-on-demand (VOD) systems may
store tens of thousands of videos). We study in detail the design issues of the tape subsystem and propose some novel tape-scheduling
algorithms which give faster response and require less disk buffer space. We also study the disk-striping policy and the
data layout on the tape cartridge in order to fully utilize the throughput of the robotic tape system and to minimize the
on-line disk storage space. 相似文献
18.
Ivan Herman Nuno Correia David A. Duce David J. Duke Graham J. Reynolds James Van Loo 《Multimedia Systems》1998,6(2):88-101
This paper describes an event-based synchronization mechanism, which is at the core of the inter-media synchronization in
the upcoming standard for multimedia presentation, PREMO. The synchronization mechanism of PREMO is a powerful tool, based
on a small number of concepts, and on cooperation among active objects, and represents a synthesis of various synchronization
models described in the literature. This model can serve as a basis for the implementation of complex synchronization patterns
in multimedia presentations, both purely event-based, as well as time-based. 相似文献
19.
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. 相似文献
20.
Zero-suppressed BDDs and their applications 总被引:2,自引:0,他引:2
Shin-ichi Minato 《International Journal on Software Tools for Technology Transfer (STTT)》2001,3(2):156-170
In many real-life problems, we are often faced with manipulating sets of combinations. In this article, we study a special
type of ordered binary decision diagram (OBDD), called zero-suppressed BDDs (ZBDDs). This data structure represents sets of
combinations more efficiently than using original OBDDs. We discuss the basic data structures and algorithms for manipulating
ZBDDs in contrast with the original OBDDs. We also present some practical applications of ZBDDs, such as solving combinatorial
problems with unate cube set algebra, logic synthesis methods, Petri net processing, etc. We show that a ZBDD is a useful
option in OBDD techniques, suitable for a part of the practical applications.
Published online: 15 May 2001 相似文献