3251263
Semantic video clustering across sources using bipartite spectral clustering
Data clustering is an important technique for visual data management. Most previous work focuses on clustering video data within single sources. We address the problem of clustering across sources, and propose novel spectral clustering algorithms for multisource clustering problems. Spectral clustering is a new discriminative method realizing clustering by partitioning data graphs. We represent multi-source data as bipartite or K-partite graphs, and investigate the spectral clustering algorithm under these representations. The algorithms are evaluated using the TRECVID-2003 corpus with semantic features extracted from speech transcripts and visual concept recognition results from videos. The experiments show that the proposed bipartite clustering algorithm significantly outperforms the regular spectral clustering algorithm in capturing cross-source associations.
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.
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
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.
7058627
Fast and Controllable Simulation of the Shattering of Brittle Objects
We present a method for the rapid and controllable simulation of the shattering of brittle objects under impact. An object to be broken is represented as a set of point masses connected by distance-preserving linear constraints. This use of constraints, rather than stiff springs, gains us a significant advantage in speed while still retaining fine control over the fracturing behavior. The forces exerted by these constraints during impact are computed using Lagrange multipliers. These constraint forces are then used to determine when and where the object will break, and to calculate the velocities of the newly created fragments. We present the details of our technique together with examples illustrating its use.
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.
17392905
Replacement Strategies in Steady State Genetic Algorithms: Static Environments
Recent years have seen increasing numbers of applications of Evolutionary Algorithms to non-stationary environments such as on-line process control. Studies have indicated that Genetic Algorithms using "Steady State" models demonstrate a greater ability to track moving optima than those using "Generational" models, however implementing the former requires an additional choice of which members of the current population should be replaced by new offspring. In this paper a number of selection and replacement strategies are compared for use in Steady State Genetic Algorithms working as function optimisers in dynamic environments. In addition to an algorithm with fixed mutation rates, the strategies are also compared in algorithms employing Cobb's Hypermutation method for tracking environmental changes. On-line and off-line metrics are used for comparison, which correspond to different types of real-world applications. In both cases it is shown that algorithms employing some kind of elitism outperform those that do not, which is related to previous studies on stationary environments. An investigation is made of various methods of implementing elitism, including an implicit method, "conservative" selection. It is shown that the latter, in addition to being computationally simpler, produces significantly better results on the problems used, and reasons are given for this behaviour.
37305588
A dynamic programming algorithm for the conditional covering problem on tree graphs
In a previous article, we presented algorithms for solving the Conditional Covering Problem (CCP) on path and extended star graphs. The CCP on these graphs can be solved in O(n2) time, where n is the number of nodes in the graph. In this article, we propose a new dynamic programming procedure to solve the CCP on tree graphs. This recursion works from the leaf nodes of the tree up to the root node, using notions of protected and unprotected costs as done for the CCP path algorithm in our previous work. We introduce new preliminary routines and data structures to merge information from subpaths and subtrees, resulting in an O(n4) algorithm to optimally solve the problem. © 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 46(4), 186–197 2005
1926668
Exploring "Multiple Worlds" in Parallel
We examine computing alternative solutions to a problem in parallel to improve response time.Problems with exploring multiple alternatives in parallel include (1) side-effects and (2) combinatorial ...