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.
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.
214797878
The onion technique: indexing for linear optimization queries
This paper describes the Onion technique, a special indexing structure for linear optimization queries. Linear optimization queries ask for top-N records subject to the maximization or minimization of linearly weighted sum of record attribute values. Such query appears in many applications employing linear models and is an effective way to summarize representative cases, such as the top-50 ranked colleges. The Onion indexing is based on a geometric property of convex hull, which guarantees that the optimal value can always be found at one or more of its vertices. The Onion indexing makes use of this property to construct convex hulls in layers with outer layers enclosing inner layers geometrically. A data record is indexed by its layer number or equivalently its depth in the layered convex hull. Queries with linear weightings issued at run time are evaluated from the outmost layer inwards. We show experimentally that the Onion indexing achieves orders of magnitude speedup against sequential linear scan when N is small compared to the cardinality of the set. The Onion technique also enables progressive retrieval, which processes and returns ranked results in a progressive manner. Furthermore, the proposed indexing can be extended into a hierarchical organization of data to accommodate both global and local queries.
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.
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.
37373998
On The Combinatorics Of Multi-Restricted Numbers
6489448
ABC: a hypermedia system for artifact-based collaboration
Abstract : Our project is studying the process by which groups of individuals work together to build large, complex structures of ideas, and we are developing a distributed hypermedia system to support the process. This description includes a brief overview of the system, but emphasizes three components: a hypermedia data management system or graph server, a set of browsers for working with graph objects, and a set of applications for working with data contents of graph nodes. A number of research issues are raised and discussed in context, including: composite objects; anchored links; scaling up for large applications; partitioning the hypermedia graph; consistency and completeness across subgraphs; and an open, extensible architecture for applications.
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.
5110411
Quasigroups and quandles
Abstract Two connexions between quasigroups and quandles are established. In one direction, Joyce's homogeneous quandle construction is shown to yield a quasigroup isotopic to the loop constructed by Scimemi on the set of o-commutators of a group automorphism o. In the other direction, the universal multiplication group construction of quasigroup theory is extended to quandles. The group of a knot becomes the universal right multiplication group of the knot quandle.
42617820
The Optimal Deployment of Filters to Limit Forged Address Attacks in Communication Networks
We consider forged address attacks in communication networks, wherein an attacking node forges the address of communication requests sent to a victim node. Unless the victim can ascertain the origin of the attack, it must cease to respond to communication requests until the attack subsides. We examine the problem of identifying a minimum cardinality subset of nodes on a network, such that placing route-based filters on these nodes provides a prescribed level of security. We model the problem as an integer program and illustrate its performance on randomly generated networks. Next, we develop a greedy heuristic to deploy filters in these networks, and compare its solution quality to that of the integer programming approach. These findings are then used to motivate both the importance of addressing this problem by optimal techniques and to motivate future research approaches for solving such problems.