In client-server database systems, clients can maintain their own cache to reduce the overhead of accessing data objects at the server database. In this case, there should be a protocol which ensures the consistency o...
详细信息
ISBN:
(纸本)0780336763
In client-server database systems, clients can maintain their own cache to reduce the overhead of accessing data objects at the server database. In this case, there should be a protocol which ensures the consistency of cached data. In this paper, we propose a cache consistency algorithm, contention based algorithm (CBA), which dynamically applies the appropriate protocol for each data object. When the contention of data objects is uniformly low or uniformly high, the proposed algorithm shows the same performance as existing algorithms, and when the contention is not uniform, the proposed algorithm shows better performance than existing algorithms.
The MPEG video group is currently developing the so-called MPEG-4 video coding standard, targeted for future interactive multimedia video communications calling for content-based functionalities, universal access in e...
详细信息
The MPEG video group is currently developing the so-called MPEG-4 video coding standard, targeted for future interactive multimedia video communications calling for content-based functionalities, universal access in error prone environments and high coding efficiency. Besides the provisions for content-based functionalities the MPEG-4 video standard will assist the efficient storage and transmission of very low bit rate video in error prone environments. This paper outlines the techniques that are currently being investigated by MPEG-4 to provide universal accessibility of video at very low bit rates and discusses the scope of some of the promising techniques under discussion.
Semantic access to the content of a video is highly desirable for multimediacontent retrieval. Automatic extraction of semantics requires content analysis algorithms. Our MoCA (Movie content Analysis) project provide...
详细信息
Semantic access to the content of a video is highly desirable for multimediacontent retrieval. Automatic extraction of semantics requires content analysis algorithms. Our MoCA (Movie content Analysis) project provides an interactive workbench supporting the researcher in the development of new movie content analysis algorithms. The workbench offers data management facilities for large amounts of video/audio data and derived parameters. It also provides an easy-to-use interface for a free combination of basic operators into more sophisticated operators. We can combine results from video track and audio track analysis. The MoCA Workbench shields the researcher from technical details and provides advanced visualization capabilities, allowing attention to focus on the development of new algorithms. The paper presents the design and implementation of the MoCA Workbench and reports practical experience.
content-base Image and Video access System (CONIVAS) consists of a collection of tools to help users retrieve still images and videos from databases by content. The system includes new algorithms for image and video r...
详细信息
ISBN:
(纸本)9780897918718
content-base Image and Video access System (CONIVAS) consists of a collection of tools to help users retrieve still images and videos from databases by content. The system includes new algorithms for image and video retrieval which can be used in searching large collections of images and video clips such as digital video library, professional video editing, TV news retrieval, and copyright protection applications.
We propose a new index structure, called the HG-tree, to support content-based retrieval in multimedia databases. Our goals are twofold: increasing the storage utilization and decreasing the directory coverage of the ...
详细信息
We propose a new index structure, called the HG-tree, to support content-based retrieval in multimedia databases. Our goals are twofold: increasing the storage utilization and decreasing the directory coverage of the index tree. The first goal is achieved by absorbing splitting if possible, and when splitting is necessary, converting two nodes to three. This is done by proposing a good ordering on the directory nodes. The second goal is achieved by representing the directory regions compactly. We note that there is a trade-off between above two design goals, but the HG-tree is so flexible that it can control the trade-off. We present the design of our index tree and associated algorithms. In addition, we report the results of a series of tests, comparing the proposed index tree with the buddy-tree, which is one of the most successful access methods for a multidimensional space. The results show the superiority of our method.
The paper describes Ethersim, a simulation tool to model and study the performance of integrated service networks that provide multimedia (audio, video, data) information access to mobile users carrying portable wirel...
详细信息
ISBN:
(纸本)0780333373
The paper describes Ethersim, a simulation tool to model and study the performance of integrated service networks that provide multimedia (audio, video, data) information access to mobile users carrying portable wireless terminals and hosts. The design process of such networks requires a proper understanding of how network and multimedia application performance is affected by (i) the choice of algorithms and protocols at various network layers, (ii) the wireless link characteristics, (iii) the presence of mobile hosts, and (iv) the host mobility patterns. Analytic approaches to study these problems suffer from intractability in such complex systems, while the inflexibility of making measurements on testbed systems makes it difficult to draw generalized conclusions. Simulation is an alternative, but available simulators provide poor support, many, for mobility and wireless. Ethersim has been built using a discrete event based simulator core and incorporates models of user applications and transport, network and MAC layer protocols. It provides the capability to specify network topology and host mobility patterns. The software architecture of Ethersim employs five special entities: an air module, a map, a mover, mobile hosts, and basestations. The air module models the physical air-interface effects (e.g., RF power decay, frequency collisions etc.). The mover is a central entity that moves the mobile hosts on the map. Ethersim allows for both random and goal-directed movements of mobile hosts, and also allows synchronized goal-directed movements to model conference room type mobility patterns. We also present case-studies of using Ethersim to model and study the interaction of transport layer, connection rerouting protocol, and radio characteristics in a mobile and wireless ATM network at Bell Laboratories.
The article focuses on digital video analysis and recognition. Digital video media analysis and recognition (DVMAR) has become an active research topic in multimediasystems and computer vision areas. This is because ...
The article focuses on digital video analysis and recognition. Digital video media analysis and recognition (DVMAR) has become an active research topic in multimediasystems and computer vision areas. This is because progress of computer and communication technologies has created strong demand for many applications of digital video in a wide variety of areas, many of which require managing video in a database or information system environment; on the other hand, indexing and retrieval schemes for traditional databases and video manipulation tools in current television systems cannot manage video in an effective, interactive, and content-based manner. The goal of DVMAR is to develop algorithms, tools, and systems to extract and analyze basic elements, features and structures of video so as to make content-based access and transmission of video data feasible and more effective. In general, video media is considered to have the following basic structural elements: shots, scenes, sequences and segments.
The cable and satellite delivered TV services established to date have generally assumed that subscribers will be content with a single service provider. Where there has been direct competition between satellite DBS a...
详细信息
The cable and satellite delivered TV services established to date have generally assumed that subscribers will be content with a single service provider. Where there has been direct competition between satellite DBS access to free-to-air services has required the viewer to take some special action to switch between the two modes of delivery. The advent of digital television opens the way for a review of the architecture of television receiving systems. A basic starting point of this new receiver might be an MPEG ii input because that format seems to be emerging as an quasi world-wide standard.< >
This book gives a comprehensive introduction to natural language processing (NLP) and its applications, covering the topics of multimodal data processing, Chinese word segmentation, new word discovery, named entity re...
详细信息
ISBN:
(数字)9789819797394
ISBN:
(纸本)9789819797387;9789819797417
This book gives a comprehensive introduction to natural language processing (NLP) and its applications, covering the topics of multimodal data processing, Chinese word segmentation, new word discovery, named entity recognition, keyword analysis, and knowledge graph construction in terms of semantic analysis.
The inaugural chapter provides an overview of NLP, and the subsequent chapters delve into the foundations of artificial intelligence, covering traditional deep learning algorithms and platforms. The book then evolves to showcase the latest advancements in deep learning, addressing bottlenecks and unfolding developments from data-oriented, training-oriented, and application-oriented perspectives. Part ii of the book navigates the practical applications of intelligent language processing. From web crawlers and multi-format document parsing to speech text recognition, readers gain insights into real-world scenarios. Each chapter provides examples and analyses, empowering readers to bridge theoretical knowledge with hands-on application, unlocking the transformative potential of AI through intelligent language processing.
This book serves as a comprehensive resource for researchers, graduate students, and undergraduates in the field of natural language processing. Additionally, it offers valuable insights as a reference for engineers, technicians, and enthusiasts interested in the realm of big data intelligence.
The translation was done with the help of artificial intelligence. A subsequent human revision was done primarily in terms of content.
The increasing availability of multimediacontent poses a challenge for information retrieval researchers. Users want not only have access to multimedia documents, but also make sense of them --- the ability of findin...
The increasing availability of multimediacontent poses a challenge for information retrieval researchers. Users want not only have access to multimedia documents, but also make sense of them --- the ability of finding specific content in extremely large collections of textual and non-textual documents is paramount. At such large scales, multimedia Information Retrieval systems must rely on the ability to perform search by similarity efficiently. However, multimedia Documents are often represented by high-dimensional feature vectors, or by other complex representations in metric spaces. Providing efficient similarity search for that kind of data is extremely challenging. In this project, we explore one of the most cited family of solutions for similarity search, the Locality-Sensitive Hashing (LSH), which is based upon the creation of hashing functions which assign, with higher probability, the same key for data that are similar. LSH is available only for a handful distance functions, but, where available, it has been found to be extremely efficient for architectures with uniform access cost to the data. Most existing LSH functions are restricted to vector spaces. We propose two novel LSH methods (VoronoiLSH and VoronoiPlex LSH) for generic metric spaces based on metric hyperplane partitioning (random centroids and K-medoids). We present a comparison with well-established LSH methods in vector spaces and with recent competing new methods for metric spaces. We develop a theoretical probabilistic modeling of the behavior of the proposed algorithms and show some relations and bounds for the probability of hash collision. Among the algorithms proposed for generalizing LSH for metric spaces, this theoretical development is new. Although the problem is very challenging, our results demonstrate that it can be successfully tackled. This dissertation will present the developments of the method, theoretical and experimental discussion and reasoning of the methods performance
暂无评论