15500231
Image Copy Detection via Grouping in Feature Space Based on Virtual Prior Attacks
In the past, many researches on image copy detection focused on finding a feature that is robust enough for various kinds of image attacks. But it is difficult to find a globally effective feature that is appropriate for many situations. In this paper, we introduce a classification framework to this problem, instead of solving the feature-selection problem. In our approach, novel features are generated by applying virtual prior attacks to copyrighted images, and the copy-detection problem is converted to a classification one that is more robust to solve. Our approach can combine existing image copy detectors and further raise their performances.
12972622
DIKNN: An Itinerary-based KNN Query Processing Algorithm for Mobile Sensor Networks
Current approaches to k nearest neighbor (KNN) search in mobile sensor networks require certain kind of indexing support. This index could be either a centralized spatial index or an in-network data structure that is distributed over the sensor nodes. Creation and maintenance of these index structures, to reflect the network dynamics due to sensor node mobility, may result in long query response time and low battery efficiency, thus limiting their practical use. In this paper, we propose a maintenance-free, itinerary-based approach called density-aware itinerary KNN query processing (DIKNN). The DIKNN divides the search area into multiple cone-shape areas centered at the query point. It then performs a query dissemination and response collection itinerary in each of the cone-shape areas in parallel. The design of the DIKNN scheme also takes into account challenging issues such as the the dynamic adjustment of the search radius (in terms of number of hops) according to spatial irregularity or mobility of sensor nodes. The simulation results show that DIKNN yields substantially better performance and scalability over previous work, both as k increases and as the sensor node mobility increases. It outperforms the second runner with up to 50% saving in energy consumption and up to 40% reduction in query response time, while rendering the same level of query result accuracy.
40595039
Constructing a Wrapper-Based DRM System for Digital Content Protection in Digital Libraries
Conventional digital libraries utilize access control and digital watermarking techniques to protect their digital content. These methods, however, have drawbacks. First, after passing the identity authentication process, authorized users can easily redistribute the digital assets. Second, it is impractical to expect a digital watermarking scheme to prevent all kinds of attack. Thus, how to enforce property rights after digital content has been released to authorized users is a crucial and challenging issue. In this paper, we propose a wrapper-based approach to digital content protection that integrates digital watermarking, cryptography, information protection technology, and a rights model. In this rights enforcement environment, the behavior of all content players is monitored and digital content can only be accessed after certain usage rules have been satisfied. Furthermore, the proposed architecture can be easily integrated into any digital content player, or even existing DRM systems in digital libraries. With the protection of the proposed DRM system, the abuse of digital content can be drastically reduced.
7571930
Using CBIR and pathfinder networks for image database visualisation
Digital images and videos have an increasingly important role in today's telecommunication and our everyday life in modern information society. In this paper, we explore the synergy between content-based image retrieval (CBIR) techniques and Pathfinder networks. Salient image features, based on colour, texture, edge orientation, and edge distance, are extracted. The structural modelling capabilities of Pathfinder are then applied to simplify and visualise the strongest interrelationships in the image database.
35624108
Optimal Parallel Routing in Star Graphs
Star graphs have been recently proposed as attractive alternatives to the popular hypercube for interconnecting processors on a parallel computer. In this paper, we present an efficient algorithm that constructs an optimal parallel routing in star graphs. Our result improves previous results for the problem.
9693361
Query translation scheme for heterogeneous XML data sources
In order to formulate a meaningful XML query, a user must have some knowledge of the schema of the XML documents to be queried. The query will succeed only if the schema of the actual documents is consistent with the user's information. When a user queries a collection of documents collected from heterogeneous XML data sources, there is a high possibility that these documents do not all conform to the same schema assumed by the user, thus causing the query to fail. In this paper, we try to solve this query and data schema mismatching problem by proposing a query translation scheme. Without attempting to solve the general problem of schema integration, we present an inclusion mapping algorithm that decides how compatible the schema of the query and the schema of the target XML documents are. Based upon the compatibility, the query will be executed directly, or translated according to the target schema and then executed, or rejected.
41927192
On the fault-tolerant pancyclicity of crossed cubes
A graph is pancyclic if it contains all cycles from lengths 4 to |V(G)|. An n-dimensional crossed cube, an important variation of hypercube denoted as CQ/sub n/, has been proved to be pancyclic because it contains all cycles whose lengths range from 4 to |V(CQ/sub n/)|. Since vertex and edge faults may occur when a network is used, it is practical and meaningful to evaluate the performance of a faulty network. Moreover the vertex fault-tolerant Hamiltonicity and the edge fault-tolerant Hamiltonicity measure the performances of the Hamiltonian properties in the faulty networks. From this fault-tolerant concept, we propose using the fault-tolerant pancyclicity of networks to measure the performance of faulty networks. In this paper we consider a faulty crossed n-cube with vertex and/or edge faults here. Let the faulty set F be a subset of V(CQ/sub n/)/spl cup/E(CQ/sub n/). We prove that any cycle of length l(4/spl les/l/spl les/|V(CQ/sub n/)|-f/sub /spl nu//) can be embedded into a faulty crossed n-cube CQ/sub n/-F with dilation 1, where |F|=f/sub /spl nu//+f/sub e/ is less than n-2, f/sub /spl nu// is the number of faulty vertices of F, f/sub e/ is the number of faulty edges of F, and n is greater than 2. The results can readily be used in the optimum embedding of a ring of the specified length in a faulty crossed cube.
2319896
Range Image Registration Based on Circular Features
Range sensing technology allows the photo-realistic modeling of large-scale scenes, such as urban structures. A major bottleneck in the process of 3D scene acquisition is the automated registration of a large number of geometrically complex 3D range scans in a common frame of reference. The generated 3D representations, after automated registration, are useful for urban planning, historical preservation, or virtual reality applications. Man-made urban scenes provide an abundance of linear features that can be used for the solution of the problem. Many scenes though require the utilization of non-linear primitives. This paper provides a solution of the registration problem based on the robust detection and matching of circular features from the range data sets. We present results from experiments with complex range scans from the interior of a large-scale landmark urban structure (Grand Central Terminal, NYC), where traditional methods would fail. This work is part of a larger range registration system that is based on extracted features of multiple geometric types.