826573
MediaAlert - a broadcast video monitoring and alerting system for mobile users
We present a system for automatic monitoring and timely dissemination of multimedia information to a range or mobile information appliances based on each user's interest profile. Multimedia processing algorithms detect and isolate relevant video segments from over twenty television broadcast programs based on a collection or words and phrases specified by the user. Content repurposing techniques are then used to convert the information into a form that is suitable for delivery to the user's mobile devices. Alerts are sent using a number of application messaging and network access protocols including email, short message service (SMS), multimedia messaging service (MMS), voice, session initiation protocol (SIP), fax, and pager protocols. The system is evaluated with respect to performance and user experiences. The MediaAlert system provides an effective and low-cost solution for the timely generation of alerts containing personal, business, and security information.
11845096
Integration of audio and visual information for content-based video segmentation
A video sequence usually consists of separate scenes, and each scene includes many shots. For video understanding purposes, it is most important to detect scene breaks. To analyze the content of each scene, detection of shot breaks is also required. Usually, a scene break is associated with a simultaneous change of image, motion, and audio characteristics, while a shot break is only accompanied with changes in image or motion or both. We propose to use audio information along with image and motion information to accomplish segmentation at different levels. Promising results have been obtained with videos digitized from TV programs.
28562
Content-based indexing and retrieval-by-example in audio
This paper presents a system for audio content-based indexing and retrieval-by-example. An unsupervised method to automatically index the audio content is proposed. To realize a retrieval system where the on-line query can be performed efficiently, a new parametric distance metric is used to allow faster identification of the audio segments that are similar to the given query example. Preliminary experimental results show that the proposed new approach can serve as an effective means in content based indexing and retrieval in audio streams.
17193716
Detecting news reporting using audio/visual information
This paper proposes an integrated approach to discriminate news reporting from everything else in broadcast news data based on both audio and visual information. The separation of news reporting segments from others not only can provide useful indices for video streams but also serves as a pre-processing step for tasks such as speaker identification and speech recognition so that only speech segments are passed on for further processing. A set of audio and visual features are adopted that aim at capturing the intrinsic properties of the underlying classes. Four types of classifiers (threshold fuzzy, Gaussian Mixture Model based, and Support Vector Machine) are tested. Some of the experimental results are presented and discussed in the paper.
2023739
Joint video scene segmentation and classification based on hidden Markov model
Video classification and segmentation are fundamental steps for efficient accessing, retrieval and browsing of large amounts of video data. We have developed a scene classification scheme using a hidden Markov model (HMM) based classifier. By utilizing the temporal behaviors of different scene classes, the HMM classifier can effectively classify video segments into one of the pre-defined scene classes. In this paper, we describe two approaches for joint video classification and segmentation based on a HMM, which works by searching for the most likely class transition path utilizing the dynamic programming technique.
14342655
Towards a Rigorous Approach to UML-Based Development
We discuss the promises and problems of UML-based development. We then suggest a framework in which UML can be used precisely and more disciplined so as to solve the problems and meet the promises better.
774892
Single Machine Scheduling Subject To Precedence Delays
Abstract A single-machine scheduling problem with precedence delays is analyzed. A set of n tasks is to be scheduled on the machine in such a way that the makespan is minimized. The executions of the tasks are constrained by precedence delays, i.e., a task can start its execution only after any of its predecessors has completed and the delay between the two tasks has elapsed. In the case of unit execution times and integer lengths of delays, the problem is shown to be NP-hard in the strong sense. In the case of integer execution times and unit length of delays, the problem is polynomial, and an O(n2) optimal algorithm is provided. Both preemptive and non-preemptive cases are considered.
3756850
Clustering algorithms for content-based publication-subscription systems
We consider efficient communication schemes based on both network-supported and application-level multicast techniques for content-based publication-subscription systems. We show that the communication costs depend heavily on the network configurations, distribution of publications and subscriptions. We devise new algorithms and adapt existing partitional data clustering algorithms. These algorithms can be used to determine multicast groups with as much commonality as possible, based on the totality of subscribers' interests. They perform well in the context of highly heterogeneous subscriptions, and they also scale well. An efficiency of 60% to 80% with respect to the ideal solution can be achieved with a small number of multicast groups (less than 100 in our experiments). Some of these same concepts can be applied to match publications to subscribers in real-time, and also to determine dynamically whether to unicast, multicast or broadcast information about the events over the network to the matched subscribers. We demonstrate the quality of our algorithms via simulation experiments.
27151074
Integrated Support for Location Aware Security Services in Enterprise Wireless Networks
In wireless computing environments limiting network access to authorized users is paramount for the overall security of network. In addition to basic authentication framework, network access is also governed by the context in which it is being used. In this work, we address security issues based on one such context: location. Location sensitivity is increasingly becoming an integral aspect of wireless and pervasive applications. As user moves around in an ubiquitous environment, access rights and other security services provided to her need to be evaluated accordingly. For such purposes we need a security mechanism that controls the authentication and other security services based on location, in addition to basic identity information. In this paper, we present an architecture of location aware security services for enterprise wireless networks. Our implementation is integrated into the RADIUS system, an Authentication, Authorization and Accounting (AAA) framework. Performace evaluation shows that our implementation is efficient for location based security services.
3399031
On 2-factors in claw-free graphs
Abstract A graph is said claw-free if it contains no induced subgraph isomorphic to K 1,3 . We prove that if G is a claw-free graph with minimum degree δ ⩾4, then G contains a 2-factor with at most 6 n /( δ +2)−1 components. Moreover, together with a theorem of Choudoum and Paulraj (J. Graph Theory 15 (1991) 259–265) and one of Anstee (J. Algorithms 6 (1985) 112–131), it is polynomial (in O( n 3 )) to construct such a 2-factor.