15070330
Towards knowledge-based extraction of roads from 1 m-resolution satellite images
As the IKONOS satellite with 1 m-resolution camera was launched in 1999, mapping using spaceborne images will be an important issue in the computer vision area as well as photogrammetry, mainly because most major man-made objects of interest can be identifiable. One of the automatically identifiable objects of importance may be roads. Detecting roads using edge detection approaches may be very difficult because a number of edge elements from such as buildings, etc., can be generated from edge detector. In this paper, we propose a method for the extraction of approximated road regions based on region segmentation that utilizes region information. Our method consists of the following three steps. First, an image is segmented using the modified hierarchical multi-scale gradient watershed transformation. Then, the road candidates are identified using information about road gray level, elongatedness and connectedness. The identified road candidates are expanded by connecting the close-by roads knowing that roads are connected objects. Our method was tested on the simulated spaceborne images and the result shows that the automation of road extraction is quite promising.
46208894
Evaluation of Feature Extraction Techniques for Robust Watermarking
This paper addresses feature extraction techniques for robust watermarking. Geometric distortion attacks desynchronize the location of the inserted watermark and hence prevent watermark detection. Watermark synchronization, which is a process of finding the location for watermark insertion and detection, is crucial to design robust watermarking. One solution is to use image features. This paper reviews feature extraction techniques that have been used in featurebased watermarking: the Harris corner detector and the Mexican Hat wavelet scale interaction method. We also evaluate the scale-invariant keypoint extractor in comparison with other techniques in aspect of watermarking. After feature extraction, the set of triangles is generated by Delaunay tessellation. These triangles are the location for watermark insertion and detection. Redetection ratio of triangles is evaluated against geometric distortion attacks as well as signal processing attacks. Experimental results show that the scale-invariant keypoint extractor is appropriate for robust watermarking.
12136049
Content-Based Synchronization Using the Local Invariant Feature for Robust Watermarking
This paper addresses the problem of content-based synchronization for robust watermarking. Synchronization is a process of extracting the location to embed and detect the signature, copyright information, so that it is crucial for the robustness of the watermarking system. In this paper, we will review representative content-based approaches and propose a new synchronization method based on the scale invariant feature transform. In content-based synchronization approaches, it is important to extract robust features even with image distortions and we suspect that the consideration of local image characteristics will be helpful. The scale invariant feature transform regards these characteristics and is invariant to noise, spatial filtering, geometric distortions, and illumination changes of the image. Through experiments, we will compare the proposed method with representative content-based approaches and show the appropriateness for robust watermarking.
7718842
Averaging attack resilient video fingerprinting
This paper addresses an effective technique for digital fingerprinting for video. The code modulation technique, that uses an averaging collusion resilient fingerprint code derived from BIBD, is a robust method against averaging attacks. In this paper, we propose a new fingerprint code based on GD-PBIBD theory that is efficient in designing the fingerprint code and describe an effective method to embed and detect the fingerprint code, in which the merits of orthogonal modulation and coded modulation techniques are combined. To analyze the performance, we apply our method to video applications using a spread-spectrum watermarking technique in the spatial domain and the results show the proposed method is effective for fingerprint code embedding and detection.
214800963
High Efficiency Counter Mode Security Architecture via Prediction and Precomputation
Encrypting data in unprotected memory has gained much interest lately for digital rights protection and security reasons. Counter Mode is a well-known encryption scheme. It is a symmetric-key encryption scheme based on any block cipher, e.g. AES. The schemeýs encryption algorithm uses a block cipher, a secret key and a counter (or a sequence number) to generate an encryption pad which is XORed with the data stored in memory. Like other memory encryption schemes, this method suffers from the inherent latency of decrypting encrypted data when loading them into the on-chip cache. One solution that parallelizes data fetching and encryption pad generation requires the sequence numbers of evicted cache lines to be cached on-chip. On-chip sequence number caching can be successful in reducing the latency at the cost of a large area overhead. In this paper, we present a novel technique to hide the latency overhead of decrypting counter mode encrypted memory by predicting the sequence number and pre-computing the encryption pad that we call one-time-pad or OTP. In contrast to the prior techniques of sequence number caching, our mechanism solves the latency issue by using idle decryption engine cycles to speculatively predict and pre-compute OTPs before the corresponding sequence number is loaded. This technique incurs very little area overhead. In addition, a novel adaptive OTP prediction technique is also presented to further improve our regular OTP prediction and precomputation mechanism. This adaptive scheme is not only able to predict encryption pads associated with static and infrequently updated cache lines but also those frequently updated ones as well. Experimental results using SPEC2000 benchmark show an 82% prediction rate. Moreover, we also explore several optimization techniques for improving the prediction accuracy. Two specific techniques, Two-level prediction and Context-based prediction are presented and evaluated. For the two-level prediction, the prediction rate was improved from 82% to 96%. With the context-based prediction, the prediction rate approaches 99%. Context-based OTP prediction outperforms a very large 512KB sequence number cache for many memory-bound SPEC programs. IPC results show an overall 15% to 40% performance improvement using our prediction and precomputation, and another 7% improvement when context-based prediction techniques is used.
37964793
Object-Oriented Design and Implementation of the OE-Scheduler in Real Time Environments
8884680
Using Segmented Objects in Ostensive Video Shot Retrieval
This paper presents a system for video shot retrieval in which shots are retrieved based on matching video objects using a combination of colour, shape and texture. Rather than matching on individual objects, our system supports sets of query objects which in total reflect the user's object-based information need. Our work also adapts to a shifting user information need by initiating the partitioning of a user's search into two or more distinct search threads, which can be followed by the user in sequence. This is an automatic process which maps neatly to the ostensive model for information retrieval in that it allows a user to place a virtual checkpoint on their search, explore one thread or aspect of their information need and then return to that checkpoint to then explore an alternative thread. Our system is fully functional and operational and in this paper we illustrate several design decisions we have made in building it.
2200598
When to use a compilation service?
Modern handheld computers are certainly capable of running general purpose applications, such as Java virtual machines. However, short battery life rather than computational capability often limits the usefulness of handheld computers. This paper considers how to reduce the energy consumption of Java applications.Broadly speaking, there are three interleaved steps in running Java programs in a compiled environment: downloading the bytecodes, compiling and possibly optimizing the bytecodes, and running the compiled code. Optimized code typically runs faster than non-optimized code but the optimization process itself may consume significant energy. We consider the possibility of moving compilation (optimizing or non-optimizing) to a tethered server. We demonstrate that there is a significant benefit to moving compilation to a server (up to 67% reduction in energy for a realistic handheld configuration). We also demonstrate that there is no single best compilation strategy for all methods.
8279890
Location tracking using quorums in mobile ad hoc networks
Abstract We explore applications of quorum systems to the problem of tracking locations of mobile users in mobile ad hoc networks (MANETs). The location tracking system uses biquorum systems, a generalization of traditional quorum systems. We performed extensive simulations of the location tracking system. The simulation results show that our strict biquorum implementation has better performance than the traditional strict quorum implementations. Moreover, our results show that randomized dynamic quorum implementations have better overall performance than strict (bi)quorum implementations.