30741426
Multimedia database management systems
Introduction. Multimedia Data Types and Formats. Multimedia Database Design Issues. Text Document Indexing and Retrieval. Indexing and Retrieval of Audio. Image Indexing and Retrieval. Video Indexing and Retrieval. Integrated Multimedia Indexing and Retrieval. Techniques and Data Structures for Efficient Multimedia Similarity Search. System Support for Distributed Multimedia Databases. Measurement of Multimedia Information Retrieval Effectiveness. Products, Applications, and New Developments.
12656940
Towards Semantic Universal Multimedia Access
16236446
Image Classification and Querying Using Composite Region Templates
The tremendous growth in digital imagery is driving the need for more sophisticated methods for automatic image analysis, cataloging, and searching. We present a method for classifying and querying images based on the spatial orderings of regions or objects using composite region templates (CRTs). The CRTs capture the spatial information statistically and provide a robust way to measure similarity in the presence of region insertions, deletions, substitutions, replications, and relocations. The CRTs can be used for classifying and annotating images by assigning symbols to the regions or objects and by extracting symbol strings from spatial scans of the images. The symbol strings can be decoded using a library of annotated CRTs to automatically label and classify the images. The CRTs can also be used for searching by sketch or example by measuring image similarity based on relative counts of the CRTs.
15943562
Content-based transcoding of images in the Internet
We present a system for transcoding images in the Internet in order to improve their delivery to client devices with a wide range of communication, processing, storage and display capabilities. The content-based image transcoder analyzes the images in order to classify them into image type and image purpose classes. The system then utilizes transcoding policies based on the content classes to manipulate and transcode the images. We describe the image transcoding process for a variety of client devices, including PDAs, hand-held computers (HHCs), TV browsers and color PCs, and demonstrate improvements in delivery speed and accessibility of the images in the Internet.
206811307
Learning visual models of semantic concepts
Statistical machine learning provides a computational framework for mapping low level media features to high level semantics concepts. In this paper we expose the challenges that these techniques face. Using support vector machine (SVM) classification we build models for 34 semantic concepts for the TREC 2002 benchmark corpus. We study the effect of number of examples available for training with respect to their impact on detection. We also examine low level feature fusion as well as parameter sensitivity with SVM classifiers.
18353433
VideoZoom Spatio-Temporal Video Browser
We describe a system for browsing and interactively retrieving video over the Internet at multiple spatial and temporal resolutions. The VideoZoom system enables users to start with coarse, low-resolution views of the sequences and selectively zoom-in in space and time. VideoZoom decomposes the video sequences into a hierarchy of view elements, which are retrieved in a progressive fashion. The client browser incrementally builds the views by retrieving, caching, and assembling the view elements, as needed. By integrating browsing and retrieval into a single progressive retrieval paradigm, VideoZoom provides a new and useful system for accessing video over the Internet. VideoZoom is suitable for digital video libraries and a number of other applications in which streaming methods provide insufficient quality of video, video downloading introduces large latencies, and generating video summaries is difficult or not well integrated with video retrieval tasks.
27619841
Dynamic programming algorithms for the conditional covering problem on path and extended star graphs
The Conditional Covering Problem (CCP) is a facility location problem on a graph, where the set of nodes represents demand points and potential facility locations. The key aspect of the CCP is that each facility covers all nodes within a given facility-specific coverage radius, except for the node at which it is located. The objective of this problem is to minimize the sum of the facility location costs required to cover all demand points. We first discuss the worst-case complexity of the CCP by examining literature related to the total domination problem, which is a special case of the CCP. Next, we examine the special case of path graphs and provide an O(n2) algorithm for its solution. Finally, we leverage information obtained from this procedure to derive an optimal algorithm for “extended star” graphs (multiple paths having one node in common), without increasing the worst-case complexity of the algorithm. © 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 46(4), 177–185 2005
16226748
Polar: an architecture for a parallel ODMG compliant object database
Object database management systems (ODBMS) are now established as the database management technology of choice for a range of challenging data intensiv e applications. Furthermore, the applications associated with object databases typically have stringen t performance requirements, and some are associated with very large data sets. Ho w ever, despite the demands made on object databases by applications, there has been surprisingly little work on parallel object databases. This paper presents the arc hitecture and some preliminary performance results for the Polar ODMG compliant parallel object database. The architecture described has been implemented in a shared-nothing environment on a network of PCs. The paper describes how OQL queries are compiled, parallelized and executed in this environment, and includes some preliminary performance results for OQL queries using the 007 benchmark.
33249562
The Transfusion Medicine Tutor: Using Expert Systems Technology to Teach Domain-Specific Problem-Solving Skills
This study provides data regarding the effectiveness of the expert system-based Transfusion Medicine Tutor (TMT) when used by medical technology students to learn an important problem-solving task, the identification of alloantibodies in a patient's blood for the purpose of finding compatible blood for transfusion. The results show that the students who were taught by an instructor using TMT to provide the instructional environment went from 0% correct on a pre-test case to 87%–93% correct on post-tests (N=15). This compares with an improvement rate of 20% by a control group (N=15) who used a passive version of the system with the tutoring functions turned off. The results also demonstrate the importance of relying on objective performance data rather than questionnaire data to evaluate systems, as there was no difference in the subjective responses of the students to these two different versions of the system.
1973175
The AURORA Gigabit Testbed
Abstract AURORA is one of five U.S. networking testbeds charged with exploring applications of, and technologies necessary for, networks operating at gigabit per second or higher bandwidths. The emphasis of the AURORA testbed, distinct from the other four testbeds, BLANCA, CASA, NECTAR and VISTANET, is research into the supporting technologies for gigabit networking. Like the other testbeds, AURORA itself is an experiment in collaboration, where government initiative (in the form of the Corporation for National Research Initiatives, which is funded by DARPA and the National Science Foundation) has spurred interaction among pre-existing centers of excellence in industry, academia, and government. AURORA has been charged with research into networking technologies that will underpin future high-speed networks. This paper provides an overview of the goals and methodologies employed in AURORA, and points to some preliminary results from our first year of research, ranging from analytic results to experimental prototype hardware. This paper enunciates our targets, which include new software architectures, network abstractions, and hardware technologies, as well as applications for our work.
6106969
Service-Based Distributed Querying on the Grid
Service-based approaches (such as Web Services and the Open Grid Services Architecture) have gained considerable attention recently for supporting distributed application development in e-business and e-science. The emergence of a service-oriented view of hardware and software resources raises the question as to how database management systems and technologies can best be deployed or adapted for use in such an environment. This paper explores one aspect of service-based computing and data management, viz., how to integrate query processing technology with a service-based Grid. The paper describes in detail the design and implementation of a service-based distributed query processor for the Grid. The query processor is service-based in two orthogonal senses: firstly, it supports querying over data storage and analysis resources that are made available as services, and, secondly, its internal architecture factors out as services the functionalities related to the construction of distributed query plans on the one hand, and to their execution over the Grid on the other. The resulting system both provides a declarative approach to service orchestration in the Grid, and demonstrates how query processing can benefit from dynamic access to computational resources on the Grid.