15518000
MediAssist: Using Content-Based Analysis and Context to Manage Personal Photo Collections
We present work which organises personal digital photo collections based on contextual information, such as time and location, combined with content-based analysis such as face detection and other feature detectors. The MediAssist demonstration system illustrates the results of our research into digital photo management, showing how a combination of automatically extracted context and content-based information, together with user annotation, facilitates efficient searching of personal photo collections.
5288834
Collaborative video searching on a tabletop
Almost all system and application design for multimedia systems is based around a single user working in isolation to perform some task yet much of the work for which we use computers to help us, is based on working collaboratively with colleagues. Groupware systems do support user collaboration but typically this is supported through software and users still physically work independently. Tabletop systems, such as the DiamondTouch from MERL, are interface devices which support direct user collaboration on a tabletop. When a tabletop is used as the interface for a multimedia system, such as a video search system, then this kind of direct collaboration raises many questions for system design. In this paper we present a tabletop system for supporting a pair of users in a video search task and we evaluate the system not only in terms of search performance but also in terms of user–user interaction and how different user personalities within each pair of searchers impacts search performance and user interaction. Incorporating the user into the system evaluation as we have done here reveals several interesting results and has important ramifications for the design of a multimedia search system.
18817570
Long-term location data management for distributed moving object databases
To handle the extreme situation that must manage positional information of a very large volume, at least millions, of moving objects, a cluster-based scalable distributed computing system architecture, called the GALIS, which consists of multiple data processors, each dedicated to keeping records relevant to a different geographical zone and a different time zone, was proposed. In this paper, we propose a valid time management and time-zone shifting scheme, which are essential in realizing the long-term location data subsystem of GALIS, but missed in our previous prototype development. We explain how to manage valid time of moving objects to avoid ambiguity of location information. We also describe time-zone shifting algorithm, with three variations, such as RT-TZS, B-TZS and TPB-TZS. Through experiments related with query processing time and CPU utilization, we show the efficiency of the proposed time-zone shifting schemes
39638713
Robust H∞ fuzzy static output feedback control of T-S fuzzy systems with parametric uncertainties
This paper addresses robust H"~ fuzzy static output feedback control problem for T-S fuzzy systems with time-varying norm-bounded uncertainties. Sufficient conditions for synthesis of a fuzzy static output feedback controller for T-S fuzzy systems are derived in terms of a set of linear matrix inequalities (LMIs). In comparison with the existing literatures, the proposed approach not only simplifies the design procedure but also achieves a better H"~ performance. Three drawbacks existing in the previous papers such as coordinate transformation, same output matrices and BMI problem have been eliminated. The effectiveness of the proposed design method is demonstrated by an example for the control of a truck-trailer system.
13472281
Bending and Stretching an Elastic Strip Around a Narrow Cylindrical Drum
An analysis is made of the deflected forms assumed by an elastic strip when it is bent and stretched around a rigid drum. A summary is first given of the method of analysis used and the results obtained in a previous study where the drum width is equal to or greater than that of the strip. This work is then extended to the case where the strip width exceeds that of the drum. Deflected forms and contact regions are delineated for a strip-width/drum-width ratio of two and for various values of two parameters: anticlastic deformation and tension.
42364168
An Algorithm for Incremental Nearest Neighbor Search in High-Dimensional Data Spaces
The SPY-TEC (Spherical Pyramid-Technique) [8] was proposed as a new indexing method for high-dimensional data spaces using a special partitioning strategy that divides a d-dimensional data space into 2d spherical pyramids. Although the authors of [8] proposed an efficient algorithm for processing hyperspherical range queries, they did not propose an algorithm for processing k-nearest neighbor queries that are frequently used in similarity search. In this paper, we propose an efficient algorithm for processing exact nearest neighbor queries on the SPY-TEC by extending the incremental nearest neighbor algorithm proposed in [10]. We also introduce a metric that can be used to guide an ordered best-first traversal when finding nearest neighbors on the SPYTEC. Finally, we show that our technique significantly outperforms the related techniques in processing k-nearest neighbor queries by comparing it to the R*-tree, the X-tree, and the sequential scan through extensive experiments.
16122349
Feature-Based Image Watermarking Method Using Scale-Invariant Keypoints
This paper addresses feature-based image watermarking methods for digital contents. Most previous watermarking algorithms suffer from geometric distortion attacks that desynchronize the location of the inserted watermark. In order to synchronize the watermark location, watermark synchronization should be performed. One solution for watermark synchronization is to use image features. This paper describes a feature-based watermarking method based on scale-invariant keypoints. We extract feature points from the scale-invariant keypoint extractor and then decompose feature points into a set of disjoint triangles. These triangles are watermarked by an additive spread-spectrum method on the spatial domain. We perform an intensive simulation in comparison with other feature-based watermarking methods using 100 test images. Results show that the proposed method is considerably robust against both geometric distortion attacks and signal processing attacks listed in Stirmark 3.1.