共查询到20条相似文献,搜索用时 31 毫秒
1.
When multimedia information is transported over a packet-switched network, the quality of presentation can be degraded due
to network delay variation or jitter. This paper presents a dejittering scheme that can be used in the transport of MPEG-4
and MPEG-2 video to absorb any introduced network jitter, thus preserving the presentation quality of transported media streams.
The dejittering scheme is based on the statistical approximation of delay variation in the arrival times of video packets
carrying encoded clock reference values and a filtering and re-stamping mechanism. In addition, a brief overview of the MPEG-4
system is presented. 相似文献
2.
Delay-jitter control in multimedia applications 总被引:1,自引:0,他引:1
The growing needs of multimedia communications are leading to
new developments in providing real-time communication with guarantees.
Several extensions
have been proposed for different layers of the
Open Systems Interconnection Reference
Model to accomodate these
needs. In this paper, we study methods for guaranteeing delay jitter
bounds for high-speed networks in the network and application layers of
this model. The method proposed for the network layer
provides distributed jitter control. The method proposed
for the application layer allows the destination application to control
delay jitter. We use a simulation to compare the effects on delay
jitter in each
method for various scenarios, such as constant bit rate,
cross traffic, and bursty data. In addition, the buffer space
requirements for accommodating real-time channels are monitored at
each node in the network. 相似文献
3.
In packet audio applications, packets are buffered at a receiving site and their playout delayed in order to compensate for
variable network delays. In this paper, we consider the problem of adaptively adjusting the playout delay in order to keep
this delay as small as possible, while at the same time avoiding excessive “loss” due to the arrival of packets at the receiver
after their playout time has already passed. The contributions of this paper are twofold. First, given a trace of packet audio
receptions at a receiver, we present efficient algorithms for computing a bound on the achievable performance of any playout delay adjustment algorithm. More precisely, we compute upper and lower bounds (which are shown to be tight for the
range of loss and delay values of interest) on the optimum (minimum) average playout delay for a given number of packet losses
(due to late arrivals) at the receiver for that trace. Second, we present a new adaptive delay adjustment algorithm that tracks
the network delay of recently received packets and efficiently maintains delay percentile information. This information, together
with a “delay spike” detection algorithm based on (but extending) our earlier work, is used to dynamically adjust talkspurt
playout delay. We show that this algorithm outperforms existing delay adjustment algorithms over a number of measured audio
delay traces and performs close to the theoretical optimum over a range of parameter values of interest. 相似文献
4.
Igor D.D. Curcio Antonio Puliafito Salvatore Riccobene Lorenzo Vita 《Multimedia Systems》1998,6(6):367-381
The relative simplicity of access to digital communications nowadays and the simultaneous increase in the available bandwidth
are leading to the definition of new telematic services, mainly oriented towards multimedia applications and interactivity
with the user. In the near future, a decisive role will be played in this scenario by the providers of interactive multimedia
services of the on-demand type, which will guarantee the end user a high degree of flexibility, speed and efficiency. In this
paper, some of the technical aspects regarding these service providers are dealt with, paying particular attention to the
problems of storing information and managing service requests. More specifically, the paper presents and evaluates a new storage
technique based on the use of disk array technology, which can manage both typical multimedia connections and traditional
requests. The proposed architecture is based on the joint use of the partial dynamic declustering and the information dispersal
algorithm, which are employed for the allocation and retrieval of the data stored on the disk array. We also define efficient
strategies for request management in such a way as to meet the time constraints imposed by multimedia sessions and guarantee
good response times for the rest of the traffic. The system proposed is then analyzed using a simulation approach. 相似文献
5.
6.
7.
We describe a system which supports dynamic user interaction with multimedia information using content-based hypermedia navigation
techniques, specialising in a technique for navigation of musical content. The model combines the principles of open hypermedia, whereby hypermedia link information is maintained by a link service, with content-based retrieval techniques in which a database is queried based on a feature of the multimedia content; our approach could be described as
‘content-based retrieval of hypermedia links’. The experimental system focuses on temporal media and consists of a set of
component-based navigational hypermedia tools. We propose the use of melodic pitch contours in this context and we present
techniques for storing and querying contours, together with experimental results. Techniques for integrating the contour database
with open hypermedia systems are also discussed. 相似文献
8.
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. 相似文献
9.
We present a high-performance solution to the I/O retrieval problem in a distributed multimedia system. Parallelism of data
retrieval is achieved by striping the data across multiple disks. We identify the components that contribute to media data-retrieval
delay. The variable delays among these have a great bearing on the server throughput under varying load conditions. We present
a buffering scheme to minimize these variations. We have implemented our model on the Intel Paragon parallel computer. The
results of component-wise instrumentation of the server operation are presented and analyzed. Experimental results that demonstrate
the efficacy of the buffering scheme are presented. Based on our experiments, a dynamic admission-control policy that takes
server workloads into account is proposed. 相似文献
10.
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. 相似文献
11.
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.
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. 相似文献
14.
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 相似文献
15.
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. 相似文献
16.
HweeHwa Pang 《Multimedia Systems》1997,5(6):386-399
Multimedia applications that are required to manipulate large collections of objects are becoming increasingly common. Moreover,
the size of multimedia objects, which are already huge, are getting even bigger as the resolution of output devices improve.
As a result, many multimedia storage systems are not likely to be able to keep all of their objects disk-resident. Instead,
a majority of the less popular objects have to be off-loaded to tertiary storage to keep costs down. The speed at which objects
can be accessed from tertiary storage is thus an important consideration. In this paper, we propose an adaptive data retrieval
algorithm that employs a combination of staging and direct access in servicing tertiary storage retrieval requests. At retrieval
time, an object that resides in tertiary storage can either be staged to and then played back from disks, or the object can
be accessed directly from the tertiary drives. We show that a simplistic policy that adheres strictly to staging or direct
access does not exploit the full retrieval capacity of both the tertiary library and the secondary storage. To overcome the
problem, we propose a data retrieval algorithm that dynamically chooses between staging and direct access, based on the relative
load on the tertiary versus secondary devices. A series of simulation experiments confirms that the algorithm achieves good
access times over a wide range of workloads and resource configurations. Moreover, the algorithm is very responsive to changing
load conditions. 相似文献
17.
保障连续媒体流用户层QoS 的缓存控制 总被引:2,自引:0,他引:2
研究了缓存控制对媒体流用户层QoS 的影响.多媒体系统信宿端通常采用播放缓存来补偿时延抖动,提高媒体流播放的连续性.缓存控制虽然能够降低时延抖动的影响,却增加了端到端时延.时延或时延抖动是用户可感知的QoS 参数,缓存控制对用户层QoS 的影响究竟如何呢?利用已有的应用层向用户层QoS 映射的研究结果,分析缓存控制参数与端到端QoS 参数、应用层QoS 参数的关系,获得了缓存控制参数与用户层QoS 参数的关系.从理论上深入挖掘缓存控制对用户层QoS 参数的作用,给出了提供确定时延和时延抖动保障的缓存容量值,论证了在网络环境一定时存在提供最佳用户层QoS 的缓存容量值.实验结果验证了分析. 相似文献
18.
We present end-to-end performance of digital coded video (JPEG, MPEG-1, and MPEG-2) over a local asynchronuous transfer mode
(ATM) network. We discuss performance in terms of both delay (jitter) and frame loss as a function of load. The experimental
data reveal that the burstiness of the variable bit-rate-coded video streams degrades the performance significantly when the
hosts and the network are stressed. Our results show that traffic smoothing decreases frame loss significantly while maintaining
acceptable jitter and loss bounds. We also discuss requirements for system components, such as the network interface and switch,
which are necessary to support video services efficiently. 相似文献
19.
Context-aware Retrieval: Exploring a New Environment for Information Retrieval and Information Filtering 总被引:4,自引:2,他引:2
The opportunities for context-aware computing are fast expanding. Computing systems can be made aware of their environment
by monitoring attributes such as their current location, the current time, the weather, or nearby equipment and users. Context-aware
computing often involves retrieval of information: it introduces a new aspect to technologies for information delivery; currently
these technologies are based mainly on contemporary approaches to information retrieval and information filtering. In this
paper, we consider how the closely related, but distinct, topics of information retrieval and information filtering relate
to context-aware retrieval. Our thesis is that context-aware retrieval is as yet a sparsely researched and sparsely understood
area, and we aim in this paper to make a start towards remedying this. 相似文献
20.
Wen-Syan Li K.Selçuk Candan Kyoji Hirata Yoshinori Hara 《The VLDB Journal The International Journal on Very Large Data Bases》2001,9(4):312-326
Due to the fuzziness of query specification and media matching, multimedia retrieval is conducted by way of exploration.
It is essential to provide feedback so that users can visualize query reformulation alternatives and database content distribution.
Since media matching is an expensive task, another issue is how to efficiently support exploration so that the system is not
overloaded by perpetual query reformulation. In this paper, we present a uniform framework to represent statistical information
of both semantics and visual metadata for images in the databases. We propose the concept of query verification, which evaluates queries using statistics, and provides users with feedback, including the strictness and reformulation alternatives
of each query condition as well as estimated numbers of matches. With query verification, the system increases the efficiency
of the multimedia database exploration for both users and the system. Such statistical information is also utilized to support
progressive query processing and query relaxation.
Received: 9 June 1998/ Accepted: 21 July 2000 Published online: 4 May 2001 相似文献