32704360
Interactive content-based retrieval of video
We describe a system for content-based retrieval of video that involves a series of query interactions with the user. The proposed approach allows the user, iteratively and selectively, to integrate different feature- and model-based methods of querying in the search process. This allows the user to choose among different retrieved content, features and matching dimensions, and classifiers, as appropriate, given the query objective and interim retrieval results. We investigate several approaches for integrating featureand model-based queries and results in successive query rounds including iterative filtering, score aggregation, and relevance feedback searching. We describe experimental results of applying the interactive content-based retrieval method to an automatically indexed corpus of 11 hours of video.
20964781
Special Issue on Image Understanding for Digital Photographs
2339969
Interactive search fusion methods for video database retrieval
In this paper, we investigate a new method for video database retrieval using interactive search fusion. Recent video analysis techniques have enabled the extraction of a variety of descriptors of features, concepts, clusters, classification results, speech and textual terms, MPEG-7 metadata, and so on. However, given an information need users are faced with a daunting task of trying to formulate queries over these multiple disparate data sources in order to retrieve the desired video content. In this paper, we explore a novel approach based on search fusion in which the user interactively builds a query by sequentially choosing among the descriptors and data sources and by selecting from various combining and score aggregation functions to fuse results of individual searches. For example, the system allows building of queries such as "retrieve video clips that have color of beach scenes, the detection of sky, and detection of water". In this paper we present the search fusion method and evaluate the performance on a large video database.
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.
1805433
MPEG-7 MDS Content Description Tools and Applications
In this paper, we present the tools specified by the MDS part of the MPEG-7 standard for describing multimedia data such as images and video. In particular, we focus on the description tools that represent the structure and semantics of multimedia data to whose development we have actively contributed. We also describe some of our research prototype systems dealing with the extraction and application of MPEG-7 structural and semantic descriptions. These systems are AMOS, a video object segmentation and retrieval system, and IMKA, an intelligent multimedia knowledge application using the MediaNet knowledge representation framework.
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.
13961662
Improving Nearest Neighbor Classifier Using Tabu Search and Ensemble Distance Metrics
The nearest-neighbor (NN) classifier has long been used in pattern recognition, exploratory data analysis, and data mining problems. A vital consideration in obtaining good results with this technique is the choice of distance function, and correspondingly which features to consider when computing distances between samples. In this paper, a new ensemble technique is proposed to improve the performance of NN classifier. The proposed approach combines multiple NN classifiers, where each classifier uses a different distance function and potentially a different set of features (feature vector). These feature vectors are determined for each distance metric using Simple Voting Scheme incorporated in Tabu Search (TS). The proposed ensemble classifier with different distance metrics and different feature vectors (TS-DF/NN) is evaluated using various benchmark data sets from UCI Machine Learning Repository. Results have indicated a significant increase in the performance when compared with various well-known classifiers. Furthermore, the proposed ensemble method is also compared with ensemble classifier using different distance metrics but with same feature vector (with or without Feature Selection (FS)).
2547072
An orthogonal taxonomy for hyperlink anchor generation in video streams using OvalTine
As dynamically linked content follows the progression of statically linked media into the realm of video, new opportunities for link creation become apparent. In this paper we describe a real-time video hypermedia system with user-definable linkage areas, in a distributed collaborative environment. We also investigate the extension of such a system to automated link creation in video streams. In the process, we identify and describe orthogonal issues of hypervideo anchor creation. An example system, OvalTine, has been produced to illustrate several potential uses through configuration of an extended video conferencing application on the SGI O2 platform.
44823536
A class of web-based facets for the generalized vertex packing problem
The generalized vertex packing problem seeks to identify a largest subset of nodes from an undirected graph, such that the subgraph induced by this subset of nodes contains no more than some threshold number of edges. This paper derives a class of valid inequalities based on certain special subgraphs called webs, which are general structures that subsume cliques, matchings, odd holes, and odd anti-holes. We also provide a set of conditions for this class of valid inequalities to be facet-inducing for the web subgraph polytope. Finally, we prescribe a web subgraph identification procedure, and test the computational benefits obtained by solving generalized vertex packing instances with formulations augmented by these web-based valid inequalities.
16384039
Experimenting with object navigation in parallel object databases
This paper addresses the problem of selecting the best object navigation strategy for a query to be run in parallel, when considering multiple alternative strategies. This is done by performing experiments with three pointer-based join algorithms, running simple and complex queries in a parallel ODMG-compliant object database system. We believe our results provide insights into how physical properties of queries impact on the performance of different joins operators in a parallel environment.
9844851
Communicating emotion through a haptic link: Design space and methodology
Communication of affect across a distance is not well supported by current technology, despite its importance to interpersonal interaction in modern lifestyles. Touch is a powerful conduit for emotional connectedness, and thus mediating haptic (touch) displays have been proposed to address this deficiency; but suitable evaluative methodology has been elusive. In this paper, we offer a first, structured examination of a design space for haptic support of remote affective communication, by analyzing the space and then comparing haptic models designed to manipulate its key dimensions. In our study, dyads (intimate pairs or strangers) are asked to communicate specified emotions using a purely haptic link that consists of virtual models rendered on simple knobs. These models instantiate both interaction metaphors of varying intimacy, and representations of virtual interpersonal distance. Our integrated objective and subjective observations imply that emotion can indeed be communicated through this medium, and confirm that the factors examined influence emotion communication performance as well as preference, comfort and connectedness. The proposed design space and the study results have implications for future efforts to support affective communication using the haptic modality, and the study approach comprises a first model for systematic evaluation of haptically expressed affect.